# K-partitions

easy

1. You are given two integers n and k, where n represents number of elements and k represents number of subsets. 2. You have to partition n elements in k subsets and print all such configurations. Note -> Check out the question video and write the recursive code as it is intended without changing signature. The judge can't force you but intends you to teach a concept.

## Constraints

1 <= n <= 10 1 <= k <= 10

## Format

### Input

A number n A number k

### Output

Check the sample ouput and question video.

## Example

Sample Input

3
2

### Sample Output

1. [1, 2] [3]
2. [1, 3] [2]
3. [1] [2, 3]

Question Video