#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int inf = 1000000007;
const long long linf = 1LL << 62;
const unsigned long long ulinf = 1ULL << 63;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T a) {
  return a >= 0 ? a : -a;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
long long powmod(long long a, long long b, long long c) {
  if (b == 0LL) return 1LL;
  long long ret = powmod(a, b >> 1, c);
  ret = ret * ret % c;
  if (b & 1LL) ret = ret * a % c;
  return ret;
}
long long inv(long long a, long long b) { return powmod(a, b - 2LL, b); }
template <class T>
void maxe(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void mine(T &a, T b) {
  if (a > b) a = b;
}
int iszero(double a) { return abs(a) <= eps; }
template <class T>
void geti(T &a) {
  a = 0;
  T b = 1;
  char c = getchar();
  if (c == '-')
    b = -1;
  else
    a = c - 48;
  while ((c = getchar()) != ' ' && c != '\n') a = a * 10 + c - 48;
  a *= b;
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 555;
const int M = 155555;
const int K = 20;
int test;
int n, m, k, ans;
int x, y;
int a[N][N], vis[N][N];
int xu[N], xd[N], yl[N], yr[N];
string s;
const char ds[] = "ULDR";
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
void upd(int x, int y) {
  mine(xu[y], x);
  mine(yl[x], y);
  maxe(xd[y], x);
  maxe(yr[x], y);
}
void on(int x, int y) {
  if (!a[x][y]) {
    upd(x, y);
    s += '1';
    a[x][y] = 1;
    k++;
  }
}
void off(int x, int y) {
  if (a[x][y]) {
    s += '2';
    a[x][y] = 0;
    k--;
  }
}
void go(int d) { s += ds[d]; }
void prt() {
  return;
  printf("%d\n", k);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) printf("%d ", a[i][j]);
    puts("");
  }
  puts(s.c_str());
}
void dfson(int x, int y) {
  vis[x][y] = 1;
  on(x, y);
  if (x != xu[y] && !vis[x - 1][y]) {
    go(0);
    dfson(x - 1, y);
    go(2);
  }
  if (x != xd[y] && !vis[x + 1][y]) {
    go(2);
    dfson(x + 1, y);
    go(0);
  }
  if (y != yl[x] && !vis[x][y - 1]) {
    go(1);
    dfson(x, y - 1);
    go(3);
  }
  if (y != yr[x] && !vis[x][y + 1]) {
    go(3);
    dfson(x, y + 1);
    go(1);
  }
}
void dfsoff(int x, int y) {
  vis[x][y] = 1;
  if (a[x - 1][y] && !vis[x - 1][y]) {
    go(0);
    dfsoff(x - 1, y);
    go(2);
  }
  if (a[x + 1][y] && !vis[x + 1][y]) {
    go(2);
    dfsoff(x + 1, y);
    go(0);
  }
  if (a[x][y - 1] && !vis[x][y - 1]) {
    go(1);
    dfsoff(x, y - 1);
    go(3);
  }
  if (a[x][y + 1] && !vis[x][y + 1]) {
    go(3);
    dfsoff(x, y + 1);
    go(1);
  }
  off(x, y);
}
int getans() {
  for (int i = 1; i <= n; i++) {
    xu[i] = yl[i] = inf;
    xd[i] = yr[i] = 0;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (a[i][j]) upd(i, j);
  memset(vis, 0, sizeof(vis));
  dfson(x, y);
  prt();
  memset(vis, 0, sizeof(vis));
  dfsoff(x, y);
  prt();
  return !k;
}
int main() {
  scanf("%d%d%d", &n, &x, &y);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) {
      scanf("%d", &a[i][j]);
      k += a[i][j];
    }
  ans = getans();
  if (ans) {
    puts("YES");
    puts(s.c_str());
  } else
    puts("NO");
  return 0;
}
