#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
using namespace std;
long long powmod(long long a, long long b, long long mod) {
  if (b == 0 || a == 1) {
    if (mod == 1)
      return 0;
    else
      return 1;
  }
  if (b % 2 == 0) {
    long long k = powmod(a, b / 2, mod);
    return (k * k) % mod;
  } else {
    long long k = powmod(a, b / 2, mod);
    return ((k * k) % mod * a) % mod;
  }
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  if (b == 0) return a;
  if (a > b)
    return gcd(a % b, b);
  else
    return gcd(b % a, a);
}
long long prime(long long p) {
  for (long long i = 2; i * i <= p; i++) {
    if (p % i == 0 && i < p) return i;
  }
  return 1;
}
long long inv(long long a, long long mod) { return powmod(a, mod - 2, mod); }
void solve(long long ppppppppp = 1) {
  long long a, b;
  cin >> a >> b;
  if (a + b == 2) {
    cout << 0;
    return;
  }
  if (a == 1) {
    for (long long i = 0; i < b; i++) cout << i + 2 << " ";
    return;
  }
  if (b == 1) {
    for (long long i = 0; i < a; i++) cout << i + 2 << " ";
    return;
  }
  for (long long i = 0; i < a; i++) {
    for (long long j = 0; j < b; j++) cout << (i + 1) * (a + j + 1) << " ";
    cout << "\n";
  }
  return;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long tututu;
  tututu = 1;
  for (long long qwerty = 0; qwerty < tututu; qwerty++) solve();
  return 0;
}
