#include <bits/stdc++.h>
using namespace std;
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto vv : V) os << vv << ",";
  return os << "]";
}
template <class T>
ostream &operator<<(ostream &os, set<T> V) {
  os << "{";
  for (auto vv : V) os << vv << ",";
  return os << "}";
}
template <typename T, typename C>
class mcmf {
 public:
  static constexpr T eps = (T)1e-9;
  struct edge {
    int from;
    int to;
    T c;
    T f;
    C cost;
  };
  vector<vector<int>> g;
  vector<edge> edges;
  vector<C> d;
  vector<int> q;
  vector<bool> in_queue;
  vector<int> pe;
  int n;
  int first, fin;
  T flow;
  C cost;
  mcmf(int _n, int _st, int _fin) : n(_n), first(_st), fin(_fin) {
    assert(0 <= first && first < n && 0 <= fin && fin < n && first != fin);
    g.resize(n);
    d.resize(n);
    in_queue.resize(n);
    pe.resize(n);
    flow = 0;
    cost = 0;
  }
  void clear_flow() {
    for (const edge &e : edges) {
      e.f = 0;
    }
    flow = 0;
  }
  void add(int from, int to, T forward_cap, T backward_cap, C cost) {
    assert(0 <= from && from < n && 0 <= to && to < n);
    g[from].push_back((int)edges.size());
    edges.push_back({from, to, forward_cap, 0, cost});
    g[to].push_back((int)edges.size());
    edges.push_back({to, from, backward_cap, 0, -cost});
  }
  bool expath() {
    fill(d.begin(), d.end(), numeric_limits<C>::max());
    q.clear();
    q.push_back(first);
    d[first] = 0;
    in_queue[first] = true;
    int beg = 0;
    bool found = false;
    while (beg < (int)q.size()) {
      int i = q[beg++];
      if (i == fin) {
        found = true;
      }
      in_queue[i] = false;
      for (int id : g[i]) {
        const edge &e = edges[id];
        if (e.c - e.f > eps && d[i] + e.cost < d[e.to]) {
          d[e.to] = d[i] + e.cost;
          pe[e.to] = id;
          if (!in_queue[e.to]) {
            q.push_back(e.to);
            in_queue[e.to] = true;
          }
        }
      }
    }
    if (found) {
      T push = numeric_limits<T>::max();
      int v = fin;
      while (v != first) {
        const edge &e = edges[pe[v]];
        push = min(push, e.c - e.f);
        v = e.from;
      }
      v = fin;
      while (v != first) {
        edge &e = edges[pe[v]];
        e.f += push;
        edge &back = edges[pe[v] ^ 1];
        back.f -= push;
        v = e.from;
      }
      flow += push;
      cost += push * d[fin];
    }
    return found;
  }
  pair<T, C> max_flow_min_cost() {
    while (expath()) {
    }
    return {flow, cost};
  }
};
const int N = 53;
int z, n, m;
char gameboard[N][N];
int won[N];
int match[N][N];
int num_matches;
map<int, int> flows[N * N + N];
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      gameboard[i][j] = '?';
    }
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    gameboard[a][b] = '1';
    gameboard[b][a] = '0';
    won[a]++;
  }
  for (int i = 1; i <= n; i++)
    for (int j = i + 1; j <= n; j++) {
      if (gameboard[i][j] == '?') {
        match[i][j] = match[j][i] = num_matches;
        num_matches++;
      }
    }
  int toplay = n * (n - 1) / 2 - m;
  assert(toplay == num_matches);
  int S = 0;
  int T = 1 + toplay + n;
  mcmf<int, int> flow(T + 1, S, T);
  for (int i = 1; i <= n; i++)
    for (int j = i + 1; j <= n; j++) {
      if (gameboard[i][j] == '?') {
        flow.add(S, 1 + match[i][j], 1, 0, 0);
        flow.add(1 + match[i][j], 1 + num_matches + i - 1, 1, 0, 0);
        flow.add(1 + match[i][j], 1 + num_matches + j - 1, 1, 0, 0);
      }
    }
  for (int i = 1; i <= n; i++) {
    for (int j = won[i]; j <= n - 1; j++) {
      flow.add(1 + num_matches + i - 1, T, 1, 0, 2 * j + 1);
    }
  }
  flow.max_flow_min_cost();
  for (auto e : flow.edges) {
    flows[e.from][e.to] = e.f;
  }
  for (int i = 1; i <= n; i++) {
    gameboard[i][i] = '0';
    for (int j = i + 1; j <= n; j++) {
      if (gameboard[i][j] == '?') {
        gameboard[i][j] = gameboard[j][i] = '0';
        int mat = match[i][j];
        if (flows[1 + mat][1 + num_matches + i - 1] == 1) {
          gameboard[i][j] = '1';
        } else {
          gameboard[j][i] = '1';
        }
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cout << gameboard[i][j];
    }
    cout << endl;
  }
  return 0;
}
