using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;

namespace AtCoderWorkspace
{
    public class Solver
    {
        public void Solve()
        {
            var cin = new Scanner();
            var n = cin.nextInt();
            var a = cin.ArrayLong(n);
            var b = cin.ArrayLong(n);
            var c = cin.ArrayLong(n);
            Array.Sort(a);
            Array.Sort(b);
            Array.Sort(c);

            var ans = 0L;
            for (int i = 0; i < n; i++)
            {
                var bv = b[i];
                var ab = new BinarySearch<long>(a, mid => bv <= mid);
                var bc = new BinarySearch<long>(c, mid => bv < mid);
                var ai = ab.Search();
                var ci = bc.Search();

                ans += (long)(ai) * (long)(n - ci);
            }

            Console.WriteLine(ans);
        }
    }

    class BinarySearch<T>
    {
        T[] a;
        Func<T, bool> isOK;

        /// <param name="a">探索する配列</param>
        /// <param name="isOK">midの判定</param>
        public BinarySearch(T[] a, Func<T, bool> isOK)
        {
            this.a = a;
            this.isOK = isOK;
        }

        public int Search()
        {
            int ng = -1;
            int ok = a.Length;

            while (Math.Abs(ok - ng) > 1)
            {
                int mid = (ok + ng) / 2;

                if (isOK(a[mid])) ok = mid;
                else ng = mid;
            }
            return ok;
        }
    }

    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 int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            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 long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            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;
        }
    }

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 42476