#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;

#define LOG(f...) fprintf(stderr, f)

char s[25], t[25];

bool DFS(int i, int ncar, int n9) {
  if (i < 0) return ncar == 0;
  if (ncar < 0 || i + 1 + n9 < ncar) return false;
  for (t[i] = 0; t[i] <= 9; ++t[i]) {
    // LOG("DFS %d %d %d => %d (s %d)\n", i, ncar, n9, t[i], s[i]);
    int dig = s[i] + t[i];
    int ncar_ = ncar - (dig > 9 ? n9 + 1 : 0);
    dig %= 10;
    int n9_ = dig == 9 ? n9 + 1 : 0;
    if (DFS(i - 1, ncar_, n9_)) return true;
  }
  return false;
}

int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    memset(s, 0, sizeof(s)); memset(t, 0, sizeof(t));
    int req;
    scanf("%s%d", s, &req);
    int len = strlen(s);
    reverse(s, s + len);
    for (int i = 0; i < len; ++i)
      s[i] -= '0';
    if (req == 0) {
      for (int i = 0; i < len + 1; ++i)
        if (s[i] != 9) {
          putchar('1');
          for (int j = 0; j < i; ++j)
            putchar('0');
          break;
        }
      putchar('\n');
      continue;
    }
    DFS(24, req, 0);
    int lent = 0;
    for (int i = 0; i < 25; ++i)
      if (t[i]) lent = i + 1;
    // for (int i = 0; i < 25; ++i)
    //   printf("%d ", int(t[i]));
    // puts("");
    reverse(t, t + lent);
    for (int i = 0; i < lent; ++i)
      t[i] += '0', putchar(t[i]);
    putchar('\n');
  }
}