#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 200010;
const int INF = 0x3f3f3f3f;
const int mod = 998244353;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, m, q;
int a[N];

struct SegsTree
{
    #define lc u << 1
    #define rc u << 1 | 1
    struct Node { int l, r, cnt[20]; } tr[N << 2];

    friend Node operator + (const Node &a, const Node &b) 
    {
        Node res = {a.l, b.r, {0}};
        for (int i = 0; i < m; i ++) res.cnt[i] = a.cnt[i];
        for (int i = 0; i < m; i ++) res.cnt[i] = (res.cnt[i] + b.cnt[i]) % mod;
        
        for (int i = 0; i < m; i ++)
            for (int j = 0; j < m; j ++)
                res.cnt[(i + j) % m] = (res.cnt[(i + j) % m] + a.cnt[i] * b.cnt[j] % mod) % mod;
        return res;
    }

    inline void pushup(int u) { tr[u] = tr[lc] + tr[rc]; }

    void build(int u, int l, int r)
    {
        tr[u].l = l, tr[u].r = r;
        if (l == r) return tr[u].cnt[a[l] % m] = 1, void();
        int mid = l + r >> 1;
        build(lc, l, mid), build(rc, mid + 1, r);
        pushup(u);
    }

    Node query(int u, int l, int r)
    {
        if (l <= tr[u].l && tr[u].r <= r)
            return tr[u];
        int mid = tr[u].l + tr[u].r >> 1;
        if (l > mid) return query(rc, l, r);
        else if (r <= mid) return query(lc, l, r);
        else return query(lc, l, r) + query(rc, l, r);
    }
} SGT;

signed main()
{
    read(n, m);
    for (int i = 1; i <= n; i ++) read(a[i]);
    SGT.build(1, 1, n);

    // DEBUG(SGT.tr[1].cnt[0]);

    // read(q);
    // while (q --)
    // {
    //     int l, r; read(l, r);
    //     // cout << SGT.query(1, l, r) << '\n';
    //     SegsTree::Node res = SGT.query(1, l, r);
    //     cout << res.cnt[0] + 1 << '\n';
    // }

    return 0;
}