#include <bits/stdc++.h>
using namespace std;
vector<int> vec[10010];
int ID;
int ord[100];
bool OK;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
void DFS(int dp, int pre, int st) {
  if (OK) return;
  if (dp == 5) {
    OK = 1;
    int i;
    for (i = 1; i <= 4; i++) vec[ID].push_back(ord[i]);
    return;
  }
  int i, j;
  for (i = pre - 1; i >= st; i--) {
    for (j = 1; j < dp; j++)
      if (gcd(ord[j], i) != 1) break;
    if (j == dp) {
      ord[dp] = i;
      DFS(dp + 1, i, st);
    }
  }
}
bool ok(int st, int en) {
  ord[1] = en;
  OK = 0;
  DFS(2, en, st);
  if (OK) return 1;
  return 0;
}
void prepare() {
  int i, now, gas;
  now = 1;
  for (ID = 1; ID <= 10000; ID++) {
    gas = 3;
    while (1) {
      if (ok(now, now + gas)) break;
      gas++;
    }
    now = now + gas + 1;
  }
}
int main() {
  int n, k, i, j, sz;
  prepare();
  scanf("%d %d", &n, &k);
  printf("%d\n", vec[n][0] * k);
  for (i = 1; i <= n; i++) {
    printf("%d", vec[i][0] * k);
    for (j = 1; j < 4; j++) printf(" %d", vec[i][j] * k);
    puts("");
  }
  return 0;
}
