#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include using namespace atcoder; using namespace std; using ll = long long; using vll = vector; using vvll = vector; using vvvll = vector; using vvvvll = vector; using vvvvvll = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vvvvb = vector; using vvvvvb = vector; using vd = vector; using vvd = vector; using vvvd = vector; using vvvvd = vector; using vvvvvd = vector; #define all(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) #define rep2(i, s,t) for (ll i = s; i < (ll) (t); i++) template bool chmax(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p < q) { p = q; return 1; } else { return 0; } } template bool chmin(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p > q) { p = q; return 1; } else { return 0; } } ll modPow(long long a, long long n, long long p) { if (n == 0) return 1; // 0乗にも対応する場合 if (n == 1) return a % p; if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p; long long t = modPow(a, n / 2, p); return (t * t) % p; } ll gcd(ll(a), ll(b)) { if (a == 0)return b; if (b == 0)return a; ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll sqrtz(ll N) { ll L = 0; ll R = sqrt(N) + 10000; while (abs(R - L) > 1) { ll mid = (R + L) / 2; if (mid * mid <= N)L = mid; else R = mid; } return L; } using mint = modint998244353; using vm = vector; using vvm = vector; using vvvm = vector; vector fact, factinv, inv, factK; ll mod = 998244353; void prenCkModp(ll n) { //factK.resize(4*n+5); fact.resize(n + 5); factinv.resize(n + 5); inv.resize(n + 5); fact[0] = fact[1] = 1; factinv[0] = factinv[1] = 1; inv[1] = 1; for (ll i = 2; i < n + 5; i++) { fact[i] = (fact[i - 1] * i); inv[i] = (mod - ((inv[mod % i] * (mod / i)))); factinv[i] = (factinv[i - 1] * inv[i]); } //factK[0]=1; //for(ll i=1;i<4*n+5;i++){ // factK[i]=factK[i-1]*mint(K-i+1); // //K*(K-1)*...*(K-i+1); //} } mint nCk(ll n, ll k) { if (n < k || k < 0) return 0; return (fact[n] * ((factinv[k] * factinv[n - k]))); } //mint nCkK(ll n,ll k){ // if(K>N; ll M=3e3+10; vll R(M,0),G(M,0),B(M,0); rep(i,N){ ll r; cin>>r; R[r]++; } rep(i,N){ ll r; cin>>r; G[r]++; } rep(i,N){ ll r; cin>>r; B[r]++; } vll SR(M+1,0); rep(i,M+1)if(i!=0)SR[i]=SR[i-1]+R[i]; ll an=0; rep(g,M)rep(b,M){ ll res=G[g]*B[b]; if(res==0)continue; ll RI=min(g+b-1,M); ll LE=max(g,b); ll u=SR[RI]-SR[LE-1]; if(u<=0)continue; an+=res*(u); // cout<