It is the easy version of the problem. The only difference is that in this version n = 1.

In the cinema seats can be represented as the table with n rows and m columns. The rows are numbered with integers from 1 to n. The seats in each row are numbered with consecutive integers from left to right: in the k-th row from m (k - 1) + 1 to m k for all rows 1 ≤ k ≤ n.

1| 2| ⋅⋅⋅| m - 1| m  
---|---|---|---|---  
m + 1| m + 2| ⋅⋅⋅| 2 m - 1| 2 m  
2m + 1| 2m + 2| ⋅⋅⋅| 3 m - 1| 3 m  
\vdots| \vdots| \ddots| \vdots| \vdots  
m (n - 1) + 1| m (n - 1) + 2| ⋅⋅⋅| n m - 1| n m  
The table with seats indices

There are nm people who want to go to the cinema to watch a new film. They are numbered with integers from 1 to nm. You should give exactly one seat to each person.

It is known, that in this cinema as lower seat index you have as better you can see everything happening on the screen. i-th person has the level of sight a_i. Let's define s_i as the seat index, that will be given to i-th person. You want to give better places for people with lower sight levels, so for any two people i, j such that a_i < a_j it should be satisfied that s_i < s_j.

After you will give seats to all people they will start coming to their seats. In the order from 1 to nm, each person will enter the hall and sit in their seat. To get to their place, the person will go to their seat's row and start moving from the first seat in this row to theirs from left to right. While moving some places will be free, some will be occupied with people already seated. The inconvenience of the person is equal to the number of occupied seats he or she will go through.

Let's consider an example: m = 5, the person has the seat 4 in the first row, the seats 1, 3, 5 in the first row are already occupied, the seats 2 and 4 are free. The inconvenience of this person will be 2, because he will go through occupied seats 1 and 3.

Find the minimal total inconvenience (the sum of inconveniences of all people), that is possible to have by giving places for all people (all conditions should be satisfied).

Input

The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. Description of the test cases follows.

The first line of each test case contains two integers n and m (n = 1, 1 ≤ m ≤ 300) — the number of rows and places in each row respectively.

The second line of each test case contains n ⋅ m integers a_1, a_2, …, a_{n ⋅ m} (1 ≤ a_i ≤ 10^9), where a_i is the sight level of i-th person.

It's guaranteed that the sum of n ⋅ m over all test cases does not exceed 10^5.

Output

For each test case print a single integer — the minimal total inconvenience that can be achieved.

Example

Input


4
1 3
1 2 3
1 5
2 1 5 3 3
1 2
2 1
1 6
2 3 2 1 1 1


Output


3
6
0
1

Note

In the first test case, there is a single way to arrange people, because all sight levels are distinct. The first person will sit on the first seat, the second person will sit on the second place, the third person will sit on the third place. So inconvenience of the first person will be 0, inconvenience of the second person will be 1 and inconvenience of the third person will be 2. The total inconvenience is 0 + 1 + 2 = 3.

In the second test case, people should sit as follows: s_1 = 2, s_2 = 1, s_3 = 5, s_4 = 4, s_5 = 3. The total inconvenience will be 6.
import java.io.*;
import java.util.Arrays;
import java.util.*;
import java.util.Scanner;
import java.util.StringTokenizer;



public class copy{


    public static boolean checker(long[] arr,long K,long diff)
    {
        long collect=0;
        for(int i=0;i<arr.length;i++)
        {
            if(arr[i]>diff)
                collect+=arr[i]-diff;
        }

        if(collect>=K)
            return true;
        else
            return false;
    }
    public static long search(long[] arr,long K,long R)
    {
        long l=0;
        long r=R;

        while(l<=r)
        {
            long mid=(l+r)/2;

            if(checker(arr,K,mid))
            {
                if(checker(arr,K,mid+1))
                    l=mid+1;
                else
                    return mid;
            }
            else
                r=mid-1;
        }
        return -1;
    }

