#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#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> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const 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;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){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){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



template<class T>
using square_matrix=std::vector<std::vector<T>>;
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> mul_matrix(square_matrix<T> l,square_matrix<T> r){
	int n=l.size();
	assert((int)l[0].size()==n&&(int)r.size()==n&&(int)r[0].size()==n);
	square_matrix<T> val(n,std::vector<T>(n,add_e()));
	for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++){
		val[i][k]=add_op(val[i][k],mul_op(l[i][j],r[j][k]));
	}
	return val;
}
template<class T,T (*add_op)(T,T),T(*add_e)(),T (*mul_op)(T,T),T(*mul_e)()>
square_matrix<T> pow_matrix(square_matrix<T> l,long long times){
	int n=l.size();
	square_matrix<T> val(n,std::vector<T>(n,add_e()));
	for(int i=0;i<n;i++) val[i][i]=mul_e();
	while(times){
		if(times&1){
			val=mul_matrix<T,add_op,add_e,mul_op,mul_e>(val,l);
		}
		l=mul_matrix<T,add_op,add_e,mul_op,mul_e>(l,l);
		times>>=1;
	}
	return val;
}

ll N,B;


using mat_F=ll;
mat_F add_op(mat_F a,mat_F b){
	return (a+b)%B;
}
mat_F add_e(){
	return 0;
}
mat_F mul_op(mat_F a,mat_F b){
	return (a*b)%B;
}
mat_F mul_e(){
	return 1;
}
#define calc mat_F,add_op,add_e,mul_op,mul_e


ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=(x%z+z)%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,0,t) solve();
}

void solve(){
    cin>>N>>B;
    auto f=[&](auto self,ll n,ll a)->ll{
        ll res=0;
        if(n==1) return 1;
        if(n&1){
            res=1+a*self(self,n-1,a)%B;
            return res;
        }
        res=self(self,n/2,a*a%B);
        res=res*(1+a)%B;
        return res;
    };
    //ab=S,a+b=T
    //sum_{i=1,2,...n} a^i+b^i
    auto g=[&](ll S,ll T,ll n)->ll{
        if(n==0) return 0;
        if(n==1) return T;
        vector<vector<ll>> base={
            {T,-S,0},
            {1,0,0},
            {1,0,1}
        };
        base=pow_matrix<calc>(base,n);
        ll res=base[2][0]*T+base[2][1]*2ll;
        return res%B;
    };
    auto h=[&](auto self,ll s,ll t,ll n)->ll{
        if(n==1) return s;
        if(n%2==0){
            ll res=g(s,t,n/2)-g(s,t,n/2-1);
            res++;
            res=(res+jyo(s,n/2,B))%B;
            res=(res*self(self,s,t,n/2))%B;
            return res;
        }
        ll res=self(self,s,t,n-1);
        res++;
        res=(res+g(s,t,n-1))%B;
        res=(res*s)%B;
        return res;
    };
    vector A(2,vector<ll>(2));
    rep(i,0,2) rep(j,0,2) cin>>A[i][j];
    ll tmp=A[0][0]*A[1][1]-A[0][1]*A[1][0];
    if(tmp==0){
        cout<<"0\n";
    }
    else{
        ll s=tmp;
        ll t=A[0][0]+A[1][1];
        s%=B,t%=B;
        ll ans=h(h,s,t,N);
        if(N%2==1&&tmp<0) ans*=-1;
        ans=(ans%B+B)%B;
        cout<<(ans%B+B)%B<<"\n";
    }
}