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

int main()
{
    int m,a,b,n,k;
    long long x;
    cin>>m>>x>>a>>b>>n>>k;
    vector<int>v;
    unordered_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()+1,v.end());
    cout<<mintav<<endl;
    cout<<v[n-k+1];
    return 0;
}