import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

public class RodendeniEden {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        HashMap<String, TreeSet<Vraboten>> vraboteni = new HashMap<>();
        int n = Integer.parseInt(sc.nextLine());
        for (int i = 0; i < n; i++) {
            String[] parts = sc.nextLine().split(" ");
            Vraboten v = new Vraboten(parts[0], parts[1], parts[2]);
            String date = parts[2].substring(0, parts[2].length() - 5);
            TreeSet<Vraboten> ts = vraboteni.get(date);
            if (ts == null) {
                ts = new TreeSet<>();
            }
            ts.add(v);
            vraboteni.put(date, ts);
        }

        String date = sc.nextLine();
        int year = Integer.parseInt(date.substring(6));
        date = date.substring(0, date.length() - 5);
        TreeSet<Vraboten> ts = vraboteni.get(date);
        if (ts == null) {
            System.out.println("Nema");
        } else {
            for (Vraboten vraboten : ts) {
                System.out.printf("%s %d\n", vraboten, vraboten.getAge(year));
            }
        }

        sc.close();
    }
}

class Vraboten implements Comparable<Vraboten> {
    private String name;
    private String surname;
    private String date;

    public Vraboten(String name, String surname, String date) {
        this.name = name;
        this.surname = surname;
        this.date = date;
    }

    public int getAge(int n) {
        int year = Integer.parseInt(date.split("/")[2]);
        return n - year;
    }

    @Override
    public int compareTo(Vraboten o) {
        return name.compareTo(o.name);
    }

    @Override
    public String toString() {
        return String.format("%s %s", name, surname);
    }

}