#include <climits>
#include <algorithm>
#include <vector>
#include <string>
#include<unordered_map>
#include <iostream>

using namespace std;

int main()
{
    long long n,m, k, a, b, x; cin>>m>>x>>a>>b>>n>>k;
    vector<long long> er(n+1);
    er[0]=x;
    for (int i=1;i<=n;++i){
            long long val=er[i-1]*a+b;
            string szam= to_string(val);
            if (szam.length()<4*m){
                szam.insert(szam.begin(),4*m-szam.length(), '0');
            }
            string koz=szam.substr(m, 2*m);
            er[i]= stoi(koz);
            //cout<<er[i]<<" ";
    }
    int mini=INT_MAX;
    for (int i=1;i<n;++i){
        for (int j=i+1;j<=n; ++j){
            if (er[i]==er[j]){
                mini=min(mini, j-i);
            }
        }
    }
    if (mini==INT_MAX) cout<<"-1"<<"\n";
    else cout<<mini<<"\n";
    sort(er.begin(), er.end());
    for (int i=1;i<=n;++i){
        if (i==k) cout<<er[i]<<"\n";
    }
    return 0;
}