#include <bits/stdc++.h>
using namespace std;
int n, sx, sy;
int a[510][510];
int can[510][510][4];
int vis[510][510];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dc[4] = {'D', 'R', 'U', 'L'};
void predo() {
  for (int i = 0; i < n; i++) {
    int x = 0;
    for (int j = 0; j < n; j++) {
      can[i][j][3] = x > 0;
      x += a[i][j];
    }
    x = 0;
    for (int j = n - 1; j >= 0; j--) {
      can[i][j][1] = x > 0;
      x += a[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    int x = 0;
    for (int j = 0; j < n; j++) {
      can[j][i][2] = x > 0;
      x += a[j][i];
    }
    x = 0;
    for (int j = n - 1; j >= 0; j--) {
      can[j][i][0] = x > 0;
      x += a[j][i];
    }
  }
}
bool out(int x, int y) { return x < 0 || x >= n || y < 0 || y >= n; }
void dfs(int x, int y, int tag) {
  vis[x][y] = tag;
  if (tag == 2 && a[x][y] == 0) {
    a[x][y] = 1;
    printf("1");
  }
  for (int i = 0; i < (4); i++) {
    int nx = x + dx[i], ny = y + dy[i];
    if (out(nx, ny) || can[x][y][i] == 0 || vis[nx][ny] == tag) continue;
    if (tag >= 2) printf("%c", dc[i]);
    dfs(nx, ny, tag);
    if (tag >= 2) printf("%c", dc[i ^ 2]);
  }
  if (tag == 3 && a[x][y] == 1) {
    a[x][y] = 0;
    printf("2");
  }
}
int main() {
  scanf("%d", &(n));
  scanf("%d%d", &(sx), &(sy));
  sx--, sy--;
  for (int i = 0; i < (n); i++)
    for (int j = 0; j < (n); j++) scanf("%d", &(a[i][j]));
  predo();
  dfs(sx, sy, 1);
  for (int i = 0; i < (n); i++)
    for (int j = 0; j < (n); j++) {
      if (a[i][j] == 1 && vis[i][j] == 0) {
        puts("NO");
        return 0;
      }
    }
  puts("YES");
  dfs(sx, sy, 2);
  dfs(sx, sy, 3);
  return 0;
}
