#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define N 1000
int n,c,car[N],k,s,l[N];
char sl[N];
struct vec{
	int x,poz;
	char y[N];
}v[N];
void read()
{
	int i;
	scanf("%d%d%s",&n,&c,&sl);
	for(i=0;i<n;i++)
	{
		scanf("%d%s",&v[i].x,&v[i].y);
		v[i].poz=i;
	}
}
void creare(char s[N],int v[N])
{
	int n,i,k=0;
	n=strlen(s);
	k=0;
	v[k++]=n;
	for(i=0;i<n;i++)
		v[k++]=s[i]-'0';
}
void afis(int v[N])
{
	int i;
	if(v[v[0]]==0)
		printf("%d",0);
	else
		for(i=v[0];i>=1;i--)
			printf("%d",v[i]);
	printf("\n");
}
void suma(int v1[N],int v2[N],int sum[N])
{
	int i,t=0,k=1;
	for(i=1;i<=v1[0]&&i<=v2[0];i++)
	{
		sum[k++]=(v1[i]+v2[i]+t)%10;
		t=(v1[i]+v2[i]+t)/10;
	}
	while(i<=v1[0])
	{
		sum[k++]=(v1[i]+t)%10;
		t=(v1[i]+t)/10;
		i++;
	}
	while(i<=v2[0])
	{
		sum[k++]=(v2[i]+t)%10;
		t=(v2[i]+t)/10;
		i++;
	}
	if(t)
		sum[k++]=t;
	sum[0]=k-1;
}
void scad(int v1[N],int v2[N],int dif[N])
{
	int i,k=1,j;
	//inters(v1,v2);
	for(i=1;i<=v1[0]&&i<=v2[0];i++)
		if(v1[i]-v2[i]>=0)
		{
			dif[k++]=v1[i]-v2[i];
			if(v1[i]-v2[i]==0&&i==v1[0])
			{
			//	v1[0]--;
				//k--;
			}
		}
		else
		{
			dif[k++]=v1[i]+10-v2[i];
			for(j=i+1;v1[j]==0&&j<=v1[0];j++)
				v1[j]=9;
			v1[j]--;
			if(v1[j]==0&&j==v1[0])
				v1[0]--;
		}
	while(i<=v1[0])
	{
		dif[k++]=v1[i];
		i++;
	}
	dif[0]=k-1;
}
int maxim(const void *a,const void *b)
{
	vec *aa,*bb;
	aa=(vec*)a;
	bb=(vec*)b;
	return aa->x-bb->x;
}
int cmp(int c[N],int b[N])
{
	int i;
	if(c[0]>b[0])
		return 1;
	else
		if(c[0]==b[0])
			for(i=c[0];i>=1;i--)
				if(b[i]>c[i])
				{
					return -1;
					break;
				}
				else
					if(b[i]<c[i])
					{
						return 1;
						break;
					}
	return 2;
}
void div(int A[N], int B)  
{  
    int i, t = 0;  
    for (i = A[0]; i > 0; i--, t %= B)  
            A[i] = (t = t * 10 + A[i]) / B;  
    for (; A[0] > 1 && !A[A[0]]; A[0]--);  
}
int mod(int A[], int B)  
{  
    int i, t = 0;  
    for (i = A[0]; i > 0; i--)  
            t = (t * 10 + A[i]) % B;  
    return t;  
}
void inv(char s[N])
{
	int i,j;
	char aux;
	for(i=0,j=strlen(s)-1;i<j;i++,j--)
	{
		aux=s[i];
		s[i]=s[j];
		s[j]=aux;
	}
}
void mul1(int A[N], int B)  
{  
    int i, t = 0;  
    for (i = 1; i <= A[0] || t; i++, t /= 10)  
            A[i] = (t += A[i] * B) % 10;  
    A[0] = i - 1;  
}
void mul2(int A[N], int B[N])  
{  
    int i, j, t, C[N];  
    memset(C, 0, sizeof(C));  
    for (i = 1; i <= A[0]; i++)  
    {  
        for (t=0, j=1; j <= B[0] || t; j++, t/=10)  
			C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;  
        if (i + j - 2 > C[0]) C[0] = i + j - 2;  
    }  
    memcpy(A, C, sizeof(C));  
}
void init(int v[N])
{
	for(int i=0;i<N;i++)
		v[i]=0;
}
void solve()
{
	int i,dif[N],l2[N],d=0,v2[N],v22[N],s12;
	inv(sl);
	creare(sl,l);
	qsort(v,n,sizeof(v[0]),maxim);
	/*for(i=n-1;i>=0;i--)
		scad(l,)*/
	for(i=n-1;i>=0&&!(l[0]==1&&l[1]==0);i--)
	{
		memcpy(l2,l,sizeof(l));
		div(l,(int)pow(c,v[i].x));
		d=0;
		for(int i1=1;i1<=l[0];i1++)
			d=d*10+l[i1];
		init(v2);
		creare(v[i].y,v2);
		memcpy(v22,v2,sizeof(v2));
		//mul1(v2,(int)pow(c,v[i].x))
		if(cmp(l,v2)==-1)
		{
			car[v[i].poz]=d;
			mul1(l,(int)pow(c,v[i].x));
			scad(l2,l,dif);
			//l-=l/(int)pow(c,v[i].x)*(int)pow(c,v[i].x);
			s+=car[v[i].poz];
			memcpy(l,dif,sizeof(l2));
		}
		else
		{
			mul1(v2,(int)pow(c,v[i].x));
			scad(l2,v2,dif);
			memcpy(l2,dif,sizeof(dif));
			//l-=v[i].y*(int)pow(c,v[i].x);
			s12=0;
			for(int i1=v22[0];i1>=1;i1--)
				s12=s12*10+v22[i1];
			car[v[i].poz]=s12;
			s+=car[v[i].poz];
			memcpy(l,l2,sizeof(l2));
		}
	}
	printf("%d\n",s);
	for(i=0;i<n-1;i++)
		printf("%d ",car[i]);
	printf("%d\n",car[i]);
}
int main()
{
	freopen("shop.in","r",stdin);
	freopen("shop.out","w",stdout);
	read();
	solve();
	return 0;
}