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 bisect
  l,c=[],"0123456789"
  for i in c:
  	for j in c:
  		z=[i,j]
  		for k in z:
  			z+=[k+i,k+j]
  			if len(k)>10:break
  		l+=z
  l,x,y={*l},[],[]
  for i in l:
      if len({*i})==1:x+=[i]
      else:y+=[i]
  x,y=sorted(map(int,x)),sorted(map(int,y))
  for _ in[*open(0)][1:]:
      n,k=map(int,_.split())
      print(n if len({*str(n)})<=k else x[bisect.bisect(x,n)]if k==1else y[bisect.bisect(y,n)])