#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <queue>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 998244353;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int t;
  cin >> t;
  vector<ll> m(t);
  vector<vector<ll>> d(t, vector<ll>(9));
  for (int i = 0; i < t; i++) {
    cin >> m[i];
    for (auto &dn: d[i]) cin >> dn;
  }

  vector<ll> ans;
  for (int i = 0; i < t; i++) {
    ll mult_1e9 = 0;
    for (int j = 0; j < 9; j++) {
      for (int k = 0; k < d[i][j]; k++) {
        mult_1e9 = mult_1e9 * 10 + (j + 1);
      }
    }
    ll ans_hi = mult_1e9 * 1000000000LL;
    ll ans_lo = (m[i] - ans_hi % m[i]) % 1000000000LL;
    if (ans_hi + ans_lo == 0) ans_lo = m[i];
    ans.push_back(ans_hi + ans_lo);
  }

  for (auto &x: ans) cout << x << endl;

  return 0;
}