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

using namespace std;

vector<long long> values;
bool done[1000000] = { false };
long long a, b, m, power, n, l;
long long startLoop, endIndex;

static void GetNextElement(int val)
{
	long long nval = val * a + b;
	long long lpower = power;
	for (int i = 0; i < m - 1; i++)
	{
		lpower /= 10;
	}
	nval %= lpower;
	for (int i = 0; i < m; i++)
	{
		nval /= 10;
	}
	if (startLoop == -1)
	{
		if (done[nval])
		{
			startLoop = nval;
		}
		else
		{
			endIndex++;
			done[nval] = true;
		}
	}
	values.push_back(nval);
	l++;
	if (l == n)
	{
		return;
	}
	GetNextElement(nval);
}

int main()
{
	long long x, k;
	cin >> m >> x >> a >> b >> n >> k;
	startLoop = -1;
	power = 1;
	endIndex = 0;
	l = 0;
	for (int i = 0; i < m * 4 - 1; i++)
	{
		power *= 10;
	}

	GetNextElement(x);
	long long startIndex = -1;

	for (long long i = 0; i < values.size(); i++)
	{
		if (values[i] == startLoop)
		{
			startIndex = i;
			break;
		}
	}

	sort(values.begin(), values.end());
	reverse(values.begin(), values.end());

	cout << endIndex - startIndex << endl << values[k - 1] << endl;
}