output_description: Print the letter that follows C in alphabetical order.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      C
attempt: # AC を 1回以上出した各問題において、初めて AC を出すまでに出した WA の数
  n, m = map(int, input().split())
  p = []
  s = []
  wacounter = 0
  walist = []
  for i in range(0, n):
      walist.append(0)
  point = 0
  point_to_num = []  # acをとった問題
  for i in range(0, m):
      list = input().split()
      p.append(int(list[0]))
      s.append(list[1])
  
  for i in range(0, m):
      if (
          s[i] == "AC" and not p[i] in point_to_num
      ):  # もし正解で、今までにその問題に正解していなかったら
          point_to_num.append(p[i])  # 正解リストにその問題を追加
          # point = point + 1 正解ポイントをあげる
      elif (
          s[i] == "WA" and not p[i] in point_to_num
      ):  # 不正解かつ今まで正解を出したことがない
          wacounter += 1
          walist[p[i] - 1] += 1
  for i in range(0, n):
      if (
          not i + 1 in point_to_num
      ):  # もし正解してない番号があったら、walistからwacounterをとってきてひく
          wacounter = wacounter - walist[i]
  print(len(point_to_num), wacounter)
  
problem_description: Statement
  
  Given is a lowercase English letter C that is not `z`. Print the letter that
  follows C in alphabetical order.
samples: [{"input": "a", "output": "b\n    \n\n`a` is followed by `b`.\n\n* * *"}, {"input": "y", "output": "z\n    \n\n`y` is followed by `z`."}]