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

#define MAX 100005

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

TASK task[MAX];
int head, tail, n;

void enqueue(TASK x) {
  task[tail] = x;
  tail = (tail + 1) % MAX;
}

TASK dequeue() {
  TASK x = task[head];
  head = (head + 1) % MAX;
  return x;
}

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

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

  for (i = 1; i <= n; i++) {
    scanf("%s", task[i].name);
    scanf("%d", &task[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;
}