Given positive integers and , print all binary sequences of length that contain exactly ones in lexicographical order.
Two positive integers and (n \ge 1, 0 \le k \le n).
Print each binary sequence on a separate line. The digits in the sequence must be separated by a single space.
Example 1