import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int d = sc.nextInt();
		int k = sc.nextInt();
		long[] a = new long[n + 1];
		int[] b = new int[n + 1];
		for(int i = 1;i <= n;i++) {
			a[i] = sc.nextInt();
		}for(int i = 1;i <= n;i++) {
			b[i] = sc.nextInt();
		}long[][] dp = new long[d + 1][k + 1];
		long[][] old = new long[d + 1][k + 1];
		long MIN = Long.MIN_VALUE/2;
		for(int i = 0;i <= d;i++) {
			for(int j = 0;j <= k;j++) {
				dp[i][j] = MIN;
				old[i][j] = MIN;
			}
		}old[0][0] = 0;
		for(int i = 1;i <= n;i++) {
			//選ぶ
			for(int p = 0;p < d;p++) {
				for(int q = 0;q <= k;q++) {
					if(old[p][q] != MIN)
					dp[p + 1][Math.min(k, q + b[i])] = Math.max(dp[p + 1][Math.min(k, q + b[i])], old[p][q] + a[i]);
				}
			}//選ばない
			for(int p = 0;p <= d;p++) {
				for(int q = 0;q <= k;q++) {
					dp[p][q] = Math.max(dp[p][q],old[p][q]);
				}
			}for(int p = 0;p <= d;p++) {
				for(int q = 0;q <= k;q++) {
					old[p][q] = dp[p][q];
				}
			}
		}System.out.print(dp[d][k] != MIN ? dp[d][k]:"No");
	}

}