#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
char a[maxn];
struct po {
  int x, y, id;
} p[maxn];
bool cmp(po x, po y) {
  if (x.x != y.x)
    return x.x < y.x;
  else if (x.y != y.y)
    return x.y < y.y;
  else
    return x.id < y.id;
}
int main() {
  int t, n, x, y, minn, l, r;
  long long s;
  cin >> t;
  while (t--) {
    scanf("%d %s", &n, a + 1);
    po kong;
    kong.x = 0, kong.y = 0;
    for (int i = 1; i <= n; i++) {
      if (a[i] == 'L')
        kong.x--;
      else if (a[i] == 'R')
        kong.x++;
      else if (a[i] == 'U')
        kong.y++;
      else
        kong.y--;
      p[i].x = kong.x;
      p[i].y = kong.y;
      p[i].id = i;
    }
    p[0].x = 0, p[0].y = 0, p[0].id = 0;
    sort(p, p + n + 1, cmp);
    x += minn;
    x = 0;
    x = 0, minn = n + 10;
    while (x <= n) {
      while (p[x].x == p[x + 1].x && p[x].y == p[x + 1].y && x < n) {
        if (p[x + 1].id - p[x].id < minn)
          minn = p[x + 1].id - p[x].id, l = p[x].id, r = p[x + 1].id;
        x++;
      }
      x++;
    }
    if (minn == n + 10)
      cout << -1 << endl;
    else
      cout << l + 1 << " " << r << endl;
  }
}
