Problem: Polycarpus has a hobby — he develops an unusual social network. His work is almost completed, and there is only one more module to implement — the module which determines friends. Oh yes, in this social network one won't have to add friends manually! Pairs of friends are deduced in the following way. Let's assume that user A sent user B a message at time t1, and user B sent user A a message at time t2. If 0 < t2 - t1 ≤ d, then user B's message was an answer to user A's one. Users A and B are considered to be friends if A answered at least one B's message or B answered at least one A's message.

You are given the log of messages in chronological order and a number d. Find all pairs of users who will be considered to be friends.

Input

The first line of the input contains two integers n and d (1 ≤ n, d ≤ 1000). The next n lines contain the messages log. The i-th line contains one line of the log formatted as "Ai Bi ti" (without the quotes), which means that user Ai sent a message to user Bi at time ti (1 ≤ i ≤ n). Ai and Bi are non-empty strings at most 20 characters long, consisting of lowercase letters ('a' ... 'z'), and ti is an integer (0 ≤ ti ≤ 10000). It is guaranteed that the lines are given in non-decreasing order of ti's and that no user sent a message to himself. The elements in the lines are separated by single spaces.

Output

In the first line print integer k — the number of pairs of friends. In the next k lines print pairs of friends as "Ai Bi" (without the quotes). You can print users in pairs and the pairs themselves in any order. Each pair must be printed exactly once.

Examples

Input

4 1
vasya petya 1
petya vasya 2
anya ivan 2
ivan anya 4


Output

1
petya vasya


Input

1 1000
a b 0


Output

0

Note

In the first sample test case Vasya and Petya are friends because their messages' sending times are one second apart. Anya and Ivan are not, because their messages' sending times differ by more than one second.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.StringTokenizer;
import java.util.TreeSet;
import java.util.Vector;


public class AFriendsOrNot {
    public class Mail
    {
        String A;
        String B;
        int d;
        public Mail(String A, String B, int d)
        {
            this.A = A;
            this.B = B;
            this.d = d;
        }
        public boolean same(Mail o)
        {
            return o.A.equals(B) && o.B.equals(A); 
        }
    }
    public static void main(String[]arg)throws IOException
    {
        new AFriendsOrNot().solve();
    }
    public void solve()throws IOException
    {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        StringTokenizer st = new StringTokenizer(in.readLine());
        int n = Integer.parseInt(st.nextToken());
        int d = Integer.parseInt(st.nextToken());
        if(n == 1)
            out.println(0);
        else
            if(n > 1)
            {
                int cont = 0;
                Mail[]ms = new Mail[n];
                for(int i = 0; i < n; i++)
                {
                    st = new StringTokenizer(in.readLine());
                    String A = st.nextToken();
                    String B = st.nextToken();
                    int dd = Integer.parseInt(st.nextToken());
                    ms[i] = new Mail(A, B, dd);
                }
                TreeSet<String> tree = new TreeSet<String>();
                StringBuilder ans = new StringBuilder();
                for(int i = 0; i < n; i++)
                    for(int j = i + 1; j < n; j++)
                        if(ms[i].same(ms[j]) && ms[j].d - ms[i].d <= d && ms[j].d - ms[i].d != 0)
                        {
                            //System.out.println("sad");
                            if(!tree.contains(ms[j].A + " " + ms[j].B))
                            {
                                //System.out.println("sdf");
                                tree.add(ms[j].A+" "+ms[j].B);
                                tree.add(ms[j].B+" "+ms[j].A);
                                ans.append(ms[j].A+" "+ms[j].B + "\n");
                                cont++;
                            }
                        }
                if(cont > 0)
                {
                    out.println(cont);
                    out.println(ans);
                }
                else
                    out.println(0);
            }
        out.close();
    }
    
    
}