#include <stdio.h>
#include <string.h>
//#include <stdlib.h>
#define N 100005

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

P Q[N];
int head,tail,n;

void enqueue(P x){
  Q[tail] = x;
  tail = (tail + 1) % N;
}

P dequeue(){
  P x = Q[head];
  head = (head +1) % N;
  return x;
}

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

int main(){

  int elaps = 0,c;
  int i,q;
  P u;

  scanf("%d %d",&n,&q);

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

   /*i=0;
  while(count!=n){
    if(t[i]<=q){
      total += t[i];
      t[i] = t[i]-t[i];
    }
    else {
      total += q;
      t[i] = t[i]-q;

        ntmp=name[i];
        ttmp=t[i];
        j=0;
        while(t[j+1]!='\0'){
          t[j]=t[j+1];
          name[j]=name[j+1];
          j++;
        }
        name[j]=ntmp;
        t[j]=ttmp;
    }

    if(t[i]==0){
      printf("%s %d\n",name,total);
      count++;
    }

    i++;

  }
  */

  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;
  }

