#include <iostream>
#include <vector>
#include <utility>
#include <map>
#include <math.h>
#include <numeric>

typedef long long ll;

using namespace std;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;

    while(t--){
        ll n, m, p, x, a, b, c;
        cin >> n >> m >> p >> x >> a >> b >> c;

        vector<int> s(n), t(m);
        map<int, int> first;
        for(int i = 0; i < n; ++i){
            x = (a * x % p * x + b * x + c) % p;
            s[i] = x;
            if(!first.count(x))
                first[x] = i;
        }
        int ans = 0;
        for(int i = 0; i < m; ++i){
            x = (a * x % p * x + b * x + c) % p;
            t[i] = x;
            if(first.count(x)){
                ans = max(ans, (int)min(m - i, n - first[x]));
            }
        }
        cout << ans << "\n";
    }
}