macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String {
            bytes
                .by_ref()
                .map(|r| r.unwrap() as char)
                .skip_while(|c| c.is_whitespace())
                .take_while(|c| !c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{min, max};

fn main() {
    input!{
        n: usize,
        x: usize,
        v: [usize; n]
    }
    let mut ans = usize::max_value();
    let mut segt = SegT::from_vec(v);
    for i in 0..n {
        let mut t = x * i;
        for j in 0..n {
            if j < i {
                t += min(segt.min(0, j), segt.min(n - (i - j), n - 1));
            } else {
                t += segt.min(j - i, j);
            }
        }
        ans = min(ans, t);
    }
    println!("{}", ans);
}

struct SegT {
    v: Vec<usize>,
    n: usize
}

impl SegT {
    fn new(n: usize) -> SegT {
        let mut s = 1;
        while s < n {
            s *= 2;
        }
        SegT{v: vec![usize::max_value(); 2 * s - 1], n: s}
    }

    fn from_vec(xs: Vec<usize>) -> SegT {
        let l = xs.len();
        let mut s = 1;
        while s < l {
            s *= 2;
        }
        let mut v = vec![usize::max_value(); 2 * s - 1];
        for i in 0..l {
            v[i + s - 1] = xs[i];
        }
        for i in 2..s + 1 {
            let p = s - i;
            v[p] = std::cmp::min(v[2 * p + 1], v[2 * p + 2]);
        }
        SegT{v: v, n: s}
    }

    fn update(&mut self, i: usize, x: usize) {
        let n = self.n;
        self.update_rec(i, x, 0, 0, n - 1);
    }

    fn update_rec(&mut self, i: usize, x: usize, p: usize, pl: usize, pr: usize) {
        if pl > i || pr < i {
            return;
        } else if p == i + self.n - 1 {
            self.v[p] += x;
        } else {
            self.update_rec(i, x, 2 * p + 1, pl, (pl + pr - 1) / 2);
            self.update_rec(i, x, 2 * p + 2, (pl + pr + 1) / 2, pr);
            self.v[p] = std::cmp::max(self.v[2 * p + 1], self.v[2 * p + 2]);
        }
    }

    fn min(&mut self, l: usize, r: usize) -> usize {
        let n = self.n;
        self.min_rec(l, r, 0, 0, n - 1)
    }

    fn min_rec(&mut self, l: usize, r: usize, p: usize, pl: usize, pr: usize) -> usize {
        if pl > r || pr < l {
            usize::max_value()
        } else if l <= pl && pr <= r {
            self.v[p]
        } else {
            let a = self.min_rec(l, r, 2 * p + 1, pl, (pl + pr - 1) / 2);
            let b = self.min_rec(l, r, 2 * p + 2, (pl + pr + 1) / 2, pr);
            std::cmp::min(a, b)
        }
    }
}


Measured memory_bytes: 4352