#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a){
    if (a.empty()) return os;
    os << a.front();
    for (auto e : a | views::drop(1)){
        os << ' ' << e;
    }
    return os;
}

void dump(auto ...vs){
    ((cout << vs << ' '), ...) << endl;
}

#include <atcoder/all>
using namespace atcoder;
using mint = dynamic_modint<0>;

void solve() {
    ll N,M,L,B;
    cin>>N>>M>>L>>B;
    mint::set_mod(B);
    typedef array<mint,4> S;
    auto mult=[&M,L](S a,S b)->S {
        S c={0,0,0,0};
        rep(i,4){
            rep(j,4){
                mint v=a[i]*b[j];
                if (i&j&1){
                    v*=M;
                }
                if (i&j&2){
                    v*=L;
                }
                c[i^j]+=v;
            }
        }
        return c;
    };
    S ans={1,0,0,0};
    S base={0,1,1,0};
    {
        ll bn=N;
        while (bn>0){
            if (bn&1){
                ans=mult(ans,base);
            }
            base=mult(base,base);
            bn>>=1;
        }
    }
    if (N%2==0){
        cout<<ans[0].val()<<'\n';
    }
    else{
        cout<<ans[2].val()<<'\n';
    }
    return;
}


int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T=1;
    cin>>T;
    while (T--){
        solve();
    }
    return 0;
}