#include <bits/stdc++.h>
using namespace std;
using vii = vector<vector<int>>;
using vi = vector<int>;
using mii = map<int, int>;
const double Eps = 1e-8;
const int Inf = 1e9 + 9;
const int Mod = 998244353;
const int N = 5e5 + 9;
const int dx4[4] = {0, 1, 0, -1};
const int dy4[4] = {-1, 0, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dy8[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
constexpr double pi = 3.141592653589793238462643383279502884L;
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
void prime_siever(long long p) {
  bool prime[p + 9];
  for (long long i = 2; i * i <= p; i++)
    if (prime[i] == 0)
      for (long long j = i * i; j <= p; j += i) prime[j] = 1;
}
int mul(int a, int b) { return (1LL * a * b) % Mod; }
int add(int a, int b) {
  a += b;
  if (a >= Mod) a -= Mod;
  if (a < 0) a += Mod;
  return a;
}
long long bin_power(long long a, long long n) {
  if (a == 0) return 0;
  long long res = 1;
  while (n) {
    if (n % 2) {
      res = (res * a) % Mod;
      n--;
    } else {
      a = (a * a) % Mod;
      n /= 2;
    }
  }
  return res;
}
int countbi1(int x) {
  int cnt = 0;
  while (x > 0) {
    if (x & 1) cnt++;
    x /= 2;
  }
  return cnt;
}
void solve() {
  int r, c;
  cin >> r >> c;
  if (r == 1 && c == 1) {
    cout << 0 << '\n';
    return;
  }
  if (r > c) {
    for (int i = 1; i <= r; i++) {
      for (int j = 1; j <= c; j++) cout << (i + c) * j << " ";
      cout << '\n';
    }
  } else {
    for (int i = 1; i <= r; i++) {
      for (int j = 1; j <= c; j++) cout << i * (r + j) << " ";
      cout << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
