When preparing a tournament, Codeforces coordinators try treir best to make the first problem as easy as possible. This time the coordinator had chosen some problem and asked n people about their opinions. Each person answered whether this problem is easy or hard.
If at least one of these n people has answered that the problem is hard, the coordinator decides to change the problem. For the given responses, check if the problem is easy enough.
The first line contains a single integer n (1≤n≤100) — the number of people who were asked to give their opinions.
The second line contains nintegers, each integer is either 0or 1. If i-th integer is 0, then i-th person thinks that the problem is easy; if it is1, theni-th person thinks that the problem is hard.
Print one word: “EASY” if the problem is easy according to all responses, or “HARD” if there is at least one person who thinks the problem is hard.
You may print every letter in any register: “EASY”, “easy”, “EaSY” and “eAsY” all will be processed correctly.
Every morning she will ask the mirror: ‘Mirror mirror tell me, who is the most beautiful girl in the world?’ If the mirror says her name, she will praise the mirror: ‘Good guy!’, but if the mirror says the name of another person, she will assail the mirror: ‘Dare you say that again?’
Today Jessie asks the mirror the same question above, and you are given a series of mirror’s answers. For each answer, please output Jessie’s response. You can assume that the uppercase or lowercase letters appearing anywhere in the name will have no influence on the answer. For example, ‘Jessie’ and ‘jessie’ represent the same person.
The first line contains an integer T(1≤T≤100), which is the number of test cases.
Each test case contains one line with a single-word name, which contains only English letters. The length of each name is no more than 15.
For each test case, output one line containing the answer.
Ryuji is not a good student, and he doesn’t want to study. But there are n books he should learn, each book has its knowledge a[i].
Unfortunately, the longer he learns, the fewer he gets.
That means, if he reads books from ll to rr, he will get a[l]×L+a[l+1]×(L−1)+⋯+a[r−1]×2+a[r](Lis the length of [ $ l, r$ ] that equals tor−l+1).
Now Ryuji has q questions, you should answer him:
If the question type is 1, you should answer how much knowledge he will get after he reads books [ l,r ].
If the question type is 2, Ryuji will change the ith book’s knowledge to a new value.
First line contains two integers nandq (n,q≤100000).
The next line contains n integers represent a[i](a[i]≤1e9) .
Then in next qline each line contains three integers a,b,c, if a=1, it means question type is 1, and b,crepresents [ l,r]. if a=2, it means question type is2 , andb,c means Ryuji changes thebth book’s knowledge toc .
For each question, output one line with one integer represent the answer.