#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

const ull M = 1000000007;

vector<ull> F,I,iF;
void init_comb(int Z){
  F.assign(Z+1,1);
  for(int i=1; i<=Z; i++) F[i] = F[i-1] * i % M;
  I.assign(Z+1,1);
  for(int i=2; i<=Z; i++) I[i] = M - M/i * I[M%i] % M;
  iF.assign(Z+1,1);
  for(int i=1; i<=Z; i++) iF[i] = iF[i-1] * I[i] % M;
}

ull comb(int n,int r){
  return F[n] * iF[r] % M * iF[n-r] % M;
}

void testcase(){
  int H,W; cin >> H >> W;
  if(H == 1 || W == 1){
    cout << 0 << "\n";
    return;
  }
  ull ans = comb((H-2)+(W-2),H-2) * ((H-1)+(W-1)-1) % M * 2 % M;
  cout << ans << "\n";
}

int main(){
  int T; cin >> T;
  init_comb(400000);
  rep(caseid,T) testcase();
  return 0;
}


struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_instance;