// #define _GLIBCXX_DEBUG #include using namespace std; #define int long long #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define rep(i, n) for (int i = 0; i < n; ++i) #define REP(i, n) for (int i = 0; i < n; ++i) #define range(i,a,b) ((a)<=(i) && (i)<(b)) #define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl; #define fs first #define sc second #define pb push_back #define eb emplace_back typedef long long ll; typedef pair P; typedef tuple T; typedef vector vec; typedef vector

pvec; typedef vector> vvec; typedef vector> pvvec; typedef priority_queue PQI; typedef priority_queue

PQP; typedef priority_queue,greater> PQIG; typedef priority_queue,greater

> PQPG; const vector dx = {0, -1, 0, 1, 1, 1, -1, -1}; const vector dy = {1, 0, -1, 0, 1, -1, 1, -1}; const int MOD = (1000000007); // const int MOD = (998244353); // const int INF = (1 << 30); const int INF = (1LL << 60); const double EPS = (1 >> 30); template inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;} template inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;} signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); //--------------------------------------------- int n,m; cin>>n>>m; int k;cin>>k; char x; cin>>x; vec b(m); vec a(n); ll sua=0,sub=0; rep(i,m) cin>>b[i],sub+=b[i]; rep(i,n) cin>>a[i],sua+=a[i]; ll cnt=0; sort(all(a));sort(all(b)); if(x=='+'){ rep(i,m){ cnt+=a.end()-lower_bound(all(a),k-b[i]); } rep(i,n){ cnt+=b.end()-lower_bound(all(b),k-a[i]); } cout<