    static void sieveOfEratosthenes(int n,ArrayList<Integer> arr,ArrayList<Integer> arr1)
    {
        // Create a boolean array
        // "prime[0..n]" and
        // initialize all entries
        // it as true. A value in
        // prime[i] will finally be
        // false if i is Not a
        // prime, else true.
        boolean prime[] = new boolean[n + 1];
        for (int i = 0; i <= n; i++)
            prime[i] = true;

        for (int p = 2; p * p <= n; p++)
        {
            // If prime[p] is not changed, then it is a
            // prime
            if (prime[p] == true)
            {

                // Update all multiples of p
                for (int i = p * p; i <= n; i += p)
                    prime[i] = false;
            }
        }

        // Print all prime numbers
        int x=0;
        for (int i = 2; i <= n; i++)
        {
            if (prime[i] == true)
            {

                arr.add(i);


            }

        }
        System.out.println(arr.size());
    }

    public static boolean check(String s,int K,char ch)
    {
        ArrayList<Integer> arr=new ArrayList<>();
        for(int i=0;i<s.length();i++)
        {
            if(s.charAt(i)==ch)
                arr.add(i);
        }
//        if(K==1 && ch=='z')
//            System.out.println(arr);
        if(arr.size()==0)
            return false;
        if(arr.get(0)>=K)
            return false;
        if(s.length()-1-arr.get(arr.size()-1)>=K)
            return false;
        for(int i=1;i<arr.size();i++)
        {
            if(arr.get(i)-arr.get(i-1)>K)
                return false;
        }
        return true;
    }

    public static int check(long N)
    {
        int sum=0;
        while(N>0)
        {
            sum+=N%10;
            N=N/10;
        }
        return sum;

    }

    public static long call(long N)
    {
        long l=1;
        long r=(long)Math.floor(Math.sqrt(N));
        while(l<=r)
        {
            long mid=(l+r)/2;
            double left=N/(double)(mid)-mid;
            int right=check(mid);
            System.out.println(mid+" "+left+" "+right);
            if(mid==10)
                System.out.println(left+" "+right);
            if(left>right)
                l=mid+1;
            else if(right>left)
                r=mid-1;
            else
                return mid;
        }
        return -1;
    }

    public static int path(ArrayList<ArrayList<Integer>> arr,int X,int parent,int[] gold,PriorityQueue<Integer> pq)
    {
        int max=0;
        ArrayList<Integer> ch=new ArrayList<>();
        for(int i:arr.get(X))
        {
            if(i!=parent)
            {
                ch.add(path(arr,i,X,gold,pq));
            }
        }
        Collections.sort(ch,Collections.reverseOrder());
        for(int i=1;i<ch.size();i++)
            pq.add(ch.get(i));


        if(ch.size()==0)
        return gold[X];
        else
            return ch.get(0)+gold[X];

    }

    public static long fac(long N,long mod)
    {
        if(N==0)
            return 1;
        return ((N%mod)*(fac(N-1,mod)%mod))%mod;
    }

    public static String form(char ch,int freq)
    {
        String s="";
        for(int i=1;i<=freq;i++)
            s+=ch;
        return s;
    }

    static long power(long x, long y, long p)
    {

        // Initialize result
        long res = 1;

        // Update x if it is more than or
        // equal to p
        x = x % p;

        while (y > 0) {

            // If y is odd, multiply x
            // with result
            if (y % 2 == 1)
                res = (res * x) % p;

            // y must be even now
            y = y >> 1; // y = y/2
            x = (x * x) % p;
        }

        return res;
    }

    // Returns n^(-1) mod p
    static long modInverse(long n, long p)
    {
        return power(n, p - 2, p);
    }

    // Returns nCr % p using Fermat's
    // little theorem.
    static long nCrModPFermat(long n, long r,
                             long p)
    {

        if (n<r)
            return 0;
        // Base case
        if (r == 0)
            return 1;

        // Fill factorial array so that we
        // can find all factorial of r, n
        // and n-r



//        System.out.println(modInverse(fac(r,p),p));
//        System.out.println(modInverse(fac(n-r,p),p));
        return ((fac(n,p)%p * (modInverse(fac(r,p), p)
                % p))%p *( modInverse(fac(n-r,p), p)
                % p)) % p;
    }

