#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct poi{
	int x,y;
}h[1010],g[1010];
int f[1010][1010][2];
int cost(int x1,int y1,int x2,int y2){
	return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}
int H,G;
int main(){
	freopen("checklist.in","r",stdin);
	freopen("checklist.out","w",stdout);
	scanf("%d%d",&H,&G);
	for(int i=1;i<=H;i++)scanf("%d%d",&h[i].x,&h[i].y);
	for(int i=1;i<=G;i++)scanf("%d%d",&g[i].x,&g[i].y);
	memset(f,0x3f,sizeof(f));//oo
	f[1][0][0]=0;
	for(int i=1;i<=H;i++){
		for(int j=1;j<=G;j++){
			f[1][0][0]=0;
			f[i][j][0]=min(f[i-1][j][0]+cost(h[i].x,h[i].y,h[i-1].x,h[i-1].y),f[i-1][j][1]+cost(h[i].x,h[i].y,g[j].x,g[j].y));
			f[i][j][1]=min(f[i][j-1][0]+cost(h[i].x,h[i].y,g[j].x,g[j].y),f[i][j-1][1]+cost(g[j-1].x,g[j-1].y,g[j].x,g[j].y));
		}
	}
	printf("%d",f[H][G][0]);
	return 0;
	
}