#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

int main() {
  int h, w, a, b;
  scan(h, w, a, b);

  int zero_h = -1;
  int zero_w = -1;
  rep (i, h+1) {
    int zeros = a * i + (w - a) * (h - i);
    int ones = h * w - zeros;
    rep (j, w+1) {
      int zeros_w = b * j + (h - b) * (w - j);
      if (zeros == zeros_w) {
        zero_h = i;
        zero_w = j;
        break;
      }
    }
    if (zero_h != -1) {
      break;
    }
  }
  if (zero_h == -1) {
    print("No");
    return 0;
  }

  vi needs_zero_h(h, 0);
  rep (i, zero_h) {
    needs_zero_h[i] = a;
  }
  FOR (i, zero_h, h) {
    needs_zero_h[i] = w - a;
  }
  vi needs_zero_w(w, 0);
  rep (j, zero_w) {
    needs_zero_w[j] = b;
  }
  FOR (j, zero_w, w) {
    needs_zero_w[j] = h - b;
  }

  debug(needs_zero_h);
  debug(needs_zero_w);

  vvi ans(h, vi(w, 1));
  vi cnt_zero_w(w, 0);
  vi cnt_one_w(w, 0);
  rep (i, h) {
    int cnt_zero_row = 0;
    int cnt_one_row = 0;
    deque<bool> fixed(w, false);
    rep (j, w) {
      if (cnt_zero_w[j] == needs_zero_w[j]) {
        ans[i][j] = 1;
        cnt_one_w[j] += 1;
        fixed[j] = true;
        cnt_one_row += 1;
        assert(cnt_one_row <= w - needs_zero_h[i]);
        continue;
      } else if (cnt_one_w[j] == h - needs_zero_w[j]) {
        ans[i][j] = 0;
        cnt_zero_w[j] += 1;
        fixed[j] = true;
        cnt_zero_row += 1;
        assert(cnt_zero_row <= needs_zero_h[i]);
        continue;
      }
    }
    rep (j, w) {
      if (fixed[j]) {
        continue;
      }
      if (cnt_zero_row < needs_zero_h[i]) {
        ans[i][j] = 0;
        cnt_zero_w[j] += 1;
        cnt_zero_row += 1;
      } else {
        ans[i][j] = 1;
        cnt_one_w[j] += 1;
        cnt_one_row += 1;
      }
    }
  }

  rep (i, h) {
    rep (j, w) {
      printf("%d", ans[i][j]);
    }
    printf("\n");
  }

  return 0;
}


Measured memory_bytes: 5248