#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep2(i, m ,n) for (int i = (m); i < (long long)(n); i++)
#define REP(i, n) for (long long i = 1; i < (long long)(n); i++)
typedef long long ll;
#define all(n) n.begin(),n.end()
#define updiv(N,X) (N + X - 1) / X
#define YesNo(Q) Q==1?cout<<"Yes":cout<<"No"
using P = pair<int, int>;
using mint = modint;
const int MOD = 998244353LL;
const ll INF = 999999999999LL;
vector<long long> fact, fact_inv, inv;
/*  init_nCk :二項係数のための前処理
    計算量:O(n)
*/
template <typename T>
void input(vector<T> &v){
 rep(i,v.size()){cin>>v[i];}
  return;
}
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
    }
}
/*  nCk :MODでの二項係数を求める(前処理 int_nCk が必要)
    計算量:O(1)
*/
long long nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

ll POW(ll a,ll n){
  long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a;
        a = a * a;
        n >>= 1;
    }
    return res;
}


ll solvet(string s) {
  ll n = s.size(), m = 7000000001LL, r = 0;
  ll c[25][2][25]={};ll u[25][2][25]={};
  ll p[25]={};
  c[0][0][n] = 1;
  p[0] = 1;
  rep(i,n){
    p[i+1] = (ll)((__int128_t)p[i] * 10 % m);
  }
  rep(i,n){ 
    rep(j,2){ 
      rep(k,n+1) {
    if (!c[i][j][k]) continue;
    int l = (j ? 9 : s[i] - '0');
    rep(d,l+1) {
      int x = j | (d < l);
      int y = (k == n && d) ? i : k;
      c[i+1][x][y] = (c[i+1][x][y] + c[i][j][k]) % m;
      ll a = u[i][j][k];
      if (y!=n) {
        a = (a+(ll)((__int128_t)d * p[i-y] % m * c[i][j][k] % m)) % m;
      }
      u[i+1][x][y] = (u[i+1][x][y] + a) % m;
    }
  }}}
  rep(j,2) rep(k,n+1) r = (r+u[n][j][k])%m;
  return r;
}
string rev(string a){
  string aa = a;
  rep(i,a.size()){
    aa[i] = a[a.size()-i-1];
  }
  return aa;
}
void solve(){
  string s,t;cin>>s>>t;

  ll a = stoll(s);
  a--;
  s = to_string(a);

  ll ans = solvet(t)-solvet(s);
  cout << ans << endl;
}
int main() {
 int n;cin>>n;
 while(n--){
   solve();
 }
 //cout << rev("20") << endl;
}