#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <iterator>
#include <set>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cctype>
#include <string>
#include <cassert>
#include <set>
#include <bitset>
#include <unordered_set>
#include <numeric>
#define all(a) a.begin(), a.end()
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define ppi pair<int,pair<int,int>>
#define int int64_t
using namespace std;
// /\_/\
// (= ._.)
// / > \>
// encouraging cat
const int INF = 10000000000000000;
//const int mod = 1000000007;
const int mod = 998244353;
const int MAXN = 200005;
//ifstream fin('xor.in');
//ofstream fout('xor.out');
signed main()
{
int t,n,ka,kb;
cin >> t >> n >> ka >> kb;
vector<vector<int>> grid(n, vector<int> (n,0));
vector<int> line(n,0);
int sx = 0;
for (int i = 0;i < n;i++)
{
for (int j = 0;j < n;j++)
{
cin >> grid[i][j];
if (grid[i][j] == 0)
{
line[i]++;
sx += j;
}
}
}
int res = 0;
vector<int> incoming(n,0);
for (int i = n - 1;i >= 1;i--)
{
if (line[i] > line[i - 1])
{
int ops = (line[i] - line[i - 1] + 1) / 2;
line[i - 1] += ops;
line[i] -= ops;
incoming[i - 1] += ops;
}
}
for (int i = 0;i < n - 1;i++)
{
if (line[i] >= n)
{
line[i + 1] += line[i] - n;
line[i] = n;
}
}
vector<vector<int>> ans(n, vector<int> (n,1));
for (int i = 0;i < n;i++)
{
for (int j = 0;j < line[i];j++)
{
ans[i][j] = 0;
}
}
for (int i = 0;i < n - 1;i++)
{
if (line[i] < line[i + 1])
{
assert(false);
}
}
for (int i = 0;i < n;i++)
{
for (int j = 0;j < n;j++)
{
cout << ans[i][j] << " ";
}
cout << '\n';
}
return 0;
}
