#include<iostream>
#include<algorithm>
using namespace std;
long long dp[1000][4],a[4],b[1000],n;
int main(){
	cin>>a[0]>>a[1]>>a[2]>>n;
	for(int i=0;i<n;i++)cin>>b[i];
	sort(a,a+3);sort(b,b+n);dp[0][0]=1;a[3]=1LL<<62;
	for(int i=0;i<n;i++){
		for(int j=0;j<4;j++){
			if(a[j]<=b[i]){dp[i+1][j+1]+=dp[i][j];}
			else{dp[i+1][j]+=dp[i][j];}
			dp[i+1][j]+=dp[i][j];
		}
	}
	long long sum=0;
	cout<<dp[n][3]<<endl;
	return 0;
}