Description

For a binary string of length $3$, each digit can be either $0$ or $1$, resulting in a total of $8$ possibilities. The first few are:

000
001
010
……

Please output these $8$ binary strings in ascending order.

Input Format

None.

Output Format

Output $8$ lines, each containing a binary string of length $3$ in ascending order.

Sample

None

000
001
010
011
100
101
110
111