You are playing a video game. The game has (n) quests that need to be completed. However, the (j)-th quest can only be completed at the beginning of hour (h_j) of a game day. The game day is (k) hours long. The hours of each game day are numbered (0, 1, \ldots, k - 1). After the first day ends, a new one starts, and so on. Also, there are dependencies between the quests, that is, for some pairs ((a_i, b_i)) the (b_i)-th quest can only be completed after the (a_i)-th quest. It is guaranteed that there are no circular dependencies , as otherwise the game would be unbeatable and nobody would play it. You are skilled enough to complete any number of quests in a negligible amount of time (i. e. you can complete any number of quests at the beginning of the same hour, even if there are dependencies between them). You want to complete all quests as fast as possible. To do this, you can complete the quests in any valid order. The completion time is equal to the difference between the time of completing the last quest and the time of completing the first quest in this order. Find the least amount of time you need to complete the game. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1\le t\le 100\,000)). The description of the test cases follows. The first line of each test case contains three integers (n), (m), and (k) ((1\le n\le 200\,000), (0\le m\le 200\,000), (1\le k\le 10^9)) — the number of quests, the number of dependencies between them, and the number of hours in a game day, respectively. The next line contains (n) integers (h_1, h_2, \ldots, h_n) ((0\le h_i < k)). The next (m) lines describe the dependencies. The (i)-th of these lines contains two integers (a_i) and (b_i) ((1\le a_i < b_i\le n)) meaning that quest (b_i) can only be completed after quest (a_i). It is guaranteed that all dependencies are pairwi