#include <bits/stdc++.h>
#define gt getchar
#define pt putchar
#define ll long long
using namespace std;
const int MAXN = 1e5 + 5;
ll read() {
    ll x = 0, f = 1;char ch = gt();
    while (ch < '0' || ch > '9') {if (ch == '-') f = -1;ch = gt();}
    while (ch >= '0' && ch <= '9') {x *= 10;x += ch - '0';ch = gt();}
    return x * f;
}

bool f[15][15];
ll n, h, w;
ll a[15], b[15];

void dfs(ll now) {
    if(now > n) {
        for (int i = 1; i <= h; i++) {
            for (int j = 1; j <= w; j++) {
                if(!f[i][j]) return;
            }
        }
        for (int i = 1; i <= h; i++) {
            for (int j = 1; j <= w; j++) {
                cout << f[i][j] << " \n"[j == w];
            }
        }
        cout << "Yes\n";
        exit(0);
    }
    dfs(now + 1);
    for (int i = 1; i <= h; i++) {
        for (int j = 1; j <= w; j++) {
            if(f[i][j]) continue;

            bool flag = true;

            for (int ii = i; ii <= i + a[now] - 1; ii++) {
                for (int jj = j; jj <= j + b[now] - 1; jj++) {
                    if(f[ii][jj] || ii > h || jj > w) {
                        flag = false;
                        break;
                    }
                    f[ii][jj] = true;
                }
                if(!flag) break;
            }
            if(!flag) continue;

            dfs(now + 1);

            for (int ii = i; ii <= i + a[now] - 1; ii++) {
                for (int jj = j; jj <= j + b[now] - 1; jj++) {
                    f[ii][jj] = false;
                }
            }

            for (int ii = i; ii <= i + b[now] - 1; ii++) {
                for (int jj = j; jj <= j + a[now] - 1; jj++) {
                    if(f[ii][jj] || ii > h || jj > w) {
                        flag = false;
                        break;
                    }
                    f[ii][jj] = true;
                }
                if(!flag) break;
            }
            if(!flag) continue;

            dfs(now + 1);

            for (int ii = i; ii <= i + b[now] - 1; ii++) {
                for (int jj = j; jj <= j + a[now] - 1; jj++) {
                    f[ii][jj] = false;
                }
            }
        }
    }
}

int main() {
    n = read(), h = read(), w = read();
    for (int i = 1; i <= n; i++) {
        a[i] = read(), b[i] = read();
    }
    dfs(1);
    cout << "No\n";
    return 0;
}