#include <iostream>
#include <vector>

using namespace std;

const long long powers[] = {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000,
                              100000000, 1000000000, 10000000000, 100000000000, 1000000000000};

struct Number
{
    int nr_appearance = 0;
    int index = -1;
};

long long calc_new_value(long long currValue, int M, int A, int B)
{
    long long newValue = A*currValue + B;
    int nrDigits = 0, temp = newValue;
    while(temp > 0){
        temp = temp/10;
        nrDigits++;
    }
    newValue = (newValue / powers[M]) % powers[2*M];
    return newValue;
}

Number freq[1000000];
vector<int> minDist(1000000, 1 << 27);

int main()
{
    int M, X, A, B, N, K;

    cin >> M >> X >> A >> B >> N >> K;
    long long currValue = X;

    for(int i = 0; i < N; i++){
        currValue = calc_new_value(currValue, M, A, B);
        freq[currValue].nr_appearance++;
        if(freq[currValue].index != -1){
            minDist[currValue] = min(minDist[currValue], i - freq[currValue].index);
        }
        freq[currValue].index = i;
    }

    int minDistSolution = 1 << 27, numberSolution = 0, index_sorted = 0;
    for(int i = 0; i <= 999999; i++){
        if(minDist[i] != 1 << 27){
            minDistSolution = min(minDistSolution, minDist[i]);
        }
    }

    for(int i = 999999; i >= 0; i--){
        index_sorted += freq[i].nr_appearance;
        if(index_sorted >= K){
            numberSolution = i;
            break;
        }
    }
    cout << minDistSolution << endl << numberSolution << endl;
    return 0;
}