#include<bits/stdc++.h> using namespace std; const int N=11000; int fa[N],fb[N],f[N],top; int main(){ int n,m,k; cin>>n>>m>>k; for(int i=1;i<=k;i++){ int a,b; cin>>fa[i]>>fb[i]; for(int j=1;j<i;j++)if(fa[j]<fa[j-1]){ swap(fa[j],fa[j-1]); swap(fb[j],fb[j-1]); } } for(int i=1;i<=n;i++){ f[i]=1; for(int j=1;j<i;j++){ if(fb[i]>fb[j])f[i]=max(f[i],f[j]+1); top=max(top,f[i]); } } printf("%0.0lf",100*(n+m-top*2+sqrt(2)*top)+0.5); }