[Solution] Creep Codeforces Solution

[Solution] Creep Codeforces Solution 

Define the score of some binary string T$T$ as the absolute difference between the number of zeroes and ones in it. (for example, T=$T=$ 010001 contains 4$4$ zeroes and 2$2$ ones, so the score of T$T$ is |4−2|=2$|4-2|=2$).

Define the creepiness of some binary string S$S$ as the maximum score among all of its prefixes (for example, the creepiness of S=$S=$ 01001 is equal to 2$2$ because the score of the prefix S[1…4]$S[1\dots 4]$ is 2$2$ and the rest of the prefixes have a score of 2$2$ or less).

Solution Click Below:-  CLICK HERE

Given two integers a$a$ and b$b$, construct a binary string consisting of a$a$ zeroes and b$b$ ones with the minimum possible creepiness.

Input

The first line contains a single integer t$t$ (1≤t≤1000)$(1\le t\le 1000)$  — the number of test cases. The description of the test cases follows.

Creep Codeforces Solution

Paranoid String Codeforces Solution

Directional Increase Codeforces Solution

Fake Plastic Trees Codeforces Solution

Keshi in Search of AmShZ Codeforces Solution

Decinc Dividing Codeforces Solution

The only line of each test case contains two integers a$a$ and b$b$ (1≤a,b≤100$1\le a,b\le 100$)  — the numbers of zeroes and ones correspondingly.

Output

For each test case, print a binary string consisting of a$a$ zeroes and b$b$ ones with the minimum possible creepiness. If there are multiple answers, print any of them.