#include <iostream>
using namespace std;

const int mod = 1e9;
int n, m;
int d[4005][4005];
int s, a, o;

int main() {
    cin >> n >> m;
    cin >> d[1][1] >> s >> a >> o;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            if (i + j == 2) continue;
            if (j > 1)
                d[i][j] = ((((1ll * d[i][j - 1] * s) ^ a) + o) ^ 48763) % mod * 1016 % mod + 1;
            else
                d[i][j] = ((((1ll * d[i - 1][m] * s) ^ a) + o) ^ 48763) % mod * 1016 % mod + 1;
        }
    }
}