#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

int a[3], b[30], dp[31][4];

int main(void) {
    int i, j, n;
    int a[3];
    REP (i,3) cin >> a[i];
    cin >> n;
    REP (i,n) cin >> b[i];

    sort(a,a+3);
    sort(b,b+n);
    dp[0][0] = 1;
    REP (i,n) REP (j,4) {
        dp[i+1][j] += dp[i][j];
        if (j < 3) dp[i+1][j+(b[i] >= a[j])] += dp[i][j];
        else dp[i+1][j] += dp[i][j];
    }
    cout << dp[n][3] << endl;
    return 0;
}