Cash Machine Notes

Run a day of requests through a cash machine that holds a limited number of notes of each denomination.

The machine has the denominations denoms (listed from largest to smallest) with stock[i] notes of value denoms[i] loaded. Process commands in order; each is one of:

• "withdraw CARD AMOUNT": the card CARD asks for AMOUNT in cash. The request is approved only if all of these hold, and declined otherwise (a declined request changes nothing, including the card's daily total):
• the card's approved total today plus AMOUNT is at most daily_limit;
• AMOUNT can be paid exactly using the notes currently in stock;
• the payout needs at most max_notes notes.

The machine pays with the fewest notes possible. If several payouts use the same fewest number of notes, it picks the one that uses more notes of the largest denomination, and if still tied, more of the next largest, and so on. Approved notes leave the machine and AMOUNT is added to the card's total.

• "refill D N": add N notes of denomination D (one of denoms).
• "newday": every card's daily total goes back to 0 (the stock stays as it is).

Input: denoms, stock, max_notes, daily_limit, commands.

Output: [payouts, stock]. payouts has one entry per withdraw command, in order: the list of notes paid, in the order of denoms (e.g. [1, 0, 0, 1]), or [] if it was declined. stock is the final number of notes of each denomination.