시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 256 MB154464130.827%

문제

입력

On the first line, I will give two positive integers N and M.

N is the number of rows, and M is the number of columns.

Both integers are at most 100.

Each of the next N lines will describe each row of the tiles.

The tiles form a rectangle, remember?

Also, note that I will remove all marks on the tiles before Niko starts moving.

"#" means the mark is on that tile, and "." means the mark is not on that tile.

I guarantee that at least one tile has a mark.

출력

Tell Niko exactly how they should move.

"U" for up, "D" for down, "L" for left, and "R" for right.

Niko is allowed to go out of the rectangle.

예제 입력 1

1 1
#

예제 출력 1

R

출처

Contest > BOJ User Contest > 구데기컵 > 제1회 구데기컵 🐱번

  • 문제를 만든 사람: jh05013
  • 데이터를 추가한 사람: njw1204

채점 및 기타 정보

  • 예제는 채점하지 않는다.