// 基本テンプレート
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

// ModInt begin

using ll = long long;
template<ll mod>
struct ModInt {
    ll v;
    ll mod_pow(ll x, ll n) const {
        return (!n) ? 1 : (mod_pow((x*x)%mod,n/2) * ((n&1)?x:1)) % mod;
    }
    ModInt(ll a = 0) : v((a %= mod) < 0 ? a + mod : a) {}
    ModInt operator+ ( const ModInt& b ) const {
        return (v + b.v >= mod ? ModInt(v + b.v - mod) : ModInt(v + b.v));
    }
    ModInt operator- () const {
        return ModInt(-v);
    }
    ModInt operator- ( const ModInt& b ) const {
        return (v - b.v < 0 ? ModInt(v - b.v + mod) : ModInt(v - b.v));
    }
    ModInt operator* ( const ModInt& b ) const {return (v * b.v) % mod;}
    ModInt operator/ ( const ModInt& b ) const {return (v * mod_pow(b.v, mod-2)) % mod;}
    
    bool operator== ( const ModInt &b ) const {return v == b.v;}
    bool operator!= ( const ModInt &b ) const {return !(*this == b); }
    ModInt& operator+= ( const ModInt &b ) {
        v += b.v;
        if(v >= mod) v -= mod;
        return *this;
    }
    ModInt& operator-= ( const ModInt &b ) {
        v -= b.v;
        if(v < 0) v += mod;
        return *this;
    }
    ModInt& operator*= ( const ModInt &b ) {
        (v *= b.v) %= mod;
        return *this;
    }
    ModInt& operator/= ( const ModInt &b ) {
        (v *= mod_pow(b.v, mod-2)) %= mod;
        return *this;
    }
    ModInt pow(ll x) { return ModInt(mod_pow(v, x)); }
    // operator int() const { return int(v); }
    // operator long long int() const { return v; }
};

template<ll mod>
ostream& operator<< (ostream& out, ModInt<mod> a) {return out << a.v;}
template<ll mod>
istream& operator>> (istream& in, ModInt<mod>& a) {
    in >> a.v;
    return in;
}

// ModInt end

using mint = ModInt<MOD>;
mint rec[3010][3010];

signed main() {
    int N, Q; cin >> N >> Q;
    vector<int> A(N);
    for(int i=0; i<N; i++) cin >> A[i];
    mint inv = mint(1) / mint(2);
    
    for(int i=0; i<N; i++) {
        for(int j=i+1; j<N; j++) {
            if(A[i] == A[j]) rec[i][j] = inv;
            if(A[i] <  A[j]) rec[i][j] = mint(0);
            if(A[i] >  A[j]) rec[i][j] = mint(1);
        }
    }

    mint mul = mint(2).pow(Q);
    while(Q--) {
        int x, y; cin >> x >> y; x--; y--;

        // x < y にする
        if(x > y) swap(x, y);
        
        map< pair<int, int>, mint > memo;
        
        // (i, x, y) -> (i, y, x)
        // (i, x) -> (i, y), (i, y) -> (i, x) と変える
        for(int i=0; i<x; i++) {
            mint va = rec[i][x], vb = rec[i][y];
            rec[i][x] = (va + vb) * inv;
            rec[i][y] = (va + vb) * inv;
        }
        
        // (x, i, y) -> (y, i, x)
        // (x, i) -> (y, i), (i, y) -> (i, x) と変える
        for(int i=x+1; i<y; i++) {
            mint va = rec[x][i], vb = rec[i][y];
            rec[x][i] = (mint(1) - vb + va) * inv;
            rec[i][y] = (mint(1) - va + vb) * inv;
        }
        
        // (x, y, i) -> (y, x, i)
        // (x, i) -> (y, i), (y, i) -> (x, i) と変える
        for(int i=y+1; i<N; i++) {
            mint va = rec[x][i], vb = rec[y][i];
            rec[x][i] = (va + vb) * inv;
            rec[y][i] = (va + vb) * inv;
        }
        
        // x, y -> y, x
        {
            mint v = rec[x][y];
            rec[x][y] = inv;
        }
    }

    mint ans(0);
    for(int i=0; i<N; i++) {
        for(int j=i+1; j<N; j++) {
            ans += rec[i][j];
        }
    }
    for(int i=0; i<N; i++) {
        for(int j=i+1; j<N; j++) {
            if(A[i] == A[j]) ans -= inv;
        }
    }
    ans *= mul;
    cout << ans << endl;
    return 0;
}


Measured memory_bytes: 71040