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

using ll = long long;

ll solve2(ll n) {
	string s = to_string(n);
    int m = s.size();
    ll ans = 0;
    for (int d=1; d<=9; d++) {
        ll p = 1;
        for (int i=0; i<m-1; i++) p *= d;
        ll cnt = 0;
        for (int i=0; i<m; i++) {
            int c = s[i] - '0';
            cnt += min(c, d) * p;
            if (d <= c) {
            	cnt--;
            	break;
            }
            if (i+1 < n) p /= d;
        }
        cnt++;
        ans += n - cnt + 1;
    }
    return ans;
}

void solve() {
	ll l, r; cin >> l >> r;
	cout << solve2(r) - solve2(l-1) << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	int T; cin >> T;
	while (T--) solve();
}