#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

int need[5];
int N, E[40];
int dp[40][5];
int solve(int i, int j){
	if(i >= N){
		return (j == 3);
	}
	if(dp[i][j] != -1)return dp[i][j];
	int res = solve(i + 1, j);
	int jj = j;
	if(j < 3 && need[j] <= E[i])++jj;
	res += solve(i + 1, jj);
	return dp[i][j] = res;
}

int main(){
	memset(dp, -1, sizeof(dp));

	cin >> need[0] >> need[1] >> need[2];
	cin >> N;
	for(int i=0;i<N;i++)cin >> E[i];

	sort(need, need + 3);
	sort(E, E + N);

	cout << solve(0, 0) << endl;
	return 0;
}