## COCI '09 Contest 6 #1 Kajak

View as PDF

Points: 5
Time limit: 0.6s
Memory limit: 32M

Problem type

Mirko and Slavko are sports commentators on a local kayaking competition. They have a live satellite feed of the entire track. Since there are too many teams for our dynamic duo to follow, they asked you to help them. They would like you to write a program that will display current standings team-by-team.

The satellite feed is encoded as a table of rows characters each. The first character in each row is the starting line, encoded by the character S. The last character in each row is the finishing line, encoded by F. There are exactly nine kayaks on the image. Each kayak is marked by his number, and each spans exactly three consecutive columns. Water is marked by ..

Teams are ranked by their distance to the finish line. Smaller is better. If two teams are at the same distance, they share their place.

#### Input Specification

The first line of input contains two integers and , the number of rows and columns of the encoded satellite image.

Each of the following lines contains exactly characters ., S, F and digits 1 to 9. Each row contains at most one kayak.

Each image contains all kayaks.

#### Output Specification

Output nine lines, one for each kayak. The -th line should contain the current rank of the -th team.

#### Sample Input 1

10 10
S.....111F
S....222.F
S...333..F
S..444...F
S.555....F
S666.....F
S.777....F
S..888...F
S...999..F
S........F

#### Sample Output 1

1
2
3
4
5
6
5
4
3

#### Sample Input 2

10 15
S..........222F
S.....111.....F
S...333.......F
S...555.......F
S.......444...F
S.............F
S......777....F
S..888........F
S........999..F
S...666.......F

#### Sample Output 2

5
1
6
3
6
6
4
7
2