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

using namespace std;

vector<int> v;

int m, st, a, b, l, k, mini = INT_MAX;

int newn(int start)
{
    deque<char> s;
    int res = 0;
    start = start * a + b;
    
    while (start > 0)
    {
        s.push_front(start % 10);
        start = start / 10;
    }
    for (int i = s.size(); i <= m*4-1; ++i)
        s.push_front(0);
    for (int i = m; i <= 3 * m-1; ++i)
        res = res * 10 + s[i];
    return res;
}

void addns(int st1, int l)
{
    if (l > 0)
    {
        int a;
        a = newn(st1);
        v.push_back(a);
        addns(a, l - 1);
    }
}

int main()
{
    cin >> m >> st >> a >> b >> l >> k;
    addns(st, l);

    cout << endl;
    for (int i = 0; i < l; ++i)
    {
        auto elem = find(v.begin() + i+1, v.end(), v[i]);
        if (elem != v.end())
            mini = min((int)distance(v.begin(), elem) - i, mini);
    }
    cout << mini;
    cout << endl;
    sort(v.rbegin(), v.rend());
    cout << v[k];
}