#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

int target[3];
int N;
int E[33];

ll dp[33][4];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    for (int i = 0; i < 3; i++)
        cin >> target[i];
    sort(target, target+3);
    cin >> N;
    for (int i = 0; i < N; i++)
        cin >> E[i];
    sort(E, E+N);
    dp[0][0] = 1;
    for (int i = 0; i < N; i++) for (int s = 0; s < 4; s++) {
        // 選択しない
        dp[i+1][s] += dp[i][s];
        // 選択する
        if (s < 3 && E[i] >= target[s]) {
            dp[i+1][s+1] += dp[i][s];
        } else {
            dp[i+1][s] += dp[i][s];
        }
    }
    cout << dp[N][3] << endl;
    return 0;
}