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.

Ibrahim Nash | 77 |

Stark_Maverick | 68 |

wmlam | 54 |

Lam Ngoc Pham | 50 |

Micky_Kt | 48 |

Lam Ngoc Pham | 455 |

All Is Well | 399 |

Divvya Sinha | 374 |

Prateek Gole | 363 |

ioan | 319 |

akhayrutdinov | 3855 |

sanjay05 | 3366 |

Michael Riegger | 2023 |

Jasleen Kaur 2 | 2012 |

Quandray | 1965 |