#include <stdio.h>
#include <string.h>
#define LEN 100005

typedef struct pp
{
  char name[100];
  int t;
}P;

P Q[LEN+1];
int head=0,tail=0,n;

void enqueue(P);
P dequeue(void);

int main()
{
  int elaps=0,c=0;
  int i,q;
  P u;
  scanf("%d%d",&n,&q);

  for(i=1;i<=n;i++)
    {
      scanf("%s",Q[i].name);
      scanf("%d",&Q[i].t);
      enqueue(Q[i]);
    }

  while(c<5)
    {
      u=dequeue();
      if(u.t > q)
	{
	elaps+=q;
	u.t-=q;
	enqueue(u);
	}
      else if(u.t <= q)
	{
	  c++;
	  elaps+=u.t;
	  printf("%s %d\n",u.name,elaps);
	}
    }
  return 0;
}

void enqueue(P x)
{
  if(head == (tail +1)%LEN)
    {
      printf("error(over flow)");
    }
  Q[tail]=x;
  if(tail+1 == LEN)
    {
      tail=0;
    }
  else
    {
      tail++;
    } 
}


P dequeue(void)
{
  P x;
  if(head == tail)
    {
      printf("error(under flow)");
    }
  x=Q[head];
  if(head+1 == LEN)
    {
      head =0;
    }
   else
    {
      head++;
    }
  return x;
}