#include #define MOD 1000000007 #define INF 0x3f3f3f3f #define INFL 0x3f3f3f3f3f3f3f3f #define EPS (1e-10) #define rep(i,n)for(int i=0;i<(n);i++) using namespace std; typedef long long ll; typedef pairP; int a[20171]; int main() { int n, k; cin >> n >> k; rep(i, n)a[i] = i & 1; int p = 0; while (k) { if (k >= 2 && p + 1 < n) { a[p + 1] = !a[p + 1]; k -= 2; p += 2; } else { if (p >= n) { puts("-1"); return 0; } a[p] = !a[p]; k--; p += 2; } } rep(i, n)cout << a[i] << endl; }