#include <bits/stdc++.h>
using namespace std;
const int MAXN = -1;
int n, k;
vector<vector<int>> ans;
set<int> S;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool puedo(vector<int> &V, int v) {
  for (int i = (0); i < (int)(V.size()); i++)
    if (gcd(V[i], v) != 1) return false;
  return true;
}
void insertar(int v) {
  for (auto p : S) {
    if (puedo(ans[p], v)) {
      ans[p].push_back(v);
      S.erase(p);
      return;
    }
  }
}
int main() {
  while (scanf("%d %d", &n, &k) == 2) {
    printf("%lld\n", (long long)(6 * n - 1) * k);
    for (int a = (0); a < (int)(n); a++) {
      long long p = 6 * a + 1;
      p *= k;
      long long q = 6 * a + 2;
      q *= k;
      long long r = 6 * a + 3;
      r *= k;
      long long s = 6 * a + 5;
      s *= k;
      printf("%lld %lld %lld %lld\n", p, q, r, s);
    }
  }
  return 0;
}
