Taco Supply Checker

In this problem, you are given the number of passengers on a flight, the number of available meals, and the number of available drinks. Your task is to determine if there are enough supplies for all passengers.

Let \(N\) be the number of passengers, \(M\) be the number of available meals, and \(D\) be the number of available drinks. The conditions are as follows:

• If \(M \ge N\) and \(D \ge N\), output All set!.
• If both \(M < N\) and \(D < N\), output Not enough meals and drinks!.
• If only \(M < N\), output Not enough meals!.
• If only \(D < N\), output Not enough drinks!.

Your solution must read input from standard input (stdin) and write the result to standard output (stdout).

inputFormat

The input consists of a single line with three space-separated integers:

• N: the number of passengers.
• M: the number of available meals.
• D: the number of available drinks.

\(1 \leq N, M, D \leq 10^9\)

outputFormat

Output a single line containing one of the following messages based on the input conditions:

• All set!
• Not enough meals!
• Not enough drinks!
• Not enough meals and drinks!

## sample

100 100 100

All set!