合并沙子//区间dp

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define inf 0x7fffffff
using namespace std;
int a,sum[305],n;
int f1[305][305],f2[305][305];
long int m;
int dpn(int l,int r)//min
{
    if(f1[l][r]!=-1)return f1[l][r];
    if(l==r)return 0;
    int ans=inf;
    for(int i=l;i<r;i++)
        ans=min(ans,dpn(l,i)+dpn(i+1,r));
    return f1[l][r]=(ans+sum[r]-sum[l-1]);
}
int dpx(int l,int r)//max
{
    if(f2[l][r]!=-1)return f2[l][r];
    if(l==r)return 0;
    int ans=-999999;
    for(int i=l;i<r;i++)
        ans=max(ans,dpx(l,i)+dpx(i+1,r));
    return f2[l][r]=(ans+sum[r]-sum[l-1]);
}
int main() 
{ 
    cin>>n>>m; 
    memset(f1,-1,sizeof(f1));
    memset(f2,-1,sizeof(f2));
    for(int i=1;i<=n;i++) 
    { 
        cin>>a; 
        sum[i]=sum[i-1]+a; 
    } 
    if(m<dpn(1,n))puts("I am..Sha...X");
    else if(m>dpx(1,n))puts("It is easy");
    else puts("I will go to play WarIII");
    return 0;
}