#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const double PI = 2 * acos(0.0);
void solve() {
  long long int n, k;
  cin >> n >> k;
  vector<long long int> v;
  v = {1, 3, 4, 5};
  long long int odd = 7;
  for (long long int i = 1; i < n; i++) {
    v.push_back(odd);
    v.push_back(odd + 2);
    v.push_back(odd + 3);
    v.push_back(odd + 4);
    odd += 6;
  }
  cout << (odd - 2) * k << endl;
  long long int ind = 0;
  for (long long int i = 0; i < n; i++) {
    cout << k * v[ind] << " " << k * v[ind + 1] << " " << k * v[ind + 2] << " "
         << k * v[ind + 3] << endl;
    ind += 4;
  }
}
int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
