/* Problem URL: https://codeforces.com/contest/990/problem/D */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, a, b;
    cin >> n >> a >> b;

    if (n == 1) {
        cout << "YES\n0\n";
        return 0;
    }

    if (n == 2) {
        if (a == b) {
            cout << "NO\n";
        } else {
            cout << "YES\n";
            if (a == 1) {
                cout << "01\n10\n";
            } else {
                cout << "00\n00\n";
            }
        }
        return 0;
    }

    if (a != 1 && b != 1) {
        cout << "NO\n";
        return 0;
    }

    if (n == 3 && max(a, b) == 1) {
        cout << "NO\n";
        return 0;
    }

    bool inv = false;
    if (b == 1) {
        swap(a, b);
        inv = true;
    }

    cout << "YES\n";
    vvi adj(n, vi(n));

    if (b == 1) {
        nrep(i, 1, n - 1) {
            adj[0][i] = 1;
            adj[i][0] = 1;
        }

        adj[n - 1][n - 2] = 1;
        adj[n - 2][n - 1] = 1;

        repv(i, adj) {
            repv(j, i) {
                cout << j;
            }
            cout << '\n';
        }

        return 0;
    }

    rep(i, b - 1) {
        nrep(j, i + 1, n) {
            adj[i][j] = 1;
            adj[j][i] = 1;
        }
    }

    if (inv) {
        rep(i, n) {
            rep(j, n) {
                if (i == j) {
                    continue;
                }

                adj[i][j] ^= 1;
            }
        }
    }

    repv(i, adj) {
        repv(j, i) {
            cout << j;
        }
        cout << '\n';
    }
}