#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

vi BCD(3), E;
int N;
// [i番目まで見た][B,C,Dの使ったフラグ(B<=C<=Dとする)]
int dp[31][1 << 3];

void solve(){
    sort(all(BCD), greater<int>());
    MEM(dp, 0);

    dp[0][0] = 1;
    rep(i, N)rep(mask, 1 << 3)if(dp[i][mask]){
        bool flag = false;
        rep(j, 3)if(!(mask >> j & 1) && E[i] >= BCD[j]){
            flag = true;
            dp[i + 1][1 << j | mask] += dp[i][mask];
            break;
        }
        dp[i + 1][mask] += dp[i][mask] * (2-(int)flag);
    }

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

int main(){
    while(cin >> BCD[0] >> BCD[1] >> BCD[2] >> N){
        E.resize(N);
        rep(i, N)cin >> E[i];
        solve();
    }
}