Combinations 1#4836

Combinations 1

1 second
128 megabytes
Very easy

Given positive integers and , print all binary sequences of length that contain exactly ones in lexicographical order.

Input

Two positive integers and (n \ge 1, 0 \le k \le n).

Output

Print each binary sequence on a separate line. The digits in the sequence must be separated by a single space.

Examples

Example 1

Loading
Loading