#include <bits/stdc++.h>
using namespace std;
const long long MOD=1e9+7;

template<uint_fast64_t Modulus> class modint{
    using u64=uint_fast64_t;
    public:
    u64 a;
    constexpr modint(const u64 x=0) noexcept:a(x%Modulus){}
    constexpr u64 &value() noexcept{return a;}
    constexpr const u64 &value() const noexcept{return a;}
    constexpr modint &operator+=(const modint &rhs) noexcept{
        a+=rhs.a;
        if (a>=Modulus) a-=Modulus;
        return *this;
    }
    constexpr modint operator+(const modint &rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint &operator++() noexcept{
        return ++a,*this;
    }
    constexpr modint operator++(int) noexcept{
        modint t=*this; return ++a,t;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{
        if (a<rhs.a) a+=Modulus;
        a-=rhs.a;
        return *this;
    }
    constexpr modint operator-(const modint &rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint &operator--() noexcept{
        return --a,*this;
    }
    constexpr modint operator--(int) noexcept{
        modint t=*this; return --a,t;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        a=a*rhs.a%Modulus;
        return *this;
    }
    constexpr modint operator*(const modint &rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        u64 exp=Modulus-2;
        while(exp){
            if (exp&1) *this*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return *this;
    }
    constexpr modint operator/(const modint &rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint operator-() const noexcept{
        return modint(Modulus-a);
    }
    constexpr bool operator==(const modint &rhs) const noexcept{
        return a==rhs.a;
    }
    constexpr bool operator!=(const modint &rhs) const noexcept{
        return a!=rhs.a;
    }
    constexpr bool operator!() const noexcept{return !a;}
    friend constexpr modint pow(modint rhs,long long exp) noexcept{
        modint res{1};
        while(exp){
            if (exp&1) res*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept{
        return modint(x)+y;
    }
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept{
        return modint(x)-y;
    }
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept{
        return modint(x)*y;
    }
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept{
        return modint(x)/y;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept{
        return s << rhs.a;
    }
    friend istream &operator>>(istream &s,modint &rhs) noexcept{
        u64 a; rhs=modint{(s >> a,a)}; return s;
    }
};

using mint=modint<MOD>;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,Q; cin >> N >> Q;
    vector<int> A(N);
    for (int i=0;i<N;++i) cin >> A[i];
    vector<vector<mint>> dp(N,vector<mint>(N,0))
                        ,nxt(N,vector<mint>(N));
    for (int i=0;i<N;++i){
        for (int j=0;j<N;++j){
            if (A[i]<A[j]){
                dp[i][j]+=1;
            }
        }
    }
    vector<vector<int>> pre(N,vector<int>(N,0));
    vector<mint> po(Q+1,1);
    auto to=[](int i,int x,int y){
        return i==x?y:(i==y?x:i);
    };
    auto update=[&](int i,int j,int k){
        nxt[j][k]=0; dp[j][k]*=po[i-pre[j][k]];
    };
    auto add=[&](int j,int k,int x,int y){
        int nj=to(j,x,y),nk=to(k,x,y);
        nxt[j][k]+=dp[j][k];
        nxt[nj][nk]+=dp[j][k];
    };
    for (int i=0;i<Q;++i){
        po[i+1]=po[i]*2;
        int X,Y; cin >> X >> Y; --X,--Y;
        vector<int> v={X,Y};
        for (int j=0;j<N;++j){
            if (j==X||j==Y) continue;
            for (int k=0;k<2;++k){
                update(i,j,v[k]);
                update(i,v[k],j);
            }
        }
        for (int j=0;j<2;++j){
            for (int k=0;k<2;++k){
                update(i,v[j],v[k]);
            }
        }
        for (int j=0;j<N;++j){
            if (j==X||j==Y) continue;
            for (int k=0;k<2;++k){
                add(j,v[k],X,Y);
                add(v[k],j,X,Y);
            }
        }
        for (int j=0;j<2;++j){
            for (int k=0;k<2;++k){
                add(v[j],v[k],X,Y);
            }
        }
        for (int j=0;j<N;++j){
            for (int k=0;k<2;++k){
                pre[j][v[k]]=pre[v[k]][j]=i+1;
                dp[j][v[k]]=nxt[j][v[k]];
                dp[v[k]][j]=nxt[v[k]][j];
            }
        }
    }
    mint ans=0;
    for (int i=0;i<N;++i){
        for (int j=0;j<i;++j){
            ans+=dp[i][j]*po[Q-pre[i][j]];
        }
    }
    cout << ans << '\n';
}

Measured memory_bytes: 179768