#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


constexpr int A[10] = {
  1, 0, 0, 0, 1,
  0, 1, 0, 2, 1,
};

int calc(int x) {
  int ret = 0;
  do {
    ret += A[x % 10];
    x /= 10;
  } while (x > 0);
  return ret;
}

constexpr int V = 20;
int F[V][V + 1];

int main() {
  for (int u = 0; u < V; ++u) {
    F[u][0] = u;
    for (int k = 1; k <= V; ++k) {
      F[u][k] = calc(F[u][k - 1]);
    }
// cerr<<u<<": ";pv(F[u],F[u]+V+1);
  }
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    int X, K;
    scanf("%d%d", &X, &K);
    
    int x = X;
    int k = K;
    for (; k > 0; ) {
      if (x < V) {
        if (k > V) {
          k = (V - 1) + (k - (V - 1)) % 2;
        }
        x = F[x][k];
        k = 0;
      } else {
        x = calc(x);
        --k;
      }
    }
    printf("%d\n", x);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}