#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
const ll inf = (1e18);
const ll mod = 1000000007;
const vector<int> dy = {-1, 0, 1, 0}, dx = {0, -1, 0, 1};
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll c, ll d) { return c / GCD(c, d) * d; }
struct __INIT {
  __INIT() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
  }
} __init;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
void debag(const vector<T> &a) {
  cerr << "debag :";
  for (auto v : a) cerr << v << " ";
  cerr << "\n";
}
template <class T>
void print(const vector<T> &a) {
  for (auto v : a) cout << v << " ";
  cout << "\n";
}
void solve() {
  ll n, k;
  cin >> n >> k;
  if (n == k) {
    cout << string(n, '1') << "\n";
    return;
  }
  if (k == 1) {
    cout << '1' << string(n - 1, '0') << "\n";
    return;
  }
  string res = {};
  if (k - 2 <= (n - k) / 2) {
    n -= k;
    k -= 2;
    res.push_back('0');
    for (int i = 0; i < k; i++) res.push_back('1');
    res.push_back('0');
    cout << string(n / 2, '1') << res << string(n / 2, '1') << "\n";
  } else if (0) {
    int v = (n - k) / 2;
    res += string(v, '1');
    res.push_back('0');
    res += string(v, '1');
    res.push_back('0');
    res += string(v, '1');
    int cnt = 0;
    string f = {};
    while (1) {
      if (int(f.size()) + int(res.size()) >= n) break;
      if (cnt == 0) {
        f.push_back('0');
        res.push_back('0');
      } else {
        f.push_back('1');
        res.push_back('1');
      }
      cnt++;
      if (cnt > v) cnt = 0;
    }
    if (int(f.size()) + int(res.size()) > n) res.pop_back();
    cout << f << res << "\n";
    f += res;
    res = f;
  } else {
    int v = (n - k) / 2;
    res += string(v, '1');
    res.push_back('0');
    res += string(v, '1');
    res.push_back('0');
    res += string(v, '1');
    int cnt = 0;
    string f = "0";
    while (1) {
      if (int(f.size()) + int(res.size()) >= n) break;
      if (cnt == 0) {
        res.push_back('0');
      } else {
        res.push_back('1');
      }
      cnt++;
      if (cnt > v) cnt = 0;
    }
    if (int(f.size()) + int(res.size()) > n) res.pop_back();
    cout << f << res << "\n";
    f += res;
    res = f;
  }
}
int main() {
  int t = 1;
  while (t--) solve();
}
