#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1e9+7;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    cout << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

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';
}

/*
mint dp[20][20][20];

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];
    for (int i=0;i<N;++i){
        for (int j=0;j<N;++j){
            if (A[i]<A[j]){
                dp[0][i][j]+=1;
            }
        }
    }
    auto f=[](int i,int x,int y){
        return (i==x?y:(i==y?x:i));
    };
    for (int i=0;i<Q;++i){
        int X,Y; cin >> X >> Y; --X,--Y;
        for (int j=0;j<N;++j){
            for (int k=0;k<N;++k){
                dp[i+1][j][k]+=dp[i][j][k];
                dp[i+1][f(j,X,Y)][f(k,X,Y)]+=dp[i][j][k];
            }
        }
        mint sum=0;
        for (int j=0;j<N;++j){
            for (int k=0;k<N;++k){
                cerr << dp[i+1][j][k] << (k+1==N?'\n':' ');
                sum+=dp[i+1][j][k];
            }
        }
        debug(i,sum);
        cerr << '\n';
    }
    mint ans=0;
    for (int i=0;i<N;++i){
        for (int j=0;j<i;++j){
            ans+=dp[Q][i][j];
        }
    }
    cout << ans << '\n';
}
*/

Measured memory_bytes: 179824