#include <bits/stdc++.h>
#define lli long long int

using namespace std;

int main() {
    iostream::sync_with_stdio(0);
    cin.tie(0);
    lli M, X, A, B, N, K;
    cin >> M >> X >> A >> B >> N >> K;
    map<lli, lli> utolso;
    vector<lli> adatok;
    adatok.push_back(X);
    utolso[X] = 0;
    lli tiz_m = ((const int[]){ 10, 100, 1000 })[M - 1];
    lli tiz_2m = tiz_m * tiz_m;
    lli kulonbseg = N + 1;
    int i;
    for(i = 1; i <= N; i++) {
        X = (((X * A) + B) / tiz_m) % tiz_2m;
        adatok.push_back(X);
        if(utolso.count(X)) {
            kulonbseg = min(kulonbseg, i - utolso[X]);
        }
        utolso[X] = i;
    }
    cout << kulonbseg << "\n";
    sort(adatok.rbegin(), adatok.rend());
    cout << adatok[K - 1] << "\n";
}