#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    ll n,m,k;cin>>n>>m>>k;
    char op;cin>>op;
    vector<ll> b(m),a(n);
    rep(i,m) cin>>b[i];
    rep(i,n) cin>>a[i];
    ll cnt=0;
    sort(ALL(b));
    rep(i,n){
        ll target=(op=='*'?(k+a[i]-1)/a[i]:k-a[i]);
        cnt+=b.end()-lower_bound(ALL(b),target);
    }
    cout<<cnt<<endl;
    return 0;
}