#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

int pow10(int n) {
    int result = 1;
    while (n--) {
        result *= 10;
    }
    return result;
}

int main() {
    cin.sync_with_stdio(false);
    cin.tie(nullptr);

    long long M, X, A, B, N, K;
    cin >> M >> X >> A >> B >> N >> K;
    vector<long long> numberS(N);
    map<long long, int> lastS;
    bool found = false;
    numberS[0] = (X * A + B) / pow10(M) % pow10(2 * M);
    for (int i = 1; i < N; i++) {
        numberS[i] = (numberS[i - 1] * A + B) / pow10(M) % pow10(2 * M);
        if (!found) {
            if (lastS.find(numberS[i]) == lastS.end()) {
                lastS[numberS[i]] = i;
            }
            else {
                found = true;
                cout << i - lastS[numberS[i]] << '\n';
            }
        }
    }
    sort(numberS.rbegin(), numberS.rend());
    cout << numberS[K - 1] << '\n';
}