Given a Binary Tree and a number k. Print all nodes that are at distance k from root (root is considered at distance 0 from itself). Nodes should be printed from left to right. If k is more that height of tree, nothing should be printed.

For example, if below is given tree and k is 2. Output should be 4 5 6.

1

/ \

2 3

/ / \

4 5 6

\

8

**Input:**

The task is to complete the method which takes two arguments, root of Binary Tree and k. The struct Node has a data part which stores the data, pointer to left child and pointer to right child.

There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should print nodes at k distance from root. Nodes should be printed from left to right.

**Constraints:**

1 <=T<= 30

1 <= Number of nodes<= 100

1 <= Data of a node<= 1000

**Example:
Input:**

2

2 0

1 2 R 1 3 L

4 2

10 20 L 10 30 R 20 40 L 20 60 R

**Output:**

1

40 60

There are two test casess. First case represents a tree with 3 nodes, 2 edges and value of k as 0. Here root is 1, left child of 1 is 3 and right child of 1 is 2. Second test case represents a tree with 4 edges and 5 nodes and k as 1.

**Note:**The **Input/Ouput** format and **Example** given above are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is a function problem, hence a user should not read any input from stdin/console, and should not print anything on stdout/console. The task is to complete the function specified, and not to write the full code.

All Is Well | 138 |

ioan | 123 |

praveen2809 | 106 |

Diplav Srivastava | 100 |

user2100 | 90 |

Lam Ngoc Pham | 405 |

Divvya Sinha | 352 |

All Is Well | 327 |

skull tone | 310 |

KM SUNITA | 301 |

akhayrutdinov | 3792 |

sanjay05 | 3366 |

Jasleen Kaur 2 | 2012 |

Michael Riegger | 1996 |

Quandray | 1923 |