Problem: Soon there will be held the world's largest programming contest, but the testing system still has m bugs. The contest organizer, a well-known university, has no choice but to attract university students to fix all the bugs. The university has n students able to perform such work. The students realize that they are the only hope of the organizers, so they don't want to work for free: the i-th student wants to get ci 'passes' in his subjects (regardless of the volume of his work).

Bugs, like students, are not the same: every bug is characterized by complexity aj, and every student has the level of his abilities bi. Student i can fix a bug j only if the level of his abilities is not less than the complexity of the bug: bi ≥ aj, and he does it in one day. Otherwise, the bug will have to be fixed by another student. Of course, no student can work on a few bugs in one day. All bugs are not dependent on each other, so they can be corrected in any order, and different students can work simultaneously.

The university wants to fix all the bugs as quickly as possible, but giving the students the total of not more than s passes. Determine which students to use for that and come up with the schedule of work saying which student should fix which bug.

Input

The first line contains three space-separated integers: n, m and s (1 ≤ n, m ≤ 105, 0 ≤ s ≤ 109) — the number of students, the number of bugs in the system and the maximum number of passes the university is ready to give the students.

The next line contains m space-separated integers a1, a2, ..., am (1 ≤ ai ≤ 109) — the bugs' complexities.

The next line contains n space-separated integers b1, b2, ..., bn (1 ≤ bi ≤ 109) — the levels of the students' abilities.

The next line contains n space-separated integers c1, c2, ..., cn (0 ≤ ci ≤ 109) — the numbers of the passes the students want to get for their help.

Output

If the university can't correct all bugs print "NO".

Otherwise, on the first line print "YES", and on the next line print m space-separated integers: the i-th of these numbers should equal the number of the student who corrects the i-th bug in the optimal answer. The bugs should be corrected as quickly as possible (you must spend the minimum number of days), and the total given passes mustn't exceed s. If there are multiple optimal answers, you can output any of them.

Examples

Input

3 4 9
1 3 1 2
2 1 3
4 3 6


Output

YES
2 3 2 3


Input

3 4 10
2 3 1 2
2 1 3
4 3 6


Output

YES
1 3 1 3


Input

3 4 9
2 3 1 2
2 1 3
4 3 6


Output

YES
3 3 2 3


Input

3 4 5
1 3 1 2
2 1 3
5 3 6


Output

NO

Note

Consider the first sample.

The third student (with level 3) must fix the 2nd and 4th bugs (complexities 3 and 2 correspondingly) and the second student (with level 1) must fix the 1st and 3rd bugs (their complexity also equals 1). Fixing each bug takes one day for each student, so it takes 2 days to fix all bugs (the students can work in parallel).

