//1. k倍区间
//https://www.acwing.com/problem/content/1232/
#include <iostream>

#define int long long

using namespace std;

const int N = 1e5+10;

int n,k;
int a[N], b[N], cnt[N];
int res;


signed main()
{
  // 请在此输入您的代码
  cin>>n>>k;
  for(int i=1;i<=n;i++) {
    cin>>a[i];

    b[i] = (b[i-1] + a[i]) % k;
    res += cnt[b[i]];
    cnt[b[i]]++;
  }

  cout<<res+cnt[0]<<endl;

  return 0;
}