Problem:
Magic Tile

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.

Sample 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 for the Sample Input

5 7
LOOP

Solution in Ruby (judge verdict: Accepted)

class Tiles
  def initialize
    @tiles = []
  end

  def add(row)
    x, y = -1, @tiles.length
    @tiles << row.map{|item|
      x += 1
      Tile.new(x, y, item)
    }
  end

  def set
    @tiles.each{|row|
      row.each{|item|
        x, y = item.next_ord
        item.set_parent(@tiles[y][x])
      }
    }
  end

  def solve
    normal, twice = @tiles[0][0].next, @tiles[0][0].next.next
    while normal != twice
      normal, twice = normal.next, twice.next.next
    end
    if normal.tip?
      puts normal.to_s
    else
      puts "LOOP"
    end
  end

end

class Tile
  attr_reader :x, :y
  @@condition = {">" => 5, "<" => 3, "^" => 1, "v"=> 7, "." => 4}
  def initialize(x, y, arrow)
    @x = x
    @y = y
    @parent = nil
    @condition = @@condition[arrow]
  end
  
  def set_parent(other)
    @parent = other
  end

  def ==(other)
    return ((@x == other.x) and (@y == other.y))
  end

  def next_ord
    return x + ((@condition % 3) <=> 1), y + ((@condition / 3) <=> 1)
  end

  def next
    return @parent
  end

  def tip?
    return @condition == 4
  end

  def to_s
    return "#{x} #{y}"
  end

  def inspect
    to_s
  end
  
  
end
def main
  while (h, w = gets.split(" ").map(&:to_i)) != [0, 0] # !> assigned but unused variable - w
    tiles = Tiles.new
    h.times do
      tiles.add(gets.chomp.split(""))
    end
    tiles.set
    tiles.solve
  end
end
main