Consider a rat placed at (0, 0) in a square matrix m[][] of order n and has to reach the destination at (n-1, n-1). Your task is to complete the function which returns a sorted array of strings denoting all the possible directions which the rat can take to reach the destination at (n-1, n-1). The directions in which the rat can move are 'U'(up), 'D'(down), 'L' (left), 'R' (right).

For example

1 0 0 0

1 1 0 1

1 1 0 0

0 1 1 1

For the above matrix the rat can reach the destination at (3, 3) from (0, 0) by two paths ie DRDDRR and DDRDRR when printed in sorted order we get DDRDRR DRDDRR.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two lines. The first line contains an integer n denoting the size of the square matrix. The next line contains n*n space separated values of the matrix m where 0's represents blocked paths and 1 represent valid paths.

**Output:**

For each test case output will be space separated sorted strings denoting all directions, which the rat could take to reach the destination.

**Constraints:**

1<=T<=10

2<=n<=10

0<=m[][]<=1

**Example(To be used only for expected output):
Input:**

2

4

1 0 0 0 1 1 0 1 0 1 0 0 0 1 1 1

4

1 0 0 0 1 1 0 1 1 1 0 0 0 1 1 1

DRDDRR

DDRDRR DRDDRR

Author: Shubham Joshi 1

svashish305 | 54 |

atharvaskant | 39 |

Abhishek Sourya | 30 |

Mr_Bean | 26 |

Shubham Pareek | 26 |

kinetic | 317 |

yirans | 278 |

kevinyu102589 | 263 |

rutvik29 | 209 |

kyaba-kun | 202 |

akhayrutdinov | 4913 |

Ibrahim Nash | 4429 |

Quandray | 4260 |

sanjay05 | 3668 |

GB11 | 2857 |

Login to report an issue on this page.