#include <stdio.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <memory.h>
#include <time.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main()
{
int n,m,min,max=0;
cin >> n >> m;
if (n%m != 0)min = (n / m + n%m) / 2 + ((n / m) / 2)*(m - 1);
else min = ((n / m) / 2)*m;
int b = (n - (m - 1)) / 2;
while (b - 1 > 0)max += (b - 1);
if (b % 2 == 1)max++;
cout << min << " " << max<<endl;
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxpb3N0cmVhbT4KI2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPG1hcD4KI2luY2x1ZGUgPHF1ZXVlPgojaW5jbHVkZSA8c3RhY2s+CiNpbmNsdWRlIDxzdHJpbmc+CiNpbmNsdWRlIDxzc3RyZWFtPgojaW5jbHVkZSA8bWVtb3J5Lmg+CiNpbmNsdWRlIDx0aW1lLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKQp7CglpbnQgbixtLG1pbixtYXg9MDsKCWNpbiA+PiBuID4+IG07CgkKCglpZiAobiVtICE9IDApbWluID0gKG4gLyBtICsgbiVtKSAvIDIgKyAoKG4gLyBtKSAvIDIpKihtIC0gMSk7CgllbHNlIG1pbiA9ICgobiAvIG0pIC8gMikqbTsKCglpbnQgYiA9IChuIC0gKG0gLSAxKSkgLyAyOwoJd2hpbGUgKGIgLSAxID4gMCltYXggKz0gKGIgLSAxKTsKCWlmIChiICUgMiA9PSAxKW1heCsrOwoKCWNvdXQgPDwgbWluIDw8ICIgIiA8PCBtYXg8PGVuZGw7CglyZXR1cm4gMDsKfQo=