Motivated by a self-referential puzzle, we study sequences of voucher price tags in which each choice multiplies the cost of the following one. We connect the puzzle setting to classical permutation statistics, introducing the \textit{voucher cost} alongside the related \textit{pairwise} and \textit{loop} costs. This perspective allows us to translate questions about budgeting into extremal problems on permutations. We review known results for permutations of ${1,2,\dots,n}$ and extend them to arbitrary sets of distinct non-negative price tags.