#include <iostream>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <algorithm>

#define int long long
#define pb push_back

using namespace std;

void permutation(vector<int>& v, int n, int k, int countNull, int needNull) {
    if (n == 0) {
        if (countNull == needNull) {
            for (auto i : v) {
                cout << i;
            }
            cout << '\n';
        }
        return;
    }
    for (int i = 0; i <= 1; i++) {
        if (countNull == needNull) {
            v.push_back(1);
            permutation(v, n - 1, k, countNull, needNull);
            v.pop_back();
            break;
        }
        if (i == 0) {
            countNull++;
        }
        v.push_back(i);
        permutation(v, n - 1, k, countNull, needNull);
        v.pop_back();
        countNull--;
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> v;
    int countNull = 0;
    int needNull = n - k;
    permutation(v, n, k, countNull, needNull);
}