A multi-subject competition is coming! The competition has mm different subjects participants can choose from. That's why Alex (the coach) should form a competition delegation among his students.

He has nn candidates. For the ii-th person he knows subject sisi the candidate specializes in and riri — a skill level in his specialization (this level can be negative!).

The rules of the competition require each delegation to choose some subset of subjects they will participate in. The only restriction is that the number of students from the team participating in each of the chosen subjects should be the same.

Alex decided that each candidate would participate only in the subject he specializes in. Now Alex wonders whom he has to choose to maximize the total sum of skill levels of all delegates, or just skip the competition this year if every valid non-empty delegation has negative sum.

(Of course, Alex doesn't have any spare money so each delegate he chooses must participate in the competition).

The first line contains two integers nn and mm (1≤n≤1051≤n≤105, 1≤m≤1051≤m≤105) — the number of candidates and the number of subjects.

The next nn lines contains two integers per line: sisi and riri (1≤si≤m1≤si≤m, −104≤ri≤104−104≤ri≤104) — the subject of specialization and the skill level of the ii-th candidate.

Print the single integer — the maximum total sum of skills of delegates who form a valid delegation (according to rules above) or 00 if every valid non-empty delegation has negative sum.

In the first example it's optimal to choose candidates 11, 22, 33, 44, so two of them specialize in the 22-nd subject and other two in the 33-rd. The total sum is 6+6+5+5=226+6+5+5=22.

In the second example it's optimal to choose candidates 11, 22 and 55. One person in each subject and the total sum is 6+6+11=236+6+11=23.

In the third example it's impossible to obtain a non-negative sum.

题意就是选科目，每科人数必须相同，总和尽量大。

有一个坑，可以往里面加入负数，只要该科总和>0就可以，具体代码。

代码:

 //C

 #include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int maxn=1e5+;

 const int inf=0x3f3f3f3f;

 vector<int> ve[maxn];

 vector<ll> sum[maxn];

 int sz[maxn];

 ll ans[maxn];

 bool cmp(int a,int b)

 {

     return a>b;

 }

 int main()

 {

     int n,m;

     cin>>n>>m;

     for(int i=;i<=n;i++){

         int s,r;

         cin>>s>>r;

         ve[s].push_back(r);

     }

     for(int i=;i<=m;i++)

         sort(ve[i].begin(),ve[i].end(),cmp);

     for(int i=;i<=m;i++){

         int pre=;

         for(int j=;j<ve[i].size();j++){

             if(j==) sum[i].push_back(ve[i][j]),pre=ve[i][j];

             else sum[i].push_back(pre+ve[i][j]),pre=sum[i][j];

         }

     }

     int maxx=;

     for(int i=;i<=m;i++){

         maxx=max(maxx,(int)ve[i].size());

         for(int j=;j<ve[i].size();j++){

             ans[j]=max(ans[j],ans[j]+sum[i][j]);

         }

     }

     ll ret=;

     for(int i=;i<maxx;i++)

         ret=max(ret,ans[i]);

     cout<<ret<<endl;

 }