#include<iostream> (30316)#include<cstring> #include<algorithm> using namespace std; const int N = 100010; int T; int n,k; long long a[N]; int main() { scanf("%d",&T); while(T--) { scanf("%d",&n); memset(a,0,sizeof a); for(int i = 1 ; i <= n ; i ++) scanf("%ld",&a[i]); scanf("%d",&k); int l = k - 1 , r = k + 1; long long value = a[k]; while(l > 0 || r <= n) { if(l > 0 && value>a[l]) value +=a[l--]; else if(r <= n && value > a[r]) value +=a[r++]; else break; } if(l == 0 && r == n + 1) printf("A perfect meal\n"); else printf("An inevitable process\n"); } return 0; }