被教育场45

package R45;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Main4 {
    static BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
    static StringTokenizer tok;
    static boolean hasNext()
    {
        while(tok==null||!tok.hasMoreTokens())
            try{
                tok=new StringTokenizer(in.readLine());
            }
            catch(Exception e){
                return false;
            }
        return true;
    }
    static String next()
    {
        hasNext();
        return tok.nextToken();
    }
    static long nextLong()
    {
        return Long.parseLong(next());
    }
    static int nextInt()
    {
        return Integer.parseInt(next());
    }
    static PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));


    static int n;
    static int g[][];
    public static void main(String[] args) {
        n = nextInt();
        int a = nextInt();
        int b = nextInt();
        g = new int[n+1][n+1];
        if (a>=2&&b>=2){
            out.println("NO");
            out.flush();
            return;
        }else if (a==1&&b==1){
            if (n==1){
                out.println("YES");
                out.println(0);
            }else if (n<=3){
                out.println("NO");
            }else {
                out.println("YES");
                for(int i=2;i<=n;i++){
                    g[i-1][i]=1;
                    g[i][i-1]=1;
                }
                syso();
            }
        }else {
            out.println("YES");
            if (a==1){
                for(int i=1;i<=b-1;i++){
                    for(int j=1;j<=n;j++){
                        if (i!=j) {
                            g[i][j] = 1;
                            g[j][i] = 1;
                        }
                    }
                }
                syso();
            }else {//b==1
                //先挑出来a-1个单独的点,剩下的随，随意？
                for(int i=a;i<=n;i++){
                    for(int j=a;j<=n;j++){
                        if (i!=j)
                            g[i][j]=g[j][i]=1;
                    }
                }
                syso();
            }
        }
        out.flush();
    }
    public static void syso(){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                out.print(g[i][j]);
            }
            out.println();
        }
    }
}