python solution
Code\npython3 []\nclass Solution:\n    def kthSmallestPath(self, destination: List[int], k: int) -> str:\n        v, h = destination\n        a = []\n\n        
# Code\n```python3 []\nclass Solution:\n    def kthSmallestPath(self, destination: List[int], k: int) -> str:\n        v, h = destination\n        a = []\n\n        for _ in range(h+v):\n            if h == 0:a.append("V")\n            else:\n                combinations_with_h = comb(h+v-1, h- 1)\n                if k > combinations_with_h:\n                    a.append("V")\n                    v -= 1\n                    k -= combinations_with_h\n                else:\n                    a.append("H")\n                    h-= 1\n        return "".join(a)\n```
['Python3']