Number Pattern Generation

Ninja enjoys arranging numbers and wishes to organize them into N rows. The first row should have 1 number, the second row 2 numbers, the third row 3 numbers, and so forth, continuing sequentially.

Ninja begins filling numbers in ascending order from 1 onward. Upon reaching 9, the sequence restarts from 1.

Example:

Input:

N = 4

Output:

 1 
 23 
 456 
7891

Constraints:

• 1 <= T <= 10
• 1 <= N <= 500
• Time Limit: 1 sec

Note:

You do not need to print the output; the task is to implement the function to produce the desired pattern.