#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=10+5,M=3e5+5,K=(1<<15)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,A[N][N],f[N][3];ll ans;
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
int CK(int x,int y){
	if(f[x][0]>3||f[x][1]>3||f[x][2]>3) return 0;
	for(int i=1;i<x;i++) for(int j=1;j<y;j++){
		if(A[i][j]==A[i][y]&&A[x][j]==A[x][y]) return 0;
		if(A[i][j]==A[x][j]&&A[i][y]==A[x][y]) return 0;
	}
	return 1;
}
void dfs(int x,int y){
	if(y==m+1) return dfs(x+1,1);
	if(x==n+1) {ans--;return;}
	A[x][y]=0;f[x][A[x][y]]++;if(CK(x,y)) dfs(x,y+1);f[x][A[x][y]]--;
	A[x][y]=1;f[x][A[x][y]]++;if(CK(x,y)) dfs(x,y+1);f[x][A[x][y]]--;
	A[x][y]=2;f[x][A[x][y]]++;if(CK(x,y)) dfs(x,y+1);f[x][A[x][y]]--;
}
ll g[N][N];
void Solve(){
	int i,j;
	scanf("%d%d",&n,&m);
	if(n>m) swap(n,m);
	if(g[n][m]){printf("%lld\n",g[n][m]);return;}
	if(n==1||m==1){puts("0");return;}
	ans=mpow(3,n*m);
	if(n<=9&&m<=9) dfs(1,1);
	g[n][m]=(ans%mod+mod)%mod;
	printf("%lld\n",(ans%mod+mod)%mod);
}
int main(){
	int t;
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}