using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace sorozat
{
    class Program
    {
        static void Main(string[] args)
        {
            string c = Console.ReadLine();
            int m = int.Parse(c.Split()[0]);
            int x = int.Parse(c.Split()[1]);
            int a = int.Parse(c.Split()[2]);
            int b = int.Parse(c.Split()[3]);
            int n = int.Parse(c.Split()[4]);
            int k = int.Parse(c.Split()[5]);
            long[] sor = new long[n];
            if (m == 1)
                m = 10;
            if (m == 2)
                m = 100;
            if (m == 3)
                m = 1000;
            sor[0] = Convert.ToInt64(Math.Floor((double)(x * a + b)/m));
            if(sor[0] / (m*m) >= 1)
                sor[0] = Convert.ToInt64(sor[0] - Math.Floor((double)sor[0] / (m*m)) * (m*m));
            for (int i = 1; i < n; i++)
            {
                sor[i] = Convert.ToInt64(Math.Floor((double)(sor[i - 1] * a + b) / m));
                if (sor[i] / (m*m) >= 1)
                    sor[i] = Convert.ToInt64(sor[i] - Math.Floor((double)sor[i] / (m*m)) * (m* m));

            }
            int tav = int.MaxValue;
            for (int i = 0; i < n; i++)
            {
                for (int j = i+1; j < n; j++)
                {
                    if(sor[i] == sor[j])
                    {
                        tav = j - i;
                        break;
                    }
                    if(j-i > tav )
                    {
                        break;
                    }
                }
            }
            Console.WriteLine(tav);
            Array.Sort(sor);
            Console.WriteLine(sor[n  - k]); ;
            Console.ReadKey();
        }
    }
}