Problem:
There are n processes in a queue. Each process has namei and timei. The round-robin scheduling handles the processes in order. A round-robin scheduler gives each process a quantum (a time slot) and interrupts the process if it is not completed by then. The process is resumed and moved to the end of the queue, then the scheduler handles the next process in the queue.

For example, we have the following queue with the quantum of 100ms.

A(150) - B(80) - C(200) - D(200)

First, process A is handled for 100ms, then the process is moved to the end of the queue with the remaining time (50ms).

B(80) - C(200) - D(200) - A(50)

Next, process B is handled for 80ms. The process is completed with the time stamp of 180ms and removed from the queue.

C(200) - D(200) - A(50)

Your task is to write a program which simulates the round-robin scheduling.

Input

n q

name1 time1

name2 time2

...

namen timen

In the first line the number of processes n and the quantum q are given separated by a single space.

In the following n lines, names and times for the n processes are given. namei and timei are separated by a single space.

Output

For each process, prints its name and the time the process finished in order.

Constraints

1 ≤ n ≤ 100000

1 ≤ q ≤ 1000

1 ≤ timei ≤ 50000

1 ≤ length of namei ≤ 10

1 ≤ Sum of timei ≤ 1000000

Sample Input 1

5 100
p1 150
p2 80
p3 200
p4 350
p5 20

Sample Output 1

p2 180
p5 400
p1 450
p3 550
p4 800

Notes

Template in C

Solution in C (judge verdict: Accepted)

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

#define NAME_LEN 11 // name に入る文字長の最大 + 1('\0')
// ノードを表す構造体
struct Node{
    char name[NAME_LEN];
    int data;
    struct Node *next;
};

typedef struct Node Node;
Node *create_node(const char *new_name, int new_data);
void clear_list(Node *head);
int pop_front(Node **head_pointer, Node **tail_pointer);
void push_back(Node **head_pointer, Node **tail_pointer, char *new_name, int new_data);
void print_list(const Node *head);


int main(void){
    Node *head = NULL;
    Node *tail = NULL; // tail -> next = NULL
    int n, q, time;
    char name[NAME_LEN];
    scanf("%d %d", &n, &q);
    for(int i=0; i<n; i++){
        scanf("\n%s %d", name, &time);
        // printf("name is %s, time is %d\n", name, time);
        push_back(&head, &tail, name, time);
    }

    int elapsed_time = 0;
    while(n > 0){
        if(head->data <= q){
            elapsed_time += head->data;
            printf("%s %d\n", head->name, elapsed_time);
            pop_front(&head, &tail);
            n--;
        }
        else{
            elapsed_time += q;
            // char name[NAME_LEN];
            strcpy(name, head->name);
            int data = head->data - q;
            pop_front(&head, &tail);
            push_back(&head, &tail, name, data);
        }
    }

    return 0;
}

// 新しいノードのメモリを確保する
Node *create_node(const char *new_name, int new_data){
    Node *new_node = (Node *)malloc(sizeof(Node));
    if (!new_node) {
        fprintf(stderr, "could not allocate a node.\n");
        exit(1);
    }
    strcpy(new_node->name, new_name);
    new_node->data = new_data;
    new_node->next = NULL;
    // static Node new_node = {new_name, new_data, NULL}; // 定数じゃない（と静的領域にいない）のでだめ
    return new_node;
}


// リストのメモリを解放する
void clear_list(Node *head){
    while(head){
        Node *target = head;
        head = head->next;
        free(target);
    }
}

// pop した数を返す
int pop_front(Node **head_pointer, Node **tail_pointer){
    // そもそも空
    if(*head_pointer == NULL){
        fprintf(stderr, "mou pop dekinai\n");
        return 0;
    }

    Node *temp_head = *head_pointer;
    int ans = temp_head->data;
    // head を次のやつに更新
    *head_pointer = (*head_pointer) -> next;
    // head = tail, すなわち head->next = NULL のときはどっちも NULL にしないとだめ
    if(*head_pointer == NULL){
        *tail_pointer = NULL;
    }
    free(temp_head);
    return ans;
    
}


void push_back(Node **head_pointer, Node **tail_pointer, char *name, int new_data){
    if(*tail_pointer == NULL){
        // 今はまだ空
        Node *new_node = create_node(name, new_data);
        *head_pointer = new_node;
        *tail_pointer = new_node;
        return;
    }

    Node *newnode = create_node(name, new_data);
    (*tail_pointer)->next = newnode;
    *tail_pointer = newnode;

    return;
}


// リストの要素を先頭から順に出力する
void print_list(const Node *head){
  while(head){
    printf("| %d |-> ", head->data);
    head = head->next;
  }
  printf("NULL\n");
}