#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 100001
using namespace std;
long long n,x,k,l,ans;
long long a[N],b[N],c[14];
long long read()
{long long x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0'; ch=getchar();}return x*f;
}
long long pow(long long x,long long y)
{long long sum=1;while(y){if(y&1) sum=(sum*x)%k;x=(x*x)%k; y>>=1;}return sum;
}
int main()
{freopen("digits.in","r",stdin);freopen("digits.out","w",stdout);n=read(),k=read(); l=k;k=1;for(int i=1;i<=l;i++) k*=10;for(int i=1;i<=n;i++)a[i]=read()%k,b[i]=read();x=read();x%=k;for(int i=1;i<=n;i++)ans=(ans+a[i]*pow(x,b[i])%k)%k;for(int i=l;i>=1;i--)c[i]=ans%10,ans/=10;for(int i=1;i<=l;i++)printf("%d\n",c[i]);return 0;
}

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,x1,x2,x3,x4,x5,x6,ans;
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=-1; ch=getchar();}while(ch>='0'&&ch<='9') {x=x*10+ch-'0'; ch=getchar();}return x*f;
}
int main()
{freopen("equation.in","r",stdin);freopen("equation.out","w",stdout);n=read();x1=read(),x2=read(),x3=read(),x4=read(),x5=read(),x6=read();for(int a=1;a<=n;a++)for(int b=1;b<=n;b++)for(int c=1;c<=n;c++)for(int d=1;d<=n;d++)for(int e=1;e<=n;e++)for(int f=1;f<=n;f++)if(x1*a-x2*b+x3*c-x4*d+x5*e-x6*f==0)ans++;printf("%d",ans);return 0;
}

#include<map>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n,x1,x2,x3,x4,x5,x6,ans;
map<int,int>ma;
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=-1; ch=getchar();}while(ch>='0'&&ch<='9') {x=x*10+ch-'0'; ch=getchar();}return x*f;
}
int main()
{freopen("equation.in","r",stdin);freopen("equation.out","w",stdout);n=read();x1=read(),x2=read(),x3=read(),x4=read(),x5=read(),x6=read();for(int a=1;a<=n;a++)for(int b=1;b<=n;b++)for(int c=1;c<=n;c++)ma[x1*a+x3*b+x5*c]++;for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)for(int k=1;k<=n;k++)ans+=ma[x2*i+x4*j+x6*k];printf("%d",ans);return 0;
}

#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 333444
int if_z,tot,ans,n,m,k,x,y,z;
int fa[maxn];
bool flag;
char Cget;
struct Edge
{int l,r,w;
}edge[maxn];
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=-1; ch=getchar();}while(ch>='0'&&ch<='9') {x=x*10+ch-'0'; ch=getchar();}return x*f;
}
bool cmp(Edge a,Edge b)
{return a.w<b.w;
}
int find(int x)
{return x==fa[x]?x:fa[x]=find(fa[x]);
}
int main()
{//freopen("graph.in","r",stdin);//freopen("graph.out","w",stdout);n=read();m=read();k=read();for(int i=1;i<=m;i++) {edge[i].l=read();edge[i].r=read();edge[i].w=read();}for(int i=1;i<=n;i++)    fa[i]=i;sort(edge+1,edge+m+1,cmp);for(int i=1;i<=m;i++){int fx=find(edge[i].l);    int fy=find(edge[i].r);if(fx!=fy){fa[fx]=fy;tot++;ans=edge[i].w;}if(find(1)==find(n)){printf("%d",edge[i].w);flag=true;break;}if(tot==n-1)break;}if(!flag)printf("-1");return 0;
}