Dividing Orange

题意翻译

## 题目描述 有一个橙子，分成 $n⋅k$ 瓣，编号为 $1,2,3,\cdots n\cdot k$。现在要分给 $k$ 个小孩，以下是给橙子的规则： - 每个小孩得到 $n$ 瓣橙子。 - 第 $i$ 个小孩有一个对橙子的要求：$a_i$，即他得到的橙子瓣中必须有编号为 $a_i$ 的橙子瓣。 保证没有两个小孩的 $a_i$ 相同。 ## 输入格式 第一行有两个整数 $n,k$ $(1\le n,k\le 30)$ 第二行有 $k$ 个整数 $a_1,a_2,...,a_k$ $(1\le a_i\le n⋅k)$ ## 输出格式 输出一个 $n⋅k$ 的矩阵，即橙子分割后的编号矩阵，答案可能有多个解，输出其中一个即可 翻译者：[LYR_](https://www.luogu.com.cn/user/110319)

题目描述

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<=i<=k) $ child wrote the number $ a_{i} $ $ (1<=a_{i}<=n·k) $ . All numbers $ a_{i} $ accidentally turned out to be different. Now the children wonder, how to divide the orange so as to meet these conditions: - each child gets exactly $ n $ orange segments; - the $ i $ -th child gets the segment with number $ a_{i} $ for sure; - no segment goes to two children simultaneously. Help the children, divide the orange and fulfill the requirements, described above.

输入输出格式

输入格式

The first line contains two integers $ n $ , $ k $ $ (1<=n,k<=30) $ . The second line contains $ k $ space-separated integers $ a_{1},a_{2},...,a_{k} $ $ (1<=a_{i}<=n·k) $ , where $ a_{i} $ is the number of the orange segment that the $ i $ -th child would like to get. It is guaranteed that all numbers $ a_{i} $ are distinct.

输出格式

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.

输入输出样例

输入样例 #1

2 2
4 1

输出样例 #1

2 4 
1 3 

输入样例 #2

3 1
2

输出样例 #2

3 2 1 

题意翻译

## 题目描述 有一个橙子，分成 $n⋅k$ 瓣，编号为 $1,2,3,\cdots n\cdot k$。现在要分给 $k$ 个小孩，以下是给橙子的规则： - 每个小孩得到 $n$ 瓣橙子。 - 第 $i$ 个小孩有一个对橙子的要求：$a_i$，即他得到的橙子瓣中必须有编号为 $a_i$ 的橙子瓣。 保证没有两个小孩的 $a_i$ 相同。 ## 输入格式 第一行有两个整数 $n,k$ $(1\le n,k\le 30)$ 第二行有 $k$ 个整数 $a_1,a_2,...,a_k$ $(1\le a_i\le n⋅k)$ ## 输出格式 输出一个 $n⋅k$ 的矩阵，即橙子分割后的编号矩阵，答案可能有多个解，输出其中一个即可 翻译者：[LYR_](https://www.luogu.com.cn/user/110319)