//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "aliens.h"
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
bool eat(pair<int,int> a,pair<int,int> b){
return min(b.f,b.s)<=min(a.f,a.s) and max(b.f,b.s)>=max(a.f,a.s);
}
const int mxn=1e5+5;
const ll inf=1e18;
ll dp[mxn];
vector<int> x,y;
ll cost(int l,int r){
ll a=(max(x[r],y[r])-min(x[l],y[l])+1);
ll b=(l==1?0:max(0,(max(x[l-1],y[l-1])-min(x[l],y[l])+1)));
return a*a-b*b;
}
ll solve(int n,int m,int k){
for(int i=1;i<=n;i++){
dp[i]=inf;
for(int j=0;j<i;j++){
dp[i]=min(dp[i],dp[j]+cost(j+1,i));
}
}
return dp[n];
}
ll take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c){
vector<pair<int,int>> vec(n);
for(int i=0;i<n;i++){
vec[i]={r[i],c[i]};
}
sort(all(vec));
vector<pair<int,int>> st;
for(int i=0;i<n;i++){
while(!st.empty() and eat(st.back(),vec[i])){
st.pop_back();
}
if(st.empty() or !eat(vec[i],st.back())){
st.push_back(vec[i]);
}
}
x.push_back(-1);
y.push_back(-1);
for(auto v:st){
x.push_back(v.f);
y.push_back(v.s);
}
return solve(st.size(),m,k);
}
//maybe its multiset not set
//yeeorz
//laborz
