#include <bits/stdc++.h>
using namespace std;

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class T,class U>istream&operator>>(istream&is,pair<T,U>&P){is>>P.fst;is>>P.snd;return is;}
template<class T>T read(){T t;cin>>t;return t;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<'('<<p.fst<<", "<<p.snd<<')';}
template<class T>ostream&operator<<(ostream&o,const vector<T>&t){o<<"{";rep(i,sz(t))o<<t[i]<<",";o<<"}"<<endl;return o;}
#ifdef LOCAL
vs s_p_l_i_t(const string&s,char c){vs v;stringstream ss(s);string x;while(getline(ss,x,c))v.emplace_back(x);return move(v);}
void e_r_r(vs::iterator it){cerr<<endl;}
template<class T,class... Args>void e_r_r(vs::iterator it,T a,Args... args){cerr<<it->substr((*it)[0]==' ',it->length())<<" = "<<a<<", ";e_r_r(++it,args...);}
#define out(args...){vs a_r_g_s=s_p_l_i_t(#args,',');e_r_r(a_r_g_s.begin(),args);}
#else
#define out(args...)
#endif

template <class V> struct MergeRangeMinQ {
  V operator() (const V &l, const V &r) const { return min(l, r); }
  static V unit() { return numeric_limits<V>::max(); }
};

template<class V, class Merge> struct SegmentTree {
  const int n;
  vector<V> val;
  const Merge merge;
  const V unit_value;

  SegmentTree(int _n) : n(1 << (33-__builtin_clz(_n-1))), val(n), merge(), unit_value(Merge::unit()) {
    reinit();
  }

  void reinit() {
    for (int i = 0; i < n; i++) val[i] = unit_value;
  }

  void update(int i, const V &v) {
    i += n / 2 - 1;
    val[i] = v;
    while (i > 0) {
      i = (i - 1) / 2;
      val[i] = merge(val[i * 2 + 1], val[i * 2 + 2]);
    }
  }

  V get(int i) const {
    return val[i + n / 2 - 1];
  }

  V query(int a, int b) const {
    return query(a, b, 0, 0, n / 2);
  }

  V query(int a, int b, int k, int l, int r) const {
    if (r <= a || b <= l) return unit_value;
    if (a <= l && r <= b) return val[k];
    return merge(query(a, b, k * 2 + 1, l, (l + r) / 2), query(a, b, k * 2 + 2, (l + r) / 2, r));
  }
};


void Main() {
  int N;
  ll x;
  scanf("%d%lld", &N, &x);
  vi A(N);
  rep(i, N) scanf("%d", &A[i]);

  SegmentTree<int, MergeRangeMinQ<int>> seg(N);
  rep(i, N) {
    seg.update(i, A[i]);
  }

  ll ans = 1e18;
  rep(m, N) {
    ll cand = 0;
    rep(i, N) {
      if (i >= m) {
        cand += seg.query(i-m, i+1);
      }
      else {
        cand += min(seg.query(0, i+1), seg.query(N-m+i, N));
      }
    }
    ans = min(ans, cand + x * m);
  }
  _p("%lld\n", ans);
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }


Measured memory_bytes: 256