import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
    	int n = scan.nextInt();
    	int q = scan.nextInt();
    	int[] tqueue = new int[n];
    	String[] nqueue = new String[n];
    	int start = 0;
    	int end = n - 1;
    	int now = 0;
    	int how = n;
    	
    	for(int i = 0; i < n; i++){
    		nqueue[i] = scan.next();
    		tqueue[i] = scan.nextInt();
    	}
    	
    	while(how > 0){
    		if(tqueue[start] <= q){
    			now += tqueue[start];
    			System.out.println(nqueue[start]+" "+now);
    			start = (start + 1)%n;
    			how--;
    		}else{
    			now += q;
    			end = (end + 1)%n;
    			tqueue[end] = tqueue[start] - q;
    			nqueue[end] = nqueue[start];
    			start = (start + 1)%n;
    		}
    	}
    }
}

/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