#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

const int N = 3e3 + 5;
int a[N];
int dp[N][N];
int x[N], y[N];
const int P = 1e9 + 7;
const int inv2 = (P + 1) / 2;
int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int n, q;
  cin>>n>>q;
  RE (i, n) {
    cin>>a[i];
  }
  RE (i, q) {
    cin>>x[i]>>y[i];
    if (x[i] > y[i]) {
      swap(x[i], y[i]);
    }
  }
//   RE (i, n) {
//     RE (j, i - 1) {
//       dp[i][j] = 0;
//     }
//   }
  FORD (i, q, 1) {
    dp[x[i]][y[i]] = inv2;
    dp[y[i]][x[i]] = inv2;
    VI ziom{x[i], y[i]};
    RE (j, n) {
      if (j == x[i] || j == y[i]) { continue; }
//       for (auto from : ziom) {
//         int to = x[i] + y[i] - from;
        int neguj = (y[i] > j) != (x[i] > j);
//         int sec = dp[j][to];
//         if (neguj) {
//           sec = (P + 1 - dp[j][to]);
//           if (sec >= P) {
//             sec -= P;
//           }
//         }
        int nx = -1;
        int ny = -1;
        if (neguj) {
          nx = (dp[j][x[i]] + 1 - dp[j][y[i]]) * inv2 % P;
          ny = (dp[j][y[i]] + 1 - dp[j][x[i]]) * inv2 % P;
        } else {
          nx = (dp[j][x[i]] + dp[j][y[i]]) * inv2 % P;
          ny = nx;
        }
        dp[j][x[i]] = nx;
        dp[j][y[i]] = ny;
        dp[x[i]][j] = /*P + 1 -*/ nx;
//         if (dp[x[i]][j] >= P) {
//           dp[x[i]][j] -= P;
//         }
        dp[y[i]][j] =/* P + 1 - */ny;
//         if (dp[y[i]][j] >= P) {
//           dp[y[i]][j] -= P;
//         }
    }
  }
  int res = 0;
  RE (i, n) {
    FOR (j, i + 1, n) {
      if (a[i] < a[j]) {
        res += dp[i][j];
      } else if (a[i] > a[j]) {
        res += 1 - dp[i][j];
      }
    }
    res %= P;
    res += P;
    res %= P;
  }
  RE (i, q) {
    res = res * 2 % P;
  }
  cout<<res<<endl;
  return 0;
}


Measured memory_bytes: 70784