#include<bits/stdc++.h>
using namespace std;

void solve(){
  using ll=long long;
  auto g=[&](int n){
    vector<ll> ret(10);
    vector pw(11,vector<ll>(n+1));
    for (int i=0;i<=10;i++){
      pw[i][0]=1;
      for (int j=0;j<n;j++) pw[i][j+1]=pw[i][j]*i;
    }
    for (int m=0;m<=9;m++){
      for (int i=0;i<n;i++){
        ret[m]+=pw[m+1][i]*pw[m][n-i-1];
      }
    }
    ret[0]=1;
    return ret;
  };
  auto f=[&](string s){
    int n=s.size();
    int md=0;
    ll ret=0;
    for (int i=0;i<n;i++){
      auto vec=g(n-i-1);
      for (int c=0;c<s[i]-'0';c++){
        for (int d=0;d<=9;d++){
          int val=max({md,c,d});
          ret+=val*vec[d];
        }
      }
      md=max(md,s[i]-'0');
    }
    return ret;
  };
  ll l,r;
  cin>>l>>r;
  ll ans=f(to_string(r+1))-f(to_string(l));
  cout<<ans<<endl;
}

int main(){
  int t;
  cin>>t;
  while (t--) solve();
}