#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    vector<int> seat(3);
    int N;
    for(int i = 0; i < 3; ++i)  cin >> seat[i];
    cin >> N;
    vector<int> E(N);
    for(int i = 0; i < N; ++i)  cin >> E[i];

    sort(begin(seat), end(seat));
    sort(begin(E), end(E));

    vector<vector<ll>> dp(N + 1, vector<ll>(4));
    dp[0][0] = 1;
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < 3; ++j){
            if(dp[i][j] == 0)   continue;
            if(E[i] >= seat[j]){
                dp[i + 1][j + 1] += dp[i][j];
                dp[i + 1][j] += dp[i][j];
            }
            else{
                dp[i + 1][j] += dp[i][j] * 2;
            }
        }
        dp[i + 1][3] += dp[i][3] * 2;
    }

    cout << dp[N][3] << endl;
    
    return 0;
}