output_description: When the minimum fee is x yen, print the value of x.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B
attempt: N, C = map(int, input().split())
  tv_times = [[int(j) for j in input().split()] for i in range(N)]
  
  channells = {}
  for i in range(C + 1):
      channells[i] = []
  max_end = -1
  
  for i in range(N):
      s, g, c = tv_times[i]
      max_end = max(max_end, g)
      channells[c] += [s, g]
  
  tv_times = []
  f = [0 for i in range(max_end + 1)]
  for cha in channells.keys():
      remove_list = []
      time = channells[cha]
      for i in range(len(time) // 2 - 1):
          if time[2 * i + 1] == time[2 * i + 2]:
              remove_list.append(time[2 * i + 1])
      time = list(set(time) - set(remove_list))
      time.sort()
      # print(time)
      # print(time)
      # print(f)
      for i in range(len(time) // 2):
          f[max(time[2 * i] - 1, 0)] += 1
          f[time[2 * i + 1]] -= 1
  
  ans = -1
  for i in range(1, max_end):
      f[i] += f[i - 1]
      if ans < f[i]:
          ans = f[i]
  
  # print(f)
  print(ans)
  
problem_description: Statement
  
  You are parking at a parking lot. You can choose from the following two fee
  plans:
  
    * Plan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.
    * Plan 2: The fee will be B yen, regardless of the duration.
  
  Find the minimum fee when you park for N hours.
samples: [{"input": "7 17 120", "output": "119\n    \n\n  * If you choose Plan 1, the fee will be 7\u00d717=119 yen.\n  * If you choose Plan 2, the fee will be 120 yen.\n\nThus, the minimum fee is 119 yen.\n\n* * *"}, {"input": "5 20 100", "output": "100\n    \n\nThe fee might be the same in the two plans.\n\n* * *"}, {"input": "6 18 100", "output": "100"}]