The robot is located on a checkered rectangular board of size n × m (n rows, m columns). The rows in the board are numbered from 1 to n from top to bottom, and the columns — from 1 to m from left to right.

The robot is able to move from the current cell to one of the four cells adjacent by side.

The sequence of commands s executed by the robot is given. Each command is denoted by one of the symbols 'L', 'R', 'D' or 'U', and triggers the movement to left, right, down or up, respectively.

The robot can start its movement in any cell. The robot executes the commands starting from the first one, strictly in the order in which they are listed in s. If the robot moves beyond the edge of the board, it falls and breaks. A command that causes the robot to break is not considered successfully executed.

The robot's task is to execute as many commands as possible without falling off the board. For example, on board 3 × 3, if the robot starts a sequence of actions s="RRDLUU" ("right", "right", "down", "left", "up", "up") from the central cell, the robot will perform one command, then the next command will force him to cross the edge. If the robot starts moving from the cell (2, 1) (second row, first column) then all commands will be executed successfully and the robot will stop at the cell (1, 2) (first row, second column).

<image> The robot starts from cell (2, 1) (second row, first column). It moves right, right, down, left, up, and up. In this case it ends in the cell (1, 2) (first row, second column).

Determine the cell from which the robot should start its movement in order to execute as many commands as possible.

Input

The first line contains an integer t (1 ≤ t ≤ 10^4) — the number of test cases.

The next 2t lines contain descriptions of the test cases.

In the description of each test case, the first line contains two integers n and m (1 ≤ n, m ≤ 10^6) — the height and width of the field that the robot is located on. The second line of the description is a string s consisting solely of characters 'L', 'R', 'D' and 'U' — the sequence of commands the robot executes. The string has a length from 1 to 10^6 commands.

It is guaranteed that the total length of s over all test cases does not exceed 10^6.

Output

Print t lines, each of which contains the answer to the corresponding test case. The answer to the test case are two integers r (1 ≤ r ≤ n) and c (1 ≤ c ≤ m), separated by a space — the coordinates of the cell (row number and column number) from which the robot should start moving to perform as many commands as possible.

If there are several such cells, you may output any of them.

Example

Input


4
1 1
L
1 2
L
3 3
RRDLUU
4 3
LUURRDDLLLUU


Output


