#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

namespace ttl{

using namespace std;
using f80=long double;
using i64=int64_t;
using u64=uint64_t;

template<int mod> struct MyModInt{
  i64 vl;
  static constexpr i64 get_mod(){ return mod; }
  i64 val(){ return vl; }
  MyModInt(i64 vl_=0):vl(vl_%mod){}
  MyModInt operator-(){ return (vl==0)?0:mod-vl; }
  MyModInt operator+(MyModInt rhs){ return MyModInt(*this)+=rhs; }
  MyModInt operator-(MyModInt rhs){ return MyModInt(*this)-=rhs; }
  MyModInt operator*(MyModInt rhs){ return MyModInt(*this)*=rhs; }
  MyModInt operator/(MyModInt rhs){ return MyModInt(*this)/=rhs; }
  MyModInt pow(i64 rhs){
    MyModInt res=1,now=(*this);
    while(rhs){
      res*=((rhs&1)?now:1),now*=now,rhs>>=1;
    }
    return res;
  }
  MyModInt& operator+=(MyModInt rhs){
    vl+=rhs.vl,vl-=((vl>=mod)?mod:0);
    return (*this);
  }
  MyModInt& operator-=(MyModInt rhs){
    vl+=((vl<rhs.vl)?mod:0),vl-=rhs.vl;
    return (*this);
  }
  MyModInt& operator*=(MyModInt rhs){
    vl=vl*rhs.vl%mod;
    return (*this);
  }
  MyModInt& operator/=(MyModInt rhs){ return (*this)*=rhs.pow(mod-2); }
  bool operator==(MyModInt rhs){ return vl==rhs.vl; }
  bool operator!=(MyModInt rhs){ return vl!=rhs.vl; }
};

template<u64 mod> using ModInt=
#if __has_include(<atcoder/all>)
  atcoder::static_modint<mod>;
#else
  MyModInt<mod>;
#endif

template<int mod> std::ostream& operator<<(std::ostream& os,ModInt<mod> x){
  return os<<(x.val());
}

template<int mod> std::istream& operator>>(std::istream& is,ModInt<mod>& x){
  i64 t;
  is>>t,x=t;
  return is;
}

template<class T> void Scan_(T& a){ cin>>a; }
template<class T,class U> void Scan_(pair<T,U>& a){ Scan_(a.first),Scan_(a.second); }
template<class T> void Scan_(vector<T>& a){
  for(auto& v:a){
    Scan_(v);
  }
}
template<class T> void Scan_(vector<vector<T>>& a){
  for(auto& v:a){
    for(auto& u:v){
      Scan_(u);
    }
  }
}
void Scan(){}
template<class T,class... Args> void Scan(T& n,Args&... args){ Scan_(n),Scan(args...); }
template<class T> void Print_(T a){ cout<<a; }
template<class T,class U> void Print_(pair<T,U> a){ Print_(a.first),cout<<" ";Print_(a.second); }
void Print_(f80 a){ printf("%.10Lf",a); }
template<class T> void Print(vector<T> a){
  for(size_t i=0;i<a.size();++i){
    Print_(a[i]);
    cout<<" \n"[i==a.size()-1];
  }
}
template<class T> void Print(vector<vector<T>> a){
  for(auto& v:a){
    for(size_t i=0;i<v.size();++i){
      Print_(v[i]);
      cout<<" \n"[i==v.size()-1];
    }
  }
}
template<class T> void Print(T a){ Print_(a),cout<<"\n"; }
template<class T,class... Args> void Print(T a,Args... args){ Print_(a),cout<<" ",Print(args...); }

template<class Head,class... Tail> struct multi_dim_vector{ using type=vector<typename multi_dim_vector<Tail...>::type>; };
template<class T> struct multi_dim_vector<T>{ using type=T; };
template<class T,class Arg> vector<T> MakeVec(int n,Arg&& arg){ return vector<T>(n,arg); }
template<class T,class... Args> class multi_dim_vector<Args...,T>::type MakeVec(int n,Args&&... args){
  return typename multi_dim_vector<Args...,T>::type(n,MakeVec<T>(args...));
}

template<class T,class=void> class has_plus_assign : public false_type {};
template<class T> class has_plus_assign<T,decltype(declval<T&>()+=declval<const T&>(),void(0))> : public true_type {};
template<class T,class=void> class has_minus_assign : public false_type {};
template<class T> class has_minus_assign<T,decltype(declval<T&>()-=declval<const T&>(),void(0))> : public true_type {};
template<class T,class=void> class has_mul_assign : public false_type {};
template<class T> class has_mul_assign<T,decltype(declval<T&>()*=declval<const T&>(),void(0))> : public true_type {};
template<class T,class=void> class has_div_assign : public false_type {};
template<class T> class has_div_assign<T,decltype(declval<T&>()/=declval<const T&>(),void(0))> : public true_type {};

template<class T> auto operator+=(T& a,const T& b) -> typename enable_if<has_plus_assign<T>::value,T&>::type{
  for(size_t i=0;i<a.size();++i){
    a[i]+=b[i];
  }
  return a;
}
template<class T> auto operator+(T a,const T& b) -> typename enable_if<has_plus_assign<T>::value,T>::type{
  return a+=b;
}
template<class T> auto operator-=(T& a,const T& b) -> typename enable_if<has_minus_assign<T>::value,T&>::type{
  for(size_t i=0;i<a.size();++i){
    a[i]-=b[i];
  }
  return a;
}
template<class T> auto operator-(T a,const T& b) -> typename enable_if<has_minus_assign<T>::value,T>::type{
  return a-=b;
}
template<class T> auto operator*=(T& a,const T& b) -> typename enable_if<has_mul_assign<T>::value,T&>::type{
  for(size_t i=0;i<a.size();++i){
    a[i]*=b[i];
  }
  return a;
}
template<class T> auto operator*(T a,const T& b) -> typename enable_if<has_mul_assign<T>::value,T>::type{
  return a*=b;
}
template<class T> auto operator/=(T& a,const T& b) -> typename enable_if<has_div_assign<T>::value,T&>::type{
  for(size_t i=0;i<a.size();++i){
    a[i]/=b[i];
  }
  return a;
}
template<class T> auto operator/(T a,const T& b) -> typename enable_if<has_div_assign<T>::value,T>::type{
  return a/=b;
}

template<class T> void Rev(T& a){ reverse(a.begin(),a.end());}
template<class T> void Sort(T& a){ sort(a.begin(),a.end()); }
template<class T> void RSort(T& a){ sort(a.rbegin(),a.rend()); }
template<class T> T Reved(T a){
  reverse(a.begin(),a.end());
  return a;
}
template<class T> T Sorted(T a){
  sort(a.begin(),a.end());
  return a;
}
template<class T> T RSorted(T a){
  sort(a.rbegin(),a.rend());
  return a;
}

template<class T> T Sum(vector<T> a){ return accumulate(a.begin(),a.end(),T(0)); }
template<class T> T Max(vector<T> a){ return *max_element(a.begin(),a.end()); }
template<class T> T Min(vector<T> a){ return *min_element(a.begin(),a.end()); }
template<class T> void ChMax(T& a,T b){ a=max(a,b); }
template<class T> void ChMin(T& a,T b){ a=min(a,b); }
i64 Tr(i64 n){ return n*(n+1)/2; }
i64 PopCnt(u64 k){ return __builtin_popcountll(k); }
template<class T>T Pow(T a,i64 n){
  T res=1;
  while(n){
    if(n&1){ res*=a; }
    a*=a;
    n/=2;
  }
  return res;
}
i64 Pow(i64 a,i64 n,i64 m){
  i64 res=1;
  while(n){
    if(n&1){ res=res*a%m; }
    a=a*a%m;
    n/=2;
  }
  return res;
}

template<class T> vector<T> CoorComp(vector<T> a){
  Sort(a);
  a.erase(unique(a.begin(),a.end()),a.end());
  return a;
}

template<class mint> vector<mint> NaiveConv(vector<mint> f,vector<mint> g){
  vector<mint> h(f.size()+g.size()-1);
  for(size_t i=0;i<f.size();++i){
    for(size_t j=0;j<g.size();++j){
      h[i+j]+=f[i]*g[j];
    }
  }
  return h;
}

i64 SqrtF(i64 n){
  i64 ok=0,ng=1e9+5;
  while(std::abs(ok-ng)>1){
    i64 mid=(ok+ng)/2;
    (mid*mid<=n?ok:ng)=mid;
  }
  return ok;
}

i64 SqrtC(i64 n){
  i64 ok=1e9+5,ng=0;
  while(std::abs(ok-ng)>1){
    i64 mid=(ok+ng)/2;
    (mid*mid>=n?ok:ng)=mid;
  }
  return ok;
}

i64 FDiv(i64 a,i64 b){
  if(b<0){
    a*=-1,b*=-1;
  }
  if(a<0){
    return -(-a+b-1)/b;
  }
  return a/b;
}

i64 CDiv(i64 a,i64 b){
  if(b<0){
    a*=-1,b*=-1;
  }
  if(a<0){
    return -(-a)/b;
  }
  return (a+b-1)/b;
}

vector<i64> LISSize(vector<i64> A){
  int N=A.size();
  vector<i64> dp(N+1,2e18),res(N+1);
  dp[0]=-1;
  for(int i=0;i<N;++i){
    auto j=(lower_bound(dp.begin(),dp.end(),A[i])-dp.begin())-1;
    dp[j+1]=A[i];
    res[i+1]=max(res[i],i64(j+1));
  }
  return res;
}

#if __has_include(<atcoder/all>)
i64 CountInverse(vector<i64> A){
  int N=A.size();
  auto B=A;
  sort(B.begin(),B.end());
  B.erase(unique(B.begin(),B.end()),B.end());
  map<i64,i64> mp;
  for(size_t i=0;i<B.size();++i){
    mp[B[i]]=i;
  }
  for(int i=0;i<N;++i){
    A[i]=mp[A[i]];
  }
  atcoder::fenwick_tree<i64> fwt(N);
  i64 ans=0;
  for(int i=0;i<N;++i){
    fwt.add(A[i],1);
    ans+=fwt.sum(A[i]+1,N);
  }
  return ans;
}
#endif

struct ESieve{
  int n;
  vector<i64> lpf;
  ESieve(int n_):n(n_),lpf(n_+1,-1){
    for(i64 p=2;p<=n;++p){
      if(lpf[p]!=-1){
        continue;
      }
      for(i64 q=p;q<=n;q+=p){
        if(lpf[q]==-1){
          lpf[q]=p;
        }
      }
    }
  }
  vector<pair<i64,i64>> operator()(int m){
    vector<i64> v;
    while(m!=1){
      v.emplace_back(lpf[m]);
      m/=lpf[m];
    }
    if(v.size()==0){
      return {};
    }
    vector<pair<i64,i64>> res;
    res.emplace_back(v[0],1);
    for(size_t i=1;i<v.size();++i){
      if(v[i-1]!=v[i]){
        res.emplace_back(v[i],1);
      }
      else{
        res.back().second++;
      }
    }
    return res;
  }
};

vector<int> BFS(vector<vector<int>> G,int v){
  int N=G.size();
  vector<int> dst(N,-1);
  queue<int> q;
  dst[v]=0;
  q.emplace(v);
  while(q.size()){
    int t=q.front();
    q.pop();
    for(auto u:G[t]){
      if(dst[u]==-1){
        dst[u]=dst[t]+1;
        q.emplace(u);
      }
    }
  }
  return dst;
}

vector<i64> Dijkstra(vector<vector<pair<int,i64>>>& G,int s){
  int N=G.size();
  vector<i64> dst(N,1e18);
  dst[s]=0;
  priority_queue<pair<i64,int>,vector<pair<i64,int>>,greater<pair<i64,int>>> pq;
  pq.emplace(0,s);
  vector<int> f(N);
  while(pq.size()){
    auto [t,u]=pq.top();
    pq.pop();
    if(f[u]){ continue; }
    f[u]=1;
    for(auto [v,w]:G[u]){
      if(dst[v]>dst[u]+w){
        dst[v]=dst[u]+w;
        pq.emplace(dst[v],v);
      }
    }
  }
  return dst;
}

void SpreadGrid(vector<string>& S,int h,int w,char c){
  int H=S.size(),W=S[0].size();
  auto res=MakeVec<string>(h,"");
  for(int i=0;i<h;++i){
    for(int j=0;j<w;++j){
      if(i<H && j<W){
        res[i]+=S[i][j];
      }
      else{
        res[i]+=c;
      }
    }
  }
  S=res;
}

bool CheckPrime(i64 n){
  if(n<2){
    return 0;
  }
  for(i64 i=2;i*i<=n;++i){
    if(n%i==0){
      return 0;
    }
  }
  return 1;
}

vector<pair<i64,i64>> PrimeFact(i64 n){
  vector<pair<i64,i64>> res;
  for(i64 i=2;i*i<=n;++i){
    if(n%i!=0){
      continue;
    }
    i64 ex=0;
    while(n%i==0){
      ex++,n/=i;
    }
    res.emplace_back(i,ex);
  }
  if(n!=1){
    res.emplace_back(n,1);
  }
  return res;
}

vector<i64> EnumDiv(i64 n){
  vector<i64> res;
  for(i64 i=1;i*i<=n;++i){
    if(n%i!=0){
      continue;
    }
    res.emplace_back(i);
    if(i*i!=n){
      res.emplace_back(n/i);
    }
  }
  sort(res.begin(),res.end());
  return res;
}

template<class T> struct CSum2D{
  int n,m;
  vector<vector<T>> a,c;
  CSum2D(vector<vector<T>> a_):n(a_.size()),m(a_[0].size()),a(a_){
    auto b=MakeVec<T>(n,m+1,0);
    for(int i=0;i<n;++i){
      for(int j=0;j<m;++j){
        b[i][j+1]=b[i][j]+a[i][j];
      }
    }
    c=MakeVec<T>(n+1,m+1,0);
    for(int j=0;j<m+1;++j){
      for(int i=0;i<n;++i){
        c[i+1][j]=c[i][j]+b[i][j];
      }
    }
  }
  T operator()(int p,int q,int r,int s){
    return c[p][r]-c[p][s]-c[q][r]+c[q][s];
  }
};

template<class T> auto RunLenEnc(T a) -> vector<pair<typename decltype(a)::value_type,i64>>{
  int n=a.size();
  vector<pair<typename decltype(a)::value_type,i64>> res;
  typename decltype(a)::value_type now=a[0];
  i64 l=1;
  for(int i=1;i<n;++i){
    if(a[i-1]==a[i]){
      l++;
    }
    else{
      res.emplace_back(now,l);
      now=a[i],l=1;
    }
  }
  res.emplace_back(now,l);
  return res;
}

template<class T> struct Comb{
  vector<T> fac,ifac;
  Comb(int mx=3000000):fac(mx+1,1),ifac(mx+1,1){
    for(int i=1;i<=mx;++i){
      fac[i]=fac[i-1]*i;
    }
    ifac[mx]/=fac[mx];
    for(int i=mx;i>0;--i){
      ifac[i-1]=ifac[i]*i;
    }
  }
  T operator()(int n,int k){
    if(n<0||k<0||n<k){
      return 0;
    }
    return fac[n]*ifac[k]*ifac[n-k];
  }
};

}

using namespace ttl;

int main(){
  constexpr int mod=1000000007;
  using mint=ModInt<mod>;
  Comb<mint> Cb;
  auto solve=[&](int a,int d){
  	if(a==0){
  		return mint(d?1:0);
  	}
  	mint ans=0;
  	{
  		int m=a-1;
  		int g=m+d;
  		ans+=Cb(m+g+1,m)*Cb(g,m);
  	}
  	{
  		int m=a-2;
  		int g=a+d;
  		ans-=Cb(m+g+1,m)*Cb(g,a);
  	}
  	return ans;
  };
  int T;
  Scan(T);
  while(T--){
  	int A,B,C,D;
  	Scan(A,B,C,D);
  	if(A!=B){
  		Print(0);
  		continue;
  	}
  	Print(solve(A,D)*Cb(A+B+C+D,C));
  }
}