#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
using ll = long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    mint p10 = mint(10).inv(), r = (1-p10*p10);
    int t;
    cin >> t;
    while(t--){
        ll a[2],b[2],c[2],t[2];
        rep(i,2) cin >> a[i] >> b[i] >> c[i];
        rep(i,2) t[i] = (a[i]-1)/b[!i];
        mint ans = 0;
        if(c[0]<=c[1]){
            if(t[0]<=t[1]){
                ans += p10.pow(t[1]-t[0]+1)*(1-p10)/r;
            }else{
                mint p = p10.pow(t[0]-t[1]-1);
                ans += (1-p)+p*(1-p10)/r;
            }
        }
        if(c[0]>=c[1]){
            if(t[0]<t[1]){
                ans += p10.pow(t[1]-t[0])*(1-p10)/r;
            }else{
                mint p = p10.pow(t[0]-t[1]);
                ans += (1-p)+p*(1-p10)/r;
            }
        }
        if(c[0]==c[1]) ans *= 499122177;
        cout << ans.val() << '\n';
    }
    return 0;
}