#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 1 << 10;

/**
 * Description: $\text{GEN}^{\frac{\text{LEN}}{2}} = \text{mod} - 1$. \\
 * ULL mod = 9223372036737335297, $\text{GEN} = 3^{\frac{\text{mod} - 1}{\text{LEN}}}, \text{LEN} \le 2^{24}$.
 */
const int mod = 998244353;

void updAdd(int& a, int b)
{
	a += b;
	if(a >= mod)
		a -= mod;
}

int add(int a, int b)
{
	return a + b < mod ? a + b : a + b - mod;
}
int sub(int a, int b)
{
	return a - b >= 0 ? a - b : a - b + mod;
}
int mult(int a, int b)
{
	return (LL)a * b % mod;
}
int binpow(int a, int n)
{
	int res = 1;
	while(n)
	{
		if(n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

const int LEN = 1 << 23;
const int GEN = 31;
const int IGEN = binpow(GEN, mod - 2);

VI mult(VI a, int x)
{
	FOR(i, 0, SZ(a))
		a[i] = mult(a[i], x);
	return a;
}
VI add(VI a, VI b)
{
	assert(SZ(a) == SZ(b));
	VI c(SZ(a));
	FOR(i, 0, SZ(a))
		c[i] = add(a[i], b[i]);
	return c;
}
VI sub(VI a, VI b)
{
	assert(SZ(a) == SZ(b));
	VI c(SZ(a));
	FOR(i, 0, SZ(a))
		c[i] = sub(a[i], b[i]);
	return c;
}
VI mult(VI a, VI b)
{
	assert(SZ(a) == SZ(b));
	VI c(SZ(a));
	FOR(i, 0, SZ(a))
		c[i] = mult(a[i], b[i]);
	return c;	
}


template<class T>
void fft(vector<T>& a, bool inv)
{
	int lg = __builtin_ctz(SZ(a));
	FOR(i, 0, SZ(a))
	{
		int k = 0;
		FOR(j, 0, lg)
			k |= ((i >> j) & 1) << (lg - j - 1);
		if(i < k)
			swap(a[i], a[k]);
	}
	for(int len = 2; len <= SZ(a); len *= 2)
	{
		int ml = binpow(inv ? IGEN : GEN, LEN / len);
		for(int i = 0; i < SZ(a); i += len)
		{
			int pw = 1;
			FOR(j, 0, len / 2)
			{
				auto v = a[i + j];
				auto u = mult(a[i + j + len / 2], pw);
				
				a[i + j] = add(v, u);
				a[i + j + len / 2] = sub(v, u);
			
				pw = mult(pw, ml);
			}
		}
	}
	if(inv)
	{
		int m = binpow(SZ(a), mod - 2);
		FOR(i, 0, SZ(a))
			a[i] = mult(a[i], m);
	}
}


VI multFFT(VI a, VI b)
{
	int sz = 0;
	int sum = SZ(a) + SZ(b) - 1;
	while((1 << sz) < sum) sz++;
	a.resize(1 << sz);
	b.resize(1 << sz);
	
	fft(a, false);
	fft(b, false);
	
	FOR(i, 0, SZ(a))
		a[i] = mult(a[i], b[i]);
	
	fft(a, true);
	a.resize(sum);
	return a;
}

vector<VI> mult(vector<VI> a, vector<VI> b)
{
	int szX = 0;
	int sumX = SZ(a) + SZ(b) - 1;
	while((1 << szX) < sumX) szX++;
	a.resize(1 << szX);
	b.resize(1 << szX);
	
	int szY = 0;
	int sumY = SZ(a[0]) + SZ(b[0]) - 1;
	while((1 << szY) < sumY) szY++;
	FOR(i, 0, 1 << szX)
	{
		a[i].resize(1 << szY);
		b[i].resize(1 << szY);
		fft(a[i], false);
		fft(b[i], false);
	}
	
	fft(a, false);
	fft(b, false);
	
	FOR(i, 0, SZ(a))
		a[i] = mult(a[i], b[i]);
	
	fft(a, true);
	a.resize(sumX);
	FOR(i, 0, sumX)
	{
		fft(a[i], true);
		a[i].resize(sumY);
	}
	return a;
}


VI inverse(const VI& a, int k)
{
	assert(SZ(a) == k && a[0] != 0);
	if(k == 1)
		return {binpow(a[0], mod - 2)};  
	
	VI ra = a;
	FOR(i, 0, SZ(ra))
		if(i & 1)
			ra[i] = sub(0, ra[i]);    
	
	int nk = (k + 1) / 2;
	VI t = multFFT(a, ra);
	t.resize(k);
	
	FOR(i, 0, nk)
		t[i] = t[2 * i];
  
	t.resize(nk);
	t = inverse(t, nk);
	t.resize(k);
  
	RFOR(i, nk, 1)
	{
		t[2 * i] = t[i];
		t[i] = 0;
	}
	
	VI res = multFFT(ra, t);
	res.resize(k);
	return res;
}

vector<VI> inverse(const vector<VI>& a, int kx, int ky)
{
	assert(SZ(a) == kx && SZ(a[0]) == ky && a[0][0] != 0);
	if(kx == 1)
		return {inverse(a[0], ky)};  
	
	vector<VI> ra = a;
	FOR(i, 0, SZ(ra))
		if(i & 1)
		{
			FOR(j, 0, ky)
				ra[i][j] = sub(0, ra[i][j]);    
		}
	
	int nk = (kx + 1) / 2;
	vector<VI> t = mult(a, ra);
	t.resize(kx);
	FOR(i, 0, kx)
		t[i].resize(ky);
	
	FOR(i, 0, nk)
		t[i] = t[2 * i];
  
	t.resize(nk);
	t = inverse(t, nk, ky);
	t.resize(kx);
  
	RFOR(i, nk, 1)
	{
		t[2 * i] = t[i];
		t[i] = VI(ky);
	}
	
	vector<VI> res = mult(ra, t);
	res.resize(kx);
	FOR(i, 0, kx)
		res[i].resize(ky);
		
	return res;
}


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

	int n, m;
	cin >> n >> m;
	
	VI d(n);
	FOR(i, 0, n)
		cin >> d[i];
	
	vector<VI> G(N, VI(N));
	FOR(i, 0, n)
	{
		FOR(dx, 0, d[i] + 1)
		{
			int dy = sqrt(d[i] * d[i] - dx * dx);
			
			updAdd(G[dx][0], 1);
			updAdd(G[dx][dy + 1], mod - 1);
		}
	}
	FOR(i, 0, N)
		FOR(j, 1, N)
			updAdd(G[i][j], G[i][j - 1]);
	G[0][0] = 0;
	
	auto D = G;
	FOR(i, 0, N)
		FOR(j, 0, N)
			D[i][j] = sub(0, G[i][j]);
	D[0][0] = 1;
	
		
	auto ways = inverse(D, N, N);	
	cerr << 1.0 * clock() / CLOCKS_PER_SEC << "\n";
	
	vector<PII> pts(m);
	FOR(i, 0, m)
		cin >> pts[i].F >> pts[i].S;
	pts.PB({1000, 1000});
	sort(ALL(pts));
	
	VI dp(m + 1);
	FOR(i, 0, m + 1)
	{
		dp[i] = ways[pts[i].F][pts[i].S];
		FOR(j, 0, i)
		{
			if(pts[j].S <= pts[i].S)
				dp[i] = sub(dp[i], mult(ways[pts[i].F - pts[j].F][pts[i].S - pts[j].S], dp[j]));
		}
	}
	cout << dp.back() << "\n";
	
	


	return 0;
}