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

alias sread = () => readln.chomp();
ulong bignum = 1_000_000_007;
alias Pair = Tuple!(long, "number", long, "times");

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 main()
{
    auto n = lread();
    auto a = aryread();
    auto b = aryread();
    auto c = aryread();
    a.sort();
    b.sort();
    c.sort();
    auto third_cand = new long[](n + 1);
    ulong bbounds, cbounds, alter;
    foreach (i, e; b)
    {
        while (cbounds < n && e >= c[cbounds])
            cbounds++;
        third_cand[i + 1] = third_cand[i] + (n -cbounds);
    }
    foreach (e; a)
    {
        while (bbounds < n && e >= b[bbounds])
            bbounds++;

        if(bbounds >= n)
            break;

        alter += third_cand[$ - 1] - third_cand[bbounds];
    }
    alter.writeln();
}