求条

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int a[3010];
ll cnt,pot[10000010];
ll gcd(ll a, ll b) {
	while (b != 0) {
		ll r = a % b;
		a = b;
		b = r;
	}
	return a;
}
ll lcm(ll a, ll b){
	return a * b / gcd(a, b);
}
inline ll mod(ll x, ll y) {
	return (x % y + y) % y;
}
int main()
{
	ll d,n,m;ll t;
	cin>>d>>n>>m>>t;
	for(ll i=1;i<=n;i++)
		cin>>a[i];
	ll zhou=lcm(n,m);
	for(ll i=1;i<=min(zhou,t);i++)
	{
		if((i-1)%m==0)
			cnt--;
		ll gogo=cnt+i;
		if((gogo)%n==0)  pot[i]=(pot[i-1]+a[n]);
		else  pot[i]=(pot[i-1]+a[gogo%n])%d;
	}
	if(min(zhou,t)==t)  cout<<mod(pot[t],d);
	
	else  cout<<mod ( mod((t/zhou)*pot[zhou],d) + pot[t%zhou],d);
}