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 c i 'passes' in his subjects (regardless of the volume of his work). Bugs, like students, are not the same: every bug is characterized by complexity a j , and every student has the level of his abilities b i . Student i can fix a bug j only if the level of his abilities is not less than the complexity of the bug: b i ≥ a j , 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. The first line contains three space-separated integers: n , m and s ( 1 ≤ n , m ≤ 10 5 , 0 ≤ s ≤ 10 9 ) — 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 a 1 , a 2 , ..., a m ( 1 ≤ a i ≤ 10 9 ) — the bugs' complexities. The next line contains n space-separated integers b 1 , b 2 , ..., b n ( 1 ≤ b i ≤ 10 9 ) — the levels of the students' abilities. The next line contains n space-separated integers c 1 , c 2 , ..., c n ( 0 ≤ c i ≤ 10 9 ) — the numbers of the passes the students want to get for their help. If the university can't correct all bugs print " NO ". Otherwise, on the fir