output_description: Find the minimum time that Snuke needs to have slimes in all N colors.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N x
      a_1 a_2 ... a_N
attempt: # gcdは3.4.3だとfractionsにある
  from fractions import gcd
  
  from math import factorial as f
  
  from math import ceil, floor, sqrt
  
  from sys import exit
  
  from copy import deepcopy
  import numpy as np
  
  import bisect
  import re
  
  
  ii = lambda: int(input())
  mi = lambda: map(int, input().split())
  li = lambda: list(map(int, input().split()))
  
  
  def main():
  
      n, x = mi()
      a = li()
      flag = [0 for i in range(n)]
  
      for i in range(1, n):
          if a[i - 1] + x < a[i]:
              a[i] = min(a[i - 1] + x, a[i])
              flag[i] = 1
      if a[n - 1] + x < a[0]:
          a[0] = min(a[n - 1] + x, a[0])
          flag[0] = 1
      for i in range(1, n):
          if a[i - 1] + x < a[i]:
              a[i] = min(a[i - 1] + x, a[i])
              flag[i] = 1
      if a[n - 1] + x < a[0]:
          a[0] = min(a[n - 1] + x, a[0])
          flag[0] = 1
      for i in range(1, n):
          if a[i - 1] + x < a[i]:
              a[i] = min(a[i - 1] + x, a[i])
              flag[i] = 1
      if a[n - 1] + x < a[0]:
          a[0] = min(a[n - 1] + x, a[0])
          flag[0] = 1
  
      a = a + a
      flag = flag + flag
  
      p = 0
      while flag[p] == 1:
          p += 1
      po = p
      p += 1
      ans = 0
      while p < n or flag[p] == 1:
          if flag[p] == 0:
              ans += a[po] * (p - po)
              ans += (p - po - 1) * x
              po = p
          p += 1
      ans += a[po] * (p - po)
      ans += (p - po - 1) * x
  
      print(ans)
  
  
  main()
  
problem_description: Statement
  
  Snuke lives in another world, where slimes are real creatures and kept by some
  people. Slimes come in N colors. Those colors are conveniently numbered 1
  through N. Snuke currently has no slime. His objective is to have slimes of
  all the colors together.
  
  Snuke can perform the following two actions:
  
    * Select a color i (1≤i≤N), such that he does not currently have a slime in color i, and catch a slime in color i. This action takes him a_i seconds.
  
    * Cast a spell, which changes the color of all the slimes that he currently has. The color of a slime in color i (1≤i≤N-1) will become color i+1, and the color of a slime in color N will become color 1. This action takes him x seconds.
  
  Find the minimum time that Snuke needs to have slimes in all N colors.
samples: [{"input": "2 10\n    1 100", "output": "12\n    \n\nSnuke can act as follows:\n\n  * Catch a slime in color 1. This takes 1 second.\n  * Cast the spell. The color of the slime changes: 1 \u2192 2. This takes 10 seconds.\n  * Catch a slime in color 1. This takes 1 second.\n\n* * *"}, {"input": "3 10\n    100 1 100", "output": "23\n    \n\nSnuke can act as follows:\n\n  * Catch a slime in color 2. This takes 1 second.\n  * Cast the spell. The color of the slime changes: 2 \u2192 3. This takes 10 seconds.\n  * Catch a slime in color 2. This takes 1 second.\n  * Cast the soell. The color of each slime changes: 3 \u2192 1, 2 \u2192 3. This takes 10 seconds.\n  * Catch a slime in color 2. This takes 1 second.\n\n* * *"}, {"input": "4 10\n    1 2 3 4", "output": "10\n    \n\nSnuke can act as follows:\n\n  * Catch a slime in color 1. This takes 1 second.\n  * Catch a slime in color 2. This takes 2 seconds.\n  * Catch a slime in color 3. This takes 3 seconds.\n  * Catch a slime in color 4. This takes 4 seconds."}]