#include <iostream>
#include <unordered_map>
#include <queue>
#include <cmath>

using namespace std;

int main() {
    int m, x, a, b, n, k;
    cin >> m >> x >> a >> b >> n >> k;

    long long mod = pow(10, 4 * m);  // Modulus for 4*M digits
    int* sor = new int[n + 1];
    unordered_map<int, int> seen;
    int min_distance = n + 1;

    sor[0] = x;
    for (int i = 1; i <= n; i++) {
        long long next = (long long)sor[i - 1] * a + b;
        next %= mod;

        int middle_digits = (next / (long long)pow(10, 2 * m)) % (int)pow(10, 2 * m);
        sor[i] = middle_digits;

        if (seen.count(middle_digits)) {
            min_distance = min(min_distance, i - seen[middle_digits]);
        }
        seen[middle_digits] = i;
    }

    cout << min_distance << endl;

    priority_queue<int, vector<int>, greater<int>> min_heap;
    for (int i = 1; i <= n; i++) {
        min_heap.push(sor[i]);
        if (min_heap.size() > k) {
            min_heap.pop();
        }
    }

    cout << min_heap.top() << endl;

    delete[] sor;
    return 0;
}