import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
//import java.util.Arrays;
import java.util.NoSuchElementException;
//import java.util.PriorityQueue;

public class Main{
	static FastScanner sc = new FastScanner();
	static PrintWriter out = new PrintWriter(System.out);
	//static String S;
	static int n;
	//static int w;
	//static PriorityQueue <Integer> q;
	
	public static void main(String[] args) {
		n = sc.nextInt();
		
		int a [] = sc.nextIntArray(n, false);
		int b [] = sc.nextIntArray(n, false);
		int c [] = sc.nextIntArray(n, false);
		
		Arrays.sort(a);
		Arrays.sort(b);
		Arrays.sort(c);
		
		long b_dp [] = new long [n+1];
		
		long cur = 0;
		int ind = n-1;
		int j = ind;
		
		for (int i=n-1; i>=0; i--) {
			cur = b[i];
			j=ind;
			
			while (j>0) {
				if (cur>=c[j])
					break;
				j--;
			}
			
			int cnt = 0;
			
			if (j==n-1) {
				if (cur<c[j]) {
					ind = n-1;
					cnt = 1;
				}
				else {
					ind = n-1;
					cnt = 0;
				}		
			}
			
			else {
				if (cur<c[j]) {
					ind = j;
					cnt = n-ind;
				}
				else {
					ind = j+1;
					cnt = n-ind;
				}
			}
			
			b_dp[i] = b_dp[i+1] + cnt;
		}
		
		ind = 0;
		long ans = 0;
		
		for (int i=0; i<n; i++) {
			cur = a[i];
			j=ind;
			
			while (j<n) {
				if (cur<b[j])
					break;
				j++;
			}
			
			ind = j;
			ans+=b_dp[ind];
		}
		
		out.println(ans);
		out.flush();
	}
	
		static class FastScanner {
		    private final InputStream in = System.in;
		    private final byte[] buffer = new byte[1024];
		    private int ptr = 0;
		    private int buflen = 0;

		    private boolean hasNextByte() {
		      if (ptr < buflen) {
		        return true;
		      } else {
		        ptr = 0;
		        try {
		          buflen = in.read(buffer);
		        } catch (IOException e) {
		          e.printStackTrace();
		        }
		        if (buflen <= 0) {
		          return false;
		        }
		      }
		      return true;
		    }

		    private int readByte() {
		      if (hasNextByte()) return buffer[ptr++];
		      else return -1;
		    }

		    private static boolean isPrintableChar(int c) {
		      return 33 <= c && c <= 126;
		    }

		    private void skipUnprintable() {
		      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
		    }

		    public boolean hasNext() {
		      skipUnprintable();
		      return hasNextByte();
		    }

		    public String next() {
		      if (!hasNext()) throw new NoSuchElementException();
		      StringBuilder sb = new StringBuilder();
		      int b = readByte();
		      while (isPrintableChar(b)) {
		        sb.appendCodePoint(b);
		        b = readByte();
		      }
		      return sb.toString();
		    }

		    public long nextLong() {
		      if (!hasNext()) throw new NoSuchElementException();
		      long n = 0;
		      boolean minus = false;
		      int b = readByte();
		      if (b == '-') {
		        minus = true;
		        b = readByte();
		      }
		      if (b < '0' || '9' < b) {
		        throw new NumberFormatException();
		      }
		      while (true) {
		        if ('0' <= b && b <= '9') {
		          n *= 10;
		          n += b - '0';
		        } else if (b == -1 || !isPrintableChar(b)) {
		          return minus ? -n : n;
		        } else {
		          throw new NumberFormatException();
		        }
		        b = readByte();
		      }
		    }

		    public int nextInt() {
		      return (int) nextLong();
		    }

		    public int[] nextIntArray(int N, boolean oneBased) {
		      if (oneBased) {
		        int[] array = new int[N + 1];
		        for (int i = 1; i <= N; i++) {
		          array[i] = sc.nextInt();
		        }
		        return array;
		      } else {
		        int[] array = new int[N];
		        for (int i = 0; i < N; i++) {
		          array[i] = sc.nextInt();
		        }
		        return array;
		      }
		    }

		    public long[] nextLongArray(int N, boolean oneBased) {
		      if (oneBased) {
		        long[] array = new long[N + 1];
		        for (int i = 1; i <= N; i++) {
		          array[i] = sc.nextLong();
		        }
		        return array;
		      } else {
		        long[] array = new long[N];
		        for (int i = 0; i < N; i++) {
		          array[i] = sc.nextLong();
		        }
		        return array;
		      }
		    }
		  }

		}	 





Measured memory_bytes: 29796