#include <bits/stdc++.h>
using namespace std;
const long long SIZE = 2e5, INF = 1e9 * 1e9 + 10, INF2 = 1e9 + 100;
pair<long long, long long> tree[SIZE];
void upd(int v, int l, int r, int pos, int val) {
  if (l == r - 1) {
    tree[v].first += val;
  } else {
    int mid = (l + r) / 2;
    if (pos < mid) {
      upd(v * 2 + 1, l, mid, pos, val);
    } else {
      upd(v * 2 + 2, mid, r, pos, val);
    }
    pair<long long, long long> q1 = tree[v * 2 + 1], q2 = tree[v * 2 + 2];
    if (q1.first == q2.first) {
      tree[v] = {q1.first, q1.second + q2.second};
    } else {
      tree[v] = max(tree[v], tree[v * 2 + 1]);
    }
  }
}
long long n;
pair<long long, long long> get_mx(int v, int l, int r, int askl, int askr) {
  if (l >= askr || r <= askl) return {-INF, -INF};
  if (l >= askl && r <= askr) return tree[v];
  int mid = (l + r) / 2;
  pair<long long, long long> q1 = get_mx(v * 2 + 1, l, mid, askl, askr),
                             q2 = get_mx(v * 2 + 2, mid, r, askl, askr);
  if (q1.first == q2.first) {
    return {q1.first, q1.second + q2.second};
  } else {
    return max(tree[v], tree[v * 2 + 1]);
  }
}
map<long long, vector<long long>> m;
vector<long long> vec;
bool check(long long lnth) {
  bool ans = 0;
  for (int i = 0; i < n * 4; i++) tree[i] = {0, 1};
  for (int i = 0; i < lnth; i++) {
    upd(0, 0, n + 2, vec[i], 1);
  }
  pair<long long, long long> mx = get_mx(0, 0, n + 2, 0, n + 2);
  if (mx.second >= 2) return true;
  for (int i = lnth; i < n; i++) {
    upd(0, 0, n + 2, vec[i - lnth], -1);
    upd(0, 0, n + 2, vec[i], 1);
    pair<long long, long long> mx = get_mx(0, 0, n + 2, 0, n + 2);
    if (mx.second >= 2) return true;
  }
  return ans;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  ;
  long long k;
  cin >> n >> k;
  string s;
  if (k >= 17) {
    char mn = 250;
    for (auto cur : s) mn = min(mn, cur);
    for (int i = 0; i < n; i++) cout << mn;
  } else {
    cout << 2 / 0;
  }
  return 0;
}
