#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/modint>
using mint = atcoder::modint;
using F = array<array<mint, 2>, 2>;
F op(F l, F r){
    F res;
    rep(i, 0, 2) rep(j, 0, 2) rep(k, 0, 2){
        res[i][k] += l[i][j] * r[j][k];
    }
    return res;
}
F my_pow(F tmp, ll t){
    F res;
    rep(i, 0, 2) res[i][i] = 1;
    while (t){
        if (t & 1){
            res = op(res, tmp);
        }
        t /= 2;
        tmp = op(tmp, tmp);
    }
    return res;
}


void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    ll N, m, l;
    int B;
    cin >> N >> m >> l >> B;
    mint::set_mod(B);
    mint M = m, L = l;
    F tmp;
    tmp[0][0] = L + M;
    tmp[1][1] = L + M;
    tmp[0][1] = L * 2;
    tmp[1][0] = M * 2;
    tmp = my_pow(tmp, N / 2);
    if (N % 2 == 0){
        cout << tmp[0][0].val() << "\n";
    }
    else{
        cout << (tmp[0][0] + tmp[1][0]).val() << "\n";
    }
}
/*
 * N が偶数のとき
 * ans * 2 = (sqrt(L) + sqrt(M))^N + (sqrt(L) - sqrt(M))^N
 * そもそも、sqrt が定義されていないので無理そう
 * a^k + b^k = (a^{k - 1} + b^{k - 1}) * (a + b) - (a^{k - 2} + b^{k - 2}) * ab
 * これで解決
 * B 素数じゃないのヤバすぎ？
 * と思いきや、B = 2 * B として仕舞えばいい
 *
 * ダメでー
 * a + b = sqrt(L) * 2 だからダメ
 * f0[N] = ans[N]
 * f1[N] = binom(N, 2 * n + 1) M^{n}L^{N / 2 - n}
 * とする
 * f0[N + 2] = f0[N] * (L + M) + f1[N] * (2 * M)
 * f1[N + 2] = f0[N] * (2 * L) + f1[N] * (L + M)
 *
 */