abc077_c.cc

// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, int(n) + 1)
#define RREP(i, n) RFOR(i, 0, n)
#define RREP1(i, n) RFOR(i, 1, int(n) + 1)
#define ALL(c) begin(c), end(c)

int _ = (
#ifndef LOCAL
    std::cin.tie(nullptr), std::ios::sync_with_stdio(false),
#endif
    std::cout.precision(10), std::cout.setf(std::ios::fixed));

using ll = long long;
using ld = long double;
template <typename T> using vec = std::vector<T>;
using pii = std::pair<int, int>;
using namespace std;

int main() {
  int N;
  cin >> N;
  vec<ll> A(N), B(N), C(N);
  REP(i, N) { cin >> A[i]; }
  REP(i, N) { cin >> B[i]; }
  REP(i, N) { cin >> C[i]; }
  sort(ALL(A));
  sort(ALL(C));

  ll answer = 0;
  REP(i, N) {
    const auto ai = upper_bound(ALL(A), B[i] - 1);
    const auto al = distance(A.begin(), ai);
    const auto ci = lower_bound(ALL(C), B[i] + 1);
    const auto cl = distance(ci, C.end());
    answer += (al * cl);
  }
  cout << answer << endl;
  return 0;
}