2861: ABC149B Greedy Takahashi

Memory Limit：128 MB Time Limit：1.000 S
Judge Style：Text Compare Creator：
Submit：0 Solved：0

Description

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≤A≤1012
  • 0≤B≤1012
  • 0≤K≤1012
  • All values in input are integers.

Input

Input

Input is given from Standard Input in the following format: 

A B K

Output

Output

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

Sample Input Copy 

2 3 3

Sample Output Copy 

0 2

Source/Category

SubmitSubmit RecordStatisticsShowOff!