//

//  1446 Head of a Gang.cpp

//  Jobdu

//

//  Created by PengFei_Zheng on 17/04/2017.

//  Copyright © 2017 PengFei_Zheng. All rights reserved.

//

#include <stdio.h>

#include <map>

#include <vector>

#include <string>

#include <string.h>

#include <algorithm>

#include <list>

#define maxn 1010

using namespace std;

int parent[maxn];

int n, k, i;

int currNum;

map<string, int> baseMap;

char marray[maxn][];

char resultArr[maxn][];

int callTime[maxn];

int singleCallTime[maxn];

int fatherArr[maxn];

int visit[maxn];

struct Node {

    char name[];

    int size;

} nodes[maxn];

//并查集寻找父亲节点

int findRoot(int x) {

    while (parent[x] != x) {

        x = parent[x];

    }

    return x;

}

//并查集合并节点

void unionSet(int a, int b) {

    a = findRoot(a);

    b = findRoot(b);

    if (a == b) return;

    if (a > b) {

        parent[a] = b;

    } else {

        parent[b] = a;

    }

}

//初始化基本数据，这在以后会用到

void initData() {

    baseMap.clear();

    memset(callTime, , sizeof(callTime));

    memset(visit, , sizeof(visit));

    memset(singleCallTime, , sizeof(singleCallTime));

    memset(fatherArr, , sizeof(fatherArr));

    for (i = ; i < maxn; i++) {

        parent[i] = i;

    }

}

//将字符串转为数字，否则后面不太好处理

int getCurrentNum(char c[]) {

    int num = ;

    map<string, int>::iterator it = baseMap.find(c);

    if (it == baseMap.end()) {

        currNum++;

        num = currNum;

        baseMap.insert(make_pair(c, num));

    } else {

        num = it->second;

    }

    return num;

}

//记录每个人打电话的时间

void constructData(char a[], char b[], int anum, int bnum, int d) {

    if (singleCallTime[anum] == ) {

        singleCallTime[anum] = d;

    } else {

        singleCallTime[anum] += d;

    }

    strcpy(marray[anum], a);

    strcpy(marray[bnum], b);

    callTime[anum] += d;

    callTime[bnum] += d;

}

bool cmp(Node node1, Node node2) {

    return strcmp(node1.name, node2.name) < ;

}

int main() {

    while (scanf("%d%d", &n, &k) != EOF) {

        initData();

        currNum = ;

        char a[];

        char b[];

        int d;

        for (i = ; i < n; i++) {

            scanf("%s%s%d", a, b, &d);

            int anum = getCurrentNum(a);

            int bnum = getCurrentNum(b);

            constructData(a, b, anum, bnum, d);

            unionSet(anum, bnum);

        }

        int tmpk = ;

        for (i = ; i < currNum + ; i++) {

            parent[i] = findRoot(i);

            if (parent[i] == i) {

                fatherArr[tmpk] = i;

                tmpk++;

            }

        }

        int num = ;

        for (i = ; i < tmpk; i++) {

            int size = ;

            int allTime = ;

            int maxTime = -;

            int maxMem = ;

            for (int j = ; j < currNum + ; j++) {

                if (fatherArr[i] !=  && visit[j] == ) {

                    if (parent[j] == fatherArr[i]) {

                        size++;

                        allTime += singleCallTime[j];

                        if (callTime[j] > maxTime) {

                            maxTime = callTime[j];

                            maxMem = j;

                        }

                        visit[j] = ;

                    }

                }

            }

            if (size < ) {

                continue;

            }

            if (allTime <= k) {

                continue;

            }

            strcpy(nodes[num].name, marray[maxMem]);

            nodes[num].size = size;

            num++;

        }

        sort(nodes, nodes + num, cmp);

        printf("%d\n", num);

        for (i = ; i < num; i++) {

            printf("%s %d\n", nodes[i].name, nodes[i].size);

        }

    }

    return ;

}

/**************************************************************

    Problem: 1446

    User: zpfbuaa

    Language: C++

    Result: Accepted

    Time:30 ms

    Memory:1096 kb

****************************************************************/