    public static boolean check(long[] arr, long time, int M)
    {
        long sum=0;
        int count=0;
        for(int i=0;i<arr.length;i++)
        {
            sum+=arr[i];
            if(sum>=time)
            {
                ++count;
                sum=0;
            }
        }

        if(sum>=time)
            ++count;

        return count>=M;
    }

    public static int check(ArrayList<Integer> arr,ArrayList<Integer> arr2)
    {
        int l=0,r=0,ans=0;
        while(l<arr.size() && r<arr2.size())
        {
            if(arr.get(l)<arr2.get(r))
                ++l;
            else if(arr.get(l)>arr2.get(r))
                ++r;
            else
            {
                ++ans;
                ++l;
                ++r;
            }
        }
        return ans;
    }


    public static int find(int[] parent,int x)
    {
        if(parent[x]==x)
            return x;
        return find(parent,parent[x]);
    }

    public static void merge(int[] parent, int[] rank,int x,int y)
    {
        int x1=find(parent,x);
        int y1=find(parent,y);
        if(rank[x1]>rank[y1])
        {
            parent[y1]=x1;

        }
        else if(rank[y1]>rank[x1])
        {
            parent[x1]=y1;
        }
        else
        {
            parent[y1]=x1;
            rank[x1]++;
        }
    }

    public static int check(ArrayList<ArrayList<Integer>> arr,int e1,int e2,int N)
    {
        boolean[] visited=new boolean[N];
        visited[0]=true;
        int[] dist=new int[N];
        Queue<Integer> queue=new LinkedList<>();
        queue.add(0);
        Arrays.fill(dist,-1);
        dist[0]=0;
        while(queue.size()>0)
        {
            int x=queue.poll();
            for(int i:arr.get(x))
            {
                if(!visited[i] || (e1==x && e2==i))
                {
                    System.out.println(x+" "+dist[x]);
                    dist[i]=dist[x]+1;
                    visited[i]=true;
                    queue.add(i);
                }
            }

        }


        return dist[N-1];
    }

    static int N;

    static void rotate90Clockwise(String a[][])
    {

        // Traverse each cycle
        for (int i = 0; i < N / 2; i++)
        {
            for (int j = i; j < N - i - 1; j++)
            {

                // Swap elements of each cycle
                // in clockwise direction
                String temp = a[i][j];
                a[i][j] = a[N - 1 - j][i];
                a[N - 1 - j][i] = a[N - 1 - i][N - 1 - j];
                a[N - 1 - i][N - 1 - j] = a[j][N - 1 - i];
                a[j][N - 1 - i] = temp;
            }
        }
    }


    public static void moves(String s,int i,int[] movx,int[] movy,int x,int y)
    {
        if(i>=s.length())
            return;
        //System.out.println(x+" hello "+y);
        if(s.charAt(i)=='L')
        {
            movy[i]=y;
            movx[i]=x-1;
            moves(s,i+1,movx,movy,x-1,y);
        }
        else if(s.charAt(i)=='R')
        {
            movy[i]=y;
            movx[i]=x+1;
            moves(s,i+1,movx,movy,x+1,y);
        }
        else if(s.charAt(i)=='U')
        {
            movy[i]=y+1;
            movx[i]=x;
            moves(s,i+1,movx,movy,x,y+1);
        }
        else
        {
            movy[i]=y-1;
            movx[i]=x;
            moves(s,i+1,movx,movy,x,y-1);
        }

    }


