#include <bits/stdc++.h>

using namespace std;

#define N 200000

#define dob complex<double>

const double pi=acos(-1.0);

int r[N],sum[N],n,m,k,l;

dob a[N],b[N];

void fft(dob *a,int o)

{

    for (int i=;i<n;i++)

      if (i>r[i]) swap(a[i],a[r[i]]);

    for (int i=;i<n;i*=)

    {

        dob wn(cos(pi/i),sin(pi*o/i)),x,y;

        for (int j=;j<n;j+=(i*))

        {

            dob w(,);

            for (int k=;k<i;k++,w*=wn)

            {

                x=a[j+k]; y=w*a[i+j+k];

                a[j+k]=x+y,a[i+j+k]=x-y;

            }

        }

    }

}

void query()

{

    for (n = ; n <= m; n <<= ) l++;

    for (int i=;i<n;i++) r[i]=(r[i/]/)|((i&)<<(l-));

    fft(a,),fft(b,);

    for (int i=;i<n;i++) a[i]*=b[i];

    fft(a,-);

    for (int i=;i<=m*+;i++) sum[i]=(a[i].real()/n+0.5);

}

int main()

{

  freopen("noip.in","r",stdin);

  freopen("noip.out","w",stdout);

  std::ios::sync_with_stdio(false);

  cin>>m>>k; int x,now=,ans=;

  for (int i=;i<m;i++)

  {

    cin>>x; now+=x; ans+=x*x; a[i]=x;

  }

  for (int i=m-;i>=;i--)

  {

    cin>>x; now-=x; ans+=x*x; b[i]=x;

  }

  int y=-now/m;

  int minn=1e9;

  for (int i=y-;i<=y+;i++)

    minn=min(m*i*i+*i*now,minn);

  ans+=minn;

  int tmp=m; m*=;

  query();

  m=tmp;

  int maxn=sum[m-];

  for (int i=m;i<*m;i++) maxn=max(sum[i]+sum[i-m],maxn);

  ans-=*maxn;

  cout<<ans<<endl;

  return ;

}