Codeforces 478B Random Teams

Description

n participants of the competition were split into m teams in some manner so that each team has at least one participant. After the competition each pair of participants from the same team became friends.

Your task is to write a program that will find the minimum and the maximum number of pairs of friends that could have formed by the end of the competition.

Input

The only line of input contains two integers n and m, separated by a single space (1 ≤ m ≤ n ≤ 109) — the number of participants and the number of teams respectively.

Output

The only line of the output should contain two integers kmin and kmax — the minimum possible number of pairs of friends and the maximum possible number of pairs of friends respectively.

Sample Input

Input

5 1

Output

10 10

Input

3 2

Output

1 1

Input

6 3

Output

3 6

Hint

In the first sample all the participants get into one team, so there will be exactly ten pairs of friends.

In the second sample at any possible arrangement one team will always have two participants and the other team will always have one participant. Thus, the number of pairs of friends will always be equal to one.

In the third sample minimum number of newly formed friendships can be achieved if participants were split on teams consisting of 2 people, maximum number can be achieved if participants were split on teams of 1, 1 and 4 people.

题意：将N个人分成M组，每组至少一人。在比赛结束时，同一组的人两两之间都会成为朋友。不同分组的分组方案得到的朋友对数不同。
要问最少和最多各是多少。

最多的可以用无向完全欧拉图
最少的可以用均分的方法是队友均分

代码实现

#include<iostream>
#include<cstdio>
using namespace std;
long long slove(long long num)
{
    long long ans=num*(num-1)/2;
    return ans;
}
int main()
{
    long long n,m,a,b;
    long long  max,min;
    scanf("%lld %lld",&n,&m);
    if(m==1)
        min=max=slove(n);
    else{
        max=slove(n-m+1);
        a=n/m;
        b=n%m;
        min=b*slove(a+1)+(m-b)*slove(a);
    }

    printf("%I64d %I64d",min,max);
    return 0;
}