#include #include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define inp(x) for(auto &i:x)cin>>i #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using i128 = __int128_t; using boost::multiprecision::cpp_int; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; //xまでで最大の数字がk以下であるパターン数(0含む)。 ll P(ll x,int k){ if(k==0)return 1; string X=to_string(x); ll stc=min(X[0]-'0',k); int n=X.size(); if(n==1)return min(x,ll(k))+1; rep(i,0,n-1){ stc*=(k+1); } if(X[0]-'0'>k){ stc/=k; stc*=k+1; return stc; } string Y(X.begin()+1,X.end()); ll y=stoll(Y); stc+=P(y,k); return stc; } //xまでで最大の数字がkであるパターン数。 ll PP(ll x,int k){ return P(x,k)-P(x,k-1); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t;cin>>t; debug(PP(60,1)); debug(P(60,1)); while(t--){ ll l,r;cin>>l>>r; ll ans=0; rep(i,1,10){ ans+=i*(PP(r,i)-PP(l-1,i)); } cout<