영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
Problem
(그림은 원문 저장소에서 볼 수 있습니다)
If you want to organize, for example, a table hockey tournament where everyone plays against everyone, you can use a practical rotation scheme called round robin. The players, numbered from 1 to n, sit around a table (we assume that the number of players n is even), and each player plays against the player sitting directly across the table. When a round is over, every player moves one seat clockwise, except the player in the lower left corner, who stays put and is skipped over (hence the name: you move “round Robin”, Robin being the last player). With this rotation scheme, everyone is guaranteed to have played everyone else exactly once after n-1 rounds.
Your task is to write a program that prints which players play against each other in a given round.
Input
The input consists of a single line with two integers n and k (2 ≤ n ≤ 100, 1 ≤ k ≤ n-1, n is even), the number of players in the tournament and the round.
Output
Print n/2 lines describing who plays against whom in round k. Each line should be of the form a-b, where a and b are the numbers of two players who play against each other. The matches may be printed in any order.
예제
예제 1
8 3
6-8 7-5 1-4 2-3