#include <bits/stdc++.h>
using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL, LL> PLL;

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

LL dp[8][40][40];

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  VI as(3); REP(i,3) cin >> as[i];
  SORT(as);
  int N; cin >> N;
  VI xs(N); REP(i,N) cin >> xs[i];

  dp[0][0][0] = 1;
  REP(i,N){
	REP(b,8){
	  REP(n,40){
		dp[b][n][i+1] += dp[b][n][i];

		int nb = b;
		for(int j=2;j>=0;--j){
		  if((b>>j&1)==0 && xs[i] >= as[j]){
			nb |= 1<<j;
			break;
		  }
		}
		dp[nb][n+1][i+1] += dp[b][n][i];
	  }
	}
  }

  LL ans = 0;
  for(int n=3;n<40;++n)
	ans += dp[7][n][N];
  cout << ans << endl;
  
  return 0;
}