Want to try solving this problem? You can submit your code online if you log in or register.

A new art installation has appeared in the streets of your local mall. It's a long walkway of *n* tiles, numbered 1 to *n* from left to right. Each tile is coloured one of *c* possible colours, numbered from 1 to *c*. The *i*-th tile has colour *x*_{i}.

You start on the leftmost tile and must get to the rightmost tile. You may only move by making jumps to the right. Using your powerful legs, you can skip any positive number of tiles with each jump.

Things are not so simple, however. The artist insists that you may only jump from one coloured tile to another colour if the colours are *compatible*! You have a list of *p* pairs of compatible colours (a colour may or may not be compatible with itself). The *j*-th such pair states that colours *a*_{j} and *b*_{j} are compatible.

The colours are very pretty and this compels you to count the number of ways you can get from the leftmost tile to the rightmost one by jumping. Two ways are considered different if there is a tile you land on in one way, but not the other. Since the answer can be quite big, give the answer modulo 1,000,000,007.

As this number may be large, you may wish to use 64-bit integer types (such as `long long`

in C/++) in your program.

For all subtasks:

2 ≤

*n*≤ 100,0001 ≤

*c*≤ 100,0001 ≤

*x*_{i}≤*c*, for all*i*0 ≤

*p*≤ 100,0001 ≤

*a*_{j},*b*_{j}≤*c*for all*j*(Note that it is possible that*a*_{j}=*b*_{j})(

*a*_{i},*b*_{i})≠(*a*_{j},*b*_{j}) and (*a*_{i},*b*_{i})≠(*b*_{j},*a*_{j}) for any*i*≠*j*. That is, no compatible pair of colours will appear twice.

Furthermore:

For Subtask 1 (4 points):

*c*= 1For Subtask 2 (22 points):

*c*≤ 100.For Subtask 3 (15 points):

*x*_{i}=*i*, for all*i*.For Subtask 4 (26 points):

*p*=*c*- 1,*a*_{j}=*j*and*b*_{j}>*j*for all*j*.For Subtask 5 (33 points): No further constraints apply.

The first line of input will contain the two integers *n*, *c*. The second line will contain the *n* integers *x*_{1}, *x*_{2}, ..., *x*_{n}.

The third line contains the single integer *p*. Then, *p* lines follow, describing the pairs of compatible colours. The *j*-th such pair states that colours *a*_{j} and *b*_{j} are compatible.

Output a single integer, the total number of ways of getting from the leftmost tile to the rightmost tile, modulo 1,000,000,007.

```
5 3
1 2 3 2 3
3
1 2
1 3
2 3
```

`5`

```
4 4
1 2 3 4
2
1 2
2 3
```

`0`

```
6 2
1 1 1 2 2 1
3
1 1
2 1
2 2
```

`16`

In the first sample case, there are 5 ways, which are listed below by the tile numbers they land on:

1 → 2 → 3 → 4 → 5

1 → 2 → 5

1 → 4 → 5

1 → 3 → 4 → 5

1 → 5

In the second sample case, it is not possible to reach the rightmost tile, no matter how you jump! Hence the answer is 0.

In the third sample case, every colour is compatible with every other colour (including themselves), so any jump is allowed. There are 16 ways.

Privacy
statement

© Australian Mathematics Trust 2001-2019

Page generated: 19 August 2019, 12:15pm AEST