#include <bits/stdc++.h>
#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())
using namespace std;
template<typename U, typename V> bool maxi(U &a, V b) {
if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
if (a > b) { a = b; return 1; } return 0;
}
const int N = (int)5e5 + 9;
const int mod = (int)1e9 + 7;
void prepare(); void main_code();
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
const bool MULTITEST = 0; prepare();
int num_test = 1; if (MULTITEST) cin >> num_test;
while (num_test--) { main_code(); }
}
void prepare() {};
int n, m, d;
int p[N], q[N], r[N], s[N], see[2 * N];
bool in(int l, int r, int x) {
return l <= x and x <= r;
}
void main_code() {
cin >> n >> m >> d;
map<ii, int> mp;
for(int i = 1; i <= n; ++i) {
cin >> p[i] >> q[i];
// FOR(k, -1, 1) FOR(l, -1, 1) {
// mp[ _mp(p[i] + k * d, q[i] + l * d) ] |= (1 << (i - 1));
// }
}
for(int i = 1; i <= m; ++i) {
cin >> r[i] >> s[i];
// FOR(y, -d, d)
// FOR(k, -1, 1) {
// mp[_mp(r[i] + k * d, y)] |= (1 << (i - 1 + n));
// }
// FOR(x, -d, d)
// FOR(k, -1, 1) {
// mp[_mp(x, s[i] + k * d)] |= (1 << (i - 1 + n));
// }
}
int ans = INT_MAX;
FOR(y, -d, d)
FOR(v, y, min(y + d - 1, d)) if ( (v - y + 1) < ans ) {
vector<ii> col;
for(int i = 1; i <= m; ++i) {
bool ok = 0;
FOR(l, -1, 1) ok |= in(y, v, s[i] + l * d);
if (ok) {
continue ;
} else {
FOR(l, -1, 1) col.emplace_back(r[i] + l * d, i);
}
}
bool check = 1;
for(int i = 1; i <= n; ++i) {
bool ok = 0;
FOR(l, -1, 1) ok |= in(y, v, q[i] + l * d);
check &= ok;
FOR(l, -1, 1) col.emplace_back(p[i] + l * d, i + m);
}
if (check == 0) continue ;
sort(col.begin(), col.end());
int cnt = 0;
FOR(i, 1, n + m) see[i] = 0;
int j = 0;
FOR(i, 0, sz(col) - 1) {
++see[col[i].se];
cnt += see[col[i].se] == 1;
while (j < i and see[col[j].se] - 1 > 0) {
--see[col[j].se];
++j;
}
if (cnt == sz(col) / 3) {
ans = min(ans, (v - y + 1) * (col[i].fi - col[j].fi + 1));
}
}
}
cout << ans;
}
/* Let the river flows naturally */
