#include<iostream>#include<cstring>#include<algorithm>usingnamespace std;constint N =1e5+5;int a[N], b[N], c[N];intmain(){int n;scanf("%d",&n);for(int i =0; i < n; i++){scanf("%d",&a[i]);}for(int i =0; i < n; i++){scanf("%d",&b[i]);}for(int i =0; i < n; i++){scanf("%d",&c[i]);}sort(a, a+n);sort(b, b+n);sort(c, c+n);longlong res =0;for(int i =0; i < n; i++){int l =0, r = n-1;while(l < r){int mid = l + r +1>>1;if(a[mid]< b[i]) l = mid;else r = mid -1;}if(a[l]>= b[i]) l =-1;longlong left = l +1;
l =0, r = n-1;while(l < r){int mid = l + r >>1;if(c[mid]> b[i]) r = mid;else l = mid +1;}if(c[l]<= b[i]) l = n;longlong right = n - l;
res += left*right;}printf("%lld", res);return0;}