// Problem: D. 子序列
// Contest: undefined - NOIP2024训练赛 03
// URL: http://119.28.3.174/contest/1155/problem/2770
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

// #pragma GCC optmize("OFAST");
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define PII pair<int, int>

using namespace std;

const int N = 2e5 + 10, M = 1e6 + 10, mod = 998244353, INF = 0x3f3f3f3f;

int n, m, q, ans;
int s[N], dp[N];

vector<int> e[N];

struct Tree
{
	int l, r, sum[30] = {};
}tr[N << 2];

inline Tree merge(Tree a, Tree b)
{
	Tree res; res.l = a.l, res.r = b.r;
	for(int i = 0; i < m; i ++)
	{
		res.sum[(i + i) % m] = (res.sum[(i + i) % m] + a.sum[i] * b.sum[i]) % mod;
		for(int j = i + 1; j < m; j ++)
		{
			res.sum[(i + j) % m] = (res.sum[(i + j) % m] + a.sum[i] * b.sum[j]) % mod;
			res.sum[(i + j) % m] = (res.sum[(i + j) % m] + a.sum[j] * b.sum[i]) % mod;
		}
	}
	return res;
}

inline void pushup(int x) {tr[x] = merge(tr[2 * x], tr[2 * x + 1]);}

void build(int x, int l, int r)
{
	tr[x].l = l, tr[x].r = r;
	if(l == r)
	{
		tr[x].sum[s[l] % m] = 1, tr[x].sum[0] += 1;
		return;
	}
	int mid = l + r >> 1;
	build(2 * x, l, mid);
	build(2 * x + 1, mid + 1, r);
	pushup(x);
}

Tree query(int x, int l, int r)
{
	if(tr[x].l >= l && tr[x].r <= r) return tr[x];
	int mid = tr[x].l + tr[x].r >> 1;
	if(l > mid) return query(2 * x + 1, l, r);
	else if(r <= mid) return query(2 * x, l, r);
	else return merge(query(2 * x, l, r), query(2 * x + 1, l, r));
}

signed main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= n; i ++) cin >> s[i];
	build(1, 1, n);
	cin >> q;
	while(q --)
	{
		int l, r; cin >> l >> r;
		cout << query(1, l, r).sum[0] << '\n';
	}	
	return 0;
}