#include <bits/stdc++.h>
using namespace std;
pair<pair<long long, long long>, int> p[200005];
set<pair<long long, int>> mp;
set<pair<long long, int>>::iterator k;
int s[200005], n, m;
int main() {
  long long u, v, x, y;
  while (~scanf("%d%d", &n, &m)) {
    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;
    }
    mp.clear();
    for (int i = 1; i <= m; i++) {
      scanf("%I64d", &x);
      mp.insert(make_pair(x, i));
    }
    sort(p + 1, p + n);
    int flag = 1;
    for (int i = 1; i < n; i++) {
      x = -p[i].first.first;
      y = -p[i].first.second;
      k = mp.lower_bound(make_pair(y, 1 << 30));
      if (k == mp.begin()) {
        puts("No");
        flag = 0;
        break;
      }
      k--;
      if (k->first < x) {
        puts("No");
        flag = 0;
        break;
      }
      s[p[i].second] = k->second;
      mp.erase(k);
    }
    if (flag) {
      puts("Yes");
      for (int i = 1; i < n; i++) {
        printf(i == n - 1 ? "%d\n" : "%d ", s[i]);
      }
    }
  }
  return 0;
}
