#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int NUM_FAMILY = 3;
const int NUM_SHEET = 30;


int needSize[NUM_FAMILY];
int numSheet, sheet[NUM_SHEET];

void read() {
    for (int i = 0; i < NUM_FAMILY; ++i) {
        cin >> needSize[i];
    }

    cin >> numSheet;
    for (int i = 0; i < numSheet; ++i) {
        cin >> sheet[i];
    }
}


int rec(int nThFamily, int nThSheet, int dp[NUM_FAMILY][NUM_SHEET]) {
    if (nThSheet == numSheet) {
        return nThFamily == 3 ? 1 : 0;
    }

    int &ret = dp[nThFamily][nThSheet];
    if (ret != -1) return ret;

    ret = 0;

    // Pick up sheet
    ret += rec(nThFamily + (nThFamily < NUM_FAMILY && needSize[nThFamily] <= sheet[nThSheet]),
               nThSheet + 1,
               dp);

    // Do not pick up sheet
    ret += rec(nThFamily, nThSheet + 1, dp);

    return ret;
}


void work() {
    sort(needSize, needSize + NUM_FAMILY);
    reverse(needSize, needSize + NUM_FAMILY);
    
    sort(sheet, sheet + numSheet);
    reverse(sheet, sheet + numSheet);

    int dp[NUM_FAMILY + 1][NUM_SHEET];
    memset(dp, -1, sizeof(dp));

    cout << rec(0, 0, dp) << endl;
}


int main() {
    read();
    work();
    return 0;
}