F

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#include <map>
#include <cmath>
#include <vector>

#define Faster ios::sync_with_stdio(false),cin.tie(0)
#define Read freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define Close fclose(stdin),fclose(stdout)
const int maxn = 1e4 + 5;
using namespace std;
const int MOD = 1e9+7;
typedef long long ll;

ll dp[20][20][2000];
int a[20];

ll dfs(int pos, int cut, int sum, bool limit){
    if (pos == -1) return sum?0:1;    //sum为0的时候说明是平衡的
    if (sum < 0) return 0;    //sum < 0 就肯定不平衡了返回0
    if(!limit && dp[pos][cut][sum] != -1)
        return dp[pos][cut][sum];
    int up = limit?a[pos]:9;
    ll ans = 0;
    for(int i = 0; i <= up;i++){
        ans += dfs(pos-1, cut, sum + (pos-cut)*i, limit && a[pos] == i);
    }
    if(!limit)
        dp[pos][cut][sum] = ans;
    return ans;
}

ll solve(ll x){
    int pos = 0;
    while(x){
        a[pos++] = x%10;
        x /= 10;
    }
    ll ans = 0;
    for(int i = 0;i < pos;i++){
        ans += dfs(pos-1, i, 0, true);
    }
    return ans - pos + 1;
    //因为0多加了(pos - 1)次
}

int main(){
    Faster;
    int t;
    cin >> t;
    memset(dp, -1, sizeof(dp));
    while(t--){
        ll l, r;
        cin >> l >> r;
        ll ans = solve(r) - solve(l-1);
        cout << ans << endl;
    }
    return 0;
}