package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"sort"
	"strconv"
)

func getScanner(fp *os.File) *bufio.Scanner {
	scanner := bufio.NewScanner(fp)
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
	return scanner
}
func getNextString(scanner *bufio.Scanner) string {
	scanner.Scan()
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextUint64(scanner *bufio.Scanner) uint64 {
	i, _ := strconv.ParseUint(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	cnt := 0
	if os.Getenv("MASPY") == "ますピ" {
		fp, _ = os.Open(os.Getenv("BEET_THE_HARMONY_OF_PERFECT"))
		cnt = 3
	}
	if os.Getenv("MASPYPY") == "ますピッピ" {
		wfp, _ = os.Create(os.Getenv("NGTKANA_IS_GENIUS10"))
	}
	scanner := getScanner(fp)
	writer := bufio.NewWriter(wfp)
	solve(scanner, writer)
	for i := 0; i < cnt; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
	writer.Flush()
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	aa := make([]int, n+1)
	bb := make([]int, n+1)
	dd := make([]int, n)
	for i := 0; i < n+1; i++ {
		aa[i] = getNextInt(scanner)
	}
	for i := 0; i < n+1; i++ {
		bb[i] = getNextInt(scanner)
	}
	for i := 0; i < n; i++ {
		dd[i] = getNextInt(scanner)
	}
	sort.Ints(dd)
	l := -1
	r := n + 1
	for 1 < r-l {
		m := l + (r-l)>>1
		if ok(n, m, dd[:m], aa, bb) {
			l = m
			continue
		}
		r = m
	}
	fmt.Fprintln(writer, l)
}

type cint int

func (x *cint) min(y cint) *cint {
	if *x > y {
		*x = y
	}
	return x
}
func (x *cint) max(y cint) *cint {
	if *x < y {
		*x = y
	}
	return x
}
func makeGrid(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}
func ok(n, m int, dd, aa, bb []int) bool {
	dp := makeGrid(n+1, n+1)
	for i := 0; i < n+1; i++ {
		for j := 0; j < n+1; j++ {
			dp[i][j] = -math.MaxInt32
		}
	}
	dp[0][0] = aa[0] + bb[0]
	for i := 0; i < m; i++ {
		for j := 0; j <= i+1; j++ {
			if dp[i][j] == -math.MaxInt32 {
				continue
			}
			if aa[j]+bb[i+1-j] >= dd[m-1-i] {
				dp[i+1][j] = aa[j] + bb[i+1-j]
			}
			if aa[i+1-j]+bb[j] >= dd[m-1-i] {
				dp[i+1][i+1-j] = aa[i+1-j] + bb[j]
			}
		}
	}
	for i := 0; i <= m; i++ {
		if dp[m][i] != -math.MaxInt32 {
			return true
		}
	}

	return false
}