#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)

#define int long long

map< array<int,4> ,int >  dp;
int V[110];
int N;
int A,B,C;
tuple<int,int,int> f(int a,int b,int c,int p){
	if( a < p ) return tuple<int,int,int>{p,a,b};
	if( b < p ) return tuple<int,int,int>{a,p,b};
	if( c < p ) return tuple<int,int,int>{a,b,p};
	return tuple<int,int,int>{a,b,c};
}
int dfs(int x,int a,int b,int c){
	
	// cout << x << " " << a << " " << b << " " << c << endl;
	if( x == N ) return a >= A and b >= B and c >= C;
	if( x >= N ) return 0;
	if( dp.count({x,a,b,c}) ) return dp[{x,a,b,c}];
	
	int X,y,z;
	tie(X,y,z) = f(a,b,c,V[x]);
	return dp[{x,a,b,c}] = dfs(x+1,X,y,z) + dfs(x+1,a,b,c);
	
	
}



signed main(){
	//memset(dp,-1,sizeof(dp));
	cin >> A >> B >> C;
	if( A < B ) swap(A,B);
	if( B < C ) swap(B,C);
	if( A < B ) swap(A,B);
	cin >> N;
	for(int i = 0 ; i < N ; i++) cin >> V[i];
	cout << dfs(0,0,0,0) << endl;
	

	
	
	
}