    public static boolean check(String s,int i,int x,int y,int obsx,int obsy)
    {
        if(i>=s.length())
        {
            if(x==0 && y==0)
                return true;
            return false;
        }
        boolean status1=false,status2=false,status3=false,status4=false;
        //System.out.println(x+" "+y+" "+obsx+" "+obsy+" "+s.charAt(i));
        if(s.charAt(i)=='L')
        {
            if(x-1==obsx && y==obsy)
                status1=check(s,i+1,x,y,obsx,obsy);
            else
                status1=check(s,i+1,x-1,y,obsx,obsy);
            //moves(s,i+1,movx,movy,x-1,y);
        }
        else if(s.charAt(i)=='R')
        {
            if(x+1==obsx && y==obsy)
                status2=check(s,i+1,x,y,obsx,obsy);
            else
                status2=check(s,i+1,x+1,y,obsx,obsy);
            //moves(s,i+1,movx,movy,x+1,y);
        }
        else if(s.charAt(i)=='U')
        {
            if(y+1==obsy && x==obsx)
                status3=check(s,i+1,x,y,obsx,obsy);
            else
                status3= check(s,i+1,x,y+1,obsx,obsy);
            //moves(s,i+1,movx,movy,x,y-1);
        }
        else
        {
            if(y-1==obsy && x==obsx)
                status4= check(s,i+1,x,y,obsx,obsy);
            else
                status4=check(s,i+1,x,y-1,obsx,obsy);
        }
        return status1 || status2 || status3 || status4;
    }

    public static int mergeAndCount1(int[] arr, int l,
                                     int m, int r)
    {

        // Left subarray
        int[] left = Arrays.copyOfRange(arr, l, m + 1);

        // Right subarray
        int[] right = Arrays.copyOfRange(arr, m + 1, r + 1);

        int i = 0, j = 0, k = l, swaps = 0;

        while (i < left.length && j < right.length) {
            if (left[i] <= right[j])
                arr[k++] = left[i++];
            else {
                arr[k++] = right[j++];
                swaps += (m + 1) - (l + i);
            }
        }
        while (i < left.length)
            arr[k++] = left[i++];
        while (j < right.length)
            arr[k++] = right[j++];
        return swaps;
    }

    // Merge sort function
    public static int mergeSortAndCount(int[] arr, int l,
                                         int r) {

        // Keeps track of the inversion count at a
        // particular node of the recursion tree
        int count = 0;

        if (l < r) {
            int m = (l + r) / 2;

            // Total inversion count = left subarray count
            // + right subarray count + merge count

            // Left subarray count
            count += mergeSortAndCount(arr, l, m);

            // Right subarray count
            count += mergeSortAndCount(arr, m + 1, r);

            // Merge count
            count += mergeAndCount1(arr, l, m, r);
        }

        return count;
    }








    public static void main(String[] args)throws IOException {
        Reader.init(System.in);
        BufferedWriter output=new BufferedWriter(new OutputStreamWriter(System.out));

         int T=Reader.nextInt();
         for(int m=1;m<=T;m++)
         {
            int N=Reader.nextInt();
            int M=Reader.nextInt();
            ArrayList<Integer> arr=new ArrayList<>();
            ArrayList<Integer> copy=new ArrayList<>();
            for(int i=0;i<M;i++)
            {
                int X=Reader.nextInt();
                arr.add(X);
                copy.add(X);
            }
            Collections.sort(copy);
            HashMap<Integer,ArrayList<Integer>> hp=new HashMap<>();
            HashMap<Integer,Integer> seat=new HashMap<>();
            for(int i=0;i<M;i++)
            {
                if(!hp.containsKey(copy.get(i)))
                    hp.put(copy.get(i),new ArrayList<>());
                hp.get(copy.get(i)).add(i);
            }

            for(int i:hp.keySet())
                seat.put(i,hp.get(i).size()-1);
            int[] se=new int[M];
            for(int i=0;i<M;i++)
            {
                int X=arr.get(i);
                int s=seat.get(X);
                seat.put(X,seat.get(X)-1);
                se[i]=hp.get(X).get(s);


            }

            int l=0,r=M-1;
            while(l<r)
            {
                int temp=se[l];
                se[l]=se[r];
                se[r]=temp;
                ++l;
                --r;
            }

            output.write(mergeSortAndCount(se,0,M-1)+"\n");




         }




















        output.flush();


    }








}

class edges
{
    int x,y,z;
    edges(int x,int y,int z)
    {
        this.x=x;
        this.y=y;
        this.z=z;
    }
}

class sort_e implements Comparator<edges>
{
    public int compare(edges o1,edges o2)
    {
        return o1.z-o2.z;
    }
}

class Reader {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


