#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double PI = acos(-1.);
const long long MOD = 1000000007;
vector<int> G[10005];
int main() {
  int i, j, k, _T = 0;
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    for (i = 1; i <= n; i++) G[i].clear();
    G[1].push_back(1);
    G[1].push_back(2);
    G[1].push_back(3);
    G[1].push_back(5);
    int j = 4;
    for (i = 2; i <= n; i++) {
      G[i].push_back(j), G[i].push_back(6 * i - 5), G[i].push_back(6 * i - 3),
          G[i].push_back(6 * i - 1);
      j += 2;
      if (j % 3 == 0) j += 2;
    }
    int f = 0;
    for (i = 1; i <= n; i++)
      for (j = 0; j < G[i].size(); j++) f = max(f, G[i][j]);
    cout << f * m << "\n";
    for (i = 1; i <= n; i++, cout << "\n")
      for (j = 0; j < G[i].size(); j++) cout << G[i][j] * m << " ";
  }
  return 0;
}
