#include<stdio.h>
#include<stdlib.h>
#include<string.h>

#define LEN 100005

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

void initialize();
int isEmpty();
int isFull();
void enqueue(P x);
P dequeue();
int min(int a,int b);



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

int main(){
  int elaps = 0, c;
  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);
  }

  head=1;  tail = n+1;

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

  return 0;
}

void initialize(){
  head = tail = 0;
}

int isEmpty(){
    if(head == tail){
      return 1;
    }
    return 0;
  }

int isFull(){
    if(head == (tail + 1) % LEN){
    return 1;
  }
  return 0;
}

void enqueue(P x){
   if (isFull()){
     printf("errer");
   }
   Q[tail] = x;
   if(tail + 1 == LEN){
     tail = 0;
   }else{
        tail++;
      }
}

 P dequeue(){
   if(isEmpty()){
     printf("errer");
   }
   P x = Q[head];
   if(head + 1 == LEN){
     head = 0;
   }else{
     head++;
   }
   return x;
 }

 int min(int a,int b){
   return a<b ? a:b;
 }

