import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}


void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      const Q = readInt;
      auto P = new int[N];
      auto S = new string[N];
      foreach (i; 0 .. N) {
        P[i] = readInt - 1;
        S[i] = readToken;
      }
      auto L = new int[Q];
      auto R = new int[Q];
      foreach (q; 0 .. Q) {
        L[q] = readInt - 1;
        R[q] = readInt;
      }
      
      auto qss = new int[][N];
      auto ans0 = new int[Q];
      auto ans1 = new int[Q];
      foreach (q; 0 .. Q) {
        qss[L[q]] ~= q;
      }
      
      auto ac = new int[M];
      auto wa = new int[M];
      ac[] = -1;
      auto bit0 = new int[N];
      auto bit1 = new int[N];
      foreach_reverse (i; 0 .. N) {
        const p = P[i];
        final switch (S[i]) {
          case "AC": {
            if (~ac[p]) {
              bit0.bAdd(ac[p], -1);
              bit1.bAdd(ac[p], -wa[p]);
            }
            ac[p] = i;
            wa[p] = 0;
            bit0.bAdd(ac[p], +1);
          } break;
          case "WA": {
            if (~ac[p]) {
              wa[p] += 1;
              bit1.bAdd(ac[p], +1);
            }
          } break;
        }
        foreach (q; qss[i]) {
          ans0[q] = bit0.bSum(R[q]);
          ans1[q] = bit1.bSum(R[q]);
        }
      }
      
      foreach (q; 0 .. Q) {
        writeln(ans0[q], " ", ans1[q]);
      }
    }
  } catch (EOFException e) {
  }
}