Chunga-Changa

滴答滴答---题目链接 

time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard output

Soon after the Chunga-Changa island was discovered, it started to acquire some forms of civilization and even market economy. A new currency arose, colloquially called "chizhik". One has to pay in chizhiks to buy a coconut now.

Sasha and Masha are about to buy some coconuts which are sold at price zz chizhiks per coconut. Sasha has xx chizhiks, Masha has yychizhiks. Each girl will buy as many coconuts as she can using only her money. This way each girl will buy an integer non-negative number of coconuts.

The girls discussed their plans and found that the total number of coconuts they buy can increase (or decrease) if one of them gives several chizhiks to the other girl. The chizhiks can't be split in parts, so the girls can only exchange with integer number of chizhiks.

Consider the following example. Suppose Sasha has 55 chizhiks, Masha has 44 chizhiks, and the price for one coconut be 33 chizhiks. If the girls don't exchange with chizhiks, they will buy 1+1=21+1=2 coconuts. However, if, for example, Masha gives Sasha one chizhik, then Sasha will have 66 chizhiks, Masha will have 33 chizhiks, and the girls will buy 2+1=32+1=3 coconuts.

It is not that easy to live on the island now, so Sasha and Mash want to exchange with chizhiks in such a way that they will buy the maximum possible number of coconuts. Nobody wants to have a debt, so among all possible ways to buy the maximum possible number of coconuts find such a way that minimizes the number of chizhiks one girl gives to the other (it is not important who will be the person giving the chizhiks).

Input

The first line contains three integers xx, yy and zz (0≤x,y≤10180≤x,y≤1018, 1≤z≤10181≤z≤1018) — the number of chizhics Sasha has, the number of chizhics Masha has and the price of a coconut.

Output

Print two integers: the maximum possible number of coconuts the girls can buy and the minimum number of chizhiks one girl has to give to the other.

Examples

input

Copy

5 4 3

output

Copy

3 1

input

Copy

6 8 2

output

Copy

7 0

Note

The first example is described in the statement. In the second example the optimal solution is to dot exchange any chizhiks. The girls will buy 3+4=73+4=7 coconuts.

#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long ll;
int main()
{
    ll n,m,z;
    scanf("%lld%lld%lld",&n,&m,&z);
    ll mx,mi;
    ll l,r;
    l=m%z;
    r=n%z;
    mx=m/z;
    mx+=n/z;
    mi=min(l,r);
    l+=r;
    mx+=l/z;
    l=l%z;
    mi-=l;
    if(mi<0)
        mi=0;
    printf("%lld %lld\n",mx,mi);

    return 0;
}