#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i64 i=0; i<n; i++)
#define all(v) v.begin(),v.end()
#define pp pair<int,int>
using Graph=vector<vector<int>>;
using i64=int64_t;

int main() {
    int si,sj;cin>>si>>sj;
    vector<vector<int>> t(50,vector<int>(50));
    rep(i,50) {
        rep(j,50) {
            cin>>t[i][j];
        }
    }
    vector<vector<int>> p(50,vector<int>(50));
    rep(i,50) {
        rep(j,50) {
            cin>>p[i][j];
        }
    }
    vector<char>ans;
    if(si<=48) {
        if(t[si][sj]!=t[si+1][sj]) {
            ans.push_back('D');
            if(si<=47 && t[si+1][sj]!=t[si+2][sj]) {
                ans.push_back('D');
                if(si<=46 && t[si+2][sj]!=t[si+3][sj]) {
                    ans.push_back('D');
                }
            }
        } else {
            ans.push_back('U');
        }
    } else {
        if(sj<=48) {
            if(t[si][sj]!=t[si][sj+1]) {
                ans.push_back('R');
                if(sj<=47 && t[si][sj+1]!=t[si][sj+2]) {
                    ans.push_back('R');
                }
            } else {
                ans.push_back('L');
            }
        } else {
            if(t[si][sj]!=t[si][sj-1]) {
                ans.push_back('L');
            } else {
                ans.push_back('U');
            }
        }
    }
    rep(i,ans.size()) {
        cout << ans[i];
    }
}
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	int a,b;
	cin>>a>>b;
	
	int ans=0;
	rep(x,1,a+1) rep(y,1,b+1){
		ans+=x*100+y;
	}
	
	cout<<ans<<endl;
}