AtCoder Beginner Contest 149
B
Greedy Takahashi
AtCoder
未评级
原题
← AC →
翻译中…

Problem Statement

翻译中…

Takahashi has $A$ cookies, and Aoki has $B$ cookies. Takahashi will do the following action $K$ times:

翻译中…
  • If Takahashi has one or more cookies, eat one of his cookies.
  • Otherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.
  • If they both have no cookies, do nothing.
翻译中…

In the end, how many cookies will Takahashi and Aoki have, respectively?

翻译中…

Constraints

翻译中…
  • $0 \leq A \leq 10^{12}$
  • $0 \leq B \leq 10^{12}$
  • $0 \leq K \leq 10^{12}$
  • All values in input are integers.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

A B K

翻译中…

Output

翻译中…

Print the numbers of Takahashi's and Aoki's cookies after $K$ actions.

翻译中…

样例

Input #1
2 3 3
Output #1
0 2
Takahashi will do the following: - He has two cookies, so he eats one of them. - Now he has one cookie left, and he eats it. - Now he has no cookies left, but Aoki has three, so Takahashi eats one of them. Thus, in the end, Takahashi will have $0$ cookies, and Aoki will have $2$.
Input #2
500000000000 500000000000 1000000000000
Output #2
0 0
Watch out for overflows.
题目信息
题号
abc149_b
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。