#include<bits/stdc++.h> using namespace std; using ll=long long; const int e5=1e5; const int e9=1e9; void readnum(int&n,int l,char s){ int c=getchar(); assert('1'<=c&&c<='9'); n=c-'0'; while(true){ c=getchar(); if(c==s)break; assert('0'<=c&&c<='9'); assert(n*10ll+c-'0'<=l); n=n*10+c-'0'; } } ll solve2(int N,int M,int K,int op,vector<int>A,vector<int>B){ sort(B.begin(),B.end()); ll z=0; for(int i=0;i<N;++i){ z+=B.end()-lower_bound(B.begin(),B.end(),op=='+'?K-A[i]:(K-1)/A[i]+1); } return z; } int main(){cin.tie(0);ios::sync_with_stdio(false); int N,M,K; readnum(N,e5,' '); readnum(M,e5,' '); readnum(K,e9,'\n'); int op=getchar(); assert(op=='+'||op=='*'); int c=getchar(); assert(c==' '); vector<int>A(N),B(M); for(int i=0;i<M;++i){ readnum(B[i],e9," \n"[i==M-1]); } for(int i=0;i<N;++i){ readnum(A[i],e9,'\n'); } c=getchar(); assert(c==-1); cout<<solve2(N,M,K,op,A,B)<<"\n"; return 0; }