#include <bits/stdc++.h>
#define maxM 1000002
#define maxN 1002
using namespace std;
int n, m, X, Y, modx, mody, offx, offy, len;
int ans[maxM], ox[maxN], oy[maxN];
int vis[maxN][maxN];
bool a[maxN][maxN];
void read()
{
    freopen("robotei.in", "r", stdin);
    scanf("%d %d %d %d %d %d %d %d", &n, &m, &X, &Y, &modx, &mody, &offx, &offy);
}
void bfs(int x, int y)
{
    int nx, ny;
    vis[x][y] = -1;
    nx = (x * x + offx) % modx;
    ny = (y * y + offy) % mody;
    if (!vis[nx][ny])
        bfs(nx, ny);
    if (vis[nx][ny] != -1)
        vis[x][y] = vis[nx][ny] + 1;
}
void solve()
{
    int i, j, l;
    int x = X, y = Y;
    while (!a[x][y])
    {
        ++ len;
        a[x][y] = 1;
        x = (x * x + offx) % modx;
        y = (y * y + offy) % mody;
    }
    if (x != X || y != Y)
    {
        ans[0] = n * n - 1;
        ans[1] = 1;
        return ;
    }
    for (i = 0; i < n; ++ i)
    {
        ++ ox[(i * i + offx) % modx];
        ++ oy[(i * i + offy) % mody];
    }
    vis[X][Y] = 1;
    for (i = 0; i < modx; ++ i)
        for (j = 0; j < mody; ++ j)
            if (!vis[i][j])
            bfs(i, j);

    for (i = 0; i < modx; ++ i)
        for (j = 0; j < mody; ++ j)
        {
            l = vis[i][j];
            if (l > 0 && l <= m)
                    ans[1 + (m - l) / len] += ox[i] * oy[j];
        }
    X = (X * X + offx) % modx;
    Y = (Y * Y + offy) % mody;
    -- ans[1 + (m - vis[X][Y]) / len];
    ++ ans[2 + (m - vis[X][Y]) / len];
}
void write()
{
    int i;
    freopen("robotei.out", "w", stdout);

    for (i = 0; i <= m; ++ i)
        if (ans[i] != 0)
            printf("%d %d\n", i, ans[i]);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}