#include <bits/stdc++.h>
using namespace std;
int inf;
const double eps = 1e-8;
const double pi = acos(-1.0);
template <class T>
int chkmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
int chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T mmin(T a, T b) {
  return a < b ? a : b;
}
template <class T>
T mmax(T a, T b) {
  return a > b ? a : b;
}
template <class T>
T aabs(T a) {
  return a < 0 ? -a : a;
}
template <class T>
int dcmp(T a, T b) {
  return a > b;
}
template <int *a>
int cmp_a(int first, int second) {
  return a[first] < a[second];
}
struct __INIT__ {
  __INIT__() { memset(&inf, 0x3f, sizeof(inf)); }
} __INIT___;
namespace io {
const int SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
                                       qu[55];
int f, qr;
inline void flush() {
  fwrite(obuf, 1, oS - obuf, stdout);
  oS = obuf;
}
inline void putc(char first) {
  *oS++ = first;
  if (oS == oT) flush();
}
inline bool read(signed &first) {
  for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-')
      f = -1;
    else if (c == EOF)
      return 0;
  for (first = 0; c <= '9' && c >= '0';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    first = first * 10 + (c & 15);
  first *= f;
  return 1;
}
inline bool read(long long &first) {
  for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-')
      f = -1;
    else if (c == EOF)
      return 0;
  for (first = 0; c <= '9' && c >= '0';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    first = first * 10 + (c & 15);
  first *= f;
  return 1;
}
inline bool read(char &first) {
  first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                    : *iS++);
  return first != EOF;
}
inline bool read(char *first) {
  while ((*first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                                (iS == iT ? EOF : *iS++))
                             : *iS++)) == '\n' ||
         *first == ' ' || *first == '\r')
    if (*first == EOF) return 0;
  while (!(*first == '\n' || *first == ' ' || *first == '\r'))
    *(++first) = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                           : *iS++);
  *first = 0;
  return 1;
}
template <typename A, typename... B>
inline bool read(A &first, B &...second) {
  return read(first) && read(second...);
}
inline bool write(signed first) {
  if (!first) putc('0');
  if (first < 0) putc('-'), first = -first;
  while (first) qu[++qr] = first % 10 + '0', first /= 10;
  while (qr) putc(qu[qr--]);
  return 0;
}
inline bool write(long long first) {
  if (!first) putc('0');
  if (first < 0) putc('-'), first = -first;
  while (first) qu[++qr] = first % 10 + '0', first /= 10;
  while (qr) putc(qu[qr--]);
  return 0;
}
inline bool write(char first) {
  putc(first);
  return 0;
}
inline bool write(const char *first) {
  while (*first) {
    putc(*first);
    ++first;
  }
  return 0;
}
inline bool write(char *first) {
  while (*first) {
    putc(*first);
    ++first;
  }
  return 0;
}
template <typename A, typename... B>
inline bool write(A first, B... second) {
  return write(first) || write(second...);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_flusher_;
}  // namespace io
using io ::putc;
using io ::read;
using io ::write;
namespace mcf {
int to[260817], lst[260817], w[260817], beg[192608], c[260817], n, e = 1;
void add(int u, int v, int wa, int cost) {
  to[++e] = v;
  lst[e] = beg[u];
  beg[u] = e;
  c[e] = cost;
  w[e] = wa;
  to[++e] = u;
  lst[e] = beg[v];
  beg[v] = e;
  c[e] = -cost;
  w[e] = 0;
}
int mincost, dis[1926081], flw[1926081], pre[1926081], inq[1926081];
int q[19260817], *l, *r;
int spfa(int s, int t) {
  for (int i = 1; i <= n; ++i) dis[i] = 0x3f3f3f3f, pre[i] = flw[i] = 0;
  flw[s] = 0x3f3f3f3f;
  pre[s] = 0;
  *(l = r = q) = s;
  dis[s] = 0;
  while (l <= r) {
    inq[*l] = 0;
    for (int i = beg[*l]; i; i = lst[i])
      if (w[i] && chkmin(dis[to[i]], dis[*l] + c[i])) {
        pre[to[i]] = i;
        flw[to[i]] = mmin(flw[*l], w[i]);
        if (!inq[to[i]]) {
          inq[to[i]] = 1;
          *(++r) = to[i];
        }
      }
    ++l;
  }
  if (!flw[t]) return 0;
  int flow = flw[t];
  mincost += flow * dis[t];
  while (pre[t]) {
    s = pre[t];
    w[s] -= flow;
    w[s ^= 1] += flow;
    t = to[s];
  }
  return flow;
}
int Min_Cost_Flow(int s, int t) {
  while (spfa(s, t))
    ;
  return mincost;
}
bool isw(int first, int second) {
  for (int i = beg[first]; i; i = lst[i])
    if (to[i] == second) return !w[i];
  return 0;
}
}  // namespace mcf
int a[55][55];
int is[55][55];
int id[55];
int s, t;
signed main() {
  int n, m, u, v;
  read(n, m);
  for (int i = 1; i <= m; ++i) {
    read(u, v);
    a[u][v] = 1;
    a[v][u] = -1;
  }
  s = ++mcf::n;
  t = ++mcf::n;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j < i; ++j) {
      is[i][j] = is[j][i] = ++mcf::n;
      mcf::add(s, is[i][j], 1, 0);
    }
  for (int i = 1; i <= n; ++i) id[i] = ++mcf::n;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j)
      if (i != j) {
        if (a[i][j] >= 0) {
          mcf::add(is[i][j], id[i], 1, 0);
        }
      }
    for (int j = 1; j <= n; ++j) mcf::add(id[i], t, 1, j);
  }
  mcf::Min_Cost_Flow(s, t);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (i == j) {
        putc('0');
      } else if (mcf::isw(is[i][j], id[i])) {
        putc('1');
      } else
        putc('0');
    }
    putc('\n');
  }
  return 0;
}
