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

using namespace std;

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

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<pair<short, short>> g[kN][kN];
pair<short, short> q[kN * kN];
int64_t sol[kM];

pair<int, int> getNext(int x, int y) {
  return {((int64_t)x * x % modX + offX) % modX, ((int64_t)y * y % modY + offY) % modY};
}

void findCycle(int x, int y) {
  vis[x][y] = true;
  len += 1;
  int xv, yv;
  tie(xv, yv) = getNext(x, y);
  if (xv == X && yv == Y) {
    return;
  }
  if (vis[xv][yv]) {
    len = 0;
    return;
  }
  findCycle(xv, yv);
}

void testCase() {
  fin >> n >> m >> X >> Y >> modX >> modY >> offX >> offY;
  for (int i = 0; i < n; ++i) {
    cntX1[((int64_t)i * i % modX + offX) % modX] += 1;
  }
  for (int i = 0; i < n; ++i) {
    cntY1[((int64_t)i * i % modY + offY) % modY] += 1;
  }
  for (int i = modX; i < n; ++i) {
    cntX2[((int64_t)i * i % modX + offX) % modX] += 1;
  }
  for (int i = modY; i < n; ++i) {
    cntY2[((int64_t)i * i % modY + offY) % modY] += 1;
  }
  findCycle(X, Y);
  for (int i = 0; i < modX; ++i) {
    for (int j = 0; j < modY; ++j) {
      int iv, jv;
      tie(iv, jv) = getNext(i, j);
      g[iv][jv].emplace_back(i, j);
      dp[i][j] = INF;
    }
  }
  int l = 0, r = -1;
  dp[X][Y] = 0;
  q[++r] = {X, Y};
  while (l <= r) {
    int i, j;
    tie(i, j) = q[l++];
    for (auto it : g[i][j]) {
      int iv, jv;
      tie(iv, jv) = it;
      if (dp[iv][jv] > dp[i][j] + 1) {
        dp[iv][jv] = dp[i][j] + 1;
        q[++r] = {iv, jv};
      }
    }
  }
  for (int i = 0; i < modX; ++i) {
    for (int j = 0; j < modY; ++j) {
      if (dp[i][j] > m) {
        sol[0] += 1;
      }
      if (dp[i][j] >= m) {
        sol[0] += (int64_t)cntX2[i] * cntY1[j] + (int64_t)cntX1[i] * cntY2[j] - (int64_t)cntX2[i] * cntY2[j];
      }
      for (int d : {dp[i][j], dp[i][j] + 1}) {
        if (d > m) {
          break;
        }
        int visits = 1, rem = m - d;
        if (len) {
          visits += rem / len;
        }
        if (d == dp[i][j]) {
          sol[visits] += 1;
        } else {
          sol[visits] += (int64_t)cntX2[i] * cntY1[j] + (int64_t)cntX1[i] * cntY2[j] - (int64_t)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;
}