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

  typedef struct pp{
    char name[100];
    int t;
  }P;
  P Q[LEN];
  int head,tail,n;
  void enq(P x){
    Q[tail]=x;
    tail=(tail+1)%LEN;
  }
  P dequeue(){
    P x=Q[head];
    head=(head+1)%LEN;
    return x;
  }
  int min(int a,int b){
    if(a<b) return a;
    else return b;
  }
  int main(){
    int elaps=0,m,i,q;
    P u;
    scanf("%d %d",&n,&q);
    for(i=1;i<=n;i++){
      scanf("%s %d",Q[i].name,&Q[i].t);
    }
    head=1;
    tail=n+1;
    while(head != tail){
      u=dequeue();
      m=min(q,u.t);
      u.t -= m;
      elaps +=m;
      if(u.t>0) enq(u);
      else{
        printf("%s %d\n",u.name,elaps);
      }
    }
    return 0;
  }

