#include <bits/stdc++.h>
using namespace std;

int main() {
	int n,k;
	cin>>n>>k;
	
	vector<int> numbers(n);
	
	for(int i=0; i<n; i++){
		cin>>numbers[i];
	}
	
	int answer = 0;
	
	unordered_map<int,int> modFreq;
	
	for(int i=0; i<n; i++){
		if(modFreq.find((k - numbers[i]%k)%k) != modFreq.end()){
			answer += modFreq[(k - numbers[i]%k)%k];
		}
		
		modFreq[numbers[i]%k]++;
	}
	
	cout<<answer;
	
	return 0;
}