Problem: Yet another education system reform has been carried out in Berland recently. The innovations are as follows:

An academic year now consists of n days. Each day pupils study exactly one of m subjects, besides, each subject is studied for no more than one day. After the lessons of the i-th subject pupils get the home task that contains no less than ai and no more than bi exercises. Besides, each subject has a special attribute, the complexity (ci). A school can make its own timetable, considering the following conditions are satisfied:

  * the timetable should contain the subjects in the order of the complexity's strict increasing; 
  * each day, except for the first one, the task should contain either k times more exercises, or more by k compared to the previous day (more formally: let's call the number of home task exercises in the i-th day as xi, then for each i (1 < i ≤ n): either xi = k + xi - 1 or xi = k·xi - 1 must be true); 
  * the total number of exercises in all home tasks should be maximal possible. 



All limitations are separately set for each school.

It turned out that in many cases ai and bi reach 1016 (however, as the Berland Minister of Education is famous for his love to half-measures, the value of bi - ai doesn't exceed 100). That also happened in the Berland School №256. Nevertheless, you as the school's principal still have to work out the timetable for the next academic year...

Input

The first line contains three integers n, m, k (1 ≤ n ≤ m ≤ 50, 1 ≤ k ≤ 100) which represent the number of days in an academic year, the number of subjects and the k parameter correspondingly. Each of the following m lines contains the description of a subject as three integers ai, bi, ci (1 ≤ ai ≤ bi ≤ 1016, bi - ai ≤ 100, 1 ≤ ci ≤ 100) — two limitations to the number of exercises on the i-th subject and the complexity of the i-th subject, correspondingly. Distinct subjects can have the same complexity. The subjects are numbered with integers from 1 to m. 

Please do not use the %lld specificator to read or write 64-bit numbers in С++. It is preferred to use the cin stream or the %I64d specificator.

Output

If no valid solution exists, print the single word "NO" (without the quotes). Otherwise, the first line should contain the word "YES" (without the quotes) and the next n lines should contain any timetable that satisfies all the conditions. The i + 1-th line should contain two positive integers: the number of the subject to study on the i-th day and the number of home task exercises given for this subject. The timetable should contain exactly n subjects.

Examples

Input

4 5 2
1 10 1
1 10 2
1 10 3
1 20 4
1 100 5


Output

YES
2 8
3 10
4 20
5 40


Input

3 4 3
1 3 1
2 4 4
2 3 3
2 2 2


Output

NO

Solution (in JAVA):

Solution:
import java.util.Arrays;
import java.util.Scanner;

public class C {
    static class subj implements Comparable<subj> {
        long min, max;
        int comp, idx;

        public subj(long mn, long mx, int c, int i) {
            min = mn;
            max = mx;
            comp = c;
            idx = i;
        }

        public int compareTo(subj a) {
            if (a.comp < comp) {
                return 1;
            }
            return -1;
        }
    }

    static subj[] ar;
    static long k;
    static long[][][][] dp;
    static byte[][][][] path;
    static int next[];
    static long inf = (long) (1e18);

    public static long solve(int curIdx, int rem, int prev, int prevOffset) {
        if (rem == 0) {
            return 0;
        }
        if (curIdx == ar.length) {
            return -inf;
        }
        if (dp[curIdx][rem][prev][prevOffset] != -1)
            return dp[curIdx][rem][prev][prevOffset];
        long prevWork = ar[prev].min + prevOffset;
        long option1 = k + prevWork, option2 = k * prevWork;
        long max = -inf;
        if (option1 <= ar[curIdx].max && option1 >= ar[curIdx].min) {
            long tmp = option1
                    + solve(next[curIdx], rem - 1, curIdx,
                            (int) (option1 - ar[curIdx].min));
            if (tmp > max) {
                max = tmp;
                path[curIdx][rem][prev][prevOffset] = (byte) (1);
            }
        }
        if (option2 <= ar[curIdx].max && option2 >= ar[curIdx].min) {
            long tmp = option2
                    + solve(next[curIdx], rem - 1, curIdx,
                            (int) (option2 - ar[curIdx].min));
            if (tmp > max) {
                max = tmp;
                path[curIdx][rem][prev][prevOffset] = (byte) (2);
            }
        }
        long tmp = solve(curIdx + 1, rem, prev, prevOffset);
        if (tmp > max) {
            max = tmp;
            path[curIdx][rem][prev][prevOffset] = (byte) (3);
        }
        return dp[curIdx][rem][prev][prevOffset] = max;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        k = sc.nextInt();
        ar = new subj[m];
        for (int i = 0; i < m; i++) {
            ar[i] = new subj(sc.nextLong(), sc.nextLong(), sc.nextInt(), i + 1);
        }
        Arrays.sort(ar);
        next = new int[m];
        for (int i = 0; i < m; i++) {
            int j = i + 1;
            for (; j < m; j++) {
                if (ar[j].comp > ar[i].comp) {
                    break;
                }
            }
            next[i] = j;
        }
        dp = new long[m][n + 1][m][101];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j <= n; j++)
                for (int k = 0; k < m; k++)
                    Arrays.fill(dp[i][j][k], -1);
        }
        path = new byte[m][n + 1][m][101];
        int bestStIdx=-1,bestOffset=-1;
        long max = -inf;
        for(int i=0;i<m;i++){
            int interval=(int) (ar[i].max-ar[i].min);
            for(int j=0;j<=interval;j++){
                long tmp=j+ar[i].min+solve(next[i], n-1, i, j);
                if(tmp>max){
                    max=tmp;
                    bestStIdx=i;
                    bestOffset=j;
                }
            }
        }
        if(max<=0){
            System.out.println("NO");
        }else {
            System.out.println("YES");
            System.out.println((ar[bestStIdx].idx)+" "+(ar[bestStIdx].min+bestOffset));
            int curPrev=bestStIdx;
            bestStIdx=next[bestStIdx];
            int rem=n-1;
            while(rem>0){
                byte cur=path[bestStIdx][rem][curPrev][bestOffset];
                if(cur==1){
                    System.out.println((ar[bestStIdx].idx)+" "+(k+ar[curPrev].min+bestOffset));
                    bestOffset=(int) ((k+ar[curPrev].min+bestOffset)-ar[bestStIdx].min);
                    rem--;
                    curPrev=bestStIdx;
                    bestStIdx=next[bestStIdx];
                }else if(cur==2){
                    System.out.println((ar[bestStIdx].idx)+" "+(k*(ar[curPrev].min+bestOffset)));
                    bestOffset=(int) ((k*(ar[curPrev].min+bestOffset))-ar[bestStIdx].min);
                    rem--;
                    curPrev=bestStIdx;
                    bestStIdx=next[bestStIdx];
                }else {
                    bestStIdx++;
                }
            }
        }
        
    }
}