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

using namespace std;

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

ifstream fin("robotei.in");
OutParser 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];
long long sol[kM];

pair<int, int> getNext(int x, int y) {
  return {((long long)x * x % modX + offX) % modX, ((long long)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[((long long)i * i % modX + offX) % modX] += 1;
  }
  for (int i = 0; i < n; ++i) {
    cntY1[((long long)i * i % modY + offY) % modY] += 1;
  }
  for (int i = modX; i < n; ++i) {
    cntX2[((long long)i * i % modX + offX) % modX] += 1;
  }
  for (int i = modY; i < n; ++i) {
    cntY2[((long long)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};
  assert(X < modX && Y < modY);
  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) {
      for (int d : {dp[i][j], dp[i][j] + 1}) {
        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();
  }
  return 0;
}