#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define ll long long
#define ul unsigned long long
#define tomax(a,b) ((a)=max((a),(b)))
#define tomin(a,b) ((a)=min((a),(b)))
#define FOR(i,a,b) for(int i=(a);i<=(int)(b);++i)
#define DOR(i,a,b) for(int i=(a);i>=(int)(b);--i)
#define RCL(a,b,c,d) memset((a),(b),sizeof(c)*(d))
#define EDGE(g,i,x,y) for(int i=(g).h[(x)],y=(g)[(i)].v;~(i);(i)=(g)[(i)].nxt,(y)=(g)[(i)].v)
#define main Main();signed main(){ios::sync_with_stdio(0);cin.tie(0);return Main();}signed Main
using namespace std;
constexpr int N=2e5+10;
namespace Modular {
#define Mod 998244353
	template<class T1,class T2>constexpr auto add(T1 a,T2 b) {
		return a+b>=Mod?a+b-Mod:(a+b<0?a+b+Mod:a+b);
	}
	template<class T1,class T2>constexpr auto mul(T1 a,T2 b) {
		return (1ll*a*b%Mod+Mod)%Mod;
	}
	template<class T,class...Types>constexpr auto add(T a,Types...args) {
		return add(a,add(args...));
	}
	template<class T,class...Types>constexpr auto mul(T a,Types...args) {
		return mul(a,mul(args...));
	}
	template<class T1,class T2>void toadd(T1 &a,T2 b) {
		a=add(a,b);
	}
	template<class T1,class T2>void tomul(T1 &a,T2 b) {
		a=mul(a,b);
	}
	template<class T0,class T,class...Types>void toadd(T0 &a,T b,Types...args) {
		return toadd(a,b),toadd(a,args...);
	}
	template<class T0,class T,class...Types>void tomul(T0 &a,T b,Types...args) {
		return tomul(a,b),tomul(a,args...);
	}
} using namespace Modular;
int n,m;
int a[N];
ul c[N];
vector<ul> num;
random_device rd;
mt19937_64 rng(rd());
struct SEG {
#define ls(p) (tr[p].ls)
#define rs(p) (tr[p].rs)
#define mid ((l+r)>>1)
	int tot;
	int rt[N<<1];
	struct node {
		int ls,rs,sum,prod;
		void down(int Prod) {
			tomul(sum,Prod),tomul(prod,Prod);
		}
	} tr[N<<5];
	int &operator[](int i) {
		return rt[i];
	}
	void Up(int p) {
		tr[p].sum=add(tr[ls(p)].sum,tr[rs(p)].sum);
	}
	void Down(int p) {
		if(tr[p].prod^1) {
			if(ls(p))tr[ls(p)].down(tr[p].prod);
			if(rs(p))tr[rs(p)].down(tr[p].prod);
			tr[p].prod=1;
		}
	}
	void Insert(int &p,int x,int l=1,int r=num.size()) {
		if(!p)tr[p=++tot]= {0,0,0,1};
		if(l==r)return ++tr[p].sum,void();
		Down(p),(x<=mid?Insert(ls(p),x,l,mid):Insert(rs(p),x,mid+1,r)),Up(p);
	}
	int Query(int p,int x,int l=1,int r=num.size()) {
		if(!p)return 0;
		if(l==r)return tr[p].sum;
		return Down(p),(x<=mid?Query(ls(p),x,l,mid):Query(rs(p),x,mid+1,r));
	}
	void Merge(int &p,int q,int fl,int fr,int l=1,int r=num.size()) {
		if(!p||!q)return tr[p|=q].down(q?fl:fr);
		if(l==r)return tr[p].sum=add(mul(tr[p].sum,tr[q].sum),mul(tr[p].sum,fr),mul(fl,tr[q].sum)),void();
		Down(p),Down(q),Merge(ls(p),ls(q),fl,fr,l,mid),Merge(rs(p),rs(q),fl,fr,mid+1,r),Up(p);
	}
#undef ls
#undef rs
#undef mid
} seg;
struct _SEG {
#define ls(p) (tr[p].ls)
#define rs(p) (tr[p].rs)
	int rt,tot;
	struct node {
		int f,id,ls,rs;
	} tr[N<<1];
	node &operator[](int i) {
		return tr[i];
	}
	void Build(int &p,int l=0,int r=n) {
		p=++tot;
		if(r==l+1)return tr[p].id=l,void();
		int mid;
		tr[p].id=-1,cin>>mid,Build(ls(p),l,mid),Build(rs(p),mid,r);
	}
	void dfs(int u) {
		if(~tr[u].id)return seg.Insert(seg[u],a[tr[u].id]),tr[u].f=1,void();
		dfs(ls(u)),dfs(rs(u)),seg.Merge(seg[u]=seg[ls(u)],seg[rs(u)],tr[ls(u)].f,tr[rs(u)].f);
		tr[u].f=add(mul(2,tr[ls(u)].f,tr[rs(u)].f),seg.tr[seg[u]].sum);
	}
#undef ls
#undef rs
} _seg;
signed main() {
	cin>>n>>m,_seg.Build(_seg.rt);
	for(int l,r; m; --m) {
		ul val=rng();
		cin>>l>>r,c[l]^=val,c[r]^=val;
	}
	FOR(i,1,n)c[i]^=c[i-1];
	num=vector<ul> {c,c+n+1},sort(num.begin(),num.end()),num.erase(unique(num.begin(),num.end()),num.end());
	FOR(i,0,n)a[i]=lower_bound(num.begin(),num.end(),c[i])-num.begin()+1;
	_seg.dfs(_seg.rt),cout<<add(_seg[_seg.rt].f,seg.Query(seg[_seg.rt],a[n]))<<endl;
	return 0;
}