#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

template<typename T>
class SparseTable{
public:
  Int LOG;
  Int N, option; // option : 0 -> min, 1 -> max, 2 -> gcd
  vector<vector<T> > Array;
  vector<Int> Memo, Log;
  Int ok = 0;

  SparseTable(){}
  SparseTable(vector<T> val, Int option = 0):
    N(val.size()), option(option), Memo(N+1), Log(N+1){
    LOG = 0;
    while(N >= (1<<LOG)) LOG++;
    Array = vector<vector<T> >(LOG,vector<T>(N));
    Array[0] = val;

    vector<Int> num(LOG);
    for(Int i=0;i<LOG;i++){
      Int x = 1<<i;
      if( x <= N ) Log[x] = i;
      num[i] = x;
    }
    for(Int i=1;i<=N;i++) Memo[i] = *lower_bound(num.begin(), num.end(), ( i + 1 ) >> 1);
    build();
  }

  void update(Int k, T val){assert(0<=k && k < N); ok = 0; Array[0][k] = val; }

  inline T merge(const T &A,const T &B){
    if( option == 0 ) return min( A, B );
    if( option == 1 ) return max( A, B );
    //if( option == 2 ) return __gcd( A, B );
    assert(0);
  }

  void build(){
    ok = 1;
    for(Int i=1;i<LOG;i++){
      Int len = 1<<i;
      for(Int j=0;j<N;j++){
        if( N <= j + len - 1 ) continue;
        Array[i][j] = merge( Array[i-1][j], Array[i-1][j+len/2] );
      }
    }
  }

  // [ l, r )の [optionを満たす値] を返す ( 0 origin )
  T get(Int l, Int r){
    assert(ok);
    assert(l < r && 0 <= l && r <= N);
    Int k = Memo[r-l];
    return merge( Array[Log[k]][l], Array[Log[k]][r-k] );
  }
};


signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int N, x;
  cin>>N>>x;
  vector<Int> A(N);
  cin>>A;
  for(Int i=0;i<N;i++) A.push_back(A[i]);
  SparseTable<Int> seg(A, 0);
  Int ans = INF;
  for(Int i=0;i<N;i++){
    Int cost = i * x;
    for(Int j=0;j<N;j++){
      Int c = seg.get(j - i + N, j + N + 1);
      cost += c;
    }
    Min(ans, cost);
  }
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 768