Posted: 12 Nov, 2020
Difficulty: Easy

## PROBLEM STATEMENT

#### The digits are stored such that the most significant digit is at the starting of the array and the least significant digit is at the end of the array.

##### For Example
``````If the given array is {1,5,2}, the returned array should be {1,5,3}.
``````
##### Note
``````Input array can contain leading zeros, but the output array should not contain any leading zeros (even if the input array contains leading zeroes).
For Example:
If the given array is {0,2}, the returned array should be {3}.
``````
##### Input Format
``````The first line of input contains a single integer T, representing the number of test cases or queries to be run.

The first line of each test case contains a positive integer N, which represents the number of digits in the given number/array.

The next line contains 'N' single space-separated positive integers representing the elements of the array.
``````
##### Output Format
``````For each test case, print the final number.

Print the output of each test case in a separate line.
``````
##### Note
``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````
##### Constraints
``````1 <= T <= 10
1 <= N <= 5 * 10^4
0 <= Arr[i] <= 9

Where Arr[i] is the i-th digit in the number.
``````