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.

Examples

Input

2 3 3


Output

0 2


Input

500000000000 500000000000 1000000000000


Output

0 0
import java.util.*;
import java.io.*;
import java.math.BigInteger;
 
public class Main {
	public static void main(String[] args) {
	Scanner s = new Scanner(System.in);
	long A = s.nextLong();
	long B = s.nextLong();
	long K = s.nextLong();

	if(A >= K){
		A = A - K;
		K = 0;
	}else{
		K = K - A;
		A = 0;
	}

	if(K > 0){
		if(B >= K){
			B = B - K;
			K = 0;
		}else{
			K = 0;
			B = 0;
		}
	}
	
	System.out.println(A + " " + B);

    
  }
}