// Problem: P9514 [JOI Open 2023] 花园
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P9514
// Memory Limit: 1 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#define int long long
//#define debug
const int mod = 1e9 + 7;
const double eps = 1e-12;
const double pi = std::acos(-1);
// disu - disv - au <= 0 -> disu - au <= disv

class list{
    public:
    std::vector<int> pre,nxt;
    int head,tail,len;
    int n;
    list(int n):head(0),tail(0),len(0){
        pre.resize(n + 2);
        nxt.resize(n + 2);
        pre[0] = 0;
        nxt[0] = 0;
        this->n = n;
    }   
    void build(){
        for(int i = 0;i < n;i++){
            nxt[i] = i + 1;
            pre[i] = i - 1;
        }
       	//nxt[n] = 0;
        //pre[0] = n;
        len = 1e9;
        head = 0;
        tail = n - 1;
    }   
    void erase(int x){
        int l = pre[x],r = nxt[x];
        if(l != -1) nxt[l] = r;
        if(r != n) pre[r] = l;
        if(pre[r] == -1)head = r;
        if(nxt[l] == n)tail = l;
        if(l != -1 && r != n)len = std::min(len,n - std::abs(l - r) + 1);
    }
};

void solve() {
    int n,m,d;std::cin>>n>>m>>d;
    std::vector<std::pair<int,int> > a(n + 2), b(m + 2);
    for(int i = 1;i <= n;i++)std::cin>>a[i].first>>a[i].second;
    for(int i = 1;i <= m;i++)std::cin>>b[i].first>>b[i].second;
    int ans = 1e18;
    std::vector<int> visx1(d + 2),visy1(d + 2);
    std::vector<std::vector<int> > lst(d + 2,std::vector<int>(2 * d + 2));
	for(int i = 1;i <= n;i++){
		auto [x,y] = a[i];
		visx1[x % d] = 1;
		visy1[y % d] = 1;
	}
	for(int i = 1;i <= m;i++){
		auto [y,x] = b[i];
		lst[x][y] = y,lst[x][y + d] = y + d;
	}
	for(int i = 0;i < d;i++){
		for(int j = 1;j < 2 * d;j++) 
			lst[i][j] = std::max(lst[i][j - 1],lst[i][j]);
	}
	
	std::vector<std::vector<int> > tp(2 * d + 2);
    
	for(int l = 0; l < d; l++){
		list lis(d);
		lis.build();
		int mx = 0;
		for(int r = l - 1 + d;r >= 0;r--)if(visx1[r % d]){mx = r;break;}
		for(int i = 0;i < d;i++){
			if(!visy1[i]){
				if(lst[i][l - 1 + d] < mx) lis.erase(i);
				else tp[lst[i][l - 1 + d]].push_back(i);
			}
		}
		for(int r = mx;r <= l - 1 + d;r++){
			for(auto x : tp[r])lis.erase(x);
			ans = std::min(ans, (r - l + 1) * std::min(lis.len, (lis.tail - lis.head + 1)));
			tp[r].clear();
		}
	}
	std::cout<<ans<<'\n';
}
signed main() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout << std::fixed << std::setprecision(10);
    int t = 1;
    // init();
    //std::cin >> t;
    //  std::cerr<<C(5,2)<<'\n';
    while (t--){
        solve();
    	if(t)std::cout<<'\n';
    }
}