#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

vector<long long>x;
long long n, k, m, i, a, b, kezd, akt, c, z, o, j;
struct hossz
{
    long long szam, hely;
};
hossz y[1000000];

bool comp(long long a, long long b)
{
    return a > b;
}

int main()
{
    cin >> m >> kezd >> a >> b >> n >> k;
    akt = kezd;
    for (i = 1; i <= n; ++i)
    {
        akt = (akt * a) + b;
        o = pow(10, m);
        akt = akt / o;
        o = pow(10, 2 * m);
        akt = akt % o;
        x.push_back(akt);
    }
    for (i = 0; i < x.size(); ++i)
    {
        if (y[x[i]].szam == 0)
        {
            y[x[i]].szam++;
            y[x[i]].hely = i;
        }
        else if (y[x[i]].szam != 0)
        {
            cout << i - y[x[i]].hely << "\n";
            break;
        }
    }
    sort(x.begin(), x.end(),comp);
    cout<<x[k-1];
    
    return 0;
}
/*
1 73 11 50 20 10
*/