import sys,random
from itertools import permutations
from collections import deque

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def calc(prefix,upper):
    ans = 0

    n = len(prefix)
    m = len(upper)
    if n > m:
        return 0
    
    ans += (10**(m-n)-1)//9
    k = m-n

    a = int(prefix)
    b = int(upper[:len(prefix)])
    if a == b:
        ans += int(upper[len(prefix):]) + 1
    elif a < b:
        ans += 10**k

    return ans

def solve(N,K):
    ans = 0
    for i in range(len(K)):
        t = K[:i+1]
        for j in range(1,int(t[-1])+1):
            prefix = str(int(t)-j)
            if prefix == "0":
                continue
            ans += calc(prefix,N)
    ans += len(K)
    return ans

def brute(N,K):
    tmp = [str(i) for i in range(1,int(N)+1)]
    tmp.sort()
    return tmp.index(K) + 1

for _ in range(int(input())):
    N,K = input().split()
    print(solve(N,K))