#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using P=pair<ll,ll>;
typedef atcoder::modint mint;
ll inf=9e18;
template<typename T, int s, int i = 0>
auto vec(const ll (&sizes)[s], const T& init = T()){
  if constexpr(i < s) return vector(sizes[i], vec<T, s, i+1>(sizes, init));
  else return init;
}


int main(){
  ll t,hc,ac,sc,hg,ag,sg;
  mint p;
  cin>>t;
  for(ll T=0;T<t;T++){
    cin>>hc>>ac>>sc>>hg>>ag>>sg;
    hc=(hc-1)/ag;
    hg=(hg-1)/ac;
    // cout<<hc<<" "<<hg<<"a\n";
    if(hc==hg){
      p=0;
      if(sc>sg) p=10;
      if(sc<sg) p=1;
      p/=11;
      if(sc==sg) p=499122177;
      cout<<p.val()<<"\n";
    }else{
      if(hc>hg){
        p=1;
        p/=10;
        p=p.pow(hc-hg);
        if(sc<sg){
          p*=10;
          p/=11;
        }else if(sc>sg){
          p/=11;
        }else{
          p/=2;
        }
        cout<<(1-p).val()<<"\n";
      }else{
        p=1;
        p/=10;
        p=p.pow(hg-hc);
        if(sc>sg){
          p*=10;
          p/=11;
        }else if(sc<sg){
          p/=11;
        }else{
          p/=2;
        }
        cout<<p.val()<<"\n";
      }
    }
  }
}