#define ATCODER #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define VL vector #define VVL vector> #define VP vector< pair > #define VVP vector>> #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define MP(a,b) make_pair(a,b) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } template T det2(array ar) { return ar[0] * ar[3] - ar[1] * ar[2]; } template T det3(array ar) { return ar[0] * ar[4] * ar[8] + ar[1] * ar[5] * ar[6] + ar[2] * ar[3] * ar[7] - ar[0] * ar[5] * ar[7] - ar[1] * ar[3] * ar[8] - ar[2] * ar[4] * ar[6]; } template bool chmax(T& tar, T src) { return tar < src ? tar = src, true : false; } template bool chmin(T& tar, T src) { return tar > src ? tar = src, true : false; } template void inc(vector& ar) { for (auto& v : ar) v++; } template void dec(vector& ar) { for (auto& v : ar) v--; } template vector> id_sort(vector& a) { vector res(a.size()); for (int i = 0; i < a.size(); i++)res[i] = MP(a[i], i); SORT(res); return res; } ll mod; using val = pair; using func = ll; val op(val a, val b) { return MP((a.first + b.first) % mod, (a.second + b.second) % mod); } val e() { return MP(0, 0);; } val mp(func f, val a) { return MP((a.first + f * a.second)%mod, a.second); } func comp(func f, func g) { return (f + g)%mod; } func id() { return 0; } // Rook ll dxr[4] = { 1,0,-1,0 }; ll dyr[4] = { 0,1,0,-1 }; // Bishop ll dxb[4] = { -1,-1,1,1 }; ll djb[4] = { -1,1,-1,1 }; // qween ll dxq[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dyq[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n, m, l, mod; cin >> n >> m >> l >> mod; vector base(3, vector(3)); // sMs,sL auto ans = base; auto f = ans; ans[0][0] = 1; f[1][0] = 1; f[0][1] = 1; auto conv=[&](auto f0, auto f1) { auto res = base; REP(i0, 2) { REP(i1, 2) { REP(j0, 2) { REP(j1, 2) { res[i0 + i1][j0 + j1] += f0[i0][j0] * f1[i1][j1]; res[i0 + i1][j0 + j1] %= mod; } } } } // 変換へたくそ委員会だった REP(i, 3) { res[i][0] += res[i][2] * l; res[i][0] %= mod; res[i][2] = 0; } REP(i,3){ res[0][i] += res[2][i] * m; res[0][i] %= mod; res[2][i] = 0; } return res; }; REP(b, 60) { if (EXISTBIT(n, b)) { ans = conv(ans, f); } f = conv(f, f); } if (n % 2) { cout << ans[0][1]; } else { cout << ans[0][0]; } cout << "\n"; } int main() { ll t = 1; cin >> t; while (t--) { solve(); } return 0; }