#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef long long LL;

const int N = 5e3 + 5;

void inline read(int &x) {
    x = 0; char s = getchar();
    while (s < '0' || s > '9') s = getchar();
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
}


int x0, a, b, c, d, p[N * N], g[N * N];

int n, m, q, tot, Lf[N], Rf[N];

bool inline check(int x, int y) {
	return y >= Rf[x - 1] && y <= Lf[x + 1]; 
}

void inline ins(int x, int y) {
	for (int i = x; i <= n; i++) Rf[i] = max(Rf[i], y);
	for (int i = x; i; i--) Lf[i] = min(Lf[i], y);
}

int main() {
	//freopen("C:/Users/MoRanSky/Downloads/random2.in", "r", stdin);
	//freopen("te.out", "w", stdout);
	memset(Lf, 0x3f, sizeof Lf);
	read(x0), read(a), read(b), read(c), read(d);
	read(n); read(m); read(q);
	int x = x0;
	for (int i = 1; i <= n * m; i++) p[i] = i;
	for (int i = 1; i <= n * m; i++) {
		x = (1ll * a * x * x + 1ll * b * x + c) % d;
		swap(p[i], p[x % i + 1]);
	}
	
	while (q--) {
		int u, v; read(u); read(v);
		swap(p[u], p[v]);
	}
	for (int i = 1; i <= n * m; i++) g[p[i]] = i;
	ins(1, 1); ins(n, m);
	for (int i = 1, x, y; i <= n * m; i++) {
		x = (g[i] - 1) / m + 1, y = (g[i] - 1) % m + 1;
		bool o = check(x, y);
		if (x + y == 2 || x + y == n + m || o) {
			if (o) ins(x, y);
			printf("%d ", i);
		}
	}
	return 0;
}