#![allow(non_snake_case)]
#![allow(dead_code)]
#![allow(unused_macros)]
#![allow(unused_imports)]

use std::str::FromStr;
use std::io::*;
use std::collections::*;
use std::cmp::*;

struct Scanner<I: Iterator<Item = char>> {
    iter: std::iter::Peekable<I>,
}

macro_rules! exit {
    () => {{
        exit!(0)
    }};
    ($code:expr) => {{
        if cfg!(local) {
            writeln!(std::io::stderr(), "===== Terminated =====")
                .expect("failed printing to stderr");
        }
        std::process::exit($code);
    }}
}

impl<I: Iterator<Item = char>> Scanner<I> {
    pub fn new(iter: I) -> Scanner<I> {
        Scanner {
            iter: iter.peekable(),
        }
    }

    pub fn safe_get_token(&mut self) -> Option<String> {
        let token = self.iter
            .by_ref()
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect::<String>();
        if token.is_empty() {
            None
        } else {
            Some(token)
        }
    }

    pub fn token(&mut self) -> String {
        self.safe_get_token().unwrap_or_else(|| exit!())
    }

    pub fn get<T: FromStr>(&mut self) -> T {
        self.token().parse::<T>().unwrap_or_else(|_| exit!())
    }

    pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> {
        (0..len).map(|_| self.get()).collect()
    }

    pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> {
        (0..row).map(|_| self.vec(col)).collect()
    }

    pub fn char(&mut self) -> char {
        self.iter.next().unwrap_or_else(|| exit!())
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.get::<String>().chars().collect()
    }

    pub fn line(&mut self) -> String {
        if self.peek().is_some() {
            self.iter
                .by_ref()
                .take_while(|&c| !(c == '\n' || c == '\r'))
                .collect::<String>()
        } else {
            exit!();
        }
    }

    pub fn peek(&mut self) -> Option<&char> {
        self.iter.peek()
    }
}

trait Joinable {
    fn join(self, sep: &str) -> String;
}

impl<U: ToString, T: Iterator<Item = U>> Joinable for T {
    fn join(self, sep: &str) -> String {
        self.map(|x| x.to_string()).collect::<Vec<_>>().join(sep)
    }
}

fn binary_search<F>(mut ok: i64, mut ng: i64, pred: F) -> i64
where
    F: Fn(usize) -> bool
{
    while (ok - ng).abs() > 1 {
        let mid = (ok + ng) / 2;
        if pred(mid as usize) {
            ok = mid;
        } else {
            ng = mid;
        }
    }
    ok
}

fn upper_bound<T: Ord>(v: &Vec<T>, x: T) -> i64 {
    binary_search(v.len() as i64 - 1, -1 as i64, |i| {
        x < v[i]
    })
}

fn main() {
    let cin = stdin();
    let cin = cin.lock();
    let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char));
    let N: usize = sc.get();
    let mut A: Vec<usize> = sc.vec(N);
    let mut B: Vec<usize> = sc.vec(N);
    let mut C: Vec<usize> = sc.vec(N);
    A.sort();
    B.sort();
    C.sort();
    let mut cnt_a = vec![0; N];
    for i in 0..N {
        let j = binary_search(-1, N as i64, |k| {
            A[k] < B[i]
        }) as usize;
        cnt_a[i] = j + 1;
    }
    let mut cnt_b = vec![0; N];
    for i in 0..N {
        let j = binary_search(N as i64, -1, |k| {
            C[k] > B[i]
        }) as usize;
        cnt_b[i] = N - j;
    }
    let mut ans = 0;
    for i in 0..N {
        ans += cnt_a[i] * cnt_b[i];
    }
    println!("{}", ans);
}


Measured memory_bytes: 10492