Using traffic lights, create a program that simulates the use of stovetops in a environment with N frying pans and M clay pots (N and M can be the same or different), from so that there is no starvation and/or deadlock.

Suppose that in a kitchen there is only one four-burner stove to be used both for frying pans and for clay pots. So that there are no problems, they were imposed some rules:

- There cannot be clay pots and pans on a stove top at the same time - There cannot be more than three pans on the stove at the same time

Print the number of pans or pans on the stove each time the value of them be updated (every time the quantity changes)

Example: The hob has 1 pan. The hob has 2 pans. The stove burner has 1 pan. The hob has 2 pans.