#include<bits/stdc++.h>
using namespace std;
const int M = 1e7 + 10;
const int INF = 998244353;
typedef long long ll;
ll n , k , a[M] , ans; 

void work(int m) {
	for(int i = 1; i <= n; i ++) {
		if(a[i] + m >= abs(a[i]))
		  ans = (ans + (a[i] + m) * (a[i] + m)) % INF;
		else ans = (ans + (a[i] + 1) * (a[i] + 1)) % INF;
	}
}

int main() {
	scanf("%lld %lld" , &n , &k);
	for(int i = 1; i <= n; i ++) 
		scanf("%lld" , &a[i]);
	for(int i = 1; i <= k; i ++)
	  work(i);
	printf("%lld\n" , ans);
	return 0;
}