#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf=2e18;
ll solve(ll n,ll a,ll b,ll c,ll d,ll m){
    ll k1,k2,ans,cnt,dq,cal,cur,cur1,cur2;
    __int128 val;
    if(n<0) return -inf;
    k1=c/m,k2=d/m;
    c%=m,d%=m;
    ans=b*k2,a+=b*k1;
    if(b==0){
        if(a>0) return ans+a*n;
        else return ans;
    }
    if(c==0){
        if(a>0) return ans+a*n;
        else return ans;
    }
    if(b>0){
        if(a>=0){
            val=(__int128)c*n+d;
            cnt=(ll)(val/m);
            return ans+a*n+b*cnt;
        }
        else{
            val=(__int128)c*n+d;
            dq=(ll)(val/m);
            if(dq==0) return ans;
            cal=solve(dq-1,b,a,m,m-d+c-1,c);
            return ans+max(0LL,cal+b);
        }
    }
    else{
        val=(__int128)c*n+d;
        cur=(ll)(val/m);
        cur1=(ll)(val%m);
        cur2=a*n+b*cur;
        cal=solve(n,-a,-b,c,m-1-cur1,m);
        return ans+cur2+cal;
    }
}
int main(){
    ll t,n,m,a,b,c,d;
    scanf("%lld",&t);
    while(t--){
        scanf("%lld%lld%lld%lld%lld%lld",&n,&m,&a,&b,&c,&d);
        printf("%lld\n",solve(n-1,a,b,c,d,m));
    }
    return 0;
}