#include <bits/stdc++.h>
using namespace std;
int const maxn = (int)1e5 + 111;
int const inf = (1 << 30) - 1;
int n, m, second;
pair<pair<int, int>, int> A[maxn];
pair<int, int> a[maxn];
int answer[maxn];
pair<pair<int, int>, int> T[4 * maxn];
vector<int> vec;
void build(int v, int tl, int tr) {
  if (tl == tr) {
    T[v].first.first = A[tl].first.second;
    T[v].first.second = A[tl].second;
    T[v].second = tl;
    return;
  }
  int mid = (tl + tr) / 2;
  build(2 * v, tl, mid);
  build(2 * v + 1, mid + 1, tr);
  T[v] = min(T[2 * v], T[2 * v + 1]);
}
pair<pair<int, int>, int> get(int v, int tl, int tr, int l, int r) {
  if (l > tr || r < tl) return make_pair(make_pair(inf, inf), inf);
  if (l <= tl && tr <= r) {
    return T[v];
  }
  int mid = (tl + tr) / 2;
  return min(get(2 * v, tl, mid, l, r), get(2 * v + 1, mid + 1, tr, l, r));
}
void update(int v, int tl, int tr, int pos, bool ok = false) {
  if (tl == tr) {
    if (ok) {
      T[v].first.first = A[tl].first.second;
      T[v].first.second = A[tl].second;
      T[v].second = tl;
    } else
      T[v] = make_pair(make_pair(inf, inf), inf);
    return;
  }
  int mid = (tl + tr) / 2;
  if (pos <= mid) {
    update(2 * v, tl, mid, pos, ok);
  } else
    update(2 * v + 1, mid + 1, tr, pos, ok);
  T[v] = min(T[2 * v], T[2 * v + 1]);
}
void reupdate() {
  for (int i = 0; i < vec.size(); i++) {
    update(1, 0, n - 1, vec[i], true);
  }
}
bool check(int mid, bool ok = false) {
  int sum = 0;
  for (int i = m - 1; i >= 0; i -= mid) {
    int val = a[i].first;
    int ind = lower_bound(A, A + n, make_pair(make_pair(val, 0), 0)) - A;
    if (ind == n) return false;
    pair<pair<int, int>, int> temp = get(1, 0, n - 1, ind, n - 1);
    int cost = temp.first.first;
    int aind = temp.first.second;
    int index = temp.second;
    if (temp == make_pair(make_pair(inf, inf), inf)) return false;
    sum += cost;
    if (sum > second) return false;
    update(1, 0, n - 1, index);
    vec.push_back(index);
    if (ok)
      for (int j = i, cnt = 0; j >= 0 && cnt < mid; j--, cnt++)
        answer[a[j].second] = aind;
  }
  return true;
}
int main() {
  cin >> n >> m >> second;
  for (int i = 0; i < m; i++) {
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a, a + m);
  for (int i = 0; i < n; i++) {
    cin >> A[i].first.first;
  }
  for (int i = 0; i < n; i++) {
    cin >> A[i].first.second;
    A[i].second = i;
  }
  sort(A, A + n);
  for (int i = 0; i < 4 * maxn; i++) T[i] = make_pair(make_pair(inf, inf), inf);
  build(1, 0, n - 1);
  int l = 0, r = m;
  while (l <= r) {
    int mid = (l + r) / 2;
    vec.clear();
    if (check(mid)) {
      r = mid - 1;
    } else
      l = mid + 1;
    reupdate();
  }
  r++;
  if (r == m + 1) {
    cout << "NO" << endl;
    return 0;
  }
  check(r, true);
  cout << "YES" << endl;
  for (int i = 0; i < m; i++) {
    cout << answer[i] + 1 << " ";
  }
  return 0;
}
