#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<int, pair<int, int>> &p1,
                  const pair<int, pair<int, int>> &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 1e6 + 1, inf = 2e18;
bool cmp(pair<long long int, long long int> a,
         pair<long long int, long long int> b) {
  if (a.first == b.first) return a.second > b.second;
  return a.first < b.first;
}
void solve() {
  long long int n, m, s;
  cin >> n >> m >> s;
  std::vector<pair<long long int, long long int>> a(m);
  vector<pair<pair<long long int, long long int>, int>> v(n);
  for (long long int i = (long long int)0; i < (long long int)(m); i++)
    cin >> a[i].first, a[i].second = i;
  for (long long int i = (long long int)0; i < (long long int)(n); i++)
    cin >> v[i].first.first, v[i].second = i;
  for (long long int i = (long long int)0; i < (long long int)(n); i++)
    cin >> v[i].first.second;
  sort(a.begin(), a.end());
  sort(v.begin(), v.end());
  if (a.back().first > v.back().first.first) {
    cout << "NO\n";
    return;
  }
  int lo = 0, hi = n + 2, f = 0;
  while (lo + 1 < hi) {
    int mid = (lo + hi) >> 1;
    if (mid > m) {
      hi = mid;
      continue;
    }
    long long int can = 0;
    multiset<long long int> have;
    int cur = m - 1, u = n;
    while (u >= 0) {
      while (u >= 1 && a[cur].first <= v[u - 1].first.first) {
        have.insert(v[u - 1].first.second);
        u--;
      }
      if (have.empty()) {
        can = inf;
        break;
      }
      can += (*have.begin());
      have.erase(have.begin());
      if (cur - mid >= 0)
        cur -= mid;
      else {
        break;
      }
    }
    if (can <= s) {
      f = 1;
      hi = mid;
    } else {
      lo = mid;
    }
  }
  if (!f) {
    cout << "NO\n";
    return;
  }
  cout << "YES\n";
  multiset<pair<long long int, long long int>> have;
  int cur = m - 1, u = n;
  vector<long long> ans(m);
  while (u >= 0) {
    while (u >= 1 && a[cur].first <= v[u - 1].first.first) {
      have.insert({v[u - 1].first.second, v[u - 1].second});
      u--;
    }
    long long int t = have.begin()->second;
    for (int j = cur; j >= 0 && j > cur - hi; j--) ans[a[j].second] = t + 1;
    have.erase(have.begin());
    if (cur - hi >= 0)
      cur -= hi;
    else {
      break;
    }
  }
  printvec(ans);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
