Problem: Facetook is a well known social network website, and it will launch a new feature called Facetook Priority Wall. This feature will sort all posts from your friends according to the priority factor (it will be described).

This priority factor will be affected by three types of actions: 

  * 1. "X posted on Y's wall" (15 points), 
  * 2. "X commented on Y's post" (10 points), 
  * 3. "X likes Y's post" (5 points). 



X and Y will be two distinct names. And each action will increase the priority factor between X and Y (and vice versa) by the above value of points (the priority factor between X and Y is the same as the priority factor between Y and X).

You will be given n actions with the above format (without the action number and the number of points), and you have to print all the distinct names in these actions sorted according to the priority factor with you.

Input

The first line contains your name. The second line contains an integer n, which is the number of actions (1 ≤ n ≤ 100). Then n lines follow, it is guaranteed that each one contains exactly 1 action in the format given above. There is exactly one space between each two words in a line, and there are no extra spaces. All the letters are lowercase. All names in the input will consist of at least 1 letter and at most 10 small Latin letters.

Output

Print m lines, where m is the number of distinct names in the input (excluding yourself). Each line should contain just 1 name. The names should be sorted according to the priority factor with you in the descending order (the highest priority factor should come first). If two or more names have the same priority factor, print them in the alphabetical (lexicographical) order.

Note, that you should output all the names that are present in the input data (excluding yourself), even if that person has a zero priority factor.

The lexicographical comparison is performed by the standard "<" operator in modern programming languages. The line a is lexicographically smaller than the line b, if either a is the prefix of b, or if exists such an i (1 ≤ i ≤ min(|a|, |b|)), that ai < bi, and for any j (1 ≤ j < i) aj = bj, where |a| and |b| stand for the lengths of strings a and b correspondently.

Examples

Input

ahmed
3
ahmed posted on fatma's wall
fatma commented on ahmed's post
mona likes ahmed's post


Output

fatma
mona


Input

aba
1
likes likes posted's post


Output

likes
posted

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long int M = 1000000007;
long long int i, j;
long long int fac(long long int x);
long long int inv_fac(long long int x);
long long int binexp(long long int a, long long int b);
long long int fac(long long int x) {
  long long int fcto = 1;
  for (long long int i = 2; i <= x; i++) {
    fcto *= i;
    fcto %= M;
  }
  return fcto;
}
long long int inv_fac(long long int x) { return binexp(fac(x), M - 2); }
long long int binexp(long long int a, long long int b) {
  if (a == 0 || a == 1) return a;
  if (b == 0) return 1;
  long long int ret = binexp(a, b / 2);
  if (b % 2)
    return (((ret * ret) % M) * a) % M;
  else
    return (ret * ret) % M;
}
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second > b.second;
}
long long int isPrime(long long int n) {
  if (n <= 3) return (1);
  if (n % 2 == 0 || n % 3 == 0) return (0);
  for (i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return (0);
  return (1);
}
long long int smallestDivisor(long long int n) {
  if (n % 2 == 0) return 2;
  for (i = 3; i * i <= n; i += 2) {
    if (n % i == 0) return i;
  }
  return n;
}
long long maxPrimeFactors(long long n) {
  long long maxPrime = -1;
  while (n % 2 == 0) {
    maxPrime = 2;
    n >>= 1;
  }
  for (i = 3; i <= sqrt(n); i += 2) {
    while (n % i == 0) {
      maxPrime = i;
      n = n / i;
    }
  }
  if (n > 2) maxPrime = n;
  return maxPrime;
}
long long int countDivisors(long long int n) {
  long long int cnt = 0;
  for (i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        cnt++;
      else
        cnt = cnt + 2;
    }
  }
  return cnt;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
  long long int tt = 1;
  while (tt--) {
    string name;
    cin >> name;
    long long int n;
    cin >> n;
    map<string, long long int> mp;
    while (n--) {
      string a, b, c, d, e;
      cin >> a >> b >> c >> d;
      if (c == "on") {
        cin >> e;
        string k = d.substr(0, d.size() - 2);
        if (a == name || k == name) {
          if (b == "posted") {
            mp[a] += 15;
            mp[k] += 15;
          } else {
            mp[a] += 10;
            mp[k] += 10;
          }
        } else {
          mp[a] += 0;
          mp[k] += 0;
        }
      } else {
        string k = c.substr(0, c.size() - 2);
        if (a == name || k == name) {
          mp[a] += 5;
          mp[k] += 5;
        } else {
          mp[a] += 0;
          mp[k] += 0;
        }
      }
    }
    map<string, long long int>::iterator itr;
    vector<pair<long long int, string>> vv;
    for (itr = mp.begin(); itr != mp.end(); itr++) {
      if (itr->first != name) {
        vv.push_back({itr->second, itr->first});
      }
    }
    sort(vv.begin(), vv.end());
    reverse(vv.begin(), vv.end());
    for (i = 0; i < vv.size(); i++) {
      long long int kk = i;
      while (kk < vv.size() && vv[kk].first == vv[i].first) {
        kk++;
        if (kk == vv.size()) {
          break;
        }
      }
      for (j = kk - 1; j >= i; j--) {
        cout << vv[j].second << "\n";
      }
      i = kk - 1;
    }
  }
}