#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
#include <algorithm>
int h(int x, int y) {
    return x>y;
}
using namespace std;
int main()
{
    int m, x, a, b, n, k;
    cin >> m >> x >> a >> b >> n >> k;
    int sor[1001];
    unordered_map<int, int> seen;
    int min_distance = n + 1;
    sor[0] = x;
    for (int i = 1; i <= n; i++) {
        sor[i] = sor[i - 1] * a + b;
        string szam = to_string(sor[i]);
        while (szam.length() < 4 * m) {
            szam = '0' + szam;
        }
        szam = szam.substr(m, 2 * m);
        int jo = stoi(szam);
        if (seen.count(jo)) {
            // Számítsuk ki a távolságot
            min_distance = min(min_distance, i - seen[jo]);
        }
        seen[jo] = i;
        sor[i] = jo;
    }
    /*for(int i=1; i<=n; i++){
        cout<<sor[i]<<" ";
    }*/
    cout << min_distance << endl;
	sort(sor, sor + n + 1, h);
	cout << sor[k - 1] << endl;
    return 0;
}