import java.util.Queue;
import java.util.ArrayDeque;
import java.util.Scanner;

public class Main {
	
	public static void main(String arg[]){
		Scanner sc = new Scanner(System.in);
		Queue<Integer> queue = new ArrayDeque<Integer>();
		Queue<String> name = new ArrayDeque<String>();
		int N = sc.nextInt();
		int q = sc.nextInt();
		int tlen = 0;
		for (int i=0; i<N; i++) {
			name.add(sc.next());
			queue.add(sc.nextInt());
		}
		
		while (queue.size()!=0) {
			
			if (queue.element() > q){
				tlen += q;
				queue.add(queue.element() - q);
				queue.remove();
				name.add(name.element());
				name.remove();
			} else {
				tlen += queue.element();
				System.out.println(name.element()+" "+tlen);
				queue.remove();
				name.remove();
			}
		}
	}	
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz