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 <bits/stdc++.h>

typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define DECIM8  fixed<<setprecision(8) 
#define SZ(a) int((a).size())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

using namespace std;
int main(void)
{
  for(;;){
    int t,p,r;
    cin >> t >> p >> r;
    if(!t&&!p&&!r) return 0;
    vector<vector<int> > act;
    // t,p: -1200*wa
    act.resize(t);
    REP(i,t) act[i].assign(p,0);
    REP(i,r){
      int tid,pid,time;
      string mes;
      cin >> tid >> pid >> time >> mes;
      tid--;pid--;
      if(act[tid][pid]>0) continue;
      if(mes=="WRONG") act[tid][pid]-=1200;
      if(mes=="CORRECT") act[tid][pid]=time-act[tid][pid];
    }
    vector<pair<pair<int,int>,int> > score;
    // -AC,penalty,team
    REP(i,t) score.PB(MP(MP(0,0),i+1));
    REP(i,t) REP(j,p) if(act[i][j]>0){
      score[i].first.first-=1;
      score[i].first.second+=act[i][j];
    }
    SORT(score);
    REP(i,t) cout << score[i].second << ' ' << -score[i].first.first << ' ' << score[i].first.second << endl;
  }
}

C++: #include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int t,p,r;

struct Team{
    int solved=0,penalty=0,teamid=0;
    Team(){}
    Team(int s,int p,int t) : solved(s),penalty(p),teamid(t){}

    bool operator < (const Team &te){
        if(solved != te.solved) return ( solved < te.solved );
        else if(penalty != te.penalty) return (penalty > te.penalty);
        else (teamid > te.teamid);
    }
    bool operator == (const Team &te){
        return (solved == te.solved and penalty == te.penalty and teamid == te.teamid);
    }
};

void solve(){
    vector<int> tid(r),pid(r),ti(r);
    vector<string> message(r);
    rep(i,r) cin >> tid[i] >> pid[i] >> ti[i] >> message[i];
    rep(i,r) tid[i]--,pid[i]--;

    vector<vi> fa(t+10,vi(p+10,0));

    vector<Team> team(t+10);
    rep(i,t) team[i].teamid=i;
    rep(i,r){
        if(message[i]=="CORRECT"){
            team[tid[i]].solved++;
            team[tid[i]].penalty += ti[i] + 1200 * fa[tid[i]][pid[i]];
        }else{
            fa[tid[i]][pid[i]]++;
        }
    }
    sort(all(team));

    for(int i=t-1;i>=0;i--){
        cout << team[i].teamid+1 << " " << team[i].solved << " " << team[i].penalty << endl;
    }
}

int main(){
    while(1){
        cin >> t >> p >> r;
        if(t==0 and p==0 and r==0) break;
        solve();
    }
}

C++: #include "bits/stdc++.h"
#define pb push_back
#define mt make_tuple
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for(int i=0;i<(n);++i)
#define rrep(i, n) for(int i=n-1;i>=0;--i)
#define debug(x) cout << #x << " : " << x << " ------------ " << endl;
using namespace std;
using TP = tuple<int, int>;
struct Record {
    int id, c, p;
    int wrong[11];
    bool operator<(const Record& rhs) const {
        if (c > rhs.c) return true;
        else if (c < rhs.c) return false;
        if (p < rhs.p) return true;
        else if (p > rhs.p) return false;
        if (id < rhs.id) return true;
        else return false;
    }
};
int main()
{
    int t, p, r;
    while (cin >> t >> p >> r, t | p | r) {
        map<TP, bool> solved;
        Record records[t + 1];
        rep (i, t + 1) {
            records[i] = {i, 0, 0};
        }
        rep (i, r) {
            int tid, pid, time;
            string msg;
            cin >> tid >> pid >> time >> msg;
            
            if (solved[tie(tid, pid)]) continue;
            
            if (msg == "CORRECT") {
                solved[tie(tid, pid)] = true;
                ++records[tid].c;
                records[tid].p += time + 1200 * records[tid].wrong[pid];
            } else {
                ++records[tid].wrong[pid];
            }
        }
        sort(records, records+t+1);
        for (auto rec : records) {
            if (rec.id != 0)
                cout << rec.id << " " << rec.c << " " << rec.p << endl;
        }
    }
    return EXIT_SUCCESS;
}