#include <bits/stdc++.h>
using namespace std;
const int maxn = 300005;
pair<pair<long long, long long>, int> p[maxn];
set<pair<long long, int> > st;
set<pair<long long, int> >::iterator it;
int n, m, Hash[maxn];
int main() {
  while (~scanf("%d%d", &n, &m)) {
    long long u, v, x, y;
    for (int i = 0; i < n; i++) {
      scanf("%I64d%I64d", &x, &y);
      if (i > 0) {
        p[i] = make_pair(make_pair(v - x, u - y), i);
      }
      u = x;
      v = y;
    }
    sort(p + 1, p + n);
    st.clear();
    for (int j = 1; j <= m; j++) {
      scanf("%I64d", &x);
      st.insert(make_pair(x, j));
    }
    bool flag = true;
    for (int i = 1; i < n; i++) {
      x = -p[i].first.first;
      y = -p[i].first.second;
      it = st.lower_bound(make_pair(y, 1 << 30));
      if (it == st.begin()) {
        flag = false;
        break;
      }
      it--;
      if (it->first < x) {
        flag = false;
        break;
      }
      Hash[p[i].second] = it->second;
      st.erase(it);
    }
    if (flag) {
      puts("Yes");
      for (int i = 1; i < n; i++) {
        printf(i == n - 1 ? "%d\n" : "%d ", Hash[i]);
      }
    } else {
      puts("No");
    }
  }
  return 0;
}
