#include <bits/stdc++.h>
using namespace std;
const int maxn = 20100;
const int inf = 1 << 30;
struct edge {
  int from, to, cap, flow, cost;
  edge(int u, int v, int c, int f, int w)
      : from(u), to(v), cap(c), flow(f), cost(w) {}
};
struct MCMF {
  int n, m;
  vector<edge> edges;
  vector<int> G[maxn];
  int inq[maxn];
  int d[maxn];
  int p[maxn];
  int a[maxn];
  void init(int n) {
    this->n = n;
    for (int i = 0; i < n; ++i) G[i].clear();
    edges.clear();
  }
  void add_edge(int from, int to, int cap, int cost) {
    edges.push_back(edge(from, to, cap, 0, cost));
    edges.push_back(edge(to, from, 0, 0, -cost));
    m = edges.size();
    G[from].push_back(m - 2);
    G[to].push_back(m - 1);
  }
  bool BellmanFord(int s, int t, int& flow, int& cost, int limit) {
    for (int i = 0; i < n; ++i) d[i] = inf;
    memset(inq, 0, sizeof(inq));
    d[s] = 0;
    inq[s] = 1;
    p[s] = 0;
    a[s] = inf;
    queue<int> Q;
    Q.push(s);
    while (!Q.empty()) {
      int u = Q.front();
      Q.pop();
      inq[u] = false;
      for (unsigned i = 0; i < G[u].size(); ++i) {
        edge& e = edges[G[u][i]];
        if (e.cap > e.flow && d[e.to] > d[u] + e.cost) {
          d[e.to] = d[u] + e.cost;
          p[e.to] = G[u][i];
          a[e.to] = min(a[u], e.cap - e.flow);
          if (!inq[e.to]) {
            Q.push(e.to);
            inq[e.to] = true;
          }
        }
      }
    }
    if (d[t] == inf) return false;
    a[t] = min(a[t], limit - flow);
    flow += a[t];
    cost += d[t] * a[t];
    for (int u = t; u != s; u = edges[p[u]].from) {
      edges[p[u]].flow += a[t];
      edges[p[u] ^ 1].flow -= a[t];
    }
    return true;
  }
  int solve(int s, int t, int limit = inf) {
    int flow = 0, cost = 0;
    while (flow < limit && BellmanFord(s, t, flow, cost, limit))
      ;
    return cost;
  }
} mcmf;
int A[100][100], out[100];
inline int node(int i, int j) {
  if (i > j) swap(i, j);
  return i * 51 + j + 101;
}
inline int C(int x) { return x * (x - 1) / 2; }
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 0; i < m; ++i) {
    int x, y;
    scanf("%d %d", &x, &y);
    A[x][y] = 1;
    out[x] += 1;
  }
  map<int, pair<int, int> > rev;
  for (int i = 1; i <= n; ++i)
    for (int j = i + 1; j <= n; ++j) rev[node(i, j)] = make_pair(i, j);
  mcmf.init(10000);
  const int S = 9000, T = 9001;
  for (int i = 1; i <= n; ++i) {
    for (int j = out[i] + 1; j <= n; ++j) {
      mcmf.add_edge(S, i, 1, C(j) - C(j - 1));
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = i + 1; j <= n; ++j) {
      if (!A[i][j] && !A[j][i]) {
        mcmf.add_edge(node(i, j), T, 1, 0);
        mcmf.add_edge(i, node(i, j), 1, 0);
        mcmf.add_edge(j, node(i, j), 1, 0);
      }
    }
  }
  mcmf.solve(S, T);
  for (auto e : mcmf.edges) {
    if (e.cap > 0 && e.flow == 1 && e.from <= n) {
      auto pr = rev[e.to];
      if (e.from == pr.first)
        A[e.from][pr.second] = 1;
      else
        A[e.from][pr.first] = 1;
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) printf("%d", A[i][j]);
    printf("\n");
  }
  return 0;
}
