#include <iostream>
#include <algorithm>
#include <vector>

void solve() {
    std::vector<int> xs(3);
    for (auto &x : xs) std::cin >> x;

    int n;
    std::cin >> n;
    std::vector<int> ys(n);
    for (auto &y : ys) std::cin >> y;

    std::sort(xs.begin(), xs.end());
    std::sort(ys.begin(), ys.end());

    std::vector<int> dp(4, 0);
    dp[0] = 1;
    for (auto y : ys) {
        for (int i = 3; i >= 0; --i) {
            if (i < 3 && xs[i] <= y) {
                dp[i + 1] += dp[i];
            } else {
                dp[i] += dp[i];
            }
        }
    }

    std::cout << dp[3] << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}