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

typedef struct pp{
    char name[100];
    int t;
} P;
P Q[LEN+1];

int head, tail, n;
void enqueue();
P dequeue();
void initialize();
int isEmpty();
int isFull();
int min(int, int);
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 enqueue(P x){
    if( isFull()==0 ){
        fprintf(stderr,"error:isEmpty\n");
    }
    Q[tail] = x;
    if(tail + 1  == LEN) {
        tail = 0;
    }
    else {
        tail++;
    }
}

P dequeue(){
    P x;
    if( isEmpty()==0 ){
        fprintf(stderr,"error:isEmpty\n");
    }
    x = Q[head];
    if(head + 1 == LEN) {
        head = 0;
    }
    else {
        head++;
    }
    return x;
}

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

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

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

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