1 1
1 2
2 1
3 2
import java.net.Inet4Address;
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class practiceb{

    static FastScanner sc;
    static int ans;
    static long[] arr,arr1;
    static char[][] board;
    static long mul,mul1;
    static int[] spf;
    static char[] ch;
    static int n,q,m;
    static long k,a,x,c;
    static StringBuilder sb,sb1;
    static long b,sum;
    static Map<Integer,List<Integer>> map;
    static Map<Long,List<Integer>> map2;
    static Map<Long,List<Integer>> map3;
    static Map<Integer,Integer> shortest;
    static Map<Integer,Integer> map1,in;
    static List<Integer> list,list1;
    static long[] count;
    static boolean[] vis;
    static boolean flag;
    static long total,xor1;

    // static class Node{
    //     long dist;
    //     Set<Integer> set;
    //     Node(){
    //         this.set = new HashSet<>();
    //     }
    //     Node(int f){
    //         this.dist = f;
    //         this.set = new HashSet<>();
    //     }
    // }

    // public static class Lca {

    //     int[] depth;
    //     int[] dfs_order;
    //     int cnt;
    //     int[] first;
    //     int[] minPos;
    //     int n;

    //     void dfs(List<Integer>[] tree, int u, int d) {
    //         depth[u] = d;
    //         dfs_order[cnt++] = u;
    //         for (int v : tree[u])
    //             if (depth[v] == -1) {
    //                 dfs(tree, v, d + 1);
    //                 dfs_order[cnt++] = u;
    //             }
    //     }

    //     void buildTree(int node, int left, int right) {
    //         if (left == right) {
    //             minPos[node] = dfs_order[left];
    //             return;
    //         }
    //         int mid = (left + right) >> 1;
    //         buildTree(2 * node + 1, left, mid);
    //         buildTree(2 * node + 2, mid + 1, right);
    //         minPos[node] = depth[minPos[2 * node + 1]] < depth[minPos[2 * node + 2]] ? minPos[2 * node + 1] : minPos[2 * node + 2];
    //     }

    //     public Lca(List<Integer>[] tree, int root) {
    //         int nodes = tree.length;
    //         depth = new int[nodes];
    //         Arrays.fill(depth, -1);

    //         n = 2 * nodes - 1;
    //         dfs_order = new int[n];
    //         cnt = 0;
    //         dfs(tree, root, 0);

    //         minPos = new int[4 * n];
    //         buildTree(0, 0, n - 1);

    //         first = new int[nodes];
    //         Arrays.fill(first, -1);
    //         for (int i = 0; i < dfs_order.length; i++)
    //             if (first[dfs_order[i]] == -1)
    //                 first[dfs_order[i]] = i;
    //     }

    //     public int lca(int a, int b) {
    //         return minPos(Math.min(first[a], first[b]), Math.max(first[a], first[b]), 0, 0, n - 1);
    //     }

    //     int minPos(int a, int b, int node, int left, int right) {
    //         if (a == left && right == b)
    //             return minPos[node];
    //         int mid = (left + right) >> 1;
    //         if (a <= mid && b > mid) {
    //             int p1 = minPos(a, Math.min(b, mid), 2 * node + 1, left, mid);
    //             int p2 = minPos(Math.max(a, mid + 1), b, 2 * node + 2, mid + 1, right);
    //             return depth[p1] < depth[p2] ? p1 : p2;
    //         } else if (a <= mid) {
    //             return minPos(a, Math.min(b, mid), 2 * node + 1, left, mid);
    //         } else if (b > mid) {
    //             return minPos(Math.max(a, mid + 1), b, 2 * node + 2, mid + 1, right);
    //         } else {
    //             throw new RuntimeException();
    //         }
    //     }
    // }

    // private static long dfs(int v, int parent,long ht) {

    //     List<Integer> list = map.get(v);
    //     hyt[v] = ht;

    //     if(list.size() == 1){
    //         if(!map3.containsKey(ht))
    //             map3.put(ht,new ArrayList<>());

    //         map3.get(ht).add(v);
    //         return ht;

    //     }

    //     long maxl = -1;
    //     for(Integer i : list){
    //         if(i == parent)
    //             continue;
    //         maxl = Math.max(maxl,dfs(i,v,ht+1));
    //     }

    //     return maxl;

    // }
    // public static int N = 100005;

    // long a[N];
    // long sfx[N];
    // long pfx[N];

//    public static boolean f(int width){
//
//        // long[] a = new long[n];
//        long[] sfx = new long[n];
//        long[] pfx = new long[n];

//        for (int j = 0; j < n; j++){
//            if (j % width == 0){
//                pfx[j] = a[j];
//            }
//            else pfx[j] = gcd(pfx[j - 1], a[j]);
//        }
//        for (int j = n - 2; j >= 0; j--){
//            if (j % width == width - 1){
//                sfx[j] = a[j];
//            }
//            else sfx[j] = gcd(sfx[j + 1], a[j]);
//        }
//
//        for(int j = 0; j < n - width + 1 ; j++){
//            if (gcd(sfx[j], pfx[j + width - 1]) >= k) return true;
//            if (((j % width) == width - 1) && pfx[j] >= k){
//                return true;
//            }
//        }
//        return false;
//    }

    public static class Node {
        int v;
        int wt;
        Node(int v,int wt) {
            this.v = v;
            this.wt = wt;
        }
    }

    public static long lcm(long a, long b) {
        return (b / gcd(b, a % b)) * a;
    }

    public static void SpecialSieve(int MAXN) {
        spf = new int[MAXN];
        spf[1] = 1;
        for (int i = 2; i < MAXN; i++)

            // marking smallest prime factor for every
            // number to be itself.
            spf[i] = i;

        // separately marking spf for every even
        // number as 2
        for (int i = 4; i < MAXN; i += 2)
            spf[i] = 2;

        for (int i = 3; i * i < MAXN; i++) {
            // checking if i is prime
            if (spf[i] == i) {
                // marking SPF for all numbers divisible by i
                for (int j = i * i; j < MAXN; j += i)

                    // marking spf[j] if it is not
                    // previously marked
                    if (spf[j] == j)
                        spf[j] = i;
            }
        }
    }

    public static void solve1(List<Integer> list) {

        int n = list.size();
        long lcm = arr[list.get(0)];
        for(int i = 1 ; i < n ; i++)
            lcm = lcm(lcm,arr[list.get(i)]);

        if(n%2 == 0) {
            for(int i = 0 ; i < n ; i++) {
                if(i%2 == 0) {
                    count[list.get(i)] = (lcm/arr[list.get(i)]);
                }
                else {
                    count[list.get(i)] = (-(lcm/arr[list.get(i)]));
                }
            }
        }
        else {
            count[list.get(0)] = (lcm/arr[list.get(0)]);
            count[list.get(1)] = (lcm/arr[list.get(1)]);

            count[list.get(2)] = (-2*lcm/arr[list.get(2)]);

            for(int i = 3 ; i < n ; i++) {
                if(i%2 == 0) {
                    count[list.get(i)] = (lcm/arr[list.get(i)]);
                }
                else {
                    count[list.get(i)] = (-(lcm/arr[list.get(i)]));
                }
            }

        }
    }

    public static void solve() {

        int l = 0;
        int r = m-1;

        int lo = 0;
        int hi = m-1;

        int maxl1 = m;
        int maxl2 = n;

        for(int i = 0 ; i < ch.length ; i++) {
            maxl1 = l;
            if(l <= r) {
                if(ch[i] == 'L') {
                    lo -= 1;
                    hi -= 1;
                }
                else if(ch[i] == 'R') {
                    hi += 1;
                    lo += 1;
                }
                if(lo < 0) {
                    l += 1;
                    lo += 1;
                }
                else if(hi > m-1) {
                    r -= 1;
                    hi -= 1;
                }
            }
            if(l > r) {
                break;
            }
            else
                maxl1 = l;
        }

        int u = 0;
        int d = n-1;

        int upper = 0;
        int lower = n-1;

        for(int i = 0 ; i < ch.length ; i++) {
            maxl2 = u;
            if(u <= d) {
                if(ch[i] == 'U') {
                    lower -= 1;
                    upper -= 1;
                }
                else if(ch[i] == 'D') {
                    upper += 1;
                    lower += 1;
                }
                if(upper < 0) {
                    u += 1;
                    upper += 1;
                }
                else if(lower > n-1) {
                    d -= 1;
                    lower -= 1;
                }
            }
            if(u > d) {
                break;
            }
            else
                maxl2 = u;
        }

        sb.append(maxl2+1).append(" ").append(maxl1+1).append("\n");

    }

    public static void main(String[] args) {

        sc = new FastScanner();
        // Scanner sc = new Scanner(System.in);
        // SpecialSieve(5000000+5);
//        long num = 1;
//        list = new ArrayList<>();
//        for(int i = 0 ; i <= 60 ; i++) {
//            list.add(num);
//            num *= 2;
//        }
        int t = sc.nextInt();
//        SpecialSieve(10001);
//        fact(200000+1);
        sb = new StringBuilder();
//        int t = 1;
        while(t > 0){

//            a = sc.nextLong();
//            b = sc.nextLong();
//            c = sc.nextLong();
            n = sc.nextInt();
            // x = sc.nextLong();
             m = sc.nextInt();
//            k = sc.nextInt();
            // mat = new int[2][m];

            // for(int i = 0 ; i < 2 ; i++)
            //     for(int j = 0 ; j < m ; j++)
            //         mat[i][j] = sc.nextLong();

            // for(int i = 1 ; i <= 15 ; i++){
            //     m = i;
            //     solve();
            // // }
            // board = new char[3][3];
            // for(int i = 0 ; i < 3 ; i++){
            //     String s = sc.next();
            //     for(int j = 0 ; j < 3 ; j++){
            //         board[i][j] = s.charAt(j);
            //     }
            // }
            // x = sc.nextInt();
             ch = sc.next().toCharArray();
            // q = sc.nextInt();
//             ch = sc.next().toCharArray();
//            arr = new long[n];
//            for(int i = 0 ; i < n ; i++)
//                arr[i] = sc.nextLong();
//
//            arr1 = new long[m];
//            for(int i = 0 ; i < m ; i++)
//                arr1[i] = sc.nextLong();
//
//            a = new long[n-1];
//            for(int i = 1 ; i < n ; i++)
//                a[i-1] = Math.abs(arr[i] - arr[i-1]);
//
//            n -= 1;

            solve();
            t -= 1;
        }
        System.out.print(sb);

    }

    // Use this instead of Arrays.sort() on an array of ints. Arrays.sort() is n^2
    // worst case since it uses a version of quicksort. Although this would never
    // actually show up in the real world, in codeforces, people can hack, so
    // this is needed.
    static void ruffleSort(long[] a) {
        //ruffle
        int n=a.length;
        Random r=new Random();
        for (int i=0; i<a.length; i++) {
            int oi=r.nextInt(n);long temp=a[i];
            a[i]=a[oi];
            a[oi]=temp;
        }

        //then sort
        Arrays.sort(a);
    }
    public static long gcd(long a, long b)
    {
        if (b == 0)
            return a;

        return gcd(b, a % b);

    }
    public static int log(double n,double base){

        if(n == 0 || n == 1)
            return 0;

        if(n == base)
            return 1;

        double num = Math.log(n);
        double den = Math.log(base);

        if(den == 0)
            return 0;

        return (int)(num/den);
    }
    public static long mod(long x, long mod)
    {
        long result = x % mod;
        if (result < 0)
        {
            result += mod;
        }
        return result;
    }

    // Use this to input code since it is faster than a Scanner
    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }
}
