#include <bits/stdc++.h>
using namespace std;
long long POW(long long A, long long N, long long MOD) {
  if (N == 0) return 1 % MOD;
  if (N == 1) return A % MOD;
  long long tmp = POW(A, N / 2, MOD) % MOD;
  if (N % 2)
    return ((tmp * tmp) % MOD * A % MOD) % MOD;
  else
    return (tmp * tmp) % MOD;
}
long long MUL(long long A, long long B, long long MOD) {
  long long r = 0;
  while (B) {
    r = (r + (A * (B % 2) % MOD)) % MOD;
    A = (A + A) % MOD;
    B /= 2;
  }
  return r;
}
long long GCD(long long A, long long B) { return B == 0 ? A : GCD(B, A % B); }
int dx[] = {0, -1, 0, 1, 0};
int dy[] = {0, 0, 1, 0, -1};
template <class X, class Y>
bool minimize(X &x, const Y &y) {
  X eps = 1e-9;
  if (x > y + eps) {
    x = y;
    return true;
  } else
    return false;
}
template <class X, class Y>
bool maximize(X &x, const Y &y) {
  X eps = 1e-9;
  if (x + eps < y) {
    x = y;
    return true;
  } else
    return false;
}
template <class T>
T Abs(const T &x) {
  return (x < 0 ? -x : x);
}
const int MAXN = 505;
int N, X, Y;
int A[MAXN][MAXN], visit[MAXN][MAXN];
string H = "LURDL";
string ANS;
void DFS(int x, int y) {
  visit[x][y] = 1;
  if (!A[x][y]) {
    ANS += '1';
    A[x][y] = 1;
  }
  for (int h = (1), _b = (4); h <= _b; ++h) {
    int tx = x;
    int ty = y;
    bool ok = 0;
    while (!visit[tx + dx[h]][ty + dy[h]]) {
      tx += dx[h];
      ty += dy[h];
      if (A[tx][ty]) ok = 1;
    }
    tx = x + dx[h];
    ty = y + dy[h];
    if (ok) {
      ANS += H[h];
      DFS(tx, ty);
      ANS += H[(h + 2) % 4];
    }
  }
  if (A[x][y]) {
    ANS += '2';
    A[x][y] = 0;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> N >> X >> Y;
  for (int i = (1), _b = (N); i <= _b; ++i) {
    for (int j = (1), _b = (N); j <= _b; ++j) {
      cin >> A[i][j];
    }
  }
  memset(visit, 1, sizeof(visit));
  for (int i = (1), _b = (N); i <= _b; ++i)
    for (int j = (1), _b = (N); j <= _b; ++j) visit[i][j] = 0;
  DFS(X, Y);
  int res = 0;
  for (int i = (1), _b = (N); i <= _b; ++i) {
    for (int j = (1), _b = (N); j <= _b; ++j) res |= A[i][j];
  }
  if (res) {
    cout << "NO\n";
    exit(0);
  }
  cout << "YES\n";
  cout << ANS << '\n';
  return 0;
}
