#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 5;
struct coord {
  int x, y;
};
coord o;
char dir[] = {'R', 'D', 'L', 'U'};
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int a[N][N];
int n;
int top;
vector<char> res;
vector<int> graph[N][N];
bool mark[N][N];
bool can(coord c, int dir) {
  while (c.x <= n && c.x >= 1 && c.y <= n && c.y >= 1) {
    if (a[c.x][c.y]) return 1;
    c.x = c.x + dx[dir];
    c.y = c.y + dy[dir];
  }
  return 0;
}
void dfs(coord o) {
  mark[o.x][o.y] = 1;
  if (a[o.x][o.y] == 0) {
    res.push_back('1');
    a[o.x][o.y] = 1;
  }
  for (int k = 0; k < 4; ++k) {
    coord ne;
    ne.x = o.x + dx[k];
    ne.y = o.y + dy[k];
    if (ne.x >= 1 && ne.y >= 1 && ne.x <= n && ne.y <= n &&
        mark[ne.x][ne.y] == 0) {
      if (can(ne, k)) {
        res.push_back(dir[k]);
        graph[o.x][o.y].push_back(k);
        dfs(ne);
        res.push_back(dir[(k + 2) % 4]);
      }
    }
  }
}
void dfscl(coord o) {
  for (int u = 0; u < graph[o.x][o.y].size(); ++u) {
    coord ne;
    int k;
    k = graph[o.x][o.y][u];
    ne.x = o.x + dx[k];
    ne.y = o.y + dy[k];
    res.push_back(dir[k]);
    dfscl(ne);
    res.push_back(dir[(k + 2) % 4]);
  }
  res.push_back('2');
}
int main() {
  scanf("%d%d%d", &n, &o.x, &o.y);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      scanf("%d", &a[i][j]);
    }
  }
  dfs(o);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (a[i][j] && mark[i][j] == 0) {
        printf("NO\n");
        return 0;
      }
  printf("YES\n");
  dfscl(o);
  for (int i = 0; i < res.size(); ++i) {
    cout << res[i];
  }
  cout << endl;
  return 0;
}
