output_description: Print the minimum total cost required to sort p in ascending order.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B
      p_1 \cdots p_N
attempt: ri = lambda: int(input())
  rl = lambda: list(map(int, input().split()))
  rr = lambda N: [ri() for _ in range(N)]
  YN = lambda b: print("YES") if b else print("NO")
  yn = lambda b: print("Yes") if b else print("No")
  OE = lambda x: print("Odd") if x % 2 else print("Even")
  INF = 10**18
  
  N, A, B = rl()
  P = rl()
  
  for i in range(N):
      P[i] -= i + 1
  
  ans = 0
  while True:
      abs_max = -1
      ind = 0
      for i in range(N):
          a_p = abs(P[i])
          if abs_max < a_p:
              abs_max = a_p
              ind = i
      if abs_max == 0:
          break
  
      if P[ind] > 0:
          ans += min(B, A * P[ind])
          for i in range(ind + 1, ind + P[ind] + 1):
              P[i] += 1
          P[ind] = 0
      else:
          ans += min(A, B * (-P[ind]))
          for i in range(ind + P[ind], ind):
              P[i] -= 1
          P[ind] = 0
  
  
  print(ans)
  
problem_description: Statement
  
  You are given a permutation p = (p_1, \ldots, p_N) of \\{ 1, \ldots, N \\}.
  You can perform the following two kinds of operations repeatedly in any order:
  
    * Pay a cost A. Choose integers l and r (1 \leq l < r \leq N), and shift (p_l, \ldots, p_r) to the left by one. That is, replace p_l, p_{l + 1}, \ldots, p_{r - 1}, p_r with p_{l + 1}, p_{l + 2}, \ldots, p_r, p_l, respectively.
    * Pay a cost B. Choose integers l and r (1 \leq l < r \leq N), and shift (p_l, \ldots, p_r) to the right by one. That is, replace p_l, p_{l + 1}, \ldots, p_{r - 1}, p_r with p_r, p_l, \ldots, p_{r - 2}, p_{r - 1}, respectively.
  
  Find the minimum total cost required to sort p in ascending order.
samples: [{"input": "3 20 30\n    3 1 2", "output": "20\n    \n\nShifting (p_1, p_2, p_3) to the left by one results in p = (1, 2, 3).\n\n* * *"}, {"input": "4 20 30\n    4 2 3 1", "output": "50\n    \n\nOne possible sequence of operations is as follows:\n\n  * Shift (p_1, p_2, p_3, p_4) to the left by one. Now we have p = (2, 3, 1, 4).\n  * Shift (p_1, p_2, p_3) to the right by one. Now we have p = (1, 2, 3, 4).\n\nHere, the total cost is 20 + 30 = 50.\n\n* * *"}, {"input": "1 10 10\n    1", "output": "0\n    \n\n* * *"}, {"input": "4 1000000000 1000000000\n    4 3 2 1", "output": "3000000000\n    \n\n* * *"}, {"input": "9 40 50\n    5 3 4 7 6 1 2 9 8", "output": "220"}]