#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
int n, a, b;
string res[1005], s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> a >> b;
  if (((n == 3 || n == 2) && (a == 1 && b == 1)) || (a > 1 && b > 1)) {
    cout << "NO" << '\n';
    return 0;
  }
  for (int i = 1; i <= n; i++) s += '0';
  for (int i = 0; i < n; i++) res[i] = s;
  if (a == 1 && b > 1) {
    int now = 1;
    while (now < b) {
      for (int i = now + 1; i <= n; i++) {
        if (now == i) continue;
        res[now - 1][i - 1] = res[i - 1][now - 1] = '1';
      }
      now++;
    }
  } else if (b == 1) {
    for (int now = a; now < n; now++)
      res[now - 1][now] = res[now][now - 1] = '1';
  }
  cout << "YES" << '\n';
  for (int i = 0; i < n; i++) cout << res[i] << '\n';
  return 0;
}
