#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

int main()
{
    int n, m, k;
    cin >> n >> m >> k;

    vector<int> ido(k);
    for(int &x : ido){
        cin >> x;
    }

    sort(ido.begin(), ido.end());


    vector<pii> alap(n);
    for(auto& x : alap){
        cin >> x.first >> x.second;
    }

    vector<pii> kezd, veg;

    for(int i = 0; i < n; i++){
        int elso = lower_bound(ido.begin(), ido.end(), alap[i].first) - ido.begin();

        if(elso != k && ido[elso] <= alap[i].second){
            kezd.push_back({alap[i].first, i});
            veg.push_back({alap[i].second, i});
        }
    }

    sort(kezd.begin(), kezd.end());
    sort(veg.begin(), veg.end());

    int kesz = 0;
    int tart = 0;
    n = kezd.size();

    vector<int> ans;

    for(int i = 0; i < n; i++){
        int ind = veg[i].second;

        if(kesz >= alap[ind].first) continue;

        int kovi = 0, ert = 0;

        while(tart < n){
            int a = kezd[tart].second;

            if(alap[ind].second < alap[a].first){
                break;
            }

            if(alap[a].second > ert){
                ert = alap[a].second;
                kovi = a;
            }

            tart++;
        }

        ans.push_back(kovi);
        kesz = ert;
    }

    cout << ans.size() << "\n";
    for(int x : ans){
        cout << x + 1 << " ";
    }
    cout << "\n";
}