#include <iostream>
#include <vector>
#include <array>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
typedef long long ll;
using namespace std;
ll p(int n) { return 1ll << n; }
ll c(int n, int r) {
    ll acc = 1;
    repeat (i,r) acc *= n-i;
    repeat (i,r) acc /= i+1;
    return acc;
}
ll f(int n, int r) {
    ll acc = p(n);
    repeat (i,r) acc -= c(n,i);
    return acc;
}
int main() {
    // input
    int b, c, d; cin >> b >> c >> d;
    int n; cin >> n;
    vector<int> es(n); repeat (i,n) cin >> es[i];
    // compute
    array<int,4> e = {};
    repeat (i,n) {
        int cnt = 0;
        cnt += int(b <= es[i]);
        cnt += int(c <= es[i]);
        cnt += int(d <= es[i]);
        e[cnt] += 1;
    }
    ll ans = 0;
    ans += p(e[0]) * f(e[1], 1) * f(e[2], 1) * f(e[3], 1);
    ans += p(e[0]) * f(e[1], 1)              * f(e[3], 2);
    ans += p(e[0]) *              f(e[2], 2) * f(e[3], 1);
    ans += p(e[0]) *                e[2]     * f(e[3], 2);
    ans += p(e[0]) *                           f(e[3], 3);
    cout << ans << endl;
    return 0;
}