#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

int gcd(int a, int b){
    if(b==0) return a;
    return gcd(b,a%b);
}
int lcm(int a, int b){
    return a/gcd(a,b)*b;
}


signed main(void) {
    vi v(3);
    rep(i,3)cin >> v[i];
    sort(all(v));
    int n;
    cin >> n;
    vi e(n);
    rep(i,n)cin >> e[i];
    sort(all(e));
    vector<vi> dp(n+1,vi(4));
    dp[0][0] = 1;
    rep(i,n)rep(j,4){
        if(j < 3 && v[j] <= e[i]){
            dp[i+1][j+1] += dp[i][j];
            dp[i+1][j] += dp[i][j];
        }else{
            dp[i+1][j] += 2*dp[i][j];
        }
    }
    cout << dp.back().back() << endl;
}