#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define int      long long int
#define MOD      998244353
#define pb       push_back
#define pf       push_front
#define vi       vector<int>
#define mi       map<int,int>
#define umi      unordered_map<int,int>
#define pii      pair<int,int>
#define ff       first
#define ss       second
#define inf      1e18
#define case    int test;cin>>test;while(test--)
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int powm(int x, int y, int m = MOD) {
	x = x % m; int res = 1; while (y)
	{if (y & 1)res = res * x; res %= m; y = y >> 1; x = x * x; x %= m;} return res;
}
int modi(int a, int m = MOD) {return powm(a, m - 2, m);}
void pre()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}
int32_t main()
{	pre();
//case
	{	int n, m;
		cin >> n >> m;
		int a[n][m];
		for (int i = 0; i < n; i++)
			for (int j = 0; j < m; j++)
				cin >> a[i][j];
		int vl = 720720;
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < m; j++)
			{
				if ((i + j) % 2 == 0)
					cout << vl << " ";
				else
				{
					cout << vl + pow(a[i][j], 4) << " ";
				}
			}
			cout << endl;
		}
	}
	return 0;
}