#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#define EACH(value, var) for (auto value : var)
#define SORT(var) sort(var.begin(), var.end())
#define REVERSE(var) reverse(var.begin(), var.end())
#define RSORT(var) \
  SORT(var);       \
  REVERSE(var)
#define OPTIMIZE_STDIO         \
  ios::sync_with_stdio(false); \
  cin.tie(0);                  \
  cout.precision(10);          \
  cout << fixed
#define endl '\n'

const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;

void solve(istream& cin, ostream& cout) {
  int t;
  cin >> t;
  REP(i, t) {
    int n;
    cin >> n;
    vector<string> s(3);
    REP(i, 3) {
      cin >> s[i];
    }
    string ans(2 * n + 1, ' ');
    REP(i, n) {
      ans[i] = '0';
      ans[i + n] = '1';
    }
    ans[2 * n] = '0';
    cout << ans << endl;
  }
}

#ifndef TEST
int main() {
  OPTIMIZE_STDIO;
  solve(cin, cout);
  return 0;
}
#endif

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t; long long N; cin >> t >> N;
    set<int> S;
    for (int i = 1; i <= 100; i++) {
        S.emplace(((100 + t) * i) / 100);
    }
    int M = 100 + t;
    vector<int> V;
    for (int i = 1; i <= M; i++) {
        if (!S.count(i)) V.emplace_back(i);
    }
    N--;
    long long x = N / V.size();
    long long y = N % V.size();
    cout << x * M + V[y] << "\n";
    return 0;
}