#include<bits/stdc++.h>
using namespace std;
#define N 500010
#define int long long
struct node{int x,y;}cow[N*3];
bool cmp(node n1,node n2){return n1.y!=n2.y?n1.y>n2.y:n1.x<n2.x;}
int n,a,b,c,d,e,f,g,h,m;
int getweight(int i){return (a*i%d*i%d*i%d*i%d*i%d+b*i%d*i%d+c)%d;}
int getuse(int i){return (e*i%h*i%h*i%h*i%h*i%h+f*i%h*i%h*i%h+g)%h;}
signed main()
{
    cin>>n>>a>>b>>c>>d>>e>>f>>g>>h>>m;
    for(int i=1;i<=3*n;i++)cow[i].x=getweight(i-1),cow[i].y=getuse(i-1);
    sort(cow+1,cow+n*3+1,cmp);
    int ans=0;for(int i=1;i<=n;i++)ans+=cow[i].x,ans%=m;
    cout<<ans;
    return 0;
}