[Java] Simple Solution
If k is bigger than total number of combination that starts with H then we should pick V\n```\nclass Solution {\n    public String kthSmallestPath(int[] destina
If k is bigger than total number of combination that starts with `H` then we should pick `V`\n```\nclass Solution {\n    public String kthSmallestPath(int[] destination, int k) {\n        return helper(destination[1],destination[0],k-1,"");\n    }\n    \n    private String helper(int H, int V, int k, String result){\n        if(H==0&& V==0) return result;\n        if(H==0) return helper(H,V-1,k,result+"V");\n        if(V==0) return helper(H-1,V,k,result+"H");\n        Long combinationIfItStartsWithH = combination(H+V-1, Math.min(H-1, V));\n        if(combinationIfItStartsWithH<=k){\n            return helper(H,V-1,k-combinationIfItStartsWithH.intValue(),result+"V");\n        }\n        return helper(H-1,V,k,result+"H");\n    }\n    \n    private long combination(Integer M, Integer N){\n        long result = 1l;\n        for(int i=0;i<N;i++){\n            result *= M-i;\n            result /=(i+1);\n        }\n        return result;\n    }\n}
[]