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

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

int main(){
    vector<int> A(3);
    int N;
    cin>>A[0]>>A[1]>>A[2];
    cin>>N;
    vector<int> E(N);
    rep(i,N) cin>>E[i];
    sort(ALL(A));
    sort(ALL(E));

    vvi dp(N+1,vi(4,0));
    dp[0][0]=1;
    for(int i=1;i<=N;i++){
        dp[i][0]=dp[i-1][0]*2;
    }

    for(int i=1;i<=N;i++){
        for(int j=1;j<=3;j++){
            if(E[i-1]>=A[j-1]){
                dp[i][j] += dp[i-1][j-1];
                dp[i][j] += dp[i-1][j];
            }else{
                dp[i][j] += 2 * dp[i-1][j];
            }
        }
    }

//    for(int i=0;i<4;i++){
//        for(int j=0;j<=N;j++){
//            cout << dp[j][i] << " ";
//        }
//        cout << endl;
//    }

    cout << dp[N][3] << endl;
}