#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
 
using namespace std;
 
#if __GNUC__
#include <tr1/unordered_map>
#include <tr1/unordered_set>
using namespace tr1;
#else
#include <unordered_map>
#include <unordered_set>
#endif
 
 
 
#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int popcount(T n) { return n ? 1 + popcount(n & (n - 1)) : 0; }
#endif
#ifdef __GNUC__
template <class T> int popcount(T n);
template <> int popcount(unsigned int n) { return __builtin_popcount(n); }
template <> int popcount(int n) { return __builtin_popcount(n); }
template <> int popcount(unsigned long long n) { return __builtin_popcountll(n); }
template <> int popcount(long long n) { return __builtin_popcountll(n); }
#endif
 
#define rep (i, n) for (int i = 0; i < (int)n; ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define MEMCPY(dest, src) memcpy(dest, src, sizeof(src))
 
 
template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }
 
typedef long long ll;
typedef pair<int, int> pint;
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
 
const double EPS = 1e-8;
const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };
bool valid_pos(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }
 
template <class T> void print(T a, int n, int br = 1, const string& deli = ", ") { cout << "{ "; for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } cout << " }"; while (br--) cout << endl; }
template <class T> void print(const vector<T>& v, int br = 1, const string& deli = ", ") { print(v, v.size(), br, deli); }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {	if (width != -1) cout.width(width); cout << a[i][j] << ' ';	} cout << endl; } while (br--) cout << endl; }
 
template <class T> void input(int n, T& a) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T, class U> void input(int n, T& a, U& b) { for (int i = 0; i < n; ++i) cin >> a[i] >> b[i]; }
template <class T> vector<T> input(int n) { vector<T> res(n); for (int i = 0; i < n; ++i) cin >> res[i]; return res; }



struct Team
{
	int ac, pena, id;
	Team(int id)
		: id(id), ac(0), pena(0) { }
	bool operator<(const Team& o) const
	{
		if (ac != o.ac)
			return ac > o.ac;
		else if (pena != o.pena)
			return pena < o.pena;
		else
			return id < o.id;
	}
};
struct Log
{
	int tid, pid, time;
	bool correct;
	Log(int tid, int pid, int time, bool correct)
		: tid(tid), pid(pid), time(time), correct(correct) { }
	bool operator<(const Log& o) const
	{
		return time < o.time;
	}
};
int main()
{
	int t, p, r;
	while (cin >> t >> p >> r, t | p | r)
	{
		vector<Team> team;
		for (int i = 0; i < t; ++i)
			team.push_back(Team(i));

		vector<Log> log;
		while (r--)
		{
			int tid, pid, time;
			string mes;
			cin >> tid >> pid >> time >> mes;
			--tid, --pid;
			log.push_back(Log(tid, pid, time, mes[0] == 'C'));
		}
		sort(all(log));

		int wa[55][16];
		CL(wa, 0);
		foreach (it, log)
		{
			if (it->correct)
			{
				Team& a = team[it->tid];
				++a.ac;
				a.pena += wa[it->tid][it->pid] * 1200 + it->time;
			}
			else
				++wa[it->tid][it->pid];
		}

		sort(all(team));
		foreach (it, team)
			printf("%d %d %d\n", it->id + 1, it->ac, it->pena);
	}
}

Measured memory_bytes: 964