#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cassert>
#include <string>
#include <cstring>
#include <bitset>
#include <random>
#include <chrono>
#include <iomanip>
#pragma GCC optimize ("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#define FOR(i, a, b) for(int i = a; i < (int) b; i++)
#define F0R(i, a) FOR (i, 0, a)
#define ROF(i, a, b) for(int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
#define rsz resize
#define eb emplace_back
#define pb push_back
#define sz(x) (int) x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef vector<pi64> vpi64;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};
i64 dp [20][10];
vi lim;
i64 solve (int p, int sum, bool tight) {
if (p < 0) return (sum);
if (tight && ~dp[p][sum]) return dp[p][sum];
i64 res = 0;
for (int i = 0; i <= (tight ? 9 : lim[p]); i++) {
int nxt = sum * 10 + i;
if ((nxt % 9) == 0 && nxt >= 9) nxt = 9;
else nxt %= 9;
res += solve (p - 1, nxt, tight | (i < lim[p]));
}
return (tight ? dp[p][sum] = res : res);
}
i64 get_solve (i64 n) {
lim.clear();
while (n) {
lim.eb(n % 10);
n /= 10;
}
return solve ( sz(lim) - 1, 0, 0);
}
int main () {
ios::sync_with_stdio(0);
cin.tie(0);
int q;
cin >> q;
memset (dp, -1, sizeof(dp));
while (q--) {
i64 lo, hi;
cin >> lo >> hi;
cout << get_solve (hi) - get_solve (lo - 1) << '\n';
}
return 0;
}
