description: It is a simplified version of problem F2. The difference between them is the constraints (F1: k ≤ 2, F2: k ≤ 10).
  
  You are given an integer n. Find the minimum integer x such that x ≥ n and the number x is k-beautiful.
  
  A number is called k-beautiful if its decimal representation having no leading zeroes contains no more than k different digits. E.g. if k = 2, the numbers 3434443, 55550, 777 and 21 are k-beautiful whereas the numbers 120, 445435 and 998244353 are not.
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.
  
  Each test case consists of one line containing two integers n and k (1 ≤ n ≤ 10^9, 1 ≤ k ≤ 2).
  
  Output
  
  For each test case output on a separate line x — the minimum k-beautiful integer such that x ≥ n.
  
  Example
  
  Input
  
  
  4
  1 1
  221 2
  177890 2
  998244353 1
  
  
  Output
  
  
  1
  221
  181111
  999999999
solution: import sys
  
  from itertools import product 
  
  from bisect import bisect_left as bisect
  
  input = sys.stdin.readline
  
  def main():
  
  	os = [1, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111]
  
  	def tonum(ar):
  		ans = 0
  		for x in ar:
  			ans *= 10
  			ans += int(x)
  
  		return ans
  
  	t = int(input())
  	#t = 1
  
  	twos = []
  
  	for i in range(10):
  		for j in range(i+1, 10):
  			for l in range(10):
  				for mask in range(1 << l):
  					q = 0
  					for b in range(l):
  						if (mask >> b) & 1:
  							q *= 10
  							q += i
  						else:
  							q *= 10
  							q += j
  					twos.append(q)
  
  	twos.sort()
  
  	for _ in range(t):
  		n, k = input().split()
  
  		k = int(k)
  
  		l = len(n)
  
  		if k == 1:
  			o = os[l-1]
  
  			nn = tonum(n)
  
  			for i in range(1, 10):
  				#print(o*i)
  				if o*i >= nn:
  					print(o*i)
  					break
  
  			continue
  
  		if l == 10:
  			print(1000000000)
  			continue
  
  
  		if k == 2 and l == 1:
  			print(n)
  			continue
  
  		nn = tonum(n)
  
  		print(twos[bisect(twos, nn)])
  
  
  	
  
  main()