#include <bits/stdc++.h>
using namespace std;
struct rankSet {
  long a, b, c, d;
};
long long gcd(long long a, long long b) {
  if (a > b) {
    long long temp = a;
    a = b;
    b = temp;
  }
  long long c = b % a;
  while (c) {
    b = a;
    a = c;
    c = b % a;
  }
  return a;
}
rankSet getNext(long long firstValidVal) {
  long long a = firstValidVal + 1 - firstValidVal % 2;
  long long b = a + 2;
  long long c = a + 4;
  long long d = firstValidVal + firstValidVal % 2;
  while (gcd(a, d) != 1 || gcd(b, d) != 1 || gcd(c, d) != 1) d += 2;
  rankSet r;
  r.a = a;
  r.b = b;
  r.c = c;
  r.d = d;
  return r;
}
int main() {
  long test_case = 0;
  long long n, k;
  cin >> n >> k;
  rankSet r[10100];
  long long firstvalidVal = 1;
  for (long long i = 0; i < n; i++) {
    r[i] = getNext(firstvalidVal);
    if (r[i].c > r[i].d)
      firstvalidVal = r[i].c + 1;
    else
      firstvalidVal = r[i].d + 1;
  }
  cout << (firstvalidVal - 1) * k << endl;
  for (long long i = 0; i < n; i++) {
    cout << r[i].a * k << " " << r[i].b * k << " " << r[i].c * k << " "
         << r[i].d * k << endl;
  }
  return 0;
}
