Python (Simple DP)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def kthSmallestPath(self, destination, k):\n        i,j = destination\n\n        @lru_cache(None)\n        def dfs(i,j,k):\n            if k == 1:\n                return "H"*j + "V"*i\n            else:\n                val = math.comb(i+j-1,j-1)\n\n                if k <= val:\n                    return "H" + dfs(i,j-1,k)\n                else:\n                    return "V" + dfs(i-1,j,k-val)\n\n        return dfs(i,j,k)\n\n\n\n\n\n\n```
['Python3']