The desired functionality is for your programs to input pairs of natural numbers as they're entered by the user, until the user enters a zero as the first in a pair of numbers. The first number in each pair indicates a bin for the second number. For example, the pair of numbers 3 4 means that bin 3 contains the number 4. After the user enters a bin number of 0, your programs then allow the user to enter natural numbers until another 0 is entered; for every natural number i entered, your programs must output the product of all the numbers in bin i (or 0 if there are no numbers in that bin). Throughout all these operations, your programs must be reasonably efficient-there should never be long, noticeable pauses during execution.

Examples of Desired Behavior:

Enter a natural number: 1
Enter a natural number: 2
Enter a natural number: 1
Enter a natural number: 3
Enter a natural number: 1
Enter a natural number: 4
Enter a natural number: 0
Enter a natural number: 1
24
Enter a natural number: 0

(Here bin 1 contains 2, 3, and 4, so the product for bin 1 is 24)

Enter a natural number: 0
Enter a natural number: 2
0
Enter a natural number: 3
0
Enter a natural number: 1
0
Enter a natural number: 0

(Here no bins contain numbers, so 0 is returned for all of their products)

Enter a natural number: 0
Enter a natural number: 0

(Here no numbers are stored and no products are sought)

Enter a natural number: 70000
Enter a natural number: 9
Enter a natural number: 70000
Enter a natural number: 7
Enter a natural number: 100000
Enter a natural number: 1
Enter a natural number: 100000
Enter a natural number: 1
Enter a natural number: 200000
Enter a natural number: 5
Enter a natural number: 200000
Enter a natural number: 0
Enter a natural number: 200000
Enter a natural number: 7
Enter a natural number: 0

Enter a natural number: 70000
63
Enter a natural number: 100000
1
Enter a natural number: 200000
0
Enter a natural number: 1
0
Enter a natural number: 0