Design a Stack With Increment Operation

Design a stack with a maximum size supporting push x (ignored when full), pop (prints the popped value or -1 if empty) and increment k v (adds v to the bottom min(k, size) elements). Print the result of every pop.

1 <= maxSize, q <= 1000