#include "aliens.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
ll dp[500][501];
vi X,Y;
ll dist(int p,int q){
ll x=min(min(X[p],X[q]),min(Y[p],Y[q])),y=max(max(X[p],X[q]),max(Y[p],Y[q]));
return ((y-x+1)*(y-x+1));
}
long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) {
vector<pi> arr;
X=r;Y=c;
REP(i,0,n)arr.PB({max(r[i],c[i]),i});
sort(all(arr));
REP(i,0,500)REP(j,0,501)dp[i][j]=INF;
REP(i,0,n)dp[i][1]=dist(arr[0].S,arr[i].S);
REP(i,0,n-1)REP(j,1,k)if(dp[i][j]!=INF)REP(x,i+1,n)dp[x][j+1]=min(dp[x][j+1],dp[i][j]+dist(arr[i+1].S,arr[x].S));
ll ans=INF;
REP(i,1,k+1)ans=min(ans,dp[n-1][i]);
return ans;
}
