#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ll long long
#define fi first
#define se second
#define lowbit(x) (x&(-x))
const int mod=998244353;
const double eps=1e-12;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;
#define popcnt __builtin_popcount
int dcmp(double x){if(fabs(x)<eps)return 0;return x>0?1:-1;}
template<typename T>inline int tomax(T&a,T b){if(b>a){a=b;return 1;}return 0;}
template<typename T>inline int tomin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
// mt19937 rnd(random_device{}());
// uniform_int_distribution<int>dist(0,1000);

#define int ll



void solve()
{
    int n,m,p,x,a,b,c;
    cin>>n>>m>>p>>x>>a>>b>>c;
    vector<int>A(n+1),B(m+1);
    map<int,int>mp;
    for(int i=1;i<=n;i++)
    {
        x=(a*x%p*x%p+b*x%p+c)%p;
        A[i]=x;
        if(!mp.count(A[i]))mp[A[i]]=i;
    }
    for(int i=1;i<=m;i++)
    {
        x=(a*x%p*x%p+b*x%p+c)%p;
        B[i]=x;
        if(mp.count(B[i]))
        {
            cout<<min(m-i+1,n-mp[B[i]]+1)<<endl;
            return;
        }
    }
    cout<<0<<endl;
}

/*

*/

#undef int

int main()
{
    ios::sync_with_stdio(false);cin.tie(nullptr);
    // cout<<fixed<<setprecision(15);



    int _;cin>>_;while(_--)
    {
        solve();
    }
    return 0;
}