import java.util.*;
import java.io.*;
import java.math.*;
public class Main{
    class Node implements  Comparable<Node>{
        int x;
        int y;
        public Node(int x,int y){
            this.x=x;
            this.y=y;
        }
        public int compareTo(Node c){
            return Long.compare(this.x,c.x);
        }
    }

    void solve()  {
        int n=ni();
        int a[]=new int[n+1];
        int b[]=new int[n+1];
        int c[]=new int[n+1];
        for(int i=1;i<=n;i++) a[i]=ni();
        for(int i=1;i<=n;i++) b[i]=ni();
        for(int i=1;i<=n;i++) c[i]=ni();
        Arrays.sort(a,1,n+1);
        Arrays.sort(b,1,n+1);
        Arrays.sort(c,1,n+1);
       // for(int i=1;i<=n;i++) pw.print(a[i]+" ");
        //pw.println("");
        long ans=0;
        for(int i=1;i<=n;i++){
            long id1=lower_bound(a,n,b[i]);
            long id2=upper_bound(c,n,b[i]);
            if(id1>n) id1--;
            if(id1>=1 && a[(int)id1]>=b[i]) id1--;
            if(id2<=n && c[(int)id2]<=b[i]) id2++;
           // System.out.println(b[i]+" "+id1+" "+id2);
            ans=ans+(id1)*(n-id2+1);
        }
        pw.println(ans);

    }

    int lower_bound(int a[], int n, int x) {
        int l = 1;
        int h = n+1; // Not n - 1
        while (l < h) {
            int mid = (l + h) / 2;
            if (x <= a[mid]) {
                h = mid;
            } else {
                l = mid + 1;
            }
        }
        return l;
    }
    int upper_bound(int a[],int n,int x){
        int l=0,h=n;
        while(l<h){
            int mid=(l+h)/2;
            if(x>=a[mid]) l=mid+1;
            else h=mid;
        }
        return l;
    }
    InputStream is;
    PrintWriter pw;
    String INPUT = "";
    void run() throws Exception {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        pw = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        pw.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }

    public static void main(String[] args) throws Exception { new Main().run(); }

    private byte[] inbuf = new byte[1024];
    public int lenbuf = 0, ptrbuf = 0;

    private int readByte() {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }

    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }

    private String ns() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private char[] ns(int n) {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }

    private char[][] nm(int n, int m) {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }

    private int[] na(int n) {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }

    private int ni() {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }

        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private long nl() {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }

        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st;
    public boolean hasNext() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String s = br.readLine();
            if (s == null) {
                return false;
            }
            st = new StringTokenizer(s);
        }
        return true;
    }

    private void tr(Object... o) { if(INPUT.length() > 0)System.out.println(Arrays.deepToString(o)); }
}

Measured memory_bytes: 28552