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 n2 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.

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.

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.

4 1

5 3

28
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16

28
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16

题意：

输出一个的n*n方阵，使得其每行为上升序列，方阵中1~n²的数字每个只能出现一次，方阵的第k列的和要最大

题解:

从样例出发，5*5的方阵中，使得第三列的和最大，倒过来看，为了满足上升序列，最后一行的倒三个数最大只能为23，倒二行的倒三个数只能为20，依此类推。剩下的未填数的格子，填入符合要求的数字即可

#include<bits/stdc++.h>using namespace std;int main(){	int n,k;	scanf("%d%d",&n,&k);	int x = 1,y = n*n - (n - k + 1) * n + 1;	printf("%d\n",y*n+(n-k+1)*n*(n-1)/2);	for (int i = 0;i < n;i++)	{		for (int u = 0;u < k - 1;u++)	u?printf(" %d",x++):printf("%d",x++);		for (int u = k - 1;u < n;u++)	u?printf(" %d",y++):printf("%d",y++);		printf("\n");			}	return 0;}