#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <iomanip>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(int i = 0;i < n;++i)
long long dp[1000][10] = {};
int main(){
	long long n;
	long long a[3] = {};
	cin >> a[0] >>a[1] >> a[2] >> n;
	vector<long long> family;
	REP(i, 3) {
		family.push_back(a[i]);
	}
	sort(begin(family), end(family));
	vector<long long> I_hate_math;
	REP(i, n) {
		long long hoge;
		cin >> hoge;
		I_hate_math.push_back(hoge);
	}
	sort(begin(I_hate_math), end(I_hate_math));
	for (int i = 0;i < n;++i) {
		if (I_hate_math[i] >= family[0]) {
			dp[i][1] += 1;
		}else{
			dp[i][0] += 1;
		}
		for (int q = i + 1;q < n;++q) {
			dp[q][3] += dp[i][3];
			if (I_hate_math[q] >= family[2]) {
				dp[q][3] += dp[i][2];
			}
			else {
				dp[q][2] += dp[i][2];
			}
			if (I_hate_math[q] >= family[1]) {
				dp[q][2] += dp[i][1];
			}
			else {
				dp[q][1] += dp[i][1];
			}
			if(I_hate_math[q] >= family[0]) {
				dp[q][1] += dp[i][0];
			}
			else {
				dp[q][0] += dp[i][0];
			}
		}
	}
	long long ans = 0;
	for (int i = 0;i < n;++i) {
		ans += dp[i][3];
	}
	cout << ans << endl;
}