//#define USE_CPP11
// #define USE_PRINTF

#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <complex>
#include <memory>
#include <sstream>

#ifdef USE_CPP11
#include <unordered_map>
#include <unordered_set>
#include <functional>
#endif

#define PRINT(obj) cout << obj << endl
#define REP(i, n) for(int (i) = 0; (i) < (n); i++)
#define SPACE " "

typedef long long ll;

const int INF = 1e9 + 10;

using namespace std;

namespace Scanner {
#ifdef USE_PRINTF
  int    nextInt()    { int    d; scanf("%d" , &d); return d; }
  float  nextFloat()  { float  f; scanf("%f" , &f); return f; }
  double nextDouble() { double f; scanf("%lf", &f); return f; }  
  string nextString() { string s; scanf("%s" , &s); return s; }
  ll     nextll()     { ll     l; scanf("%ll", &l); return l; }
#else
  int    nextInt()    { int    d; cin >> d; return d; }
  float  nextFloat()  { float  f; cin >> f; return f; }
  double nextDouble() { double f; cin >> f; return f; }  
  string nextString() { string s; cin >> s; return s; }
  ll     nextll()     { ll     l; cin >> l; return l; }
#endif

  string getLine() { 
    string input;
    getline(cin, input);
    return input;
  }
};

namespace myLibrary {
  vector<string> split(const string& str, char delim) {
    vector<string> ret;
    size_t current = 0, found;
    while ((found = str.find_first_of(delim, current)) != string::npos) {
      ret.push_back(string(str, current, found - current));
      current = found + 1;
    }
    ret.push_back(string(str, current, str.size() - current));
    return ret;
  }
  
#ifdef USE_CPP11
  ///
  /// higher-order functional
  /// This is something like map in haskell, python, etc.
  /// Sample usage:
  ///   vector<int> a = {1, 2, 3, 4, 5};
  ///   vector<int> b = myLibrary::_Map<int, int>(a, [](int n){
  ///     return n * n;
  ///   });
  /// Result:
  ///   b = 1, 4, 9, 16, 25
  ///
  template<typename T_IN, typename T_OUT, class Functor>
  vector<T_OUT> _Map(vector<T_IN> src, Functor func) {
    vector<T_OUT> ret;
    for (int i = 0; i < src.size(); i++) {
      ret.push_back(func(src[i]));
    }
    return ret;
  }
#endif

};

/// BEGIN //////////////////////////////////////////////////////////

struct State {
public:
  int teamID;
  int acCount;
  int waCount[11];
  int penalty;

  State():acCount(0), penalty(0) { 
    memset(waCount, 0, sizeof(waCount));
  }
};

int main() {
  while (true) {
    int T = Scanner::nextInt();
    int P = Scanner::nextInt();
    int R = Scanner::nextInt();
    
    if (T + P + R == 0) {
      break;
    }

    vector<State> score(T);
    
    REP(i, T) {
      score[i].teamID = i + 1;
    }

    REP(i, R) {
      int tID        = Scanner::nextInt() - 1;
      int pID        = Scanner::nextInt() - 1;
      int time       = Scanner::nextInt();
      string message = Scanner::nextString();
      if (message == "WRONG") {
        score[tID].waCount[pID]++;
      } else if (message == "CORRECT") {
        score[tID].acCount++;
        score[tID].penalty += score[tID].waCount[pID] * 1200 + time;
      }
    }

    sort(score.begin(), score.end(), [](State a, State b) {
      if (a.acCount == b.acCount) {
        if (a.penalty == b.penalty) {
          return a.teamID < b.teamID;
        }
        return a.penalty < b.penalty;
      }
      return a.acCount > b.acCount;
    });

    REP(i, T) {
      cout << score[i].teamID << SPACE << score[i].acCount << SPACE << score[i].penalty << endl;
    }
  }  

  return 0;
}
/// END   //////////////////////////////////////////////////////////

Measured memory_bytes: 3160