Try guessing the statement from this picture <http://tiny.cc/ogyoiz>.

You are given two integers A and B, calculate the number of pairs (a, b) such that 1 ≤ a ≤ A, 1 ≤ b ≤ B, and the equation a ⋅ b + a + b = conc(a, b) is true; conc(a, b) is the concatenation of a and b (for example, conc(12, 23) = 1223, conc(100, 11) = 10011). a and b should not contain leading zeroes.

Input

The first line contains t (1 ≤ t ≤ 100) — the number of test cases.

Each test case contains two integers A and B (1 ≤ A, B ≤ 10^9).

Output

Print one integer — the number of pairs (a, b) such that 1 ≤ a ≤ A, 1 ≤ b ≤ B, and the equation a ⋅ b + a + b = conc(a, b) is true.

Example

Input


3
1 11
4 2
191 31415926


Output


1
0
1337

Note

There is only one suitable pair in the first test case: a = 1, b = 9 (1 + 9 + 1 ⋅ 9 = 19).
def getNum(a,b):
	s1=str(a)
	s2=str(b)
	s=s1+s2
	num=int(s)
	return num

t=int(input())

for _ in range(t):

	A,B=map(int,input().split(" "))
	
	count=0

	stb=str(B)
	n=len(stb)
	if ('9'*n==stb):
		print(A*n)
	else:		
		print(A*(n-1))

	'''for i in range(1,A+1):
		for j in range(1,B+1):
			if ((i+j+i*j)==getNum(i,j)):
				count+=1
				#print("i = ",i)
				#print("j = ",j," /// ")'''
	#print("count = ",count)

