#include <bits/stdc++.h>
using namespace std;
const int maxn = 3000;
const int maxm = 100010;
const int INF = 0x3f3f3f3f;
struct Edge {
  int to, next, cap, flow, cost;
} edge[maxm];
int head[maxn], tol;
int pre[maxn], dis[maxn];
bool vis[maxm];
int N;
void init(int n) {
  N = n;
  tol = 0;
  memset(head, -1, sizeof(head));
}
void addedge(int u, int v, int cap, int cost) {
  edge[tol].to = v;
  edge[tol].cap = cap;
  edge[tol].cost = cost;
  edge[tol].flow = 0;
  edge[tol].next = head[u];
  head[u] = tol++;
  edge[tol].to = u;
  edge[tol].cap = 0;
  edge[tol].cost = -cost;
  edge[tol].flow = 0;
  edge[tol].next = head[v];
  head[v] = tol++;
}
bool spfa(int s, int t) {
  queue<int> q;
  for (int i = 0; i < N; ++i) {
    dis[i] = INF;
    vis[i] = false;
    pre[i] = -1;
  }
  dis[s] = 0;
  vis[s] = true;
  q.push(s);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    vis[u] = false;
    for (int i = head[u]; i != -1; i = edge[i].next) {
      int v = edge[i].to;
      if (edge[i].cap > edge[i].flow && dis[v] > dis[u] + edge[i].cost) {
        dis[v] = dis[u] + edge[i].cost;
        pre[v] = i;
        if (!vis[v]) {
          vis[v] = true;
          q.push(v);
        }
      }
    }
  }
  if (pre[t] == -1)
    return false;
  else
    return true;
}
int minCostMaxflow(int s, int t, int &cost) {
  int flow = 0;
  cost = 0;
  while (spfa(s, t)) {
    int Min = INF;
    for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to]) {
      if (Min > edge[i].cap - edge[i].flow) Min = edge[i].cap - edge[i].flow;
    }
    for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to]) {
      edge[i].flow += Min;
      edge[i ^ 1].flow -= Min;
      cost += edge[i].cost * Min;
    }
    flow += Min;
  }
  return flow;
}
int n, m;
char s[55][55];
int main() {
  scanf("%d %d", &n, &m);
  init(n * n + 2 * n + 2);
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) s[i][j] = '0';
  while (m--) {
    int u, v;
    scanf("%d %d", &u, &v);
    s[u - 1][v - 1] = '1';
  }
  for (int i = 0; i < n; ++i) addedge(n * 2 + n * n, i, INF, 0);
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      if (s[i][j] == '1' || s[j][i] == '1') continue;
      addedge(n + i, 2 * n + i * n + j, 1, 0);
      addedge(n + j, 2 * n + i * n + j, 1, 0);
      addedge(2 * n + i * n + j, 2 * n + n * n + 1, 1, 0);
    }
  }
  for (int i = 0; i < n; ++i) {
    int k = 0;
    for (int j = 0; j < n; ++j)
      if (s[i][j] == '1') k++;
    for (int j = 0; j < n; ++j) {
      if (j == i || s[i][j] == '1' || s[j][i] == '1') continue;
      k++;
      addedge(i, i + n, 1, 2 * k - 1);
    }
  }
  minCostMaxflow(n * n + 2 * n, n * n + 2 * n + 1, m);
  for (int i = 0; i < n; ++i) {
    for (int o = head[i + n]; ~o; o = edge[o].next) {
      if (edge[o].cap == 1 && edge[o].flow == 1) {
        int j = edge[o].to - n * 2;
        j = (j / n) ^ (j % n) ^ i;
        s[i][j] = '1';
      }
    }
  }
  for (int i = 0; i < n; ++i) printf("%s\n", s[i]);
}
