#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

i64 testcase(){
    i64 N, K; cin >> N >> K;
    // most significant digit of K
    i64 msd = 1; while(msd <= K/10) msd *= 10;
    
    auto times10andmin = [](i64 a, i64 bound) -> i64 {
        if(a >= bound/10+1) return bound;
        return min(a * 10, bound);
    };
    
    i64 ans = 0;
    {
        // msd increasing
        i64 kmsd = msd;
        i64 k = K;
        while(kmsd <= N){
            ans += min(k, N+1) - kmsd;
            kmsd = times10andmin(kmsd, N+1);
            k = times10andmin(k, N+1);
        }
    }
    {
        // msd decreasing
        i64 kmsd = msd;
        i64 k = K;
        while(true){
            kmsd /= 10;
            k /= 10;
            if(kmsd == 0) break;
            if(kmsd <= N){
                ans += min(k, N) + 1 - kmsd;
            }
        }
    }
    // K itself
    return ans + 1;
}

int main(){
    int T; cin >> T;
    rep(t, T) cout << testcase() << '\n';
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;