Please suggest optimal solution for this problem.\n\n```\nFor the given 2D Matrix,need to reach at the bottom of the matrix[m,n] from starting index [0.0],can take one step in right & down direction.\nPrint the kth path which is sorted among all the possible paths\n\nInput -  m = 3, n = 2,k=2\nExplanation: From the top-left corner, there are a total of 3 paths to reach the bottom-right corner:\n1. Right -> Down -> Down\n2. Down -> Down -> Right\n3. Down -> Right -> Down\n\nOutput (String format) - k =2 ,so second sorted path among above list\nDown -> Rigth -> Right\n```

Please suggest optimal solution for this problem.\n\n\nFor the given 2D Matrix,need to reach at the bottom of the matrix[m,n] from starting index [0.0],can take