description: 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
solution: import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.*;
   
  public class Solution{
  static FastScanner sc = new FastScanner();
  public static void solve(){
      int n=sc.nextInt();
      int m=sc.nextInt();
      char[] c=sc.next().toCharArray();
      int x=1,y=1;
      int sum=0;
      int l=0,r=0,d=0,u=0;
      int a=0,b=0;
      for (int i=0;i<c.length;i++) {
        if (c[i]=='R') {
          a++;
        }else if(c[i]=='L'){
          a--;
        }else if(c[i]=='U'){
          b++;
        }else{
          b--;
        }
        l=min(a,l);
        r=max(r,a);
        u=max(u,b);
        d=min(d,b);
        if(m>(r-l)&&(n>(u-d)))
      {
          x=(n+d);
          y=(m-r);
      }
      }
      
      System.out.println((x)+" "+(y));
  
          }
  
  
  public static void main(String[] args) {
    int t = sc.nextInt();
    outer: for (int tt = 0; tt < t; tt++) {
      solve();
    }
  
  }
  static boolean isPrime(int n)
      {
          if (n <= 1)
              return false;
          if (n <= 3)
              return true;
    
          if (n % 2 == 0 || n % 3 == 0)
              return false;
    
          for (int i = 5; i * i <= n; i = i + 6)
              if (n % i == 0 || n % (i + 2) == 0)
                  return false;
    
          return true;
      }
  public static int[] LPS(String s){
    int[] lps=new int[s.length()];
    int i=0,j=1;
    while (j<s.length()) {
      if(s.charAt(i)==s.charAt(j)){
        lps[j]=i+1;
        i++;
        j++;
        continue;
      }else{
        if (i==0) {
          j++;
          continue;
        }
        i=lps[i-1];
        while(s.charAt(i)!=s.charAt(j) && i!=0) {
          i=lps[i-1];
        }
        if(s.charAt(i)==s.charAt(j)){
        lps[j]=i+1;
        i++;
        }
        j++;
      }
    }
    return lps;
  }
  static long getPairsCount(int n, double sum,int[] arr)
      {
          HashMap<Double, Integer> hm = new HashMap<>();
          for (int i = 0; i < n; i++) {
              if (!hm.containsKey((double)arr[i]))
                  hm.put((double)arr[i], 0);
              hm.put((double)arr[i], hm.get((double)arr[i]) + 1);
          }
          long twice_count = 0;
          for (int i = 0; i < n; i++) {
              if (hm.get(sum - arr[i]) != null)
                  twice_count += hm.get(sum - arr[i]);
              if (sum - (double)arr[i] == (double)arr[i])
                  twice_count--;
          }
          return twice_count / 2l;
      }
  static boolean[] sieveOfEratosthenes(int n)
      {
          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] == true)
              {
                  for (int i = p * p; i <= n; i += p)
                      prime[i] = false;
              }
          }
          return prime;
   }
  static long power(long x, long y, long p)
    {
      long res = 1l; 
      x = x % p;
      if (x == 0)
        return 0;
      while (y > 0)
      {
  
        if ((y & 1) != 0)
          res = (res * x) % p;
        y>>=1;
        x = (x * x) % p;
      }
      return res;
    }
  
  public static int log2(int N)
      {
          int result = (int)(Math.log(N) / Math.log(2));
    
          return result;
      }
  
  ////////////////////////////////////////////////////////////////////////////////////
  ////////////////////DO NOT READ AFTER THIS LINE //////////////////////////////////
  ////////////////////////////////////////////////////////////////////////////////////
  static long modFact(int n, 
                         int p) 
      { 
          if (n >= p) 
              return 0; 
        
          long result = 1l; 
          for (int i = 3; i <= n; i++) 
              result = (result * i) % p; 
        
          return result; 
      } 
        
  static boolean isPalindrom(char[] arr, int i, int j) {
    boolean ok = true;
    while (i <= j) {
      if (arr[i] != arr[j]) {
        ok = false;
        break;
      }
      i++;
      j--;
    }
    return ok;
  }
  
  static int max(int a, int b) {
    return Math.max(a, b);
  }
  
  static int min(int a, int b) {
    return Math.min(a, b);
  }
  
  static long max(long a, long b) {
    return Math.max(a, b);
  }
  
  static long min(long a, long b) {
    return Math.min(a, b);
  }
  
  static int abs(int a) {
    return Math.abs(a);
  }
  
  static long abs(long a) {
    return Math.abs(a);
  }
  
  static void swap(long arr[], int i, int j) {
    long temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
  }
  
  static void swap(int arr[], int i, int j) {
    int temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
  }
  
  static int maxArr(int arr[]) {
    int maxi = Integer.MIN_VALUE;
    for (int x : arr)
      maxi = max(maxi, x);
    return maxi;
  }
  
  static int minArr(int arr[]) {
    int mini = Integer.MAX_VALUE;
    for (int x : arr)
      mini = min(mini, x);
    return mini;
  }
  
  static long maxArr(long arr[]) {
    long maxi = Long.MIN_VALUE;
    for (long x : arr)
      maxi = max(maxi, x);
    return maxi;
  }
  
  static long minArr(long arr[]) {
    long mini = Long.MAX_VALUE;
    for (long x : arr)
      mini = min(mini, x);
    return mini;
  }
  static int lcm(int a,int b){
    return (int)(((long)a*b)/(long)gcd(a,b));
  }
  static int gcd(int a, int b) {
    if (b == 0)
      return a;
    return gcd(b, a % b);
  }
  
  static long gcd(long a, long b) {
    if (b == 0)
      return a;
    return gcd(b, a % b);
  }
  
  static void ruffleSort(int[] a) {
    int n = a.length;
    Random r = new Random();
    for (int i = 0; i < a.length; i++) {
      int oi = r.nextInt(n);
      int temp = a[i];
      a[i] = a[oi];
      a[oi] = temp;
    }
    Arrays.sort(a);
  }
  
  public static int binarySearch(int a[], int target) {
    int left = 0;
    int right = a.length - 1;
    int mid = (left + right) / 2;
    int i = 0;
    while (left <= right) {
      if (a[mid] <= target) {
        i = mid + 1;
        left = mid + 1;
      } else {
        right = mid - 1;
      }
      mid = (left + right) / 2;
    }
    return i-1;
  }
  
  
  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[] readLongArray(int n) {
      long[] a = new long[n];
      for (int i = 0; i < n; i++)
        a[i] = nextLong();
      return a;
    }
  
    int[][] read2dArray(int n, int m) {
      int arr[][] = new int[n][m];
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
          arr[i][j] = nextInt();
        }
      }
      return arr;
    }
  
    ArrayList<Integer> readArrayList(int n) {
      ArrayList<Integer> arr = new ArrayList<Integer>();
      for (int i = 0; i < n; i++) {
        int a = nextInt();
        arr.add(a);
      }
      return arr;
    }
  
    long nextLong() {
      return Long.parseLong(next());
    }
  }
   static class Pair {
    int l, r;
  
    Pair(int fr, int sc) {
      this.l = fr;
      this.r = sc;
    }
  }
  }