The second student wants 3 passes for his assistance, the third student wants 6 passes. It meets the university's capabilities as it is ready to give at most 9 passes.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
static inline int Rint() {
  struct X {
    int dig[256];
    X() {
      for (int i = '0'; i <= '9'; ++i) dig[i] = 1;
      dig['-'] = 1;
    }
  };
  static X fuck;
  int s = 1, v = 0, c;
  for (; !fuck.dig[c = getchar()];)
    ;
  if (c == '-')
    s = 0;
  else if (fuck.dig[c])
    v = c ^ 48;
  for (; fuck.dig[c = getchar()]; v = v * 10 + (c ^ 48))
    ;
  return s ? v : -v;
}
template <typename T>
static inline void cmax(T& a, const T& b) {
  if (b > a) a = b;
}
template <typename T>
static inline void cmin(T& a, const T& b) {
  if (b < a) a = b;
}
const int maxn = 100005;
int have[maxn << 1];
struct Task {
  int id, hardness;
  int operator<(const Task& o) const { return hardness < o.hardness; }
};
struct Worker {
  int id, ability, need;
  int curr_ability;
  int operator<(const Worker& o) const { return need < o.need; }
};
Task task[maxn];
Worker worker[maxn];
int tree[maxn << 2];
void bc(int root, int l, int r) {
  if (l == r) {
    tree[root] = l;
    return;
  }
  const int lc = root << 1, rc = lc + 1, mid = l + r >> 1;
  bc(lc, l, mid);
  bc(rc, mid + 1, r);
  const int u = tree[lc];
  const int v = tree[rc];
  tree[root] = worker[u].curr_ability >= worker[v].curr_ability ? u : v;
}
void update(int root, int l, int r, int id) {
  if (l == r) {
    worker[tree[root]].curr_ability = -1;
    return;
  }
  const int lc = root << 1, rc = lc + 1, mid = l + r >> 1;
  if (id <= mid)
    update(lc, l, mid, id);
  else
    update(rc, mid + 1, r, id);
  const int u = tree[lc];
  const int v = tree[rc];
  tree[root] = worker[u].curr_ability >= worker[v].curr_ability ? u : v;
}
int rmq(int root, int l, int r, int a, int b) {
  if (l == a && r == b) {
    return tree[root];
  }
  const int lc = root << 1, rc = lc + 1, mid = l + r >> 1;
  if (b <= mid)
    return rmq(lc, l, mid, a, b);
  else if (a > mid)
    return rmq(rc, mid + 1, r, a, b);
  int u = rmq(lc, l, mid, a, mid);
  int v = rmq(rc, mid + 1, r, mid + 1, b);
  if (worker[u].curr_ability >= worker[v].curr_ability)
    return u;
  else
    return v;
}
int ans[maxn];
int flag[maxn];
int check(int n, int m, int s, int days, int record = 0) {
  if (days == 0) return 0;
  for (int i = 0; i < n; ++i) worker[i].curr_ability = worker[i].ability;
  bc(1, 0, n - 1);
  fill(flag, flag + m, 0);
  int curr_s = 0;
  for (int i = m - 1; i >= 0; --i)
    if (flag[i] == 0) {
      int l = 0, r = n - 1;
      while (l <= r) {
        const int mid = l + r >> 1;
        int t = rmq(1, 0, n - 1, 0, mid);
        if (worker[t].curr_ability >= task[i].hardness)
          r = mid - 1;
        else
          l = mid + 1;
      }
      if (l == n) return 0;
      curr_s += worker[l].need;
      if (curr_s > s) return 0;
      for (int total = days, j = i; total-- && j >= 0; --j) {
        flag[j] = 1;
        if (record) {
          int t = task[j].id;
          int who = worker[l].id;
          ans[t] = who;
        }
      }
      update(1, 0, n - 1, l);
    }
  return 1;
}
static inline int query_id(int top, int val) {
  int id = lower_bound(have, have + top, val) - have;
  return id + 1;
}
int main() {
  const int n = Rint(), m = Rint(), s = Rint();
  int mh = -1, ma = -1;
  int top = 0;
  for (int i = 0; i < m; ++i) {
    task[i].id = i, task[i].hardness = have[top++] = Rint();
    cmax(mh, task[i].hardness);
  }
  for (int i = 0; i < n; ++i) {
    worker[i].id = i + 1, worker[i].ability = have[top++] = Rint();
    cmax(ma, worker[i].ability);
  }
  if (mh > ma) {
    puts("NO");
    return 0;
  }
  for (int i = 0; i < n; ++i) worker[i].need = Rint();
  sort(have, have + top);
  top = unique(have, have + top) - have;
  for (int i = 0; i < m; ++i) {
    task[i].hardness = query_id(top, task[i].hardness);
  }
  for (int i = 0; i < m; ++i) {
    worker[i].ability = query_id(top, worker[i].ability);
  }
  sort(task, task + m);
  sort(worker, worker + n);
  int l = 1, r = m;
  while (l <= r) {
    const int mid = l + r >> 1;
    if (check(n, m, s, mid))
      r = mid - 1;
    else
      l = mid + 1;
  }
  if (l == m + 1) {
    puts("NO");
    return 0;
  }
  puts("YES");
  check(n, m, s, l, 1);
  for (int i = 0; i < m; ++i) printf("%d ", ans[i]);
  puts("");
  return 0;
}