#include <bits/stdc++.h>
using namespace std;
using Int = long long;
constexpr static int mod = 1e9 + 7;
constexpr static int inf = (1 << 30) - 1;
constexpr static Int infll = (1LL << 61) - 1;
int Competitive_Programming =
    (ios_base::sync_with_stdio(false), cin.tie(nullptr),
     cout << fixed << setprecision(15), 0);
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
int main() {
  int N, K;
  cin >> N >> K;
  if (N % 2 == 1 and K == 1) {
    cout << 1;
    for (int i = 1; i < N; i++) {
      cout << 0;
    }
    cout << '\n';
    return 0;
  }
  string ans = "";
  int L = (N - K) / 2;
  while (ans.size() < N) {
    ans.push_back('1');
    for (int i = 0; i < L and ans.size() < N; i++) {
      ans.push_back('0');
    }
  }
  cout << ans << "\n";
}
