Ace is ready to go to Waterloo for the open house. Unfortunately, his parents won't drive him so he has to take some sort of transit there. Ace always starts at `home`

and ends up at `Waterloo GO`

. Along the way, there are stops that Ace can transfer through. Then, there are transfers are given in the form - where is one node and is the other. The transfer is two directional, meaning Ace can go from to or to . The names of the transfers will include a dash. Thus, find the minimum number of transfers for Ace to get to Waterloo for the open house. If Ace cannot, print `RIP ACE`

.

#### Input Specification

First line: , , the number of destinations, not including `home`

and `Waterloo GO`

, and the number of transfers.

Next lines, the name of a transfer.

Next lines: a transfer, given in the form -

#### Output Specification

The minimum number of transfers to get to Waterloo.

#### Sample Input 1

```
2 3
Union Station
MiWay Stop
home-MiWay Stop
MiWay Stop-Union Station
Union Station-Waterloo GO
```

#### Sample Output 1

`3`

#### Sample Input 2

```
5 8
China
India
Burma
Uzbekistan
Kyrgyzstan
home-China
China-India
India-Burma
home-Uzbekistan
Uzbekistan-India
Uzbekistan-Kyrgyzstan
Kyrgyzstan-Waterloo GO
Burma-Waterloo GO
```

#### Sample Output 2

`3`

## Comments

I think the problem meant

`"home"`

instead of`"Glenforest"`

for the starting point. Unless if he lives at Glenforest... That would be kind of sad. :(The input specifications have been updated we apologize for the inconvenience.

He basically lives at the school but yes, we'll look to editing the problem statement. Apologies for the delayed response.