#include <algorithm>
#include <iostream>
#include <string>
#include <vector>

using namespace std;

int A, B, C, D;

int main(int argc, char* argv[]) {
  cin >> A >> B >> C >> D;
  int L = A + B;
  int R = C + D;

  if (L > R)
    cout << "Left" << endl;
  else if (L == R)
    cout << "Balanced" << endl;
  else
    cout << "Right" << endl;

  return 0;
}
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll mod1=998244353;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  int H, W, A, B;
  cin>>H>>W>>A>>B;
  int ans[H][W];
  for(int i=0;i<H;++i) {
    for(int j=0;j<W;++j) {
      ans[i][j] = 0;
    }
  }
  map<int, int> gyo[H], retu[W];
  for(int i=0;i<H;++i) {
    for(int j=0;j<W;++j) {
      if(gyo[i][1]<W-A && retu[j][1]<H-B) {
        ans[i][j] = 1;
        gyo[i][1]++;
        retu[j][1]++;
      }
    }
  }
  bool can = true;
  for(int i=0;i<H;++i) {
    if(gyo[i][1]!=A && gyo[i][1]!=W-A) can = false;
    if(retu[i][1]!=B && retu[i][1]!=H-B) can = false;
  }
    for(int i=0;i<H;++i) {
      for(int j=0;j<W;++j) {
        cout<<ans[i][j];
      }
      cout<<endl;
    }
}
