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

using namespace std;

int m,n,tav,a,b,x,k,j,veg;
long long r,szami;

vector<int> v;
vector<int>::iterator p1;
vector<int>::iterator p2;

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

int main()
{
	cin >> m >> x >> a >> b >> n >> k;
	for (int i = 1; i <= n; ++i)
	{
		if (r == 0) r = x;
		v.push_back(szam());
	}
	for (int i = 0; i <= n - 1; ++i)
	{
		p1 = find(v.begin(), v.end(), v[i]);
		if (find(p1 + 1, v.end(), v[i]) != v.end())
		{

			p2 = find(p1 + 1, v.end(), v[i]);
			break;
		}
		else veg = 0;
	}
	veg = distance(p1, p2);
	cout << veg << endl;
	sort(v.rbegin(), v.rend());
	cout << v[k - 1];
}