1
8 3 5 2 7 4

6

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;#define maxn 100010
#define LL long long
int n, s, q, p, m, d, gcdnd, pos[maxn];
bool has[maxn], h2[maxn];int fa[maxn], siz[maxn];
int findset(int x) { return x == fa[x] ? x : fa[x] = findset(fa[x]); }
int f2[maxn];
int find2(int x) { return x == f2[x] ? x : f2[x] = find2(f2[x]); }
int nxt(int x) { return (x + d) % n; }
int pre(int x) { return (x - d + n) % n; }
LL gcd(LL a, LL b) { return !b ? a : gcd(b, a % b); }
void add(int u, int x) {has[u] = 1;int v = findset(nxt(u));if(has[v]) fa[u] = v;v = findset(pre(u)); u = findset(u);if(u != v) { if(has[v]) fa[v] = u; }else {h2[x] = 1; int xx = find2(x);if(x < gcdnd - 1 && h2[x+1]){ v = find2(x + 1); if(x != v) f2[x] = v; }if(x && h2[x-1]){ v = find2(x - 1); if(x != v) f2[v] = x; }}return ;
}int main() {int T; scanf("%d", &T);while(T--) {scanf("%d%d%d%d%d%d", &n, &s, &q, &p, &m, &d); d %= n;
//      n = read(); s = read(); q = read(); p = read(); m = read(); d = read() % n;gcdnd = gcd(n, d);memset(has, 0, sizeof(has));memset(h2, 0, sizeof(h2));has[s] = 1;for(int i = 0; i < n; i++) fa[i] = i;for(int i = 0; i < gcdnd; i++) f2[i] = i;LL c = 0;for(int i = 1; i < n; i++) {c = (c * q + p) % m;LL cd = c % n % gcdnd;int y = find2(cd); if(h2[y]) y++; if(y >= gcdnd){ y = find2(0); if(h2[y]) y++; }int u;if(y - cd >= 0){ u = findset((c % n + y - cd) % n); if(has[u]) u = nxt(u); }else { u = findset((c % n + y - cd + gcdnd) % n); if(has[u]) u = nxt(u); }add(u, y); pos[i] = u;}//      for(int i = 1; i < n; i++) printf("%d ", pos[i]); puts("\n");for(int i = 0; i < n; i++) fa[i] = i, siz[i] = 1;for(int i = 1; i < n; i++) {int u = findset(i), v = findset(pos[i]);if(u != v) fa[v] = u, siz[u] += siz[v], siz[v] = 0;}for(int i = 0; i < n; i++) pos[i] = findset(i);sort(pos, pos + n);int ans = 0;for(int i = 0; i < n; i++) if((!i || pos[i] != pos[i-1]) && siz[pos[i]] > 1) ans += siz[pos[i]] + 1;if(siz[findset(0)] > 1) ans -= 2;printf("%d\n", ans);}return 0;
}