#include <bits/stdc++.h>
using namespace std;
const int N = 500 + 7;
const long long INF = 2e18 + 7;
const double EPS = 1e-15;
const int P = 37;
const long long MOD = 1e9 + 7;
int fx[] = {1, -1, 0, 0, 1, 1, -1, -1};
int fy[] = {0, 0, 1, -1, -1, 1, -1, 1};
vector<int> z_function(string s) {
  int n = (int)s.length();
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
string s, t;
int n, m;
vector<int> z;
int ans;
int a[505][505];
int main() {
  int n, k;
  long long ans = 0;
  cin >> n >> k;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (j == k) ans += (k - 1) * n + 1 + (i - 1) * (n - k + 1);
  cout << ans << endl;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (j < k)
        a[i][j] = (i - 1) * (k - 1) + j;
      else if (j == k)
        a[i][j] = (k - 1) * n + 1 + (i - 1) * (n - k + 1);
      else
        a[i][j] = a[i][k] + (j - k);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) cout << a[i][j] << ' ';
    cout << endl;
  }
  return 0;
}
