Go: // You Are the Judge(審判は君だ！)
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2400&lang=jp
package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

type Team struct {
	TID         int
	Accepted    int
	WrongAnswer map[int]int
	Penalty     int
}

type Teams []Team

func (t Teams) Len() int      { return len(t) }
func (t Teams) Swap(i, j int) { t[i], t[j] = t[j], t[i] }
func (t Teams) Less(i, j int) bool {
	// より多くの問題を解いたチームは順位が上になる
	if t[i].Accepted > t[j].Accepted {
		return true
	} else if t[i].Accepted == t[j].Accepted {
		// 解いた問題が同じ場合、ペナルティの少ないチームのほうが順位が上になる
		if t[i].Penalty < t[j].Penalty {
			return true
		} else if t[i].Penalty == t[j].Penalty {
			// 解いた問題もペナルティも同じ場合、チーム番号が小さいほうのチームが順位が上になる
			if t[i].TID < t[j].TID {
				return true
			}
		}
	}
	return false
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	for {
		t, p, r := nextInt(sc), nextInt(sc), nextInt(sc)
		if t == 0 && p == 0 && r == 0 {
			break
		}

		teams := []Team{}
		for tID := 0; tID < t; tID++ {
			teams = append(teams, Team{tID + 1, 0, map[int]int{}, 0})
		}

		for i := 0; i < r; i++ {
			tID, pID, time, message := nextInt(sc), nextInt(sc), nextInt(sc), nextString(sc)
			tID--

			if message == "CORRECT" {
				teams[tID].Accepted++
				wa, _ := teams[tID].WrongAnswer[pID]
				teams[tID].Penalty += wa*1200 + time
			} else {
				teams[tID].WrongAnswer[pID]++
			}
		}

		sort.Sort(Teams(teams))

		for _, team := range teams {
			fmt.Println(team.TID, team.Accepted, team.Penalty)
		}
	}
}

func nextInt(sc *bufio.Scanner) int {
	sc.Scan()
	i, err := strconv.Atoi(sc.Text())
	if err != nil {
		panic(err)
	}
	return i
}

func nextString(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

C++: #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);
	}
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

const int MAX_P = 10;

class Team {
public:
    int id;
    int solves_;
    int penalty_;
    int failures_[MAX_P];

    Team() {
        solves_ = 0;
        penalty_ = 0;
        fill_n(failures_, MAX_P, 0);
    }

    void correct(int pid, int time) {
        solves_++;
        penalty_ += failures_[pid - 1] * 1200 + time;
    }

    void wrong(int pid) {
        failures_[pid - 1]++;
    }

    friend bool operator<(const Team& t1, const Team& t2) {
        return (t1.solves_ > t2.solves_)
            || (t1.solves_ == t2.solves_ && t1.penalty_ < t2.penalty_);
    }
};

int main () {
    int t, p, r;
    while (cin >> t >> p >> r, t | p | r) {
        vector<Team> teams(t);
        for (int i = 0; i < t; i++) {
            teams[i].id = i + 1;
        }

        for (int i = 0; i < r; i++) {
            int tid, pid, time;
            string message;
            cin >> tid >> pid >> time >> message;
            if (message == "CORRECT") {
                teams[tid - 1].correct(pid, time);
            } else if (message == "WRONG") {
                teams[tid - 1].wrong(pid);
            }
        }

        sort(teams.begin(), teams.end());
        for (vector<Team>::iterator it = teams.begin(); it != teams.end(); it++) {
            cout << it->id << " " << it->solves_ << " " << it-> penalty_ << endl;
        }
    }
}