Feast Preparation Check

In this problem, you are given k unique spices and m dishes. Each dish requires a specific amount of each spice. Your task is to determine whether the feast can be prepared with the available spices.

For every spice \(i\) (where \(i = 1, 2, \ldots, k\)), the following condition must hold:

\[ \text{Total requirement for spice } i \leq \text{Available quantity of spice } i \]

If the condition is met for all spices, output Feast Ready; otherwise, output Need More Spices.

inputFormat

The first line contains two integers, k and m, representing the number of unique spices and the number of dishes, respectively.

The second line contains k space-separated integers, denoting the available quantities of each spice.

The following m lines each contain k space-separated integers, representing the required quantities of spices for each dish.

outputFormat

Output a single line: Feast Ready if the feast can be prepared, or Need More Spices if not.

## sample

3 2
5 6 7
3 2 4
1 2 3

Feast Ready