Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

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. Coin Troubles

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn the Isle of Guernsey there are *n* different types of coins. For each *i* (1 ≤ *i* ≤ *n*), coin of type *i* is worth *a*_{i} cents. It is possible that *a*_{i} = *a*_{j} for some *i* and *j* (*i* ≠ *j*).

Bessie has some set of these coins totaling *t* cents. She tells Jessie *q* pairs of integers. For each *i* (1 ≤ *i* ≤ *q*), the pair *b*_{i}, *c*_{i} tells Jessie that Bessie has a strictly greater number of coins of type *b*_{i} than coins of type *c*_{i}. It is known that all *b*_{i} are distinct and all *c*_{i} are distinct.

Help Jessie find the number of possible combinations of coins Bessie could have. Two combinations are considered different if there is some *i* (1 ≤ *i* ≤ *n*), such that the number of coins Bessie has of type *i* is different in the two combinations. Since the answer can be very large, output it modulo 1000000007 (10^{9} + 7).

If there are no possible combinations of coins totaling *t* cents that satisfy Bessie's conditions, output 0.

Input

The first line contains three space-separated integers, *n*, *q* and *t* (1 ≤ *n* ≤ 300; 0 ≤ *q* ≤ *n*; 1 ≤ *t* ≤ 10^{5}). The second line contains *n* space separated integers, *a*_{1}, *a*_{2}, ..., *a*_{n} (1 ≤ *a*_{i} ≤ 10^{5}). The next *q* lines each contain two distinct space-separated integers, *b*_{i} and *c*_{i} (1 ≤ *b*_{i}, *c*_{i} ≤ *n*; *b*_{i} ≠ *c*_{i}).

It's guaranteed that all *b*_{i} are distinct and all *c*_{i} are distinct.

Output

A single integer, the number of valid coin combinations that Bessie could have, modulo 1000000007 (10^{9} + 7).

Examples

Input

4 2 17

3 1 2 5

4 2

3 4

Output

3

Input

3 2 6

3 1 1

1 2

2 3

Output

0

Input

3 2 10

1 2 3

1 2

2 1

Output

0

Note

For the first sample, the following 3 combinations give a total of 17 cents and satisfy the given conditions: {0 *of* *type* 1, 1 *of* *type* 2, 3 *of* *type* 3, 2 *of* *type* 4}, {0, 0, 6, 1}, {2, 0, 3, 1}.

No other combinations exist. Note that even though 4 occurs in both *b*_{i} and *c*_{i}, the problem conditions are still satisfied because all *b*_{i} are distinct and all *c*_{i} are distinct.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/17/2020 02:28:54 (e2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|