import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') N,M,K=map(int,readline().split()) A=list(map(int,readline().split())) mod=998244353 left=[[0]*K for i in range(N+1)] right=[[0]*K for i in range(N+1)] left[0][0]=1 right[N][0]=1 for i in range(1,N+1): if i%M==1: left[i][0]+=1 left[i][A[i-1]%K]+=1 else: for k in range(K): left[i][k]+=left[i-1][k] left[i][k]+=left[i-1][(k-A[i-1])%K] left[i][k]%=mod for i in range(N-1,-1,-1): if i%M==0: right[i][0]=1 else: for k in range(K): right[i][k]+=right[i+1][k] right[i][k]+=right[i+1][(k-A[i])%K] right[i][k]%=mod for i in range(N-M+1): ans=(sum(right[i][k]*left[i+M][(-k)%K]%mod for k in range(K))-1)%mod print(ans)