#include <iostream>
#include <vector>
#include <map>
#include <bits/stdc++.h> //igy nem kell a tobbi
using namespace std;

int main()
{
    int m, a, b, n, k;
    long long x;
    cin >> m >> x >> a >> b >> n >> k;
    vector <int> v(n +1);
    map <int, int> tav;
    int hat = pow(10,m);
    int mintav = INT_MAX;
    for (int i = 0; i < n; i++)
    {
        x = x * a + b;
        x = (x / hat) % (hat * hat);
        v[i] = x;
        if (tav.count(x))
        {
            if (mintav > i - tav[x])
            {
                mintav = i - tav [x];
            }
        }
        tav[x] = i;
    }

    sort(v.begin(), v.end() -1);
    cout << mintav << endl;
    cout << v[n - k];
    return 0;
}