#include<iostream>

#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>

#include<stdio.h>
#include<math.h>
#include<ctype.h>
#include<string.h>

using namespace std;

#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define PB push_back
#define PII pair<int, int>
#define fi first
#define se second;iiiisaas
#define MP make_pair

#define SIZE(s) ((int)(s).size())

#define MAX 2047

#define ll long long

int D[5][MAX];
int L, N[5];

vector<ll> K[3];

int find(int a)
{
//	if (a < 0 ) return 0;
	int idx = upper_bound(K[1].begin(), K[1].end(), a) - K[1].begin();
	return idx;
}

int main()
{
	while(true)
	{
		scanf("%d %d %d %d %d", &L, N, N+1, N+2, N+3);
		if (L + N[0] + N[1] + N[2] + N[3] == 0) return 0;
		FOR(n,0,3)
		{
			FOR(i,0,N[n]-1) scanf("%d", &D[n][i]);
		}

		
		FOR(i,0,1) K[i].clear();


		FOR(i,0,N[0]-1)
			FOR(j,0,N[1]-1)
			{
				K[0].PB( (ll)( D[0][i]+D[1][j] ) );
			}
		FOR(i,0,N[2]-1)
			FOR(j,0,N[3]-1)
			{
				K[1].PB( (ll) (D[2][i]+D[3][j]) );
			}

		sort(K[0].begin(), K[0].end());
		sort(K[1].begin(), K[1].end());

		//FOR(i,0,SIZE(K[0])-1) printf("%d ", K[0][i]); printf("\n");
		//FOR(i,0,SIZE(K[1])-1) printf("%d ", K[1][i]); printf("\n");

		ll sum = 0;
		FOR(i,0,SIZE(K[0])-1)
		{
			int k = find( (ll)L - K[0][i]);
		//	printf("Hladam: %d = %d\n",  L - K[0][i], k);
			sum+= (ll) k;
		}

		printf("%lld\n", sum);
	}
	return 0;
}