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

int main() {
	int n,x; cin >> n >> x; 
	vector<int> arr(n);
	for(int i = 0; i < n; i++)
	cin >> arr[i];
	
	unordered_map<int,int> mp;
	int cnt = 0;
	for(int i = 0; i < n; i++){
		int req = (x - (arr[i]%x))%x;
		if(mp.find(req) != mp.end())
		cnt += mp[req];
		
		mp[arr[i] % x]++;
	}
	cout << cnt;
	return 0;
}