Problem: The Little Elephant loves permutations of integers from 1 to n very much. But most of all he loves sorting them. To sort a permutation, the Little Elephant repeatedly swaps some elements. As a result, he must receive a permutation 1, 2, 3, ..., n.

This time the Little Elephant has permutation p1, p2, ..., pn. Its sorting program needs to make exactly m moves, during the i-th move it swaps elements that are at that moment located at the ai-th and the bi-th positions. But the Little Elephant's sorting program happened to break down and now on every step it can equiprobably either do nothing or swap the required elements.

Now the Little Elephant doesn't even hope that the program will sort the permutation, but he still wonders: if he runs the program and gets some permutation, how much will the result of sorting resemble the sorted one? For that help the Little Elephant find the mathematical expectation of the number of permutation inversions after all moves of the program are completed.

We'll call a pair of integers i, j (1 ≤ i < j ≤ n) an inversion in permutatuon p1, p2, ..., pn, if the following inequality holds: pi > pj.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 1000, n > 1) — the permutation size and the number of moves. The second line contains n distinct integers, not exceeding n — the initial permutation. Next m lines each contain two integers: the i-th line contains integers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi) — the positions of elements that were changed during the i-th move.

Output

In the only line print a single real number — the answer to the problem. The answer will be considered correct if its relative or absolute error does not exceed 10 - 6.

Examples

Input

2 1
1 2
1 2


Output

0.500000000


Input

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


Output

3.000000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int N = 1e3 + 5;
const int mod = 1e9 + 7;
const int MOD = mod - 1;
const double eps = 1e-18;
const double PI = acos(-1.0);
using namespace std;
int p[N];
double f[N][N];
int main() {
  int n, m;
  scanf("%d", &n), scanf("%d", &m);
  for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) f[i][j] = (p[i] > p[j]);
  while (m--) {
    int a, b;
    scanf("%d", &a), scanf("%d", &b);
    for (int i = 1; i <= n; i++) {
      if (i != a && i != b) {
        f[i][a] = f[i][b] = (f[i][a] + f[i][b]) / 2;
        f[a][i] = f[b][i] = (f[a][i] + f[b][i]) / 2;
      }
    }
    f[a][b] = f[b][a] = 0.5;
  }
  double ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++) {
      ans += f[i][j];
    }
  }
  printf("%f\n", ans);
  return 0;
}