#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FILL(a, b) memset(a, b, sizeof(a))
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

typedef unsigned long long ULL;

const int mod = 1'000'000'007;
const int MAX = 100001;

void updAdd(int& x, int val)
{
	x += val;
	if (x >= mod)
	{
		x -= mod;
	}
}

struct DSU
{
	int n;
	VI p, sz;
	void init(int _n)
	{
		n = _n;
		p.resize(n);
		iota(ALL(p), 0);
		sz.assign(n, 1);
	}
	int find(int v)
	{
		if (p[v] == v)
			return v;
		return p[v] = find(p[v]);
	}
	bool unite(int u, int v)
	{
		u = find(u);
		v = find(v);
		if (u == v)
			return false;
		if (sz[u] > sz[v])
			swap(u, v);
		p[u] = v;
		sz[v] += sz[u];
		return true;
	}
} dsu;

ULL k1, k2;

ULL xorShift128Plus()
{
	ULL k3 = k1, k4 = k2;
	k1 = k4;
	k3 ^= k3 << 23;
	k2 = k3 ^ k4 ^ (k3 >> 17) ^ (k4 >> 26);
	return k2 + k4;
}

int n, m, u[MAX], v[MAX];
ULL w[MAX];
int idxes[MAX];

void gen()
{
	cin >> n >> m >> k1 >> k2;
	FOR(i, 0, m)
	{
		u[i] = xorShift128Plus() % n;
		v[i] = xorShift128Plus() % n;
		w[i] = xorShift128Plus();
	}
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		gen();
		iota(idxes, idxes + m, 0);
		sort(idxes, idxes + m, [](int i, int j) {return w[i] < w[j];});
		dsu.init(n);
		int ans = 0;
		FOR(i, 0, m)
		{
			int j = idxes[i];
			if (dsu.unite(u[j], v[j]))
				updAdd(ans, w[j] % mod);
		}
		if (dsu.sz[dsu.find(0)] != n)
			ans = 0;
		cout << ans << "\n";
	}
	
}