Given **N**, print all **N** digit numbers in increasing order, such that their digits are in strictly increasing order(from left to right).

**Input:**

First line of input contains **T** denoting number of test cases. Only line of each test case contains one integers** N, **as described above.

**Output:**

For each test case output a single line containing all the possible numbers as described above(Numbers should be space separated).

**Constraints:**

1<= T <= 9

1<= N <= 9

**Example:
Input:**

1

2

**Output:**

12 13 14…89

**Explanation:**

For N=2, the correct sequence is 12 13 14 15 16 17 18 19 23 24 and so on up to 89.

Author: tanujyadav97

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

geetyadav | 82 |

yashrana1 | 74 |

AdityaRaj9 | 73 |

abuexshaitan | 56 |

Shashi Bhushan | 52 |

abducodes | 837 |

harshtyagi36 | 399 |

sandipbhaumik | 321 |

Akhil varma | 314 |

vamsikrishna55 | 304 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4567 |

Login to report an issue on this page.