Codeforces Round #342 (Div. 2) C

C. K-special Tables

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Input

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.

Output

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.

Sample test(s)

Input

4 1

Output

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

Input

5 3

Output

85
5 6 17 18 19
9 10 23 24 25
7 8 20 21 22
3 4 14 15 16
1 2 11 12 13

题意：1~n*n 排列在n*n的矩阵 要求每个数字出现一次
每行递增 第k列的和尽可能的大
题解：模拟 以第k列为分界线 左边为 1~n*（k-1）的排列
   右边为n*(k-1)+1~n*n 的排列
简单模拟

#include<iostream>
#include<cstdio>
#include<cstring>
#define LL __int64
using namespace std;
int n,k;
int main()
{
    scanf("%d%d",&n,&k);
    int exm;
    int ans=0;
    exm=n*(k-1);
    int gg=1,ggg=exm+1;
    for(int i=exm+1;i<=n*n;i=i+n-k+1)
        ans+=i;
    printf("%d
",ans);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<k;j++)
        {
            if(j==1)
                printf("%d",gg);
            else
            printf(" %d",gg);
            gg++;
        }
        for(int j=k;j<=n;j++)
        {
            if(j==1)
                printf("%d",ggg);
            else
            printf(" %d",ggg);
            ggg++;
        }
        printf("
");
    }
    return 0;
}