simple Python math solution
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```\nclass Solution:\n    def kthSmallestPath(self, destination: List[int], k: int) -> str:\n        v, h = destination\n        res = ""\n        while k > 1:\n            comb = math.comb(v+h-1, h-1)\n            if comb >= k:\n                res += "H"\n                h -= 1\n            else:\n                res += "V"\n                v -= 1\n                k -= comb\n        return res + "H" * h + "V" * v\n\n```
['Python3']