#include <bits/stdc++.h>

const int N = 3005, mod = 1000000007, i2 = mod + 1 >> 1;
typedef long long LL;

int n, q, dp[N][N], tmp[N][N], x, y, A[N];

void copy(int x, int y) { tmp[x][y] = dp[x][y]; }
void update(int X, int Y) {
	int tx = X, ty = Y;
	if (tx == x) tx = y; else if (tx == y) tx = x;
	if (ty == x) ty = y; else if (ty == y) ty = x;
	dp[X][Y] = (LL) i2 * (tmp[X][Y] + tmp[tx][ty]) % mod;
}

int main() {
	std::ios::sync_with_stdio(0), std::cin.tie(0);
	std::cin >> n >> q;
	for (int i = 1; i <= n; ++i) std::cin >> A[i];
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			dp[i][j] = A[i] > A[j];
	for (int i = 1; i <= q; ++i) {
		std::cin >> x >> y;
		for (int j = 1; j <= n; ++j)
			copy(x, j), copy(j, x), copy(y, j), copy(j, y);
		for (int j = 1; j <= n; ++j)
			update(x, j), update(j, x), update(y, j), update(j, y);
	}
	int ans = 0;
	for (int i = 1; i <= n; ++i)
		for (int j = i + 1; j <= n; ++j)
			ans += dp[i][j] - mod, ans += ans >> 31 & mod;
	for (int i = 1; i <= q; ++i)
		ans += ans - mod, ans += ans >> 31 & mod;
	std::cout << ans << '\n';
	return 0;
}