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

int main() {
    using namespace std;
    int b, c, d, n;
    cin >> b >> c >> d >> n;
    if (b > c) { swap(b, c); }
    if (c > d) { swap(c, d); }
    if (b > c) { swap(b, c); }
    vector<int> a(n);
    for (auto &e : a) { cin >> e; }
    sort(a.begin(), a.end());

    int ans = 0;
    for (int i = 0; i < n; i++) {
        if (a[i] < b) { continue; }
        for (int j = i + 1; j < n; j++) {
            if (a[j] < c) { continue; }
            for (int k = j + 1; k < n; k++) {
                if (a[k] < d) { continue; }
                ans += 1 << i;
            }
        }
    }
    cout << ans << endl;
}