#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
bool has_issue(long long int a, long long int b, long long int c,
               long long int d) {
  if (a < b) {
    if (gcd(a, b) != 1) return true;
  } else {
    if (gcd(b, a) != 1) return true;
  }
  if (a < c) {
    if (gcd(a, c) != 1) return true;
  } else {
    if (gcd(c, a) != 1) return true;
  }
  if (a < d) {
    if (gcd(a, d) != 1) return true;
  } else {
    if (gcd(d, a) != 1) return true;
  }
  return false;
}
int main() {
  long long int n, k, m = -100000;
  cin >> n >> k;
  vector<vector<long long int> > ans(n);
  long long int eve = 2, odd = 1;
  for (int i = 0; i < n; ++i) {
    ans[i].push_back(odd * k);
    odd += 2;
    while (has_issue(eve, odd - 2, odd, odd + 2)) eve += 2;
    ans[i].push_back(eve * k);
    eve += 2;
    ans[i].push_back(odd * k);
    odd += 2;
    ans[i].push_back(odd * k);
    odd += 2;
    if (ans[i][1] > ans[i][3])
      m = ans[i][1];
    else
      m = ans[i][3];
  }
  cout << m << "\n";
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < 4; ++j) {
      cout << ans[i][j] << " ";
    }
    cout << "\n";
  }
  return 0;
}
