hard?
\nclass Solution:\n    def kthSmallestPath(self, d: List[int], k: int) -> str:\n        v,h=d\n        o=[]\n        while v and h:\n            if k>(t:=comb(v
```\nclass Solution:\n    def kthSmallestPath(self, d: List[int], k: int) -> str:\n        v,h=d\n        o=[]\n        while v and h:\n            if k>(t:=comb(v+h-1,h-1)):\n                o.append(\'V\')\n                k-=t\n                v-=1\n            else:\n                o.append(\'H\')\n                h-=1\n        return \'\'.join(o)+\'V\'*v+\'H\'*h\n        \n        \n\n\n```
['Python3']