Problem: There is a magic room in a homestead. The room is paved with H × W tiles. There are five different tiles:

* Tile with a east-pointing arrow
* Tile with a west-pointing arrow
* Tile with a south-pointing arrow
* Tile with a north-pointing arrow
* Tile with nothing



Once a person steps onto a tile which has an arrow, the mystic force makes the person go to the next tile pointed by the arrow. If the next tile has an arrow, the person moves to the next, ans so on. The person moves on until he/she steps onto a tile which does not have the arrow (the tile with nothing). The entrance of the room is at the northwest corner.

Your task is to write a program which simulates the movement of the person in the room. The program should read strings which represent the room and print the last position of the person.

The input represents the room as seen from directly above, and up, down, left and right side of the input correspond to north, south, west and east side of the room respectively. The horizontal axis represents x-axis (from 0 to W-1, inclusive) and the vertical axis represents y-axis (from 0 to H-1, inclusive). The upper left tile corresponds to (0, 0).

The following figure shows an example of the input:


10 10
>>>v..>>>v
...v..^..v
...>>>^..v
.........v
.v<<<<...v
.v...^...v
.v...^<<<<
.v........
.v...^....
.>>>>^....


Characters represent tiles as follows:


'>': Tile with a east-pointing arrow
'<': Tile with a west-pointing arrow
'^': Tile with a north-pointing arrow
'v': Tile with a south-pointing arrow
'.': Tile with nothing


If the person goes in cycles forever, your program should print "LOOP". You may assume that the person never goes outside of the room.



Input

The input consists of multiple datasets. The input ends with a line which contains two 0. Each dataset consists of:


H W
H lines where each line contains W characters


You can assume that 0 < W, H < 101.

Output

For each dataset, print the coordinate (X, Y) of the person or "LOOP" in a line. X and Y should be separated by a space.

Examples

Input

10 10
>>>v..>>>v
...v..^..v
>>>>>>^..v
.........v
.v


Output

5 7
LOOP


Input

10 10
>>>v..>>>v
...v..^..v
>>>>>>^..v
.........v
.v<<<<...v
.v.v.^...v
.v.v.^<<<<
.v.v.....v
.v...^...v
.>>>>^....
6 10
>>>>>>>>>v
.........v
.........v
>>>>v....v
^...v....v
^<<<<<<<<<
0 0


Output

5 7
LOOP

Solution (in CPP):

Solution:
#include <cstdio>
#include <algorithm>
using namespace std;
char imap[101][101];
int d[101][101];
int h, w;

void dfs(int x, int y, int step) {
    if (d[x][y] != -1) { printf("LOOP\n"); return; }
    d[x][y] = step;
    if (imap[x][y] == '.') { printf("%d %d\n", y, x); return; }
    else if (imap[x][y] == '^') dfs(x-1, y, step+1);
    else if (imap[x][y] == 'v') dfs(x+1, y, step+1);
    else if (imap[x][y] == '>') dfs(x, y+1, step+1);
    else if (imap[x][y] == '<') dfs(x, y-1, step+1);
}


int main()  {

    for (; ;) {
        scanf("%d %d", &h, &w);
        if (h == 0 && w == 0) break;
        for (int i = 0; i < h; i++) {
            fill(d[i], d[i]+w, -1);
            scanf("%s", imap[i]);
        }
        dfs(0, 0, 0);
    }
    return 0;
}