Problem: During the break, we decided to relax and play dominoes. Our box with Domino was empty, so we decided to borrow the teacher's dominoes.

The teacher responded instantly at our request. He put nm dominoes on the table as an n × 2m rectangle so that each of the n rows contained m dominoes arranged horizontally. Each half of each domino contained number (0 or 1).

We were taken aback, and the teacher smiled and said: "Consider some arrangement of dominoes in an n × 2m matrix. Let's count for each column of the matrix the sum of numbers in this column. Then among all such sums find the maximum one. Can you rearrange the dominoes in the matrix in such a way that the maximum sum will be minimum possible? Note that it is prohibited to change the orientation of the dominoes, they all need to stay horizontal, nevertheless dominoes are allowed to rotate by 180 degrees. As a reward I will give you all my dominoes".

We got even more taken aback. And while we are wondering what was going on, help us make an optimal matrix of dominoes.

Input

The first line contains integers n, m (1 ≤ n, m ≤ 103).

In the next lines there is a description of the teachers' matrix. Each of next n lines contains m dominoes. The description of one domino is two integers (0 or 1), written without a space — the digits on the left and right half of the domino.

Output

Print the resulting matrix of dominoes in the format: n lines, each of them contains m space-separated dominoes.

If there are multiple optimal solutions, print any of them.

Examples

Input

2 3
01 11 00
00 01 11


Output

11 11 10
00 00 01


Input

4 1
11
10
01
00


Output

11
10
01
00

Note

Consider the answer for the first sample. There, the maximum sum among all columns equals 1 (the number of columns is 6, and not 3). Obviously, this maximum can't be less than 1, then such matrix is optimal.

Note that the dominoes can be rotated by 180 degrees.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
const double EPS = 1e-8;
const double PI = acos(-1.0);
int popcount(int n) { return __builtin_popcount(n); }
int popcount(long long n) { return __builtin_popcountll(n); }
template <class T>
int SIZE(T a) {
  return a.size();
}
template <class T>
string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T>
T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++) res = (res * 10 + str[i] - '0');
  return res;
}
template <class T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
long long getTen(int a) { return (a <= 0) ? 1 : (getTen(a - 1) * 10); }
bool EQ(double a, double b) { return abs(a - b) < EPS; }
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0) res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}
int N, M;
string field[1001][1001];
int xs[1001] = {};
pair<int, int> costs[1001];
int main() {
  cin >> N >> M;
  int zz = 0, oz = 0, oo = 0;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) {
      string s;
      cin >> s;
      if (s == "00")
        zz++;
      else if (s == "11")
        oo++;
      else
        oz++;
    }
  }
  for (int i = 0; i < oo; i++) {
    int cy = i / M;
    int cx = i % M;
    field[cy][cx] = "11";
    xs[cx] = cy + 1;
    costs[cx] = pair<int, int>(costs[cx].first + 1, costs[cx].second + 1);
  }
  priority_queue<pair<pair<int, int>, int>, vector<pair<pair<int, int>, int> >,
                 greater<pair<pair<int, int>, int> > >
      pq;
  for (int i = 0; i < M; i++)
    if (xs[i] != N) pq.push(make_pair(costs[i], i));
  while (pq.size()) {
    pair<pair<int, int>, int> p = pq.top();
    pq.pop();
    const int idx = p.second;
    const pair<int, int> cost = p.first;
    if (oz > 0) {
      if (cost.first > cost.second) {
        costs[idx].second++;
        field[xs[idx]][idx] = "01";
      } else {
        costs[idx].first++;
        field[xs[idx]][idx] = "10";
      }
      if (xs[idx] != N) pq.push(make_pair(costs[idx], idx));
      oz--;
    } else {
      costs[idx].second++;
      costs[idx].first++;
      field[xs[idx]][idx] = "00";
      if (xs[idx] != N) pq.push(make_pair(costs[idx], idx));
    }
    xs[idx]++;
  }
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) cout << field[i][j] << " ";
    cout << endl;
  }
  return 0;
}