import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.format;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void minAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) min(dst, src);
}

void maxAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) max(dst, src);
}

enum MOD = (10 ^^ 9) + 7;

void main()
{
    long N = lread();
    auto A = aryread();
    auto B = aryread();
    auto C = aryread();
    A.sort();
    B.sort();
    C.sort();
    // writeln(A);
    // writeln(B);
    // writeln(C);
    long ans;
    auto Bs = new long[](N);
    foreach (i, a; A)
        Bs[i] = bsearch(B, a);
    auto Cs = new long[](N);
    foreach (i, b; B)
        Cs[i] = bsearch(C, b);
    long[] sum = new long[](N + 1);
    foreach (i; 0 .. N)
        sum[i + 1] = sum[i] + (N - (Cs[i] + 1));

    foreach (i; 0 .. N)
    {
        auto bb = Bs[i];
        ans += sum[$ - 1] - sum[bb + 1];
    }
    writeln(ans);
}

long bsearch(const long[] V, long x)
{
    if (x < V[0])
    {
        return -1;
    }
    long gt = V.length;
    long lt = 0;
    while (1 < gt - lt)
    {
        long m = lt + (gt - lt) / 2;
        if (V[m] <= x)
        {
            lt = m;
        }
        else
        {
            gt = m;
        }
    }
    return lt;
}
