#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 50010
using namespace std; typedef double db;
const db pi=acos(-1);
inline void Max(int &x,int y) {x=max(x,y);}
inline char nc() {static char *p1,*p2,buf[100000]; return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;}
int rd() {int x=0; char c=nc(); while(!isdigit(c)) c=nc(); while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=nc(); return x;}
struct cp
{db x,y;cp() {x=y=0;}cp(db x_,db y_) {x=x_,y=y_;}cp operator + (const cp &a) const {return cp(x+a.x,y+a.y);}cp operator - (const cp &a) const {return cp(x-a.x,y-a.y);}cp operator * (const cp &a) const {return cp(x*a.x-y*a.y,x*a.y+y*a.x);}
}a[N<<2],b[N<<2];
void fft(cp *a,int len,int flg)
{int i,j,k,t;cp tmp,w,wn;for(i=k=0;i<len;i++){if(i>k) swap(a[i],a[k]);for(j=len>>1;(k^=j)<j;j>>=1);}for(k=2;k<=len;k<<=1){wn=cp(cos(2*pi*flg/k),sin(2*pi*flg/k));t=k>>1;for(i=0;i<len;i+=k){w=cp(1,0);for(j=i;j<i+t;j++){tmp=a[j+t]*w;a[j+t]=a[j]-tmp;a[j]=a[j]+tmp;w=w*wn;}}}if(flg==-1) for(i=0;i<len;i++) a[i].x/=len;
}
inline int sqr(int x) {return x*x;}
int main()
{int ans=0;int sum1=0,sum2=0;int all1=0,all2=0;int n=rd(),m=rd();for(int i=0;i<n;i++){a[i].x=rd();sum1+=a[i].x; all1+=sqr(a[i].x);}for(int i=n-1;~i;i--){b[i].x=rd();sum2+=b[i].x; all2+=sqr(b[i].x);}// printf("%d %d %d %d\n",sum1,sum2,all1,all2);int len=1; while(len<(n<<1)) len<<=1;fft(a,len,1); fft(b,len,1);for(int i=0;i<len;i++) a[i]=a[i]*b[i];fft(a,len,-1);ans=(int)(a[n-1].x+0.1);for(int i=1;i<n;i++){Max(ans,(int)(a[i-1].x+0.1)+(int)(a[n+i-1].x+0.1));}if(sum1>=sum2) printf("%d\n",all1+all2-2*ans);else{int ANS=all1+all2-2*ans;int dlt=(sum1-sum2)*2;int x=(-1*dlt)/(2*n);ANS+=min(n*sqr(x)+dlt*x,n*sqr(x+1)+dlt*(x+1));cout << ANS << endl ;}return 0;
}