Given a binary tree and a integer value K, the task is to find all nodes in given binary tree having K leaves in sub-tree rooted with them. If no node is found then print -1.
The first line of input contains an integer T denoting the no of test cases. First line of each test case consists of two integers N and K, denoting Number of Nodes in binary Tree and number of leaves in sub-tree rooted with them. Second line of each test case consists of the struct Node, which has a data part which stores the data, pointer to left child and pointer to right child.
For each test case print the respective output in each line.
1<=value of nodes<=100
Example(To be used only for expected output):
0 1 L 0 2 R
0 1 L 0 2 R 2 3 R 2 4 L