program test
implicit none
integer(8) :: i,j,k,m,n,nn,a(100000),ma(100000),suma(100000),sumb(100000),ans=0,combo=1

read(*,*) n,m
read(*,*) (a(i),i=1,n)

do i=1,n
	ma(i) = mod(a(i),m)
enddo

do i=1,n
	if(i==1)then
	suma(i) = ma(i)
	else
	suma(i) = mod(suma(i-1) + ma(i),m)
	endif
enddo

call heapsort2(n,suma(1:n),sumb(1:n))

do i=2,n
	if(suma(i) == suma(i-1)) then
		combo = combo + 1
	else
		if(suma(i-1) == 0) then
			ans = ans + i-1
		endif
		ans = ans + combo*(combo-1)/2
		combo = 1
	endif
enddo

if(combo > 1) then
		ans = ans + combo*(combo-1)/2
endif

if(suma(n) == 0) then
	ans = ans + i
endif

write(*,*) ans

contains

subroutine heapsort2(n,y1,y2)

	implicit none
	integer(8),intent(in) :: n
	integer(8),intent(inout) :: y1(1:n)
	integer(8),intent(inout) :: y2(1:n)
	integer(8) :: i,k,j,l
	integer(8) :: t1,t2
	
	l = n/2+1
	k = n

	do while (k /= 1)
		 if(l > 1) then
				l = l-1
				t1 = y1(l)
				t2 = y2(l)
				
		 else
				t1 = y1(k)
				t2 = y2(k)
				y1(k) = y1(1)
				y2(k) = y2(1)
				k = k-1
				if(k == 1) then
					 y1(1) = t1
					 y2(1) = t2
					 exit
				endif
		 endif

		 i = l
		 j = l+l

		 do while(j <= k)
				if(j < k) then
					 if(y1(j) < y1(j+1)) j = j+1
				endif
				
				if (t1 < y1(j)) then
					 y1(i) = y1(j)
					 y2(i) = y2(j)
					 i = j
					 j = j+j
				else
					 j = k+1
				endif
		 
		 enddo
		 
		 y1(i) = t1
		 y2(i) = t2
	
	enddo
	return

end subroutine heapsort2

end program