56.5%

Given an input n, print Floyd's triangle with n lines.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n.

**Output:**

Print the Floyd's triangle with n lines.

**Constraints:**

1<=T<=10

1<=N<=20

**Example:**

**Input:**

2

4

5

**Output:**

1

2 3

4 5 6

7 8 9 10

1

2 3

4 5 6

7 8 9 10

11 12 13 14 15

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 |