#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, m; cin >> n >> m;
  vector a(1 << n, vector(1 << m, 0));
  for (int i = 0, a_ij = 0; i < (1 << n); i += 2) {
    for (int j = 0; j < (1 << m); j += 2) {
      a[i][j] = a_ij++;
      a[i][j + 1] = a_ij++;
      a[i + 1][j] = a_ij++;
      a[i + 1][j + 1] = a_ij++;
    }
  }
  for (const vector<int>& a_i : a) {
    REP(j, 1 << m) cout << a_i[j] << " \n"[j + 1 == (1 << m)];
  }
  return 0;
}