Codeforces 665B - Shopping

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>

using namespace std;
typedef deque<int>::iterator iterator_t;

int main()
{
deque<int> que;
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
int tmp;
for (int i = 0; i != k; ++i)
{
scanf("%d", &tmp);
que.push_back(tmp);
}
int tot_time = 0;
int val;
for (int i = 0; i != n; ++i)
{
for (int j = 0; j != m; ++j)
{
scanf("%d", &val);
for (iterator_t it = que.begin(); it != que.end(); ++it)
{
tot_time++;
if (*it == val)
{
//printf("first %d\n", que.size());
que.erase(it);
que.push_front(val);
// for (int i = 0; i < que.size(); ++i)
//{
//  printf("%d ", que[i]);
//}
//puts("");
break;
}
}
}
}
printf("%d\n", tot_time);
return 0;
}