#include <bits/stdc++.h>

using namespace std;
using i64 = int_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pdi = pair<double, int>;
template <class T> using mat = vector<vector<T>>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;

#define each(i,v) for (auto i = begin(v); i != end(v); ++i)
#define reach(i,v) for (auto i = rbegin(v); i != rend(v); ++i)
#define urep(i,s,t) for (int i = (s); i <= (t); ++i)
#define drep(i,s,t) for (int i = (s); i >= (t); --i)
#define rep(i,n) urep(i, 0, (n)-1)
#define rep1(i,n) urep(i, 1, (n))
#define rrep(i,n) drep(i, (n)-1, 0)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define front fro
#define back bac
#define vct vector
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount

struct setupper {
    setupper(uint_fast8_t prec) {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(prec);
#ifdef Local
        auto print_atexit = []() { cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n"; };
        atexit(print_atexit);
#endif
    }
} setuppre_obj(10);

namespace std {
    template <class T> void hash_combine(size_t &seed, T const &key) {
        seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    }
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &pr) const
        {
            size_t seed = 0;
            hash_combine(seed,pr.first);
            hash_combine(seed,pr.second);
            return seed;
        }
    };
    template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
        static void apply(size_t& seed, Tup const& tup) {
            hashval_calc<Tup, index - 1>::apply(seed, tup);
            hash_combine(seed,get<index>(tup));
        }
    };
    template <class Tup> struct hashval_calc<Tup,0> {
        static void apply(size_t& seed, Tup const& tup) {
            hash_combine(seed,get<0>(tup));
        }
    };
    template <class ...T> struct hash<tuple<T...>> {
        size_t operator()(tuple<T...> const& tup) const
        {
            size_t seed = 0;
            hashval_calc<tuple<T...>>::apply(seed,tup);
            return seed;
        }
    };
}

template <class T, class U> ostream& operator << (ostream& s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream& s, vct<T> v) { each(i,v) { if(i != begin(v)) s << " "; s << *i; } return s; }
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\
dump_func(__VA_ARGS__)
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)
const auto add = [](auto &x, auto y) { x += y; };
const auto mul = [](auto &x, auto y) { x *= y; };
const auto lam_min = [](auto x, auto y) { return min(x, y); };
const auto lam_max = [](auto x, auto y) { return max(x, y); };
const auto chmax = [](auto &m, auto x) { if(m < x){ m = x; return true; } return false; };
const auto chmin = [](auto &m, auto x) { if(m > x){ m = x; return true; } return false; };
bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(uint64_t x, uint64_t b = 2) { return x ? 1 + ilog(x / b,b) : -1; }
template <class F> i64 binsr(i64 ok, i64 ng, const F &fn) {
    while (abs(ok - ng) > 1) {
        i64 mid = (ok + ng) / 2;
        (fn(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array,(T*)(array + N),val); }
template <class T> T cmprs(T &v) {
    T tmp = v, ret = v;
    sort(all(tmp));
    tmp.erase(unique(all(tmp)), end(tmp));
    each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp);
    return ret;
}

template <class T> constexpr T inf = numeric_limits<T>::max() / 2 - 1;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double gold = 1.618033988;
constexpr long double eps = 1e-15;
constexpr uint_fast64_t mod = 1e9 + 7;

int n,Q;
i64 up[1<<12][1<<12],dw[1<<12][1<<12];
int last[1<<12][1<<12];
i64 two[1<<12];

void upd(int i,int j,int t) {
    assert(i<j);
    if(t==last[i][j]) return;
    assert(t>last[i][j]);
    up[i][j]=up[i][j]*two[t-1-last[i][j]]%mod;
    dw[i][j]=dw[i][j]*two[t-1-last[i][j]]%mod;
    last[i][j]=t;
    return;
}

int main() {
    cin>>n>>Q;
    int a[1<<12];
    for(int i=0; i<n; i++) cin>>a[i];
    for(int i=0; i<n; i++) {
        for(int j=0; j<i; j++) {
            if(a[i]>a[j]) up[j][i]++;
            if(a[j]>a[i]) dw[j][i]++;
            last[j][i]=-1;
        }
    }

    two[0]=1;
    for(int i=0; i<Q; i++) two[i+1]=two[i]*2%mod;

    for(int i=0; i<Q; i++) {
        //u_map<pii,int> up_nx,dw_nx;
        stack<pair<pii,int>> up_nx,dw_nx;
        int x,y;
        cin>>x>>y;
        if(--x > --y) swap(x,y);

        for(int j=0; j<x; j++) {
            upd(j,y,i);
            upd(j,x,i);
            dw_nx.emp(mkp(j,y),dw[j][x]);
            up_nx.emp(mkp(j,y),up[j][x]);
            dw_nx.emp(mkp(j,x),dw[j][y]);
            up_nx.emp(mkp(j,x),up[j][y]);
        }
        for(int j=y+1; j<n; j++) {
            upd(x,j,i);
            upd(y,j,i);
            dw_nx.emp(mkp(y,j),dw[x][j]);
            up_nx.emp(mkp(y,j),up[x][j]);
            dw_nx.emp(mkp(x,j),dw[y][j]);
            up_nx.emp(mkp(x,j),up[y][j]);
        }
        for(int j=x+1; j<y; j++) {
            upd(j,y,i);
            upd(x,j,i);
            dw_nx.emp(mkp(j,y),up[x][j]);
            up_nx.emp(mkp(j,y),dw[x][j]);
            dw_nx.emp(mkp(x,j),up[j][y]);
            up_nx.emp(mkp(x,j),dw[j][y]);
        }
        {
            upd(x,y,i);
            up_nx.emp(mkp(x,y),dw[x][y]);
            dw_nx.emp(mkp(x,y),up[x][y]);
        }
        while(!up_nx.empty()) {
            auto p=up_nx.top();
            up_nx.pop();
            (up[p.fir.fir][p.fir.sec]+=p.sec)%=mod;
        }
        while(!dw_nx.empty()) {
            auto p=dw_nx.top();
            dw_nx.pop();
            (dw[p.fir.fir][p.fir.sec]+=p.sec)%=mod;
        }
    }

    int ans=0;
    for(int i=0; i<n; i++) {
        for(int j=0; j<i; j++) {
            upd(j,i,Q);
            ans=(ans+dw[j][i])%mod;
        }
    }
    cout<<ans<<endl;
}


Measured memory_bytes: 242208