#include <bits/stdc++.h>
#include <omp.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;


#define int ll
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());


typedef pair<int, int> pii;
typedef pair<string, string> pst;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef pair<pld, pld> pldd;
typedef vector<pld> vpd;
typedef complex<double> base;


#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define my_abs(a) (((a) >= 0) ? (a) : -(a))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define MODIK(a) (a >= M ? a - M : a)
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef ART_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif


const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

istream &operator >> (istream &in, pii &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pii &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


istream &operator >> (istream &in, pld &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pld &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) <<
               ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void print(int a, int b, int n, vi h)
{
    ofstream cout("output.txt");
    cout << SZ(h) << ' ' << a << ' ' << b << '\n';
    for (int i = 0; i < SZ(h); ++i) {
        cout << h[i]  << ' ';
    }
    cout.close();
    exit(0);
}


inline bool break_time(ld time)
{
    return clock() > CLOCKS_PER_SEC * time;
}


ld get_rand_ld(ld l, ld r)
{
    uniform_real_distribution<double> gen(l, r);
    return gen(rng);
}


bool may(int E, ld T)
{
    if (E < 0)
        return 1;

    double eps = get_rand_ld(0, 1);
    return eps < exp(-E / T);
}


void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef ART_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(0) << fixed;
    smain();
#ifdef ART_HOME
    cout << "\nTOTAL EXECUTIOn TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}


const int N = 3e3 + 10, K = 1e2 + 10, B = 1000, oo = 1e18, M = 1e9 + 7, LOG = 20;
const int M1 = 1000000093, x1 = 27162;
const int M2 = 1000000087, x2 = 241;
const ld pi = atan2(1, 0) * 2, EPS = 1e-9;


int dp[N][N], used[N], pw[N];
vpi flex;

void inc(int a, int b, int v)
{
    flex.push_back(mp(a * N + b, v));
}


int MOD(int v)
{
    v %= M;
    if (v < 0)
        v += M;

    return v;
}


void smain() {
    pw[0] = 1;
    for (int i = 1; i < N; ++i)
        pw[i] = MOD(pw[i - 1] * 2);

    int n, q;
    cin >> n >> q;

    vi kek(n);
    for (int i = 0; i < n; ++i)
        cin >> kek[i];

    for (int i = 0; i < n; ++i)
        for (int j = i + 1; j < n; ++j)
        {
            if (kek[i] < kek[j])
                dp[i][j] = 1;
            else if (kek[i] > kek[j])
                dp[j][i] = 1;
        }

    fill(used, used + N, -1);


    for (int i = 0; i < q; ++i)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;
        flex.clear();

        for (int j = 0; j < n; ++j)
        {
            if (j == a || j == b)
                continue;

            dp[a][j] = MOD(dp[a][j] * pw[i - max(used[a], used[j]) - 1]);
            dp[b][j] = MOD(dp[b][j] * pw[i - max(used[b], used[j]) - 1]);
            dp[j][a] = MOD(dp[j][a] * pw[i - max(used[a], used[j]) - 1]);
            dp[j][b] = MOD(dp[j][b] * pw[i - max(used[b], used[j]) - 1]);
        }

        dp[a][b] = MOD(dp[a][b] * pw[i - max(used[a], used[b]) - 1]);
        dp[b][a] = MOD(dp[b][a] * pw[i - max(used[a], used[b]) - 1]);
        used[a] = used[b] = i;


        for (int j = 0; j < n; ++j)
        {
            if (j == a || j == b)
                continue;

            inc(a, j, dp[b][j]);
            inc(b, j, dp[a][j]);
            inc(j, a, dp[j][b]);
            inc(j, b, dp[j][a]);
        }

        inc(a, b, dp[b][a]);
        inc(b, a, dp[a][b]);


        for (auto p : flex)
        {
            int a, b, v;
            tie(a, v) = p;

            b = a % N;
            a /= N;
            dp[a][b] = MOD(dp[a][b] + v);
        }
    }

    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            dp[i][j] = MOD(dp[i][j] * pw[q - max(used[i], used[j]) - 1]);

    int ans = 0;
    for (int i = 0; i < n; ++i)
        for (int j = i + 1; j < n; ++j)
            ans = MOD(ans + dp[j][i]);

    cout << ans;
}


Measured memory_bytes: 71296