#include <bits/stdc++.h>
using namespace std;

long long tizh(int n) {
    int t = 1;
    for(int i = 1; i <= n; i++) t *= 10;
    return t;
}

long long n, v[1000001], aux[1000001], x, a, b, m, k, hely[1000001], c, lntav;

void msort(int e1, int u2) {
    int u1 = (e1+u2)/2, e2 = u1+1;
    if(e1 != u1) msort(e1, u1);
    if(e2 != u2) msort(e2, u2);
    int l = e1, r = e2, p = e1;
    while(l <= u1 or r <= u2) {
        if((v[l] <= v[r] && l <= u1) || r > u2) {
            aux[p] = v[l];
            l++;
        } else {
            aux[p] = v[r];
            r++;
        }
        p++;
    }
    for(int i = e1; i <= u2; i++) v[i] = aux[i];
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    //ifstream f("be.in");
    cin >> m >> x >> a >> b >> n >> k;

    for(int i = 1; i <= n; i++) {
        x = x*a + b + 1000000000000;
        x = x % tizh(3*m);
        x /= tizh(m);
        v[i] = x;
        if(hely[v[i]] != 0) lntav = max(lntav, i-hely[v[i]]);
        hely[v[i]] = i;
    }
    cout << lntav << '\n';
    msort(1, n);
    cout << v[n-k+1];

    return 0;
}