#include <bits/stdc++.h>

using namespace std;

int main()
{
    int m,x,a,b,n,k;
    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=1; i<=n; i++)
    {
        x=x*a+b;
        x=(x/hat)%(hat*hat);
        v.push_back(x);
        if(tav.count(x))
        {
            if(mintav>i-tav[x])
            {
                mintav=i-tav[x];
            }
        }
        tav[x]=i;
    }

    sort(v.begin(),v.end());
    auto it=v.end()-k-1;
    cout << mintav << endl;
    cout << *it;
    return 0;
}