#include <bits/stdc++.h>
using namespace std;
namespace mcmf {
const int MAX = 1000010;
const long long INF = 1LL << 60;
long long cap[MAX], flow[MAX], cost[MAX], dis[MAX];
int n, m, s, t, Q[10000010], adj[MAX], link[MAX], last[MAX], from[MAX],
    visited[MAX];
void init(int nodes, int source, int sink) {
  m = 0, n = nodes, s = source, t = sink;
  for (int i = 0; i <= n; i++) last[i] = -1;
}
int addEdge(int u, int v, long long c, long long w) {
  adj[m] = v, cap[m] = c, flow[m] = 0, cost[m] = +w, link[m] = last[u],
  last[u] = m++;
  adj[m] = u, cap[m] = 0, flow[m] = 0, cost[m] = -w, link[m] = last[v],
  last[v] = m++;
  return m - 2;
}
bool spfa() {
  int i, j, x, f = 0, l = 0;
  for (i = 0; i <= n; i++) visited[i] = 0, dis[i] = INF;
  dis[s] = 0, Q[l++] = s;
  while (f < l) {
    i = Q[f++];
    for (j = last[i]; j != -1; j = link[j]) {
      if (flow[j] < cap[j]) {
        x = adj[j];
        if (dis[x] > dis[i] + cost[j]) {
          dis[x] = dis[i] + cost[j], from[x] = j;
          if (!visited[x]) {
            visited[x] = 1;
            if (f && rand() & 7)
              Q[--f] = x;
            else
              Q[l++] = x;
          }
        }
      }
    }
    visited[i] = 0;
  }
  return (dis[t] != INF);
}
pair<long long, long long> solve() {
  int i, j;
  long long mincost = 0, maxflow = 0;
  while (spfa()) {
    long long aug = INF;
    for (i = t, j = from[i]; i != s; i = adj[j ^ 1], j = from[i]) {
      aug = min(aug, cap[j] - flow[j]);
    }
    for (i = t, j = from[i]; i != s; i = adj[j ^ 1], j = from[i]) {
      flow[j] += aug, flow[j ^ 1] -= aug;
    }
    maxflow += aug, mincost += aug * dis[t];
  }
  return make_pair(mincost, maxflow);
}
}  // namespace mcmf
const int N = 152;
int out[N];
bool edge[N][N];
int id[N][N];
int main() {
  int n, m;
  cin >> n >> m;
  int total = n * n + 2 * n + 2;
  int source = 0, sink = total - 1;
  mcmf::init(total, source, sink);
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    edge[u][v] = 1;
    out[u]++;
  }
  int cur = 2 * n;
  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++) {
      if (edge[i][j] || edge[j][i]) continue;
      id[i][j] = mcmf::addEdge(i, cur + 1, 1, 0);
      id[j][i] = mcmf::addEdge(j, cur + 1, 1, 0);
      mcmf::addEdge(cur + 1, cur + 2, 1, 0);
      mcmf::addEdge(cur + 2, n + i, 1, 0);
      mcmf::addEdge(cur + 2, n + j, 1, 0);
      cur += 2;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = out[i] + 1; j <= n - 1; j++)
      mcmf::addEdge(source, i, 1, 2 * j - 1);
    mcmf::addEdge(n + i, sink, n, 0);
  }
  mcmf::solve();
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (edge[i][j])
        cout << 1;
      else if (i == j || edge[j][i])
        cout << 0;
      else if (mcmf::flow[id[i][j]])
        cout << 1;
      else
        cout << 0;
    }
    cout << endl;
  }
}
