You are given an array consisting of N integers. Now, you need to find the length of largest sub array of this array where first element of this sub array is ≥ than the last element of that sub array.
Let us consider a sub array from index i to j. You need to find the length of the maximum length sub array, such that A[i]≥A[j].
The first line contains a single integer T denoting the number of test cases in a single test file. Each test case is spread over 2 lines, in the following format :
The first line of each test case contains a single integer N denoting the size of the given array A. The next line contains N space separated integers, where the ith integer denotes A[i].
For each test case output answer in new line.
Example test case:
5 4 3 2 1
The max length sub array which can be chosen is from index 1 to 5.