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

C. Foe Pairs

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given a permutation *p* of length *n*. Also you are given *m* foe pairs (*a*_{i}, *b*_{i}) (1 ≤ *a*_{i}, *b*_{i} ≤ *n*, *a*_{i} ≠ *b*_{i}).

Your task is to count the number of different intervals (*x*, *y*) (1 ≤ *x* ≤ *y* ≤ *n*) that do not contain any foe pairs. So you shouldn't count intervals (*x*, *y*) that contain at least one foe pair in it (the positions and order of the values from the foe pair are not important).

Consider some example: *p* = [1, 3, 2, 4] and foe pairs are {(3, 2), (4, 2)}. The interval (1, 3) is incorrect because it contains a foe pair (3, 2). The interval (1, 4) is also incorrect because it contains two foe pairs (3, 2) and (4, 2). But the interval (1, 2) is correct because it doesn't contain any foe pair.

Input

The first line contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 3·10^{5}) — the length of the permutation *p* and the number of foe pairs.

The second line contains *n* distinct integers *p*_{i} (1 ≤ *p*_{i} ≤ *n*) — the elements of the permutation *p*.

Each of the next *m* lines contains two integers (*a*_{i}, *b*_{i}) (1 ≤ *a*_{i}, *b*_{i} ≤ *n*, *a*_{i} ≠ *b*_{i}) — the *i*-th foe pair. Note a foe pair can appear multiple times in the given list.

Output

Print the only integer *c* — the number of different intervals (*x*, *y*) that does not contain any foe pairs.

Note that the answer can be too large, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type.

Examples

Input

4 2

1 3 2 4

3 2

2 4

Output

5

Input

9 5

9 7 2 3 1 4 6 5 8

1 6

4 5

2 7

7 2

2 7

Output

20

Note

In the first example the intervals from the answer are (1, 1), (1, 2), (2, 2), (3, 3) and (4, 4).

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/28/2020 05:31:59 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|