I want to go through all combinations of three dealt playing cards taking into account two (or possibly more) dead cards that can't appear. So with two dead cards for example 5 and 2 I would iterate through all the possible combinations of the remaining cards:
2 2 2
2 2 3
etc all the way up to
12 13 13
12 13 14
etc
Obviously there is no need for for example 2 2 4 and 4 2 2 since these would be the same with regard to playing cards. I've checked through many similar questions on here without finding the solution to this specific problem.
EDIT: I realise I didn't ask an actual question: how do I achieve this?