// Source: https://usaco.guide/general/io #include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(0); cin.tie(0); ll n, m, q; cin >> n >> m >> q; vector<pair<ll,ll>> lr(m); for (ll i{}; i < m; i++){ cin >> lr[i].first >> lr[i].second; } vector<ll> s(q); for (ll i{}; i < q; i++){ cin >> s[i]; } for (ll Q; Q < q; Q++){ vector<ll> last(n + 1, -1); ll day = 0; ll ins = 0; for (ll i{}; i < m; i++) { for (ll x = lr[i].first; x <= lr[i].second; x++) { if (last[x] != -1 && day - last[x] >= s[Q]) { ins++; } last[x] = day; day++; } } cout << ins << " "; } }