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 java.util.*;
  import java.io.*;
  public class F1 {
      static class Scan {
          private byte[] buf=new byte[1024];
          private int index;
          private InputStream in;
          private int total;
          public Scan()
          {
              in=System.in;
          }
          public int scan()throws IOException
          {
              if(total<0)
              throw new InputMismatchException();
              if(index>=total)
              {
                  index=0;
                  total=in.read(buf);
                  if(total<=0)
                  return -1;
              }
              return buf[index++];
          }
          public int scanInt()throws IOException
          {
              int integer=0;
              int n=scan();
              while(isWhiteSpace(n))
              n=scan();
              int neg=1;
              if(n=='-')
              {
                  neg=-1;
                  n=scan();
              }
              while(!isWhiteSpace(n))
              {
                  if(n>='0'&&n<='9')
                  {
                      integer*=10;
                      integer+=n-'0';
                      n=scan();
                  }
                  else throw new InputMismatchException();
              }
              return neg*integer;
          }
          public double scanDouble()throws IOException
          {
              double doub=0;
              int n=scan();
              while(isWhiteSpace(n))
              n=scan();
              int neg=1;
              if(n=='-')
              {
                  neg=-1;
                  n=scan();
              }
              while(!isWhiteSpace(n)&&n!='.')
              {
                  if(n>='0'&&n<='9')
                  {
                      doub*=10;
                      doub+=n-'0';
                      n=scan();
                  }
                  else throw new InputMismatchException();
              }
              if(n=='.')
              {
                  n=scan();
                  double temp=1;
                  while(!isWhiteSpace(n))
                  {
                      if(n>='0'&&n<='9')
                      {
                          temp/=10;
                          doub+=(n-'0')*temp;
                          n=scan();
                      }
                      else throw new InputMismatchException();
                  }
              }
              return doub*neg;
          }
          public String scanString()throws IOException
          {
              StringBuilder sb=new StringBuilder();
              int n=scan();
              while(isWhiteSpace(n))
              n=scan();
              while(!isWhiteSpace(n))
              {
                  sb.append((char)n);
                  n=scan();
              }
              return sb.toString();
          }
          private boolean isWhiteSpace(int n)
          {
              if(n==' '||n=='\n'||n=='\r'||n=='\t'||n==-1)
              return true;
              return false;
          }
      }
      
      public static void sort(int arr[],int l,int r) {    //sort(arr,0,n-1);
          if(l==r) {
              return;
          }
          int mid=(l+r)/2;
          sort(arr,l,mid);
          sort(arr,mid+1,r);
          merge(arr,l,mid,mid+1,r);
      }
      public static void merge(int arr[],int l1,int r1,int l2,int r2) {
          int tmp[]=new int[r2-l1+1];
          int indx1=l1,indx2=l2;
          //sorting the two halves using a tmp array
          for(int i=0;i<tmp.length;i++) {
              if(indx1>r1) {
                  tmp[i]=arr[indx2];
                  indx2++;
                  continue;
              }
              if(indx2>r2) {
                  tmp[i]=arr[indx1];
                  indx1++;
                  continue;
              }
              if(arr[indx1]<arr[indx2]) {
                  tmp[i]=arr[indx1];
                  indx1++;
                  continue;
              }
              tmp[i]=arr[indx2];
              indx2++;
          }
          //Copying the elements of tmp into the main array
          for(int i=0,j=l1;i<tmp.length;i++,j++) {
              arr[j]=tmp[i];
          }
      }
      
      public static void sort(long arr[],int l,int r) {    //sort(arr,0,n-1);
          if(l==r) {
              return;
          }
          int mid=(l+r)/2;
          sort(arr,l,mid);
          sort(arr,mid+1,r);
          merge(arr,l,mid,mid+1,r);
      }
      public static void merge(long arr[],int l1,int r1,int l2,int r2) {
          long tmp[]=new long[r2-l1+1];
          int indx1=l1,indx2=l2;
          //sorting the two halves using a tmp array
          for(int i=0;i<tmp.length;i++) {
              if(indx1>r1) {
                  tmp[i]=arr[indx2];
                  indx2++;
                  continue;
              }
              if(indx2>r2) {
                  tmp[i]=arr[indx1];
                  indx1++;
                  continue;
              }
              if(arr[indx1]<arr[indx2]) {
                  tmp[i]=arr[indx1];
                  indx1++;
                  continue;
              }
              tmp[i]=arr[indx2];
              indx2++;
          }
          //Copying the elements of tmp into the main array
          for(int i=0,j=l1;i<tmp.length;i++,j++) {
              arr[j]=tmp[i];
          }
      }
      
      static TreeSet<Integer> ts1,ts2;
      
      public static void main(String args[]) throws IOException {
          Scan input=new Scan();
          StringBuilder ans=new StringBuilder("");
          
          ts1=new TreeSet<>();
          ts2=new TreeSet<>();
          for(int i=0;i<10;i++) {
              for(int j=0;j<10;j++) {
                  per(i,j,0);
              }
          }
          
          int test=input.scanInt();
          for(int tt=1;tt<=test;tt++) {
              int n=input.scanInt();
              int k=input.scanInt();
              if(k==1) {
                  if(ts1.contains(n)) {
                      ans.append(n+"\n");
                      continue;
                  }
                  ans.append(ts1.higher(n)+"\n");
                  continue;
              }
              if(ts2.contains(n)) {
                  ans.append(n+"\n");
                  continue;
              }
              ans.append(ts2.higher(n)+"\n");
          }
          System.out.println(ans);
      }
      
      public static void per(int a,int b,long val) {
          if(val>Integer.MAX_VALUE) {
              return;
          }
          if(val!=0) {
              if(a==b) {
                  ts1.add((int)val);
              }
              ts2.add((int)val);
          }
          if(a!=0 || val!=0) {
              per(a,b,(val*10)+a);
          }
          if(b!=0 || val!=0) {
              per(a,b,(val*10)+b);
          }
      }
  }
  