#include<iostream>
#include<cstdio>

using namespace std;
	int n,a,b,c,d,e,f,g,h,m,x,minn;
	int wi[1500000];
	int ui[1500000];
void qsort(int a[],int l,int r);	
void qsort(int a[],int l,int r)
{
	int i,j,x,y;
	i=l;j=r;x=a[(i+j)/2];
	while (i<=j)
	{
		while (a[i]>x) i++;
		while (a[j]<x) j--;
		if (i<=j)
		{
			y=a[i];a[i]=a[j];a[j]=y;
			y=wi[i];wi[i]=wi[j];wi[j]=y;
			i++;j--;
		}
	}
	if (l<j) qsort(a,l,j);
	if (i<r) qsort(a,i,r);
}
int main()

{
	freopen("farmoff.in","r",stdin);
	freopen("farmoff.out","w",stdout);
	scanf("%d%d%d%d%d%d%d%d%d%d",&n,&a,&b,&c,&d,&e,&f,&g,&h,&m);
	for (int i=0;i<=3*n-1;i++)
	{
		wi[i]=(a*i*i*i*i*i+b*i*i+c)%d;
		ui[i]=(e*i*i*i*i*i+f*i*i*i+g)%h;
	}
	qsort(ui,0,3*n-1);
	for (int i=0;i<=n-1;i++)
	{
		minn+=wi[i];
	}
	/*for (int i=0;i<=3*n-1;i++)
	{
		printf("%d ",ui[i]);
	}*/
	minn%=m;
	printf("%d",minn);
	return 0;
}