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: N, M = map(int, input().split())
  A = {}
  ac = []
  total = 0
  count = 0
  for i in range(M):
      p, s = map(str, input().split())
      if int(p) not in ac:
          if int(p) not in A.keys():
              if int(p) > 0 and int(p) <= N:
                  if s == "WA":
                      A[int(p)] = 1
                  elif s == "AC":
                      A[int(p)] = 0
                      ac.append(int(p))
          elif int(p) in A.keys():
              if s == "WA":
                  A[int(p)] += 1
              elif s == "AC":
                  A[int(p)] += 0
                  ac.append(int(p))
                  count += 1
                  total += A[int(p)]
  
  print(count, total)
  
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`."}]