#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e7+1;
ll n,m,k,x,cnt,s,ans;
ll pre[maxn];
int main()
{
	scanf("%lld%lld%lld%lld",&n,&m,&k,&x);
	pre[0]=1;
	ans=m%n;
	while(1)
	{
		pre[++cnt]=(pre[cnt-1]*10)%n;
		ans=(ans*pre[cnt])%n;
		k-=cnt;
		if(k<=cnt) break;
	}
	ans=(pre[k]*ans)%n;
	x=(x+ans)%n;
	printf("%lld",x);
	return 0;
}