PivotOJ

PRVA

시간 제한: 1000ms메모리 제한: 128MB출처: COCI 2007-2008BOJ 3005

문제

Little Ivica solves crossword puzzles every day. In case you haven't seen one, a crossword puzzle starts on a grid of R×C squares, each of which is either empty or blocked. The player's task is to write words in consecutive empty squares vertically (top down) or horizontally (left to right). 

Ivica's sister has a strange habit of looking at crosswords Ivica has finished solving, and finding the lexicographically smallest word in it. She only considers words at least 2 characters long. 

Write a program that, given a crossword puzzle, finds that word. 

입력

The first line contains two integers R and C (2 ≤ R, C ≤ 20), the number of rows and columns in the crossword. 

Each of the following R lines contains a string of C characters. Each of those characters is either a lowercase letter of the English alphabet, or the character '#' representing a blocked square. 

The input will be such that a solution will always exist. 

출력

Output the lexicographically smallest word in the crossword.

 

예제

예제 1

입력
4 4
luka
o#a#
kula
i#a#
출력
kala

예제 2

입력
4 4
luka
o#a#
kula
i#as
출력
as

예제 3

입력
4 5
adaca
da##b
abb#b
abbac
출력
abb
코드를 제출하려면 로그인하세요.