// https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
using Graph = vector<vector<ll>>;
const ll INF = 1LL << 60;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
const ll tl= 1'000'000'007;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ind(...) long double __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << endl;} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#define in1(A) REP(i,A.size()) in(A[i]);
#define in2(A,B) REP(i,A.size()) in(A[i],B[i]);
#define in3(s,t,u) REP(i,sz(s)){in(s[i] , t[i] , u[i]);}
#define in4(s,t,u,v) REP(i,sz(s)){in(s[i] , t[i] , u[i] , v[i]);}
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
struct Point{ ld x,y; };
ld dist(Point a, Point b){return sqrt(abs(a.x-b.x)*abs(a.x-b.x)+abs(a.y-b.y)*abs(a.y-b.y));} // ２点間の距離 
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a,ll b){ return a / gcd(a,b) * b;} 
ll fact(ll n){ if(n < 2) return 1; return (n * fact(n-1))%tl; } //階乗
inline ll updiv(ll a,ll b){ return (a + b - 1) / b; } //切り上げ
template<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;}
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
//-------------------------------------------------------------------------------------------------
//lower_bound
bool isok1(ll idx,ll x,vl &A){
    
    if(A[idx]>=x) return 1;
    else return 0; 
}
int binary_meguru1(ll x,vl &A){
    ll left= -1; ll right= A.size();
    while(right-left>1){
        ll mid= left+(right-left)/2;
        if(isok1(mid,x,A)){
            right= mid;
        }else{
            left= mid;
        }
    }
    return right;
}
//upper_bound
bool isok2(ll idx,ll x,vl &A){
    
    if(A[idx]<=x) return 1;
    else return 0; 
}
int binary_meguru2(ll x,vl &A){
    ll left= -1; ll right= A.size();
    while(right-left>1){
        ll mid= left+(right-left)/2;
        if(isok2(mid,x,A)){
            left= mid;
        }else{
            right= mid;
        }
    }
    return left;
}
// int x= 見つけたい数;
// cout << binary_meguru(-1,A.size(),x) << endl;
int main(){
    init();
    inl(n);
    vl A(n); in1(A);    
    vl B(n); in1(B); 
    vl C(n); in1(C); 
    sort(all(A));
    sort(all(B));
    sort(all(C));
    ll ans=0;
    REP(i,n){
        // ll x=lower_bound(all(A),B[i])-A.begin();
        // ll y=C.end()-upper_bound(all(C),B[i]);
        // ans+= x*y;
        auto p=binary_meguru1(B[i],A);
        auto q=binary_meguru2(B[i],C);
        ans+= p*(n-1-q);
    }
    
    out(ans);
}

Measured memory_bytes: 2560