#include <iostream>
//#include<queue>
#define ll long long

using namespace std;
const int N = 510;
char a[N][N];
bool vis[N][N];
int main() {
    int row, col;
    cin >> row >> col;
    vis[1][1] = 1;
    //这里也要一个getchar
    getchar();
    for (int i = 1; i <= row; ++i) {
        for (int j = 1; j <= col; ++j) {
            scanf("%c", &a[i][j]);
        }
        getchar();
    }
    int i = 1, j = 1;
    while (1) {
        //情况1
        if (a[i][j] == 'U') {
            if (i != 1) {
                i = i - 1;
                if (vis[i][j] == 1) {
                    //重复走过了，可以循环
                    cout << -1;
                    return 0;
                } else
                    vis[i][j] = 1;
            } else {
                cout << i << " " << j;
                return 0;
            }
            continue;
        }
        //情况2
        if (a[i][j] == 'D') {
            if (i != row) {
                i = i + 1;
                if (vis[i][j] == 1) {
                    //重复走过了，可以循环
                    cout << -1;
                    return 0;
                } else
                    vis[i][j] = 1;
            } else {
                cout << i << " " << j;
                return 0;
            }
            continue;
        }
        //情况3
        if (a[i][j] == 'L') {
            if (j != 1) {
                j = j - 1;
                if (vis[i][j] == 1) {
                    //重复走过了，可以循环
                    cout << -1;
                    return 0;
                } else
                    vis[i][j] = 1;
            } else {
                cout << i << " " << j;
                return 0;
            }
            continue;
        }
        //情况4
        if (a[i][j] == 'R') {
            if (j != col) {
                j = j + 1;
                if (vis[i][j] == 1) {
                    //重复走过了，可以循环
                    cout << -1;
                    return 0;
                } else
                    vis[i][j] = 1;
            } else {
                cout << i << " " << j;
                return 0;
            }
            continue;
        }
    }

    return 0;
}