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.util.*;
  import java.io.*;
  
  public class Main {
  
      static long startTime = System.currentTimeMillis();
  
      // for global initializations and methods starts here
  
      // global initialisations and methods end here
  
      static void run() {
          boolean tc = true;
          //AdityaFastIO r = new AdityaFastIO();
          FastReader r = new FastReader();
  
          try (OutputStream out = new BufferedOutputStream(System.out)) {
  
              //long startTime = System.currentTimeMillis();
  
              int testcases = tc ? r.ni() : 1;
              int tcCounter = 1;
              // Hold Here Sparky------------------->>>
              // Solution Starts Here
  
              start:
              while (testcases-- > 0) {
  
                  int n = r.ni();
                  int m = r.ni();
  
                  char[] s = r.word().toCharArray();
                  int x = 0;
                  int y = 0;
  
                  int left = 0;
                  int right = 0;
                  int up = 0;
                  int down = 0;
                  int X = 0, Y = 0;
                  for (char c : s) {
                      if (c == 'L') x--;
                      else if (c == 'R') x++;
                      else if (c == 'U') y++;
                      else y--;
  
                      left = Math.min(left, x);
                      right = Math.max(right, x);
                      up = Math.max(up, y);
                      down = Math.min(down, y);
  
                      if (up - down < n && -left + right < m) {
                          X = -left;
                          Y = up;
                      }
                  }
  
                  out.write((++Y + " " + (++X) + " ").getBytes());
                  out.write(("\n").getBytes());
  
              }
              // Solution Ends Here
          } catch (IOException e) {
              e.printStackTrace();
          }
      }
  
      static class AdityaFastIO {
          final private int BUFFER_SIZE = 1 << 16;
          private final DataInputStream din;
          private final byte[] buffer;
          private int bufferPointer, bytesRead;
          public BufferedReader br;
          public StringTokenizer st;
  
          public AdityaFastIO() {
              br = new BufferedReader(new InputStreamReader(System.in));
              din = new DataInputStream(System.in);
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
  
          public AdityaFastIO(String file_name) throws IOException {
              din = new DataInputStream(new FileInputStream(file_name));
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
  
          public String word() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          public String line() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          public String readLine() throws IOException {
              byte[] buf = new byte[100000001]; // line length
              int cnt = 0, c;
              while ((c = read()) != -1) {
                  if (c == '\n') break;
                  buf[cnt++] = (byte) c;
              }
              return new String(buf, 0, cnt);
          }
  
          public int ni() throws IOException {
              int ret = 0;
              byte c = read();
              while (c <= ' ') c = read();
              boolean neg = (c == '-');
              if (neg) c = read();
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
              if (neg) return -ret;
              return ret;
          }
  
          public long nl() throws IOException {
              long ret = 0;
              byte c = read();
              while (c <= ' ') c = read();
              boolean neg = (c == '-');
              if (neg) c = read();
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
              if (neg) return -ret;
              return ret;
          }
  
          public double nd() throws IOException {
              double ret = 0, div = 1;
              byte c = read();
              while (c <= ' ') c = read();
              boolean neg = (c == '-');
              if (neg) c = read();
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
              if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);
              if (neg) return -ret;
              return ret;
          }
  
          private void fillBuffer() throws IOException {
              bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
              if (bytesRead == -1) buffer[0] = -1;
          }
  
          private byte read() throws IOException {
              if (bufferPointer == bytesRead) fillBuffer();
              return buffer[bufferPointer++];
          }
  
          public void close() throws IOException {
              if (din == null) return;
              din.close();
          }
      }
  
      public static void main(String[] args) throws Exception {
          run();
      }
  
      static long mod = 998244353;
  
      static long modInv(long base, long e) {
          long result = 1;
          base %= mod;
          while (e > 0) {
              if ((e & 1) > 0) result = result * base % mod;
              base = base * base % mod;
              e >>= 1;
          }
          return result;
      }
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          String word() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          String line() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          int ni() {
              return Integer.parseInt(word());
          }
  
          long nl() {
              return Long.parseLong(word());
          }
  
          double nd() {
              return Double.parseDouble(word());
          }
      }
  
      static int MOD = (int) (1e9 + 7);
  
      static long powerLL(long x, long n) {
          long result = 1;
          while (n > 0) {
              if (n % 2 == 1) result = result * x % MOD;
              n = n / 2;
              x = x * x % MOD;
          }
          return result;
      }
  
      static long powerStrings(int i1, int i2) {
          String sa = String.valueOf(i1);
          String sb = String.valueOf(i2);
          long a = 0, b = 0;
          for (int i = 0; i < sa.length(); i++) a = (a * 10 + (sa.charAt(i) - '0')) % MOD;
          for (int i = 0; i < sb.length(); i++) b = (b * 10 + (sb.charAt(i) - '0')) % (MOD - 1);
          return powerLL(a, b);
      }
  
      static long gcd(long a, long b) {
          if (a == 0) return b;
          else return gcd(b % a, a);
      }
  
      static long lcm(long a, long b) {
          return (a * b) / gcd(a, b);
      }
  
      static long lower_bound(int[] arr, int x) {
          int l = -1, r = arr.length;
          while (l + 1 < r) {
              int m = (l + r) >>> 1;
              if (arr[m] >= x) r = m;
              else l = m;
          }
          return r;
      }
  
      static int upper_bound(int[] arr, int x) {
          int l = -1, r = arr.length;
          while (l + 1 < r) {
              int m = (l + r) >>> 1;
              if (arr[m] <= x) l = m;
              else r = m;
          }
          return l + 1;
      }
  
      static void addEdge(ArrayList<ArrayList<Integer>> graph, int edge1, int edge2) {
          graph.get(edge1).add(edge2);
          graph.get(edge2).add(edge1);
      }
  
      public static class Pair implements Comparable<Pair> {
          int first;
          int second;
  
          public Pair(int first, int second) {
              this.first = first;
              this.second = second;
          }
  
          public String toString() {
              return "(" + first + "," + second + ")";
          }
  
          public int compareTo(Pair o) {
              // TODO Auto-generated method stub
              if (this.first != o.first)
                  return (int) (this.first - o.first);
              else return (int) (this.second - o.second);
          }
      }
  
      public static class PairC<X, Y> implements Comparable<PairC> {
          X first;
          Y second;
  
          public PairC(X first, Y second) {
              this.first = first;
              this.second = second;
          }
  
          public String toString() {
              return "(" + first + "," + second + ")";
          }
  
          public int compareTo(PairC o) {
              // TODO Auto-generated method stub
              return o.compareTo((PairC) first);
          }
      }
  
      static boolean isCollectionsSorted(List<Long> list) {
          if (list.size() == 0 || list.size() == 1) return true;
          for (int i = 1; i < list.size(); i++) if (list.get(i) <= list.get(i - 1)) return false;
          return true;
      }
  
      static boolean isCollectionsSortedReverseOrder(List<Long> list) {
          if (list.size() == 0 || list.size() == 1) return true;
          for (int i = 1; i < list.size(); i++) if (list.get(i) >= list.get(i - 1)) return false;
          return true;
      }
  
  }