// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}
// modint
#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m,a[maxn];

pii t1[maxn],t2[maxn],tx[maxn],ty[maxn];
int len1,len2;
bool vis[maxn];

void brute()
{
	For(_,1,m){
		int x=read(),y=read();
		len1=len2=0;
		For(i,1,n){
			if(a[i]<=x)t1[++len1]=mkp(x-a[i],i);
			else t2[++len2]=mkp(a[i]-x,i);
		}
		reverse(t1+1,t1+len1+1);
		merge(t1+1,t1+len1+1,t2+1,t2+len2+1,tx+1);
		len1=len2=0;
		swap(x,y);
		For(i,1,n){
			if(a[i]<=x)t1[++len1]=mkp(x-a[i],i);
			else t2[++len2]=mkp(a[i]-x,i);
		}
		reverse(t1+1,t1+len1+1);
		merge(t1+1,t1+len1+1,t2+1,t2+len2+1,ty+1);
		swap(x,y);
		modint res=0;
		int p1=1,p2=1;
	//	For(i,1,n)cout<<tx[i].se<<" "<<tx[i].fi<<endl;puts("");
		For(i,1,n){
			if(i&1){
				while(vis[tx[p1].se])++p1;
				vis[tx[p1].se]=1,res+=a[tx[p1].se];
	//			cout<<"add "<<p1<<" "<<a[tx[p1].se]<<endl;
			}else{
				while(vis[ty[p2].se])++p2;
				vis[ty[p2].se]=1;
			}
		}
		printf("%d\n",res.x);
		For(i,1,n)vis[i]=0;
	}
}

signed main()
{
	//freopen("card.in","r",stdin);
	//freopen("card.out","w",stdout);
	n=read(),m=read();
	For(i,1,n)a[i]=read();
	if(n<=5000)brute();
	
	return 0;
}