Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Shopping

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAyush is a cashier at the shopping center. Recently his department has started a ''click and collect" service which allows users to shop online.

The store contains *k* items. *n* customers have already used the above service. Each user paid for *m* items. Let *a*_{ij} denote the *j*-th item in the *i*-th person's order.

Due to the space limitations all the items are arranged in one single row. When Ayush receives the *i*-th order he will find one by one all the items *a*_{ij} (1 ≤ *j* ≤ *m*) in the row. Let *pos*(*x*) denote the position of the item *x* in the row at the moment of its collection. Then Ayush takes time equal to *pos*(*a*_{i1}) + *pos*(*a*_{i2}) + ... + *pos*(*a*_{im}) for the *i*-th customer.

When Ayush accesses the *x*-th element he keeps a new stock in the front of the row and takes away the *x*-th element. Thus the values are updating.

Your task is to calculate the total time it takes for Ayush to process all the orders.

You can assume that the market has endless stock.

Input

The first line contains three integers *n*, *m* and *k* (1 ≤ *n*, *k* ≤ 100, 1 ≤ *m* ≤ *k*) — the number of users, the number of items each user wants to buy and the total number of items at the market.

The next line contains *k* distinct integers *p*_{l} (1 ≤ *p*_{l} ≤ *k*) denoting the initial positions of the items in the store. The items are numbered with integers from 1 to *k*.

Each of the next *n* lines contains *m* distinct integers *a*_{ij} (1 ≤ *a*_{ij} ≤ *k*) — the order of the *i*-th person.

Output

Print the only integer *t* — the total time needed for Ayush to process all the orders.

Example

Input

2 2 5

3 4 1 2 5

1 5

3 1

Output

14

Note

Customer 1 wants the items 1 and 5.

*pos*(1) = 3, so the new positions are: [1, 3, 4, 2, 5].

*pos*(5) = 5, so the new positions are: [5, 1, 3, 4, 2].

Time taken for the first customer is 3 + 5 = 8.

Customer 2 wants the items 3 and 1.

*pos*(3) = 3, so the new positions are: [3, 5, 1, 4, 2].

*pos*(1) = 3, so the new positions are: [1, 3, 5, 4, 2].

Time taken for the second customer is 3 + 3 = 6.

Total time is 8 + 6 = 14.

Formally *pos*(*x*) is the index of *x* in the current row.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/21/2019 09:21:36 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|