#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];
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));
}
}
// (0 -> m + n - 1) -> 2 ^ (m + n) - 1
int ans = INT_MAX;
FOR(x, -d, d)
FOR(y, -d, d) {
FOR(u, x, d)
FOR(v, y, d) if ( (u-x+1) * (v-y+1) < ans ) {
int val = 0;
FOR(a, x, u) FOR(b, y, v) {
val |= mp[_mp(a, b)];
}
if (val == (1 << (n + m)) - 1) {
cout << x << ' ' << y << ' ' << u << ' ' << v << nl;
ans = (u - x + 1) * (v - y + 1);
}
}
}
cout << ans;
}
/* Let the river flows naturally */
