def get_combinations(self, t, lst, k):
        if t == 0:
            return 1

        if 0 < t or k >= len(lst):
            return 0

        if (t, k) not in self.combs:
            cnt = 0
            while t >= 0:
                cnt += self.get_combinations(t, lst, k + 1)
                t -= lst[k]
            self.combs[(t, k)] = cnt

        return self.combs[(t, k)]
dataset/ETHPy150Open algorhythms/HackerRankAlgorithms/Dynamic Programming Classics - The Coin Change Problem.py/Solution.get_combinations/swapped operands of `<`