Suppose there are three decks of cards on the table, a number is written on each card. And each deck is sorted in decreasing order (The maximum value is on the deck in top).
The goal is to find the minimum value between all these three decks with the smallest number of steps. You only can see the top card.
Use stack and recursion to solve this problem.