[요약 중] After Borko's second plan of taking over the village fell through (because Mirko's brother Stanko drank all the water), young Zvonko decided to relax with sports. For this purpose he stocked up on carrot juice and peanuts, and dived onto the couch, ready to watch the next tennis match on television. 이런 목적으로 그는 당근 쥬스를 stock

While the two players are warming up, their statistics pop up on the screen. Zvonko noticed that the match history of the players contained invalid results. He had a brilliant idea where you write him a program that checks the validity of results, 그가 기막힌 생각을 가졌다. 당신은 그에게 프로그램을 which he will then sell to the record keepers and enjoy a leisurely life.

A tennis match consists of sets, each set consisting of games. The following rules apply: 테니스 시합이 set 로 이루어지고 각 세트가 게임으로 이루어지고 다음 룰은 적용된다.

• A player wins a set if he has 6 or more games and at least two games more than his opponent. 플레이어는 세트를 이긴다. 그가 6 게임 이상을 가져간다면 그리고 적어도 두
• Additionally, if the result is 6:6 in the first or second set (but not the third set), a single final game is played to determine the winner of the set (the tie-break game). 또한 첫세트와두 세트가 6:6 이라면 (3 세트는 아님), 마지막 싱글 게임은 승자를 결정하기 ..(타이 브레이크 게임)
• The match ends when either player has won 2 sets. That player is the winner. 시합은 끝난다. 각 선수가 2 세트를 이기면 . 해당 플레이어가 승자이다.

Write a program that checks the validity of all matches between two players. 두 선수사이의 모든 시합의 유효성을 검증하는 프로그램을 작성하시오.

While the two players are warming up, their statistics pop up on the screen. Zvonko noticed that the match history of the players contained invalid results. He had a brilliant idea where you write him a program that checks the validity of results, which he will then sell to the record keepers and enjoy a leisurely life.

A tennis match consists of sets, each set consisting of games. The following rules apply:

• A player wins a set if he has 6 or more games and at least two games more than his opponent.
• Additionally, if the result is 6:6 in the first or second set (but not the third set), a single final game is played to determine the winner of the set (the tie-break game).
• The match ends when either player has won 2 sets. That player is the winner.

Write a program that checks the validity of all matches between two players.

입력

• The first line of input contains the names of the two players separated by a single space. Both names will be strings of at most 20 lowercase letters of the English alphabet. The names will be different.
• The second line contains an integer N (1 ≤ N ≤ 50), how many matches the two players have played. Each of the following N lines contains the result of a single match, composed of the results of a number of sets separated by single spaces. Each match result will contain between 1 and 5 sets.

출력

입출력 예

input 

sampras agassi 
6 
6:2 6:4 
3:6 7:5 2:6 
6:5 7:4 
7:6 7:6 
6:2 3:6 
6:2 1:6 6:8 

output 

da 
da 
ne 
da 
ne 
da 

input 

federer roddick 
1 
2:6 4:6 

output 

ne 

출처:coci/2006-2007/contest5 3