#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using pi = pair<int, int>;
using vpi = vector<pi>;

void solve()
{
    int n, c, q;
    cin >> n >> c >> q;

    vpi segs;
    for (int i = 0; i < n; ++i)
    {
        int f, t;
        cin >> f >> t;
        segs.push_back({f, 1});
        segs.push_back({t + 1, -1});
    }
    sort(segs.begin(), segs.end());

    const int MAX = 100005;
    vi res(MAX);
    int open = 0;
    int j = 0;
    for (int i = 1; i < MAX; ++i)
    {
        while (j < (int)segs.size() && segs[j].first == i)
        {
            open += segs[j].second;
            j++;
        }
        res[i] = open;
    }

    int ans = 0;
    for (int i = 0; i < c; ++i)
    {
        int p;
        cin >> p;
        ans += res[p];
    }
    cout << (n - ans) << '\n';

    for (int i = 0; i < q; ++i)
    {
        int f, t;
        cin >> f >> t;
        ans -= res[f];
        ans += res[t];
        cout << (n - ans) << '\n';
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}