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

#define LEN 100005

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

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

int isEmpty() {
    return head == tail;    
}

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

void enqueue(P x) {
    if (isFull()) {
        printf("Queue is full");
        exit(0);
    }
    Q[tail] = x;
    if (tail + 1 > LEN) {
        tail = 0;
    } else {
        tail++;
    }
}

P dequeue() {
    int prehead = head;
    if (isEmpty()) {
        printf("Queue is empty");
        exit(0);
    }
    if (head + 1 > LEN) {
        head = 0;
    } else {
        head++;
    }
    return Q[prehead];
}

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) % (LEN + 1);

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

