#include <bits/stdc++.h>
#define INF 0x3f3f3f3f

using namespace std;

ifstream fin("robotei.in");
ofstream fout("robotei.out");

struct point {
  int x, y;
};

const int kN = 1e3;
const int kM = 7e5;
int n, m, X, Y, modX, modY, offX, offY, len, cntX1[kN], cntY1[kN], cntX2[kN], cntY2[kN], dp[kN][kN];
bitset<kN> vis[kN];
vector<point> g[kN][kN];
point q[kN * kN];
long long sol[kM];

point getNext(point x) {
  return {(x.x * x.x + offX) % modX, (x.y * x.y + offY) % modY};
}

void findCycle(point curr) {
  vis[curr.x][curr.y] = true;
  len += 1;
  point vec = getNext(curr);
  if (vec.x == X && vec.y == Y) {
    return;
  }
  if (vis[vec.x][vec.y]) {
    len = 0;
    return;
  }
  findCycle(vec);
}

void testCase() {
  fin >> n >> m >> X >> Y >> modX >> modY >> offX >> offY;
  if (X >= modX || Y >= modY) {
    fout << "0 " << (long long)n * n - 1 << '\n' << "1 1\n";
    return;
  }
  int up = min(n - 1, (int)4e4);
  for (int i = 0; i <= up; ++i) {
    cntX1[(i * i + offX) % modX] += 1;
    cntY1[(i * i + offY) % modY] += 1;
    if (i >= modX) {
      cntX2[(i * i + offX) % modX] += 1;
    }
    if (i >= modY) {
      cntY2[(i * i + offY) % modY] += 1;
    }
  }
  for (int i = up + 1; i < n; ++i) {
    cntX1[((long long)i * i + offX) % modX] += 1;
    cntY1[((long long)i * i + offY) % modY] += 1;
    if (i >= modX) {
      cntX2[((long long)i * i + offX) % modX] += 1;
    }
    if (i >= modY) {
      cntY2[((long long)i * i + offY) % modY] += 1;
    }
  }
  for (int i = 0; i < modX; ++i) {
    for (int j = 0; j < modY; ++j) {
      point vec = getNext({i, j});
      g[vec.x][vec.y].push_back({i, j});
      dp[i][j] = INF;
    }
  }
  int l = 0, r = -1;
  dp[X][Y] = 0;
  q[++r] = {X, Y};
  while (l <= r) {
    point curr = q[l++];
    for (const point &vec : g[curr.x][curr.y]) {
      if (dp[vec.x][vec.y] > dp[curr.x][curr.y] + 1) {
        dp[vec.x][vec.y] = dp[curr.x][curr.y] + 1;
        q[++r] = vec;
      }
    }
  }
  findCycle({X, Y});
  for (int i = 0; i < modX; ++i) {
    for (int j = 0; j < modY; ++j) {
      for (int d = dp[i][j]; d <= dp[i][j] + 1; ++d) {
        int visits = (d <= m), rem = max(0, m - d);
        if (len) {
          visits += rem / len;
        }
        if (d == dp[i][j]) {
          sol[visits] += 1;
        } else {
          sol[visits] += (long long)cntX2[i] * cntY1[j] + (long long)cntX1[i] * cntY2[j] - (long long)cntX2[i] * cntY2[j];
        }
      }
    }
  }
  for (int i = 0; i <= m; ++i) {
    if (sol[i]) {
      fout << i << ' ' << sol[i] << '\n';
    }
  }
}

int main() {
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  fin.close();
  fout.close();
  return 0;
}