#include <iostream>
#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <climits>
using namespace std;

long long ipow(int e)
    {
    long long r = 1;
    while (e--) r *= 10;
    return r;
    }
int main()
{
    int m,a,b,k,n;long long num;
    cin>>m>>num>>a>>b>>n>>k;
    int MOD = ipow(2*m);
    int DIV = ipow(m);
    vector<int> lastseen(MOD, -1);
    vector<int> freq(MOD, 0);
    int mindist = INT_MAX;
    int cur = num;
    for (int i = 1; i <= n; i++) {
        long long y = 1LL * cur * a + b;
        cur = (y / DIV) % MOD;
        if (lastseen[cur] != -1)
            mindist = min(mindist, i - lastseen[cur]);
        lastseen[cur] = i;
        freq[cur]++;
    }
    cout << mindist << "\n";
    for (int v = MOD - 1; v >= 0; v--) {
        if (freq[v] >= k) {
            cout << v;
            break;
        }
        k-=freq[v];
    }
    return 0;
}