using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;

class Myon
{
    public Myon() { }
    public static int Main()
    {
        cin = new Scanner();
        new Myon().calc();
        return 0;
    }

    static Scanner cin;

    // メンバ変数---
    int N;
    int[] A;
    int[] B;
    int[] C;

    // -------------

    void calc()
    {
        N = cin.nextInt();
        A = cin.ArrayInt(N);
        B = cin.ArrayInt(N);
        C = cin.ArrayInt(N);

        Array.Sort(A);
        Array.Sort(B);
        Array.Sort(C);
        long ret = 0;
        foreach(int b in B)
        {
            int a = LowerBound(A, b);
            int c = N - UpperBound(C, b);
            ret += ((long)a * (long)c);
        }
        Write(ret);
    }

    public static int LowerBound(int[] arr, int value)
    {
        int low = 0;
        int high = arr.Length;
        int mid;
        while (low < high)
        {
            // 1つ右シフトすることで、半分にする
            mid = ((high - low) >> 1) + low;
            if (arr[mid] < value)
            {
                low = mid + 1;
            }
            else
            {
                high = mid;
            }
        }
        return low;
    }
    public static int UpperBound(int[] arr, int value)
    {
        int low = 0;
        int high = arr.Length;
        int mid;
        while (low < high)
        {
            // 1つ右シフトすることで、半分にする
            mid = ((high - low) >> 1) + low;
            if (arr[mid] <= value)
            {
                low = mid + 1;
            }
            else
            {
                high = mid;
            }
        }
        return low;
    }

    void Write(string v)
    {
        Console.WriteLine(v);
    }

    void Write(int v)
    {
        Console.WriteLine(v);
    }

    void Write(double v)
    {
        Console.WriteLine(v);
    }
    void Write(long v)
    {
        Console.WriteLine(v);
    }

    int Pow(int x, int y)
    {
        return (int)Math.Pow(double.Parse(x.ToString()), double.Parse(y.ToString()));
    }

    double Pow(double x, double y)
    {
        return Math.Pow(x, y);
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }
    public class UnionFind
    {
        private int[] _par;
        private int[] _rank;

        public UnionFind(int size)
        {
            _par = new int[size + 1];
            _rank = new int[size + 1];
            for (int i = 0; i < _par.Length; i++)
            {
                _par[i] = i;
            }
        }

        public int Root(int x)
        {
            if (_par[x] == x)
                return x;
            else
            {
                _par[x] = Root(_par[x]);
                return _par[x];
            }
        }

        public bool IsSame(int x, int y)
        {
            return Root(x) == Root(y);
        }

        public void Unite(int x, int y)
        {
            x = Root(x);
            y = Root(y);
            if (x == y) return;

            if (_rank[x] < _rank[y])
            {
                _par[x] = y;
            }
            else
            {
                _par[y] = x;
                if (_rank[x] == _rank[y])
                {
                    _rank[x]++;
                }
            }
        }
    }
}

Measured memory_bytes: 41300