output_description: Print the minimum amount of money required to prepare X A-pizzas and Y
  B-pizzas.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C X Y
attempt: N, C = map(int, input().split())
  XV = sorted([list(map(int, input().split())) for _ in range(N)])
  acmXV = []
  dbl_acmXV = []
  for i, xv in enumerate(XV):
      x, v = xv
      if i == 0:
          acmXV.append(v - x)
          dbl_acmXV.append(v - x * 2)
      else:
          acmXV.append(v - (x - XV[i - 1][0]) + acmXV[i - 1])
          dbl_acmXV.append(v - (x - XV[i - 1][0]) * 2 + dbl_acmXV[i - 1])
  
  acmXV_rev = [0 for _ in range(N)]
  dbl_acmXV_rev = [0 for _ in range(N)]
  for i in range(N - 1, -1, -1):
      x, v = XV[i]
      if i == N - 1:
          acmXV_rev[i] = v - (C - x)
          dbl_acmXV_rev[i] = v - (C - x) * 2
      else:
          acmXV_rev[i] = v - (XV[i + 1][0] - XV[i][0]) + acmXV_rev[i + 1]
          dbl_acmXV_rev[i] = v - (XV[i + 1][0] - XV[i][0]) * 2 + dbl_acmXV_rev[i + 1]
  
  ans = max(0, max(acmXV), max(acmXV_rev))
  for i in range(N - 1):
      for j in range(N - 2, i + 1, -1):
          # print(i,j,dbl_acmXV[i],acmXV_rev[N-1-j])
          ans = max(ans, dbl_acmXV[i] + acmXV_rev[j], acmXV[i] + dbl_acmXV_rev[j])
  print(ans)
  
problem_description: Statement
  
  "Pizza At", a fast food chain, offers three kinds of pizza: "A-pizza",
  "B-pizza" and "AB-pizza". A-pizza and B-pizza are completely different pizzas,
  and AB-pizza is one half of A-pizza and one half of B-pizza combined together.
  The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen
  (yen is the currency of Japan), respectively.
  
  Nakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He
  can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or
  buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza.
  At least how much money does he need for this? It is fine to have more pizzas
  than necessary by rearranging pizzas.
samples: [{"input": "1500 2000 1600 3 2", "output": "7900\n    \n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and\ntwo B-pizzas, then buy additional one A-pizza.\n\n* * *"}, {"input": "1500 2000 1900 3 2", "output": "8500\n    \n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\n* * *"}, {"input": "1500 2000 500 90000 100000", "output": "100000000\n    \n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas\nand 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that\nis fine."}]