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>
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,vi(p,0));

    vector<Team> team(t);
    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));
    reverse(all(team));

    for(int i=0;i<t;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 _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)

using namespace std;

const int MAX_T=50;
const int MAX_P=10;
const int PENALTY=1200;
struct team{
public:
  team(){REP(i,MAX_P)wrong[i]=solved[i]=0;}
  int wrong[MAX_P];
  int solved[MAX_P];
};
pair<int,int> score(team& tm,int n){
  pair<int,int> result=make_pair(0,0);
  REP(i,n)
    if(tm.solved[i]!=0){
      result.first++;
      result.second-=tm.wrong[i]*PENALTY+tm.solved[i];
    }
  return result;
}


int t,p;

int main(){ _;
  int r,tid,pid,time;
  string msg;
  while(cin>>t>>p>>r,(t|p|r)!=0){
    team teams[MAX_T];
    REP(i,r){
      cin>>tid>>pid>>time>>msg;
      tid--;pid--;
      if(teams[tid].solved[pid]==0){
	if(msg=="WRONG"){
	  teams[tid].wrong[pid]++;
	}else{
	  teams[tid].solved[pid]=time;
	}
      }
    }
    pair<pair<int,int>,int> result[MAX_T];
    REP(i,t){
      result[i]=make_pair(score(teams[i],p),-i);
    }
    sort(result,result+t,greater<pair<pair<int,int>,int> >());
    REP(i,t){
      cout<<-result[i].second+1<<" "<<result[i].first.first<<" "<<-result[i].first.second<<endl;
    }
  }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <tuple>

using namespace std;

#define rep(i, n) for(int i=0; i<(n); ++i)
#define all(c) (c).begin(), (c).end()

int main(){
    int T, P, R;
    while(cin >> T >> P >> R, T|P|R){
        vector<vector<int> > pen(T, vector<int>(P));
        vector<tuple<int, int, int> > info(T);
        rep(i, T)get<2>(info[i]) = i+1;
        while(R--){
            int tID, pID, tim; string mes;
            cin >> tID >> pID >> tim >> mes;
            tID--; pID--;
            if(mes[0] == 'W')pen[tID][pID]++;
            else{
                get<0>(info[tID])--;
                get<1>(info[tID]) += pen[tID][pID] * 1200 + tim;
            }
        }
        sort(all(info));
        rep(i, T){
            int corr, pena, id; tie(corr, pena, id) = info[i];
            cout << id << ' ' << -corr << ' ' << pena << '\n';
        }
    }
    return 0;
}