#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 3e5 + 10;

int n1, n2, d;
struct Seg
{
    int l, r;
    bool operator < (const Seg u) const {return l < u.l;}
}a[MAXN], b[MAXN];

#define nxta(x) upper_bound(a + 1, a + n1 + 1, Seg{x, 0}) - a
#define nxtb(x) upper_bound(b + 1, b + n2 + 1, Seg{x, 0}) - b
#define posa(p, x) (p > n1 ? 2e9 : max(a[p].l, x))
#define posb(p, x) (p > n2 ? 2e9 : max(b[p].l, x))
inline int sufa(int x, int pre)
{
    x += d, pre -= d;
    int cur = upper_bound(a + 1, a + n1 + 1, Seg{x, 0}) - a - 1;
    if (cur == 0 || a[cur].r < x || pre >= a[cur].l) cur++;
    return cur;
}
inline int sufb(int x, int pre)
{
    x += d, pre -= d;
    int cur = upper_bound(b + 1, b + n2 + 1, Seg{x, 0}) - b - 1;
    if (cur == 0 || b[cur].r < x || pre >= b[cur].l) cur++;
    return cur;
}

int g[2][MAXN << 1], h[2][MAXN << 1], tp[2];

int main()
{
    // freopen("C.in", "r", stdin);
    // freopen("C.out", "w", stdout);
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n1), Read(n2), Read(d);
    for (int i = 1; i <= n1; i++) Read(a[i].l), Read(a[i].r), a[i].r--;
    for (int i = 1; i <= n2; i++) Read(b[i].l), Read(b[i].r), b[i].r--;
    a[n1 + 1].l = b[n2 + 1].l = 2e9;
    sort(a + 1, a + n1 + 1), sort(b + 1, b + n2 + 1);
    int p1 = nxta(-1), p2 = nxtb(d - 1);
    if (b[p2].l == d - 1) p2++;
    int x1 = posa(p1, 0), x2 = posb(p2, d);
    g[0][0] = 0, g[1][0] = d;
    if (x1 <= x2) tp[0]++, g[0][tp[0]] = x1, h[0][tp[0]] = 0;
    if (x2 <= x1 || x2 == d) tp[1] += 1 + (x1 == 0), g[1][tp[1]] = x2, h[1][tp[1]] = d;
    if (tp[1] == 2) g[1][1] = d;
    while (1)
    {
        int p1 = nxta(g[0][tp[0]]), x1 = posa(p1, g[0][tp[0]]), l1 = h[0][tp[0]];
        if (tp[1] > tp[0] && x1 > g[1][tp[0] + 1] + d) x1 = l1 = g[1][tp[0] + 1] + d;
        if (tp[1] >= tp[0])
        {
            int p = sufa(g[1][tp[0]], h[1][tp[0]]), x = posa(p, g[1][tp[0]] + d), l = g[1][tp[0]] + d;
            if (x1 > x || (x == x1 && l1 > l)) x1 = x, l1 = l;
        }
        int p2 = nxtb(g[1][tp[1]]), x2 = posb(p2, g[1][tp[1]]), l2 = h[1][tp[1]];
        if (tp[0] > tp[1] && x2 > g[0][tp[1] + 1] + d) x2 = l2 = g[0][tp[1] + 1] + d;
        if (tp[0] >= tp[1])
        {
            int p = sufb(g[0][tp[1]], h[0][tp[1]]), x = posb(p, g[0][tp[1]] + d), l = g[0][tp[1]] + d;
            if (x2 > x || (x == x2 && l2 > l)) x2 = x, l2 = l;
        }
        if (x1 == 2e9 && x2 == 2e9) break;
        // cout << x1 << ' ' << tp[0] + 1 << ' ' << l1 << '\n';
        // cout << x2 << ' ' << tp[1] + 1 << ' ' << l2 << '\n';
        // cout << '\n';
        if (x1 <= x2) tp[0]++, g[0][tp[0]] = x1, h[0][tp[0]] = l1;
        if (x2 <= x1) tp[1]++, g[1][tp[1]] = x2, h[1][tp[1]] = l2;
    }
    cout << max(tp[0], tp[1]) << '\n';
    // for (int i = 1; i <= n1; i++) cout << a[i].l << ' ' << a[i].r << '\n'; cout << '\n';
    // for (int i = 1; i <= n2; i++) cout << b[i].l << ' ' << b[i].r << '\n'; cout << '\n';
    // for (int i = 1; i <= tp[0]; i++) cout << g[0][i] << ' ' << h[0][i] << '\n';
    // cout << '\n';
    // for (int i = 1; i <= tp[1]; i++) cout << g[1][i] << ' ' << h[1][i] << '\n';
    // cout << '\n';
    return 0;
}