#include <bits/stdc++.h>
using namespace std;
int p[100];
queue<int> q;
int main() {
  ios::sync_with_stdio(false);
  int n, m, k, t;
  cin >> n >> m >> k;
  for (int i = 0; i < k; ++i) cin >> p[i];
  for (int i = 0; i < m * n; ++i) {
    cin >> t;
    q.push(t);
  }
  int an = 0;
  for (int i = 0; i < m * n; ++i) {
    for (int j = 0; j < k; ++j) {
      if (p[j] == q.front())
        for (int h = j; h > 0; --h) {
          swap(p[h], p[h - 1]);
          an++;
        }
    }
    an++;
    q.pop();
  }
  cout << an;
  return 0;
}
