#ifdef LOCAL111
#else
	#define NDEBUG
#endif
#include <bits/stdc++.h>
const int INF = 1e8;
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define rangej(a,b,c) ((a) <= (c) and (c) < (b))
#define rrangej(b,c) rangej(0,b,c)
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;
typedef pair<LL,LL> LP;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);	
}

int main()
{
	ios_init();
	vector<int> bcd(3);	
	while(cin >> bcd[0] >> bcd[1] >> bcd[2]){
		int n;
		cin >> n;
		vector<int> e(n);
		REP(i,n) cin >> e[i];

		sort(ALL(bcd));
		sort(ALL(e));
		std::vector<std::vector<LL>> dp(n+1,vector<LL>(4,0));
		dp[0][0] = 1;
		REP(i,n){
			REP(j,3){
				if(bcd[j] <= e[i]){
					dp[i+1][j] += dp[i][j];
					dp[i+1][j+1] += dp[i][j];
				}else{
					dp[i+1][j] += dp[i][j]*2;
				}
			}
			dp[i+1][3] += dp[i][3]*2;
		}
		// REP(i,n+1) dpite(ALL(dp[i]));
		cout << dp[n][3] << endl;
	}
	return 0;
}