CF244A Dividing Orange

One day Ms Swan bought an orange in a shop. The orange consisted of $ n·k $ segments, numbered with integers from 1 to $ n·k $ . There were $ k $ children waiting for Ms Swan at home. The children have recently learned about the orange and they decided to divide it between them. For that each child took a piece of paper and wrote the number of the segment that he would like to get: the $ i $ -th $ (1

The first line contains two integers $ n $ , $ k $ $ (1

Print exactly $ n·k $ distinct integers. The first $ n $ integers represent the indexes of the segments the first child will get, the second $ n $ integers represent the indexes of the segments the second child will get, and so on. Separate the printed numbers with whitespaces. You can print a child's segment indexes in any order. It is guaranteed that the answer always exists. If there are multiple correct answers, print any of them.