#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC optimize("O4")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("tracer")
#pragma GCC target("sse2")
#pragma GCC target("sse3")
#pragma GCC target("popcnt")
#pragma GCC target("abm")
#pragma GCC target("mmx")
#pragma GCC target("tune=native")

namespace Competitive {
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define all(a) begin(a), end(a)
#define len(a) (int)a.size()
#define pb push_back
#define eb emplace_back
#define em emplace

void useiostream() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cout.setf(ios::fixed), cout.precision(20);
}

void drop(char const *bu) {
  printf("%s", bu);
  exit(0);
}

ull gcd(ull a, ull b) { return b == 0 ? a : gcd(b, a % b); }

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ld const pi = acos(-1.0L);
ld const eps = 1e-6;

template <typename T, typename TT>
bool mi(T &a, TT b) {
  return a > b ? (a = b, true) : false;
}
template <typename T, typename TT>
bool ma(T &a, TT b) {
  return a < b ? (a = b, true) : false;
}

auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 ran(seed);

int Mod[] = {1000000007, 1052339657, 998244353};
int const mod = 1000000007;

}  // namespace Competitive

using namespace Competitive;

int n, m;
int arr[505][505];

ll lcm(vector<ll> a) {
  if (len(a) == 2) return lcm(a[0], a[1]);
  auto t = a.back();
  a.pop_back();
  return lcm(t, lcm(a));
}

int main(int argc, char *args[]) {
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  useiostream();
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> arr[i][j];
    }
  }
  vector<ll> a;
  for (int i = 1; i <= 16; i++) a.pb(i);
  ll t = lcm(a);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      if (i + j & 1) {
        cout << t + arr[i][j] * arr[i][j] * arr[i][j] * arr[i][j];
      } else {
        cout << t;
      }
      cout << " ";
    }
    cout << "\n";
  }
  return 0;
}