#include <bits/stdc++.h>
const long long mod = 1000 * 1000 * 1000 + 7;
const long long mod1 = 998244353;
const long long INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
using namespace std;
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (long long)(res * x);
    y = y >> 1;
    if (x <= 100000000) x = (long long)(x * x);
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long T;
  cin >> T;
  while (T--) {
    long long n;
    cin >> n;
    string s;
    cin >> s;
    set<pair<pair<long long, long long>, long long>> a;
    long long f = 0;
    long long l = -1;
    long long r = -1;
    long long curx = 0;
    long long cury = 0;
    long long here = INF;
    for (int i = 0; i < n; i++) {
      if (s[i] == 'L') curx -= 1;
      if (s[i] == 'R') curx += 1;
      if (s[i] == 'U') cury += 1;
      if (s[i] == 'D') cury -= 1;
      if (int((a).size()) > 0) {
        auto it = a.lower_bound({{curx, cury}, -i - 1});
        if ((*it).first.first == curx and (*it).first.second == cury) {
          f = 1;
          if (l == -1 and r == -1) {
            l = abs((*it).second) + 1;
            r = i + 1;
            here = r - l;
          } else {
            if (i - abs((*it).second) < here) {
              l = abs((*it).second) + 1;
              r = i + 1;
              here = r - l;
            }
          }
        } else {
          if (curx == 0 and cury == 0) {
            f = 1;
            if (i < here) {
              r = i + 1;
              l = 0;
              here = i;
            }
          }
        }
      }
      a.insert({{curx, cury}, -i});
    }
    if (f == 0) {
      if (curx == 0 and cury == 0)
        cout << 1 << ' ' << n << "\n";
      else
        cout << -1 << "\n";
    } else {
      cout << l + 1 << ' ' << r << "\n";
    }
  }
  return 0;
}
