#include <bits/stdc++.h>
using namespace std;

using ll = long long;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    ll N, M;
    cin >> N >> M;
    vector<pair<ll, ll>> inp(N);
    map<pair<ll, ll>, vector<ll>> m;
    map<pair<ll, ll>, ll> ind;
    for (int i = 0; i < N; i++)
    {
        cin >> inp[i].first >> inp[i].second;
        if (inp[i].first > inp[i].second)
            swap(inp[i].first, inp[i].second);
        m[inp[i]].push_back(i + 1);
    }

    sort(inp.begin(), inp.end());
    vector<ll> vis(N);
    vector<ll> ans;
    for (int i = 0; i < M; i++)
    {
        ll a;
        cin >> a;

        if (ind[{a - 1, a}] < m[{a - 1, a}].size())
        {
            ans.push_back(m[{a - 1, a}][ind[{a - 1, a}]]);
            ind[{a - 1, a}]++;
        }
        else if (ind[{a, a}] < m[{a, a}].size())
        {
            ans.push_back(m[{a, a}][ind[{a, a}]]);
            ind[{a, a}]++;
        }
        else if (ind[{a, a + 1}] < m[{a, a + 1}].size())
        {
            ans.push_back(m[{a, a + 1}][ind[{a, a + 1}]]);
            ind[{a, a + 1}]++;
        }
        else
        {
            cout << "impossible";
            return 0;
        }
    }
    for (auto &x : ans)
        cout << x << '\n';
}