#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

ll fac[MAX_N], inv[MAX_N], fiv[MAX_N]; //fiv:inv(fac(i))

ll mod_pow(ll a, ll n) {
	if(n == 0) return 1;
	ll res = mod_pow(a, n / 2);
	if(n % 2 == 0) return res * res % mod;
	else return a * res % mod * res % mod;
}

ll invf(ll a) {
	return mod_pow(a, mod - 2);
}

void C_init(int n) {
	fac[0] = fac[1] = 1; inv[1] = 1;
	fiv[0] = fiv[1] = 1;
	rep(i, 2, n + 1) {
		fac[i] = fac[i - 1] * i % mod;
		inv[i] = mod - inv[mod % i] * (mod / i) % mod;
		fiv[i] = fiv[i - 1] * inv[i] % mod;
	}
}

ll C(int a, int b) { //assume a >= b
	if(a < b || a < 0 || b < 0) return 0;
	return fac[a] * fiv[b] % mod * fiv[a - b] % mod;
}



int N, Q;
ll dp[3010][3010];
int X[3010], Y[3010];
int A[3010];



void solve() {
	cin >> N >> Q;
	rep(i, 0, N) cin >> A[i];
	rep(i, 0, Q) {
		cin >> X[i] >> Y[i];
		X[i]--; Y[i]--;
	}
	rep(i, 0, N) {
		rep(j, i + 1, N) {
			dp[i][j] = 1;
		}
	}
	ll div2 = invf(2);
	rer(k, Q, 0) {
		int x = X[k], y = Y[k];
		rep(i, 0, N) {
			if(i == x || i == y) continue;
			MUL(dp[i][x], div2);
			MUL(dp[i][y], div2);
			ll vx = dp[i][x];
			ll vy = dp[i][y];
			dp[i][x] = (vx + vy) % mod;
			dp[i][y] = (vx + vy) % mod;
		}
		rep(j, 0, N) {
			if(j == x || j == y) continue;
			MUL(dp[x][j], div2);
			MUL(dp[y][j], div2);
			ll vx = dp[x][j];
			ll vy = dp[y][j];
			dp[x][j] = (vx + vy) % mod;
			dp[y][j] = (vx + vy) % mod;
		}
		MUL(dp[x][y], div2);
		MUL(dp[y][x], div2);
		ll v1 = dp[x][y];
		ll v2 = dp[y][x];
		dp[x][y] = (v1 + v2) % mod;
		dp[y][x] = (v1 + v2) % mod;
		// rep(i, 0, N) {
		// 	debug(k, vl(dp[i], dp[i] + N));
		// }
	}
	ll res = 0;
	rep(i, 0, N) {
		rep(j, i + 1, N) {
			ll v = dp[i][j];
			ll pv = (1 - dp[i][j] + mod) % mod;
			if(A[i] > A[j]) ADD(res, v);
			else if(A[i] < A[j]) ADD(res, pv);
		}
	}
	cout << (res * mod_pow(2, Q)) % mod << "\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 71936