#include <bits/stdc++.h>
int dir[4][2] = {-1, 0, 0, -1, 1, 0, 0, 1};
char dirc[4] = {'U', 'L', 'D', 'R'};
char antidirc[4] = {'D', 'R', 'U', 'L'};
int n;
int sx, sy;
int a[600][600];
int c[600][600];
int b[600][600];
int q[300000][3];
int qi;
char ans[3000000];
int ansi;
int isrange(int x, int y) { return x >= 0 && x < n && y >= 0 && y < n; }
void onlight(int nx, int ny) {
  int i, j;
  c[nx][ny] = 1;
  if (a[nx][ny] == 0) {
    a[nx][ny] = 1;
    ans[ansi++] = '1';
  }
  for (i = 0; i < 4; i++) {
    int flag = 0;
    for (j = 1; j < n; j++) {
      if (!isrange(nx + j * dir[i][0], ny + j * dir[i][1])) break;
      if (a[nx + j * dir[i][0]][ny + j * dir[i][1]]) {
        flag = 1;
        break;
      }
    }
    if (flag == 0) continue;
    if (c[nx + dir[i][0]][ny + dir[i][1]]) continue;
    ans[ansi++] = dirc[i];
    onlight(nx + dir[i][0], ny + dir[i][1]);
    ans[ansi++] = antidirc[i];
  }
}
void bfs() {
  int i, j;
  q[qi][0] = sx;
  q[qi][1] = sy;
  q[qi++][2] = 1;
  b[sx][sy] = 1;
  c[sx][sy] = 2;
  for (i = 0; i < qi; i++) {
    int nx = q[i][0], ny = q[i][1];
    for (j = 0; j < 4; j++) {
      int nextx = nx + dir[j][0], nexty = ny + dir[j][1];
      if (isrange(nextx, nexty) && a[nextx][nexty] && c[nextx][nexty] == 1) {
        c[nextx][nexty] = 2;
        b[nextx][nexty] = q[i][2] + 1;
        q[qi][0] = nextx;
        q[qi][1] = nexty;
        q[qi++][2] = q[i][2] + 1;
      }
    }
  }
}
void offlight(int nx, int ny) {
  int i, j;
  for (i = 0; i < 4; i++) {
    int nextx = nx + dir[i][0], nexty = ny + dir[i][1];
    if (!isrange(nextx, nexty)) continue;
    if (a[nextx][nexty] == 1 && b[nextx][nexty] > b[nx][ny]) {
      ans[ansi++] = dirc[i];
      offlight(nextx, nexty);
      ans[ansi++] = antidirc[i];
    }
  }
  ans[ansi++] = '2';
  a[nx][ny] = 0;
}
int main() {
  int i, j, k;
  scanf("%d", &n);
  scanf("%d%d", &sx, &sy);
  sx--, sy--;
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) scanf("%d", &a[i][j]);
  }
  onlight(sx, sy);
  for (i = 0; i < n; i++) {
    for (j = 0; j < n; j++) {
      if (a[i][j] && !c[i][j]) {
        printf("NO");
        return 0;
      }
    }
  }
  printf("YES\n");
  bfs();
  offlight(sx, sy);
  printf("%s", ans);
  return 0;
}
