import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int n, m; readV(n, m);
  int[] a; readA(n, a);

  auto ca = new int[](n+1);
  foreach (i; 0..n) ca[i+1] = (ca[i]+a[i])%m;

  int[int] h;
  auto r = 0L;
  foreach_reverse (l; 0..n+1) {
    auto k = ca[l];
    if (k in h) r += h[k];
    ++h[k];
  }

  writeln(r);
}
