#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;

// find min(ax + b)
struct EnvelopeLinear {
    deque<pll> v;
    EnvelopeLinear() {}
    void add(ll a, ll b) {
        pll t(a, b);
        while(v.size() > 1 && check(v[v.size()-2], v[v.size()-1], t)) v.pop_back();
        v.pb(t);
    }
    ll query(ll x) {
        if(v.empty()) return 0;
        int l = -1, r = v.size() - 1;
        while(l+1<r) {
            int mid = (l+r)/2;
            if (f(v[mid], x) >= f(v[mid+1], x)) l = mid;
            else r = mid;
        }
        return f(v[r], x);
    }
    ll query_incr(ll x) {
        if(v.empty()) return 0;
        while(v.size() > 1 && f(v[0], x) >= f(v[1], x)) v.pop_front();
        return f(v[0], x);
    }
    bool check(const pll &p1, const pll &p2, const pll &p3) {
        return (__int128)(p2.first-p1.first)*(p3.second-p2.second) >= (__int128)(p2.second-p1.second)*(p3.first-p2.first);
    }
    ll f(pll a, ll x){
        return a.first * x + a.second;
    }
};

ll T, n, m;

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    while(cin >> n >> m){
        ll x, y;
        cin >> x;
        EnvelopeLinear env;
        env.add(-2 * x, x * x);
        REP(i, n - 1) {
            cin >> x;
            y = env.query(x) + x*x + m;
            env.add(-2 * x, y + x * x);
        }
        cout << y << endl;
    }
    return 0;
}


Measured memory_bytes: 3584