/**************************************************************
     Problem: 3613
     User: MiEcoku
     Language: C++
     Result: Accepted
     Time:7452 ms
     Memory:40356 kb
 ****************************************************************/

 #include <bits/stdc++.h>
 using namespace std;
 #define rep(i,a,b) for(int i=a;i<=b;++i)
 ;
 typedef long long ll;
 inline ll gi() {
     ll x=;char o;bool f=true;for(;!isdigit(o=getchar());)if(o=='-')f=false;
     )+(x<<)+(o&); ;
 }
 ll n,Sa,Sb,Sc,Sd,A[maxn],P,ans,Maxn;
 ll F(ll x) { return (((Sa*x%P*x%P*x%P+Sb*x%P*x%P)%P+Sc*x%P)%P+Sd)%P;}
 int main() {
 #ifndef ONLINE_JUDGE
     freopen("4.in","r",stdin);
 #endif
     A[]=;n=gi();Sa=gi();Sb=gi();Sc=gi();Sd=gi();A[]=gi();P=gi();
     Sa%=P;Sb%=P;Sc%=P;Sd%=P;Maxn=A[];
     rep(i,,n) {
         A[i]=(F(A[i-])+F(A[i-]))%P; ans=max(ans,Maxn-A[i]); Maxn=max(Maxn,A[i]);
     }
 //  rep(i,1,n) printf("%lld ",A[i]); puts("");
     printf();
     ;
 }