#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

vi a;
int n;
vi b;

int main(){
  REP(i,3){
    int x;
    scanf("%d",&x);
    a.push_back(x);
  }
  scanf("%d",&n);
  REP(i,n){
    int x;
    scanf("%d",&x);
    b.push_back(x);
  }
  sort(ALL(a));
  sort(ALL(b));
  vi dp(4,0);
  dp[0] = 1;
  REP(i,n){
    FORR(j,0,4){
      if(j==3 || b[i]<a[j]){
        dp[j] *= 2;
      }else{
        dp[j+1] += dp[j];
      }
    }
  }
  printf("%d\n",dp[3]);
  return 0;
}