#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    ll h1, a1, s1, h2, a2, s2;
    cin >> h1 >> a1 >> s1 >> h2 >> a2 >> s2;
    h1 = (h1 + a2 - 1) / a2;
    h2 = (h2 + a1 - 1) / a1;
    bool flip = h1 < h2;
    if (flip) swap(h1, h2), swap(s1, s2);
    mint ans;
    ll t = h1 - h2;
    mint teni = mint(10).inv();
    if (t) {
      // 9/10(1 + 1/10 + 1/10^2 + ... + 1/10^(t-1))
      ans += mint(9) / 10 * (1 - teni.pow(t)) / (1 - teni);
    }
    mint prob = teni.pow(t);
    if (s1 > s2) {
      // 9/10(1+1/10^2+1/10^4+...)
      ans += prob * 9 / 10 / (1 - teni.pow(2));
    } else if (s1 < s2) {
      ans += prob * teni * 9 / 10 / (1 - teni.pow(2));
    } else {
      ans += prob * (mint(9) / 10 + teni * 9 / 10) / 2 / (1 - teni.pow(2));
    }
    if (flip) ans = 1 - ans;
    cout << ans.val() << '\n';
  }
}