B"The new academic year has started, and Berland's university has n first-year students. They are divided into k academic groups, however, some of the groups might be empty. Among the students, there are m pairs of acquaintances, and each acquaintance pair might be both in a common group or be in two different groups. Alice is the curator of the first years, she wants to host an entertaining game to make everyone know each other. To do that, she will select two different academic groups and then divide the students of those groups into two teams. The game requires that there are no acquaintance pairs inside each of the teams. Alice wonders how many pairs of groups she can select, such that it'll be possible to play a game after that. All students of the two selected groups must take part in the game. Please note, that the teams Alice will form for the game don't need to coincide with groups the students learn in. Moreover, teams may have different sizes (or even be empty). The first line contains three integers n , m and k ( 1 <= n <= 500 ,000 ; 0 <= m <= 500 ,000 ; 2 <= k <= 500 ,000 ) -- the number of students, the number of pairs of acquaintances and the number of groups respectively. The second line contains n integers c_1, c_2, ... , c_n ( 1 <= c_i <= k ), where c_i equals to the group number of the i -th student. Next m lines follow. The i -th of them contains two integers a_i and b_i ( 1 <= a_i, b_i <= n ), denoting that students a_i and b_i are acquaintances. It's guaranteed, that a_i neq b_i , and that no (unordered) pair is mentioned more than once. Print a single integer -- the number of ways to choose two different groups such that it's possible to select two teams to play the game. The acquaintances graph for the first example is shown in the picture below (next to each student there is their group number writte"...