// #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=998244353;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const long double EPS=1e-9;
const long double INF=1e+10;
const long double PI=acos(-1.0);
const int C_SIZE = 3100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ
int main(){
	int a,b;scanf("%d%d",&a,&b);
	if(a>b)swap(a,b);
	init_C(1100000);
	long long ret=0;
	long long cur=Comb(a+b-1,b-1);
	long long S=0;
	for(int i=1;i<=a+b;i++){
		S=(S+cur)%mod;
		ret=(ret+S*inv[i])%mod;
		if(i%2){
			if(a-(i+1)/2>=0)cur=(cur+mod-Comb(a-(i+1)/2+b-(i+1)/2,a-(i+1)/2)*Comb((i+1)/2+(i+1)/2-2,(i+1)/2-1)%mod)%mod;
		}else{
			cur=(cur+Comb(a-i/2+b-i/2-1,a-i/2)*Comb(i/2+i/2-1,i/2))%mod;
		}
		// printf("%d: %lld %lld %lld\n",i,S,ret,cur);
	}
	// printf("%lld\n",ret*12%mod);
	cur=Comb(a+b-1,a-1);
	S=0;
	for(int i=1;i<=a+b;i++){
		S=(S+cur)%mod;
		ret=(ret+S*inv[i])%mod;
		if(i%2){
			if(b-(i+1)/2>=0)cur=(cur+mod-Comb(a-(i+1)/2+b-(i+1)/2,b-(i+1)/2)*Comb((i+1)/2+(i+1)/2-2,(i+1)/2-1)%mod)%mod;
		}else{
			cur=(cur+Comb(b-i/2+a-i/2-1,b-i/2)*Comb(i/2+i/2-1,i/2))%mod;
		}
	}
	ret=ret*fact[a]%mod*fact[b]%mod*finv[a+b]%mod;
	printf("%lld\n",ret);
}
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>

using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)

int main(){
    ll n;
    ll m;
    cin >> n >> m;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    vector<ll> sum(n+1);
    sum[0] = 0;
    map<ll, ll> mp;
    mp[0] = 1;
    rep(i, n) {
        sum[i+1] = (sum[i]+a[i]) % m;
        ++mp[sum[i+1]];
    }
    ll ans = 0;
    for ( auto p : mp ) {
        ans += p.second * (p.second - 1 ) / 2;
    }
    cout << ans << endl;
    return 0;
}
