#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <iomanip>
using namespace std;
int a[20],b,d,f[20],l,m,n=0,x;
long long c;
int main(void)
{
	freopen ("recursion.in","r",stdin);
	freopen ("recursion.out","w",stdout);
	scanf("%d",&b);
	cin>>c;
	for (d=0;d<=b;d++) scanf("%d",&a[d]);
	for (d=0;d<b;d++) scanf("%d",&f[d]);
	n=0;
	for (d=b;d<=c;d++)
	{
		x=a[b];
		x%=9973;
		m=b-1+n;
		if (m>=b) m-=b;
		for (l=0;l<b;l++) 
		{
			x+=f[m]*a[l];
			x%=9973;
			m--;
			if (m<0) m+=b;
		}
		f[n]=x;
		n++;
		if (n>=b) n-=b;
	}
	n--;
	if (n<0) n+=b;
	printf("%d",f[n]);
	fclose(stdin);
	fclose(stdout);
	return 0;
}