#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int s = 0, t = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') t = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
  return s * t;
}
const int N = 1305;
const int Inf = (1 << 30);
int n, m, cnt = 1, tot, S, T, Ans;
int deg[51], R[51][51], p[51][51], h[N], d[N], vis[N], pre[N];
struct edge {
  int to, nxt, v, w;
} e[N * 10];
void Add(int x, int y, int v, int w) {
  e[++cnt] = (edge){y, h[x], v, w};
  h[x] = cnt;
  e[++cnt] = (edge){x, h[y], 0, -w};
  h[y] = cnt;
}
bool SPFA() {
  queue<int> q;
  for (int i = 1; i <= tot; i++) pre[i] = 0, d[i] = Inf;
  q.push(S), vis[S] = 1, d[S] = 0;
  while (q.size()) {
    int x = q.front();
    q.pop(), vis[x] = 0;
    for (int i = h[x]; i; i = e[i].nxt) {
      int y = e[i].to;
      if (e[i].v && d[x] + e[i].w < d[y]) {
        pre[y] = i, d[y] = d[x] + e[i].w;
        if (!vis[y]) vis[y] = 1, q.push(y);
      }
    }
  }
  return d[T] != Inf;
}
void Adjust() {
  for (int i = 0, x = T; x != S; x = e[i ^ 1].to)
    i = pre[x], e[i].v--, e[i ^ 1].v++;
}
int main() {
  tot = n = read(), m = read();
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    R[x][y] = 1, deg[x]++;
  }
  S = ++tot, T = ++tot;
  for (int i = 1; i <= n; i++)
    for (int j = deg[i]; j < n; j++) Add(i, T, 1, j);
  for (int x = 1; x <= n; x++)
    for (int y = x + 1; y <= n; y++)
      if (!R[x][y] && !R[y][x]) {
        tot++, Add(S, tot, 1, 0);
        Add(tot, x, 1, 0), p[x][y] = cnt, Add(tot, y, 1, 0);
      }
  while (SPFA()) Adjust();
  for (int x = 1; x <= n; x++)
    for (int y = x + 1; y <= n; y++)
      if (!R[x][y] && !R[y][x]) {
        if (e[p[x][y]].v)
          R[x][y] = 1;
        else
          R[y][x] = 1;
      }
  for (int i = 1; i <= n; i++, puts(""))
    for (int j = 1; j <= n; j++) putchar('0' + R[i][j]);
  return 0;
}
