#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 10;
const int maxv = 1e3 + 10;
const double eps = 1e-9;
pair<int, int> num[maxn << 2];
int ID[maxn];
int Pos[maxn];
struct SegmentTree {
  void build(int rt, int l, int r) {
    if (l == r) {
      num[rt] = pair<int, int>(Pos[l], l);
      return;
    }
    int m = (l + r) >> 1;
    build(rt << 1, l, m);
    build(rt << 1 | 1, m + 1, r);
    num[rt] = min(num[rt << 1], num[rt << 1 | 1]);
  }
  void update(int rt, int l, int r, int pos) {
    if (l == r) {
      num[rt] = pair<int, int>(inf, inf);
      return;
    }
    int m = (l + r) >> 1;
    if (m >= pos)
      update(rt << 1, l, m, pos);
    else
      update(rt << 1 | 1, m + 1, r, pos);
    num[rt] = min(num[rt << 1], num[rt << 1 | 1]);
  }
  pair<int, int> query(int rt, int l, int r, int L, int R) {
    if (L <= l && r <= R) {
      return num[rt];
    }
    int m = (l + r) >> 1;
    pair<int, int> cur = pair<int, int>(inf, inf);
    if (m >= L) cur = min(cur, query(rt << 1, l, m, L, R));
    if (m < R) cur = min(cur, query(rt << 1 | 1, m + 1, r, L, R));
    return cur;
  }
} st;
struct STA {
  int first, second, id;
  STA(int _f = 0, int _s = 0, int _id = 0) : first(_f), second(_s), id(_id) {}
  bool operator<(const STA& rhs) const {
    if (first == rhs.first) {
      if (second == rhs.second) return id < rhs.id;
      return second < rhs.second;
    }
    return first < rhs.first;
  }
};
std::vector<int> xs;
pair<int, int> bug[maxn];
STA peo[maxn];
int n, m;
long long s;
int ans[maxn];
int tmp[maxn];
int get(int id) {
  return lower_bound(xs.begin(), xs.end(), id) - xs.begin() + 1;
}
bool check(int ti) {
  st.build(1, 1, n);
  long long res = 0;
  for (int i = 1; i <= n; i++) {
    pair<int, int> cur = st.query(1, 1, n, i, i);
  }
  for (int i = m; i > 0; i -= ti) {
    int id = get(bug[i].first);
    pair<int, int> cur = st.query(1, 1, n, get(bug[i].first), n);
    if (cur.first == inf) return false;
    int p = cur.second;
    res += peo[p].second;
    int start = max(i - ti + 1, 1);
    for (int j = start; j <= i; j++) {
      tmp[bug[j].second] = peo[p].id;
    }
    st.update(1, 1, n, p);
  }
  if (res <= s) {
    memcpy(ans, tmp, sizeof(int) * (m + 1));
  }
  return res <= s;
}
int main() {
  cin >> n >> m >> s;
  for (int i = 1; i <= m; i++) {
    cin >> bug[i].first;
    bug[i].second = i;
  }
  sort(bug + 1, bug + m + 1);
  for (int i = 1; i <= n; i++) {
    cin >> peo[i].first;
  }
  for (int i = 1; i <= n; i++) {
    cin >> peo[i].second;
    peo[i].id = i;
  }
  sort(peo + 1, peo + 1 + n);
  for (int i = 1; i <= n; i++) {
    ID[i] = peo[i].id;
    xs.push_back(peo[i].first);
    Pos[i] = peo[i].second;
  }
  sort(xs.begin(), xs.end());
  int l = 1, r = m;
  int flag = 0;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (check(mid)) {
      r = mid - 1;
      flag = 1;
    } else
      l = mid + 1;
  }
  if (!flag)
    puts("NO");
  else {
    puts("YES");
    for (int i = 1; i <= m; i++) {
      printf("%d%c", ans[i], i == m ? '\n' : ' ');
    }
  }
  return 0;
}
