Caring for Kindergartener Padaeng-i

Time limit1sMemory limit1024 MB

Summary

Given T minutes and N candies with flavor durations, decide whether the candies' total duration is at least T.

Level: Easy1 of 10
Topics: Array, Implementation
Solved: No attempts yet

Problem

Padaeng-i is a kindergartener, so he still loves sweets very much.

Also, Padaeng-i cries at all hours unless he gets candy.

You, who love Padaeng-i, have agreed to look after him for a set amount of time. You do not want to see him cry while you care for him, so you brought candy to keep him from crying. However, you were in such a hurry to see him that you packed the candy quickly and did not check whether you had enough to keep him from crying for the whole time.

You must look after Padaeng-i for $T$ minutes, and you have $N$ pieces of candy. Each candy stops his crying for a length of time that depends on its flavor: a candy with flavor $F$ stops his crying for $F$ minutes.

Input

The first line contains an integer $T$ $(1 \leq T \leq 1 \\, 000)$ , the number of minutes you must look after Padaeng-i. The second line contains an integer $N$ $(1 \leq N \leq 100)$ , the total number of candies you have. The third line contains $N$ integers $F$ $(1 \leq F \leq 10)$ separated by spaces, the flavor of each candy.

Output

If you can keep Padaeng-i from crying for $T$ minutes, print Padaeng_i Happy. Otherwise, print Padaeng_i Cry.

Examples2

Example 1
Input
```
5
2
2 3
```
Expected output
```
Padaeng_i Happy
```
Example 2
Input
```
6
2
2 3
```
Expected output
```
Padaeng_i Cry
```