#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1000000007;
int f(int x, int n, int m){
  if(n == 0)
    return 1;
  if(n % 2 == 0)
    return f(x * x % m, n / 2, m);
  else
    return x * f(x, n - 1, m) % m;
}
int g(int n,int m){
    return (n*(n+1)/2)%m;
}
int h(int n,int m){
    if((2*n+1)%3 == 0) return (((n*(n+1)/2)%m*(2*n+1))/3)%m;
    else return n*(n+1)/6%m*(2*n+1)%m;
}
signed main(){
  int T;
  cin>>T;
  for(int i=0;i<T;i++){
      int N,M;
      cin>>N>>M;
      cout<<(g(f(N,M,mod),mod)-h(f(N,M/2,mod),mod)+mod)%mod<<endl;
  }
}