Codeforces 410C.Team[构造]

C. Team

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Now it's time of Olympiads. Vanya and Egor decided to make his own team to take part in a programming Olympiad. They've been best friends ever since primary school and hopefully, that can somehow help them in teamwork.

For each team Olympiad, Vanya takes his play cards with numbers. He takes only the cards containing numbers 1 and 0. The boys are very superstitious. They think that they can do well at the Olympiad if they begin with laying all the cards in a row so that:

• there wouldn't be a pair of any side-adjacent cards with zeroes in a row;
• there wouldn't be a group of three consecutive cards containing numbers one.

Today Vanya brought n cards with zeroes and m cards with numbers one. The number of cards was so much that the friends do not know how to put all those cards in the described way. Help them find the required arrangement of the cards or else tell the guys that it is impossible to arrange cards in such a way.

Input

The first line contains two integers: n (1 ≤ n ≤ 106) — the number of cards containing number 0; m (1 ≤ m ≤ 106) — the number of cards containing number 1.

Output

In a single line print the required sequence of zeroes and ones without any spaces. If such sequence is impossible to obtain, print -1.

Examples

input

1 2

output

101

input

4 8

output

110110110101

input

4 10

output

11011011011011

input

1 5

output

-1

---

题意：构造一个序列0连续1个 1连续最多两个

---

先考虑无解，然后需要110，然后10，最后1收尾

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,l;
int main(int argc, const char * argv[]) {
    scanf("%d%d",&n,&m);
    if(n->m||*n<m-) {printf("-1");return ;}

    if(m==n-) printf(""),l=m;
    else if(m==n) l=m;
    else{
        int t=m-n-;
        for(int i=;i<=t;i++) printf(""),m-=,n--;
        l=min(m,n);
    }
    for(int i=;i<=l;i++) printf(""),n--,m--;
    while(m) printf(""),m--;
    return ;
}