#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#include <algorithm>
#include <functional>
using namespace std;

int N;

int DP[31][4];

int main()
{
	vector<int>BCD(3);
	cin >> BCD[0] >> BCD[1] >> BCD[2];
	sort(BCD.begin(), BCD.end(),greater<int>());

	cin >> N;
	vector<int>E(N);
	for (int i = 0; i < N; i++)cin >> E[i];
	sort(E.begin(), E.end(),greater<int>());

	DP[0][0] = 1;
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= 3; j++) {
			if (BCD[j - 1] <= E[i - 1]) {
				for (int k = j - 1; k < i; k++) {
					DP[i][j] += DP[k][j - 1];
				}
			}
		}
	}
	int ans = 0;
	for (int i = 3; i <= N; i++) {
		ans += DP[i][3] * pow(2, N - i);
		//cout << DP[i][3] << endl;
	}

	cout << ans << endl;
	return 0;
}