#include <iostream>
#include <map>
#include <algorithm>
//#include <fstream>
using namespace std;

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

int main()
{
    //ifstream fin("be2.txt");
    cin >> m >> x >> a >> b >> n >> k;
    long long szamjegyek=0;
    long long tomb[n+1], temp;
    long long c[4*m];
    tomb[0]=x;
    for(int i=1; i<=n; i++){
        szamjegyek=0;
        x=tomb[i-1]*a+b;
        //cout << tomb[i-1] << '\n';
        //cout << x << '\n';
        int j=4*m-1;
        while(x){
            c[j]=x%10;
            x=x/10;
            j--;
        }
        while(j>=0){
            c[j]=0;
            j--;
        }

        //cout << "\n";
        x=0;
        for(j=m; j<m*3; j++){
            x=x*10+c[j];
        }
        tomb[i]=x;
        //cout << x << "\n\n";

    }
    long long mini=1000000000;
    map<long long, long long> mp;
    map<long long, long long>::iterator it;
    for(int i=1; i<=n; i++){
        it=mp.find(tomb[i]);
        if(it==mp.end()){
            mp[tomb[i]]=i;
        }
        else{
            if(i-mp[tomb[i]]<mini){
                mini=i-mp[tomb[i]];
                mp[tomb[i]]=i;
            }
        }
    }
    cout << mini << '\n';
    sort(tomb+1, tomb+n+1);
    /*for(auto& i:tomb){
        cout << i << ' ';
    }*/
    cout << '\n' << tomb[k] << '\n';
    return 0;
}