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

typedef long long ll;
typedef vector<ll> vi;

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

    ll m, x, a, b, n, k;

    cin >> m >> x >> a >> b >> n >> k;

    ll p = 1;
    for (ll i=0; i < m; i++) p *= 10;
    ll p2 = p * p;

    vi seq;
    seq.reserve(n);

    unordered_map<ll, ll> last_pos;
    last_pos.reserve(n);

    ll ans_dist = INT_MAX;

    ll curr = x;

    for (ll i=0; i < n; i++) {
        ll y = curr * a + b;

        int next = (y / p) % p2;

        seq.push_back(next);

        if (last_pos.count(next)) {
            ans_dist = min(ans_dist, i - last_pos[next]);
        }
        last_pos[next] = i;

        curr = next;
    }

    sort(seq.begin(), seq.end());

    cout << ans_dist << '\n' << seq[seq.size() - k] << '\n';

    return 0;
}