#include <bits/stdc++.h>
using namespace std;

int main() {
	int c[3];
	for (int i = 0; i < 3; i++) cin >> c[i];
	sort(c, c + 3);

	int n;
	cin >> n;
	vector<long long> a(n);
	for (int i = 0; i < n; i++) cin >> a[i];

	static long long dp[33][33][33][33];
	dp[0][0][0][0] = 1;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j <= 30; j++) {
			for (int k = 0; k <= 30; k++) {
				for (int l = 0; l <= 30; l++) {
					int nj = j + (a[i] >= c[0]);
					int nk = k + (a[i] >= c[1]);
					int nl = l + (a[i] >= c[2]);
					dp[i + 1][j][k][l] += dp[i][j][k][l];
					dp[i + 1][nj][nk][nl] += dp[i][j][k][l];
				}
			}
		}
	}

	long long ans = 0;
	for (int j = 3; j <= 30; j++) {
		for (int k = 2; k <= 30; k++) {
			for (int l = 1; l <= 30; l++) {
				ans += dp[n][j][k][l];
			}
		}
	}
	cout << ans << endl;
}