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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

void solve(){
	__int128 n, k;
	ll tn, tk; cin >> tn >> tk;
	n = tn;
	k = tk;
	vector<int> s, t;
	__int128 nn = n;
	while(nn > 0){
		s.push_back(nn % 10);
		nn /= 10;
	}
	while(k > 0){
		t.push_back(k % 10);
		k /= 10;
	}
	reverse(s.begin(), s.end());
	reverse(t.begin(), t.end());
	int l = t.size();
	while(t.size() < s.size()){
		t.push_back(0);
	}
	int m = s.size();
	__int128 nw = 0;
	__int128 tmp = 0;
	__int128 rr = 0;
	rep(i,1,m){
		nw *= 10;
		nw += t[i-1];
		if (i <= l){
			tmp += nw;
		}else{
			tmp += nw-1;
		}
		tmp -= rr;
		//cout << (ll)tmp << '\n';
		rr *= 10;
		rr += 9;
	}
	nw *= 10;
	nw += t[m-1];
	if (m <= l){
		tmp += nw;
	}else{
		tmp += min(n, nw-1);
	}
	tmp -= rr;
	cout << (ll)tmp << '\n';
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t; cin >> t;
	while(t--) solve();
}