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 JAVA):

Solution:
/*
 ID: govind.3, GhpS, govindpatel
 LANG: JAVA
 TASK: Main 
 */

import java.io.*;
import java.math.BigInteger;
import java.util.*;

public class Main {

    //dsu next operation
    int[] next;

    private int next(int i) {
        if (next[i] == i) {
            return i;
        }
        return next[i] = next(next[i]);
    }

    //segment tree...
    private void set(int[] t, int ind, int val) {
        ind += (t.length / 2);
        t[ind] = val;
        int curr = 0;
        while (ind > 1) {
            ind >>= 1;
            if (curr == 0) {
                t[ind] = t[ind * 2] | t[ind * 2 + 1];
            } else {
                t[ind] = t[ind * 2] ^ t[2 * ind + 1];
            }
            curr ^= 1;
        }
    }

    //Binary Index tree
    class FenwickTree {

        int[] a;
        int N;

        FenwickTree(int n) {
            this.N = n;
            a = new int[N];
        }

        private int lowbit(int x) {
            return x & (-x);
        }

        void update(int pos, int val) {
            while (pos < N) {
                a[pos] += val;
                pos |= pos + 1;//0-index
            }
        }

        int sum(int pos) {
            int sum = 0;
            while (pos >= 0) {
                sum += a[pos];
                pos = (pos & (pos + 1)) - 1;
            }
            return sum;
        }
    }

    /**
     * BINARY SEARCH IN FENWICK TREE: l=1, r=N(length), at=sumRequired,
     * letter=TreeIndex(if there are many ft), ft=arrays of FT
     */
    private int binarySearch(int l, int r, int at, int letter, FenwickTree[] ft) {
        while (r - l > 0) {
            int mid = (l + r) / 2;
            int sum = ft[letter].sum(mid);
            if (sum < at) {
                l = mid + 1;
            } else {
                r = mid;
            }
        }
        return l;
    }

    private int[] compress(int[] a) {
        int[] b = new int[a.length];
        for (int i = 0; i < a.length; i++) {
            b[i] = a[i];
        }
        Arrays.sort(b);
        int m = 0;
        for (int i = 0; i < b.length;) {
            int j = i;
            while (j < b.length && b[j] == b[i]) {
                j++;
            }
            b[m++] = b[i];
            i = j;
        }
        for (int i = 0; i < a.length; i++) {
            a[i] = Arrays.binarySearch(b, 0, m, a[i]);
        }
        return a;
    }

    private class Student {

        int index;
        int ability;
        int passesRequired;

        Student(int ind, int abil) {
            index = ind;
            ability = abil;
            passesRequired = 0;
        }

        public void setPasses(int x) {
            passesRequired = x;
        }

        public int getIndex() {
            return index;
        }
    }
    public Comparator<Student> byAbility = new Comparator<Student>() {
        @Override
        public int compare(Student f, Student s) {
            if (f.ability != s.ability) {
                return (s.ability - f.ability);
            }
            if (f.passesRequired != s.passesRequired) {
                return f.passesRequired - s.passesRequired;
            }
            return f.index - s.index;
        }
    };
    public Comparator<Student> byPasses = new Comparator<Student>() {
        @Override
        public int compare(Student f, Student s) {
            if (f.passesRequired != s.passesRequired) {
                return f.passesRequired - s.passesRequired;
            }
            if (f.ability != s.ability) {
                return (s.ability - f.ability);
            }
            return f.index - s.index;
        }
    };

    private class Bugs {

        int index;
        int complexity;
        Student student;

        Bugs(int ind, int comp) {
            index = ind;
            complexity = comp;
        }

        public void setStudent(Student s) {
            student = s;
        }
    }
    public Comparator<Bugs> byComplexityHL = new Comparator<Bugs>() {
        @Override
        public int compare(Bugs f, Bugs s) {
            return (s.complexity - f.complexity);
        }
    };
    public Comparator<Bugs> byComplexityLH = new Comparator<Bugs>() {
        @Override
        public int compare(Bugs f, Bugs s) {
            return f.complexity - s.complexity;
        }
    };
    int N, M, have;
    Student[] student;
    Bugs[] bugs;
    int[] tempAnswer;
    StringBuilder sb;

    private void solve() throws IOException {
        N = nextInt();
        M = nextInt();
        have = nextInt();
        student = new Student[N];
        bugs = new Bugs[M];
        tempAnswer = new int[150000];
        sb = new StringBuilder("");
        for (int i = 0; i < M; i++) {
            bugs[i] = new Bugs(i + 1, nextInt());
        }
        for (int i = 0; i < N; i++) {
            student[i] = new Student(i + 1, nextInt());
        }
        for (int i = 0; i < N; i++) {
            student[i].setPasses(nextInt());
        }
        Arrays.sort(bugs, byComplexityHL);
        Arrays.sort(student, byAbility);
        boolean solvable = false;
        for (int i = 0; i < N; i++) {
            if (student[i].passesRequired <= have && student[i].ability >= bugs[0].complexity) {
                solvable = true;
                break;
            }
        }
        if (!solvable) {
            out.println("NO");
            return;
        }
        sb.append("YES\n");
        int[] answer = new int[M];
        for (int low = 1, high = M; low <= high;) {
            int mid = (low + high) / 2;
            long cost = solve(mid);
            if (cost <= have) {
                for (int i = 0; i < M; i++) {
                    answer[i] = tempAnswer[i];
                }
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }
        for (int i : answer) {
            sb.append(i).append(" ");
        }
        out.println(sb);
    }

    long solve(int days) {
        long res = 0;
        PriorityQueue<Student> q = new PriorityQueue<Student>(200000, byPasses);
        int curr = 0;
        for (int idx = 0; idx < M; idx += days) {
            while (curr < N && student[curr].ability >= bugs[idx].complexity) {
                q.add(student[curr++]);
            }
            if (q.isEmpty()) {
                return Long.MAX_VALUE;
            }
            Student s = q.poll();
            res += s.passesRequired;
            for (int j = 0; j < days && idx + j < M; j++) {
                tempAnswer[bugs[idx + j].index - 1] = s.index;
            }
        }
        return res;
    }

    boolean isSorted(ArrayList<Integer> al) {
        int size = al.size();
        for (int i = 1; i < size - 2; i++) {
            if (al.get(i) > al.get(i + 1)) {
                return false;
            }
        }
        return true;
    }

    /**
     * SHUFFLE: shuffle the array 'a' of size 'N'
     */
    private void shuffle(int[] a, int N) {
        for (int i = 0; i < N; i++) {
            int r = i + (int) ((N - i) * Math.random());
            int t = a[i];
            a[i] = a[r];
            a[r] = t;
        }
    }

    /**
     * TEMPLATE-STUFF: main method, run method - ( fileIO and stdIO ) and
     * various methods for input like nextInt, nextLong, nextToken and
     * nextDouble with some declarations.
     */
    /**
     * For solution to the problem ... see the solve method
     */
    public static void main(String[] args) {
        new Main().run();
    }

    public void run() {
        try {
            in = new BufferedReader(new FileReader("D-large.in"));
            out = new PrintWriter(new BufferedWriter(new FileWriter("Main.out")));
            tok = null;
            solve();
            in.close();
            out.close();
            System.exit(0);
        } catch (IOException e) {//(FileNotFoundException e) {
            try {
                in = new BufferedReader(new InputStreamReader(System.in));
                out = new PrintWriter(new OutputStreamWriter(System.out));
                tok = null;
                solve();
                in.close();
                out.close();
                System.exit(0);
            } catch (IOException ex) {
                System.out.println(ex.getMessage());
                System.exit(0);
            }
        }
    }

    private String nextToken() throws IOException {
        while (tok == null || !tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    private int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    private long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    private double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
    BufferedReader in;
    StringTokenizer tok;
    PrintWriter out;
}