import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Lunch {

	static String line;
	static String[] nums;
	private static ArrayList<Integer> SM;
	private static ArrayList<Integer> DB;

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		while (true) {
			line = br.readLine();
			nums = line.split(" ");
			int L = Integer.parseInt(nums[0]);
			int S = Integer.parseInt(nums[1]);
			int M = Integer.parseInt(nums[2]);
			int D = Integer.parseInt(nums[3]);
			int B = Integer.parseInt(nums[4]);
			if (L == 0 && S == 0 && M == 0 && D == 0 && B == 0) {
				break;
			}
			SM = new ArrayList<Integer>();
			DB = new ArrayList<Integer>();
			//////////////////////////////
			List<Integer> first = new ArrayList<Integer>();
			line = br.readLine();
			nums = line.split(" ");
			for (int i = 0; i < S; i++) {
				first.add(Integer.parseInt(nums[i]));
			}

			line = br.readLine();
			nums = line.split(" ");
			for (int i = 0; i < M; i++) {
				int num = Integer.parseInt(nums[i]);
				for (int j = 0; j < first.size(); j++) {
					SM.add(num + first.get(j));
				}
			}
			/////////////////////////////////////
			first = new ArrayList<Integer>();
			line = br.readLine();
			nums = line.split(" ");
			for (int i = 0; i < D; i++) {
				first.add(Integer.parseInt(nums[i]));
			}

			line = br.readLine();
			nums = line.split(" ");
			for (int i = 0; i < B; i++) {
				int num = Integer.parseInt(nums[i]);
				for (int j = 0; j < first.size(); j++) {
					DB.add(num + first.get(j));
				}
			}

			Collections.sort(DB);
			System.out.println(spocitaj(L));
			br.readLine();
		}

	}

	private static long spocitaj(int L) {
		long moznosti = 0;
		for (Integer c1 : SM) {
			if (c1 > L)
				continue;
			int dolnyIx = 0;
			int hornyIx = DB.size() - 1;
			while (hornyIx - dolnyIx > 0) {
				int stred = (hornyIx + dolnyIx) / 2 + 1;
				if (c1 + DB.get(stred) > L) {
					hornyIx = stred - 1;
				} else
					dolnyIx = stred;

			}
			moznosti += hornyIx;
			if (hornyIx == 0 && (c1 + DB.get(0)) <= L) {
				moznosti++;
			} else if (hornyIx > 0) {
				moznosti++;
			}
		}
		return moznosti;

	}
}