#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <limits>

using namespace std;

int countDigit(int n) {
    if (n == 0)
        return 1;

    int count = 0;

    while (n != 0) {
        n = n / 10;
        ++count;
    }
    return count;
}

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

int main()
{
    int m, x, a, b, n, k;
    cin >> m >> x >> a >> b >> n >> k;
    vector <int> v;
    unordered_map<int, int> lastSeen;
    int minDistance = numeric_limits<int>::max();
    int resultDigit = -1, digit;
    for(int i = 0 ; i < n; i++){
        x = x * a + b;
       // cout << x << " ";
        if(countDigit(x) == 2 or countDigit(x) == 3){
            x = x / 10;
        }
        else if(countDigit(x) == 4){
                x = x / 10;
                x = x % 100;
        }
        v.push_back(x);
        digit = v[i];
         if (lastSeen.find(digit) != lastSeen.end()) {
            int distance = i - lastSeen[digit];
            if (distance < minDistance) {
                minDistance = distance;
                resultDigit = digit;
            }
        }
        lastSeen[digit] = i;
    }
    cout << resultDigit << endl;
    sort(v.begin(), v.end(), comp);
    cout << v[k - 1];
    return 0;
}