#include <bits/stdc++.h>
using namespace std;
void FAST_IO(string filein = "", string fileout = "") {
  if (fopen(filein.c_str(), "r")) {
    freopen(filein.c_str(), "r", stdin);
    freopen(fileout.c_str(), "w", stdout);
  }
  cin.tie(0), cout.tie(0)->sync_with_stdio(0);
}
void Why_Are_You_So_Orz();
signed main() {
  FAST_IO("mike4235orz.inp", "mike4235orz.out");
  int testcases = 1;
  cin >> testcases;
  for (int test = 1; test <= testcases; test++) Why_Are_You_So_Orz();
  return 0;
}
string n;
long long k;
void Why_Are_You_So_Orz() {
  cin >> n >> k;
  while (1) {
    set<char> s;
    for (auto c : n) s.insert(c);
    if (s.size() <= k) return cout << n << '\n', (void)0;
    s.clear();
    for (long long i = 0;; i++) {
      s.insert(n[i]);
      if (s.size() > k) {
        while (n[i] == '9') i--;
        n[i]++;
        for (long long j = i + 1; j < n.size(); j++) n[j] = '0';
        break;
      }
    }
  }
}

### Prompt

Please create a solution in cpp to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
void FAST_IO(string filein = "", string fileout = "") {
  if (fopen(filein.c_str(), "r")) {
    freopen(filein.c_str(), "r", stdin);
    freopen(fileout.c_str(), "w", stdout);
  }
  cin.tie(0), cout.tie(0)->sync_with_stdio(0);
}
void Why_Are_You_So_Orz();
signed main() {
  FAST_IO("mike4235orz.inp", "mike4235orz.out");
  int testcases = 1;
  cin >> testcases;
  for (int test = 1; test <= testcases; test++) Why_Are_You_So_Orz();
  return 0;
}
string n;
long long k;
void Why_Are_You_So_Orz() {
  cin >> n >> k;
  while (1) {
    set<char> s;
    for (auto c : n) s.insert(c);
    if (s.size() <= k) return cout << n << '\n', (void)0;
    s.clear();
    for (long long i = 0;; i++) {
      s.insert(n[i]);
      if (s.size() > k) {
        while (n[i] == '9') i--;
        n[i]++;
        for (long long j = i + 1; j < n.size(); j++) n[j] = '0';
        break;
      }
    }
  }
}

```