#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define BIGINT 0x7FFFFFFF
#define E107 1000000007


int n;
int fam[4];
int sheet[105];


int memo[105][5];
int calc(int sheetid,int famid){
    //printf("%d %d\n",sheetid,famid,memo[sheetid][famid] -1 );
    if (n<=sheetid) return (3<=famid);
    
    if (!memo[sheetid][famid]) 	{
        int k;
        if (fam[famid] <= sheet[sheetid]){
            k = calc(sheetid+1,famid+1) + calc(sheetid+1,famid);
        }else{
            k = calc(sheetid+1,famid) * 2;
        }
        memo[sheetid][famid] = k + 1;
    }
    
    //printf("%d %d > %d\n",sheetid,famid,memo[sheetid][famid] -1 );
    return memo[sheetid][famid] - 1;
}

int main(){
    int i,j,k,l;
    
    cin>>fam[0]>>fam[1]>>fam[2]>>n;
    fam[3]=BIGINT;
    
    for (i=0;i<n;i++){
        scanf("%d",sheet+i);
    }
    
    sort(fam,fam+3);
    sort(sheet,sheet+n);
    
    cout<<calc(0,0)<<endl;

    return 0;
}