#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;

#define ll long long

ll B,C,D;
ll N;
vector<ll>E;

void sortinput(){
  vector<ll> s;
  s.push_back(B);
  s.push_back(C);
  s.push_back(D);

  sort(s.begin(),s.end());
  B=s[0];
  C=s[1];
  D=s[2];
}

ll judge(ll b, ll c, ll d){
  if(((b>=B)&&(c>=C))&&(d>=D)){
    return 1;
  }
  return 0;
}


ll pl(ll i){
  if(i<=0) return 1;
  else return pow(2,i);
}

int main(){

  ll inp;
  ll compare,count;
  ll result =0;
  ll outp;
  
  cin >> B >> C >> D;
  cin >> N;

  for(ll i =0;i<N;i++){
    cin >>inp;
    E.push_back(inp);
  }
  sort(E.begin(),E.end());
  sortinput();

    
  if(N<3){
    cout << "0" << endl;
    return 0;
  }
  for(ll i =0;i<N;i++){
    for(ll j=i+1;j<N;j++){
      for(ll k=j+1;k<N;k++){
	result+=judge(E[i],E[j],E[k])*pl(i);
      }
    }
  }

  
  cout << result << endl;
  
}