You are given an integer n. You have to apply m operations to it.

In a single operation, you must replace every digit d of the number with the decimal representation of integer d + 1. For example, 1912 becomes 21023 after applying the operation once.

You have to find the length of n after applying m operations. Since the answer can be very large, print it modulo 10^9+7.

Input

The first line contains a single integer t (1 ≤ t ≤ 2 ⋅ 10^5) — the number of test cases.

The only line of each test case contains two integers n (1 ≤ n ≤ 10^9) and m (1 ≤ m ≤ 2 ⋅ 10^5) — the initial number and the number of operations. 

Output

For each test case output the length of the resulting number modulo 10^9+7.

Example

Input


5
1912 1
5 6
999 1
88 2
12 100


Output


5
2
6
4
2115

Note

For the first test, 1912 becomes 21023 after 1 operation which is of length 5.

For the second test, 5 becomes 21 after 6 operations which is of length 2.

For the third test, 999 becomes 101010 after 1 operation which is of length 6.

For the fourth test, 88 becomes 1010 after 2 operations which is of length 4.
import sys
input = sys.stdin.readline

M = 10 ** 9 + 7

dp = [[0, 0] for i in range(200001)]
for i in range(200001):
  if i < 10:
    dp[i][0] = 1
    dp[i][1] = 1
    if i == 9:
      dp[i][1] = dp[1][1] + dp[1][0]
  else:
    dp[i][0] = (dp[i - 10][1] + dp[i - 10][0]) % M
    dp[i][1] = (dp[i - 9][1] + dp[i - 9][0]) % M

def solve(n, m):
  s = list(str(n))
  z = 0
  for i in range(len(s)):
    x = int(s[i])
    if x + m < 10:
      z += 1
    else:
      z += dp[m - (10 - x)][1] + dp[m - (10 - x)][0]
  return str(z % M)

t = int(input())
o = []
while t > 0:
  n, m = map(int, input().split())
  o.append(solve(n, m))
  t -= 1
print('\n'.join(o))
