#include <bits/stdc++.h>

using namespace std;

int main()
{
    int m, x, a, b, n, k;
    cin >> m >> x >> a >> b >> n >> k;
    vector<pair<int, int>> s (0);
    bool loop = true;
    int l = k;
    int l1 = k;
    while (loop)
    {
        x = x*a + b;
        x = floor(x/pow(10, m));
        x = x % int(pow(10, 2*m));
        for (int i = 0; i < s.size(); i++)
        {
            if (s[i].first == x)
            {
                loop = false;
                l1 = i;
                l = s.size() - l1;
            }
        }
        if (loop)
            s.push_back(make_pair(x, 1));
    }
    for (int i = l1; i < s.size(); i++)
    {
        s[i].second = floor((n - l1)/l);
        if (((n - l1 -1) % l) +2 >= i)
            s[i].second++;
    }
    /*for (int i = 0; i < s.size(); i++)
    {
        cout << s[i].first << "   " << s[i].second << endl;
    }*/
    sort(s.begin(), s.end());
    cout << l << endl;
    int temp = 0;
    for (int i = s.size() -1; i >= 0; i--)
    {
        temp += s[i].second;
        if (temp >= k)
        {
            temp = s[i].first;
            i = -1;
        }
    }
    cout << temp;
    return 0;
}