K.cpp

#include<bits/stdc++.h>
using namespace std;
#define fo(i,n) for(i=0;i<n;i++)
#define fo2(i,start,end) for(i=start;i<=end;i++)
#define rfo(i,n) for(i=n-1;i>=0;i--)
#define lli long long int
#define deb(x) cout<<#x<<"="<<x<<endl
#define deb2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define tr(it,a) for(auto it=a.begin(); it!=a.end();it++)
#define nl '\n'
#define PI 3.1415926535897932384626
#define mod 1000000007
typedef pair<int, int>	pii;
typedef pair<lli, lli>	pl;
typedef vector<int>		vi;
typedef vector<lli>		vl;
typedef vector<pii>		vpii;
typedef vector<pl>		vpl;
void solve(){
    int i,j;
    string s;
    cin>>s;
    lli n,x,y,block_x,block_y;
    map<pair<int,int>,int> mapp;
    n=s.size();
    fo(j,n){
        
        block_x=0;
        block_y=0;
        x=0;y=0;
        fo(i,n){
            if(s[i]=='R'){
                x++;
            }
            else if(s[i]=='L'){
                x--;
            }
            else if(s[i]=='U'){
                y++;
            }
            else if(s[i]=='D'){
                y--;
            }
            if(i==j && mapp[{x,y}]==0){
                block_x=x;
                block_y=y;
                mapp[{x,y}]++;
            }
            if(x==block_x && y==block_y && i>=j){
                if(s[i]=='R'){
                    x--;
                }
                else if(s[i]=='L'){
                    x++;
                }
                else if(s[i]=='U'){
                    y--;
                }
                else if(s[i]=='D'){
                    y++;
                }
            }
        }
        if(x==0 && y==0){
            cout<<block_x<<" "<<block_y<<nl;
            return;
        }
    }
    cout<<"0 0\n";
}

int main(){
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}