CF625C.K-special Tables

People do many crazy things to stand out in a crowd. Some of them dance, some learn by heart rules of Russian language, some try to become an outstanding competitive programmers, while others collect funny math objects.

Alis is among these collectors. Right now she wants to get one of k-special tables. In case you forget, the table n × n is called k-special if the following three conditions are satisfied:

• every integer from 1 to _n_2 appears in the table exactly once;
• in each row numbers are situated in increasing order;
• the sum of numbers in the k-th column is maximum possible.

Your goal is to help Alice and find at least one k-special table of size n × n. Both rows and columns are numbered from 1 to n, with rows numbered from top to bottom and columns numbered from left to right.

人们为了在人群中脱颖而出，会做出许多疯狂的事情。有些人跳舞，有些人死记硬背俄语语法规则，有些人努力成为出色的竞赛程序员，而另一些人则热衷于收集有趣的数学对象。

阿莉斯（Alis）正是这样一位收藏家。目前，她想获得一张 k-特殊表（k-special table）。如果你忘了定义，那么一个 n × n 的表格被称为 k-特殊表，当且仅当满足以下三个条件：

• 从 1 到 _n_² 的每个整数在表中恰好出现一次；
• 每一行中的数字从左到右严格递增；
• 第 k 列中所有数字之和达到可能的最大值。

你的目标是帮助阿莉斯，构造出至少一张大小为 n × n 的 k-特殊表。行与列均从 1 编号至 n，其中行号从上到下递增，列号从左到右递增。

The first line of the input contains two integers n and k (1 ≤ n ≤ 500, 1 ≤ k ≤ n) — the size of the table Alice is looking for and the column that should have maximum possible sum.

输入的第一行包含两个整数 $n$ 和 $k$（$1 \leq n \leq 500$，$1 \leq k \leq n$）—— 分别表示 Alice 所寻找的表格的大小，以及应具有最大可能和的列号。

First print the sum of the integers in the k-th column of the required table.

Next n lines should contain the description of the table itself: first line should contains n elements of the first row, second line should contain n elements of the second row and so on.

If there are multiple suitable table, you are allowed to print any.

首先输出所要求表格中第 $k$ 列所有整数的和。

接下来的 $n$ 行应描述该表格本身：第一行包含第一行的 $n$ 个元素，第二行包含第二行的 $n$ 个元素，依此类推。

若存在多个满足条件的表格，输出任意一个即可。