You are going to hold a competition of one-to-one game called AtCoder Janken. _(Janken is the Japanese name for Rock-paper-scissors.)_ N players will participate in this competition, and they are given distinct integers from 1 through N. The arena has M playing fields for two players. You need to assign each playing field two distinct integers between 1 and N (inclusive). You cannot assign the same integer to multiple playing fields. The competition consists of N rounds, each of which proceeds as follows:    * For each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.   * Then, each player adds 1 to its integer. If it becomes N+1, change it to 1.  You want to ensure that no player fights the same opponent more than once during the N rounds. Print an assignment of integers to the playing fields satisfying this condition. It can be proved that such an assignment always exists under the constraints given.
import sys

sys.setrecursionlimit(100000000)


def main():
    n, m = map(int, input().split())

    init = int(n / 2)
    res_list = [(init, init + 1)]
    for i in range(1, m):
        res_list.append((init - i, init + 1 + i))

    for l in res_list:
        print(l)


main()

import sys

sys.setrecursionlimit(100000000)


def main():
    n, m = map(int, input().split())
    res = []
    
    if m % 2 == 0:
        half_m = int(m / 2)
        for i in range(half_m):
            res.append((half_m - i, half_m + 1 + i))
            res.append((m + half_m - i, m + half_m + 2 + i))
    else:
        half_m = int(m / 2)
        for i in range(half_m):
            res.append((half_m - i, half_m + 2 + i))
            res.append((m + half_m + 1 - i, m + half_m + 2 + i))
        res.append((m + 1, m + 2 * half_m + 2))

    for r in res:
        print(str(r[0]) + " " + str(r[1]))


main()
