Problem:
 Score : 200 points    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.        Sample Input 1 2 3 3      Sample 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 .       Sample Input 2 500000000000 500000000000 1000000000000      Sample Output 2 0 0  Watch out for overflows.

Solution (Python):
a,b,k=map(int,input().split())

if a>=k:
    print(a-k,b)

elif a+b>=k>a:
    print(0,a+b-k)

else:
    print(0,0)

Solution (Python):
a, b, k = map(int, input().split())
if k <= a:
    print(a-k, b)
else:
    if a+b <= k:
        print(0, 0)
    else:
        print(0, a+b-k)

Solution (Python):
if __name__ == "__main__":
    a, b, k = map(int, input().split())
    ans_a = max(a - k, 0)
    ans_b = b
    if ans_a == 0:
        k = k - a
        ans_b = max(b - k, 0)           
    print(ans_a,ans_b)

Solution (Python):
A,B,K=map(int,input().split())
if A>=K:
    print(A-K,B)
elif A+B<=K:
    print(0,0)
else:
    print(0,B-K+A)

Solution (Python):
a,b,k = map(int,input().split())
if a <= k: 
    k -= a
    a = 0
    b -= k
    if b < 0: b = 0
else:
    a -= k
print(a,b)

Solution (Python):
import itertools

def solve():
    a, b, k = map(int, input().split())
    d = min(a, k)
    a -= d
    k -= d
    d = min(b, k)
    b -= d
    k -= d
    return a, b

print(*solve())

Solution (Python):

def main():
    A, B, K = map(int, input().split())
    aa = A - K if A >= K else 0
    kk = K - A if K >= A else 0
    bb = B - kk if B >= kk else 0
    print(aa, bb)


if __name__ == "__main__":
    main()

Solution (Python):
A, B, K = map(int, input().split())
taka,aoki = 0, 0
taka = max(0,A-K)
aoki = max(0,B + min(0,A-K))
print(taka,aoki)

Solution (Python):
a,b,k=map(int,input().split())
if a > k:
    print(a-k,b)
elif b > k-a:
    print(0,b-k+a)
else:
    print(0,0)

Solution (Python):
A,B,K=map(int,input().split())
if A>K:
  print(A-K,B)
elif A+B>K and A<=K:
    print(0,B+A-K)
else:
  print(0,0)

Solution (Python):
a, b, k = map(int, input().split())

if a >= k:
    print("%d %d" % (a - k, b))
else:
    print("0 %d" % (max(0, b - (k - a))))

Solution (Python):

a,b,k=map(int,input().split())
if a+b<=k:
    print("0 0")
elif a<=k:
    print("0 "+str(b-(k-a)))
else:
    print(str(a-k)+" "+str(b))

Solution (Python):
a,b,k=map(int,input().split())
if a<k:
    c=b-(k-a)
    if c<0:
        print(0,0)
    else:
        print(0,c)
else:
    print(a-k,b)

Solution (Python):
A, B, K = map(int, input().split())

print(max(A-K, 0), max(B - max(K-A, 0), 0))

Solution (Python):
a,b,k = map(int,input().split())

if a <=k:
    if a+b-k<=0:
        print(0, 0)
    else:
        print(0,a+b-k)
    
else:
    print(a-k,b)

Solution (Python):

l = [int(x) for x in input().split()]
a = max(0,l[0]-l[2])
b = max(0,l[0]+l[1]-l[2]-a)
print(a,b)

Solution (Python):
A, B, K = map(int, input().split())

if A >= K:
    print(*(A - K, B))
elif B + (A - K) > 0:
    print(*(0, B + (A - K)))
else:
    print(*(0, 0))

Solution (Python):
a, b, k = map(int, input().split())
takahashi = a
aoki = b
if takahashi > k:
    takahashi -= k
elif takahashi <= k:
    takahashi = 0
    if aoki > k - a:
        aoki -= k - a
    elif aoki <= k - a:
        aoki = 0
print(takahashi, aoki)

Solution (Python):
A, B, K = map(int, input().split())
remainK = K - A
A = A - K
if A < 0:
    A = 0
if remainK > 0:
    B = B - remainK
if B < 0:
    B = 0
print(A, B)

Solution (Python):
import sys
a, b, k = map(int, input().split())

if b == 0:
    if a-k >= 0:
        print(a-k, 0)
    else:
        print(0, 0)
    sys.exit()
elif a == 0:
    if b-k >= 0:
        print(0, b-k)
    else:
        print(0, 0)
    sys.exit()
elif a + b <= k:
    print(0, 0)
    sys.exit()
    
if a <= k:
    print(0, b -(k -a))
else:
    print(a-k, b)

Solution (Python):
a,b,k = map(int,input().split())
if a-k < 0:
    b  = b + a -k
a = max(a-k,0)
print(a,max(b,0))

Solution (Python):
a, b, k = map(int, input().split())

if (a - k) <= 0:
    k -= a
else:
    print(a-k, b)
    exit()

if (b - k) <= 0:
    print(0, 0)
else:
    print(0, b-k)

Solution (Python):
a,b,k=map(int,input().split())
if a>=k:
  print(a-k,b)
else:
  print(0,max([a+b-k,0]))

Solution (Python):
A,B,K =map(int,input().split())

if A>=1 and K>0:
    tmp=A
    A=A-K
    K=K-tmp
if A<0:
    A=0

if A==0 and B>=1 and K>0:
    B=B-K

if B<0:
    B=0

print(A,B)

Solution (Python):
A, B, K = list(map(int, input().split()))

a = max(A - K, 0)
K -= A - a
b = max(B - K, 0)
print(a, b)

Solution (Python):
A, B, K = list(map(int, input().split()))

if A > K:
    A -= K
    K = 0
else:
    K -= A
    A = 0
    if B > K:
        B -= K
        K = 0
    else:
        K -= B
        B = 0
print(A, B)

Solution (Python):
a,b,k = map(int, input().split())
num = a + b - k
if(num <= 0):
  print(0, 0)
elif(a - k >= 0):
  print(a - k, b)
else:
  print(0, num)

Solution (Python):
a,b,k = map(int,input().split())
if a > k:
    print(a-k,b)
elif a+b < k:
    print(0,0)
else:
    print(0,a+b-k)

Solution (Python):
A, B, K = map(int, input().split())

if A + B <= K:
    print(0, 0)
elif A < K:
    print(0, A+B-K)
else:
    print(A-K, B)

Solution (Python):
a, b, k = map(int, input().split())

if a > k:
  print(a-k, b)
elif a+b > k:
  print("0" , a+b-k)
else :
  print("0", "0")

Solution (Python):
A, B, K = map(int,input().split())
print(' '.join(map(str,[A-K,B])) if A > K else ' '.join(map(str,[0,max(0,B-K+A)])))

Solution (Python):
a, b, k = map(int, input().split())

if a >= k:
    print(a-k, b)
else:
    k -= a
    if b >= k:
        print(0, b-k)
    else:
        print(0, 0)

Solution (Python):
x = input()
a = int(x.split()[0])
b = int(x.split()[1])
k = int(x.split()[2])
a_result = ''
b_result = ''

if k >= a:
  a_result = '0'
  k = k -a
else:
  a_result = str(a - k)
  k = 0

if k >= b:
  b_result = '0'
else:
  b_result = str(b - k)
  
print(a_result + ' ' + b_result)

Solution (Python):
a, b , k = map(int,input().split())
if a>k:
    print(str(a-k) +" "+ str(b))
else:
    if a + b > k:
        print(str(0) +" "+ str(b-(k-a)))
    else:
        print(str(0) +" " + str(0))

Solution (Python):
[a,b,k] = [int(i) for i in input().split()]

if a+b <= k:
    print(0,0)
elif a < k:
    print(0,a + b - k)
else:
    print(a-k,b)

Solution (Python):
a, b, k = map(int, input().split())
sub = k - a  
a = max(0, a - k)
b = max(0, min(b - sub, b))
print(a, b)

Solution (Python):


def main():
    A, B, K = map(int, open(0).read().split())
    if (A > K):
        print(A - K, B)
    elif (B - (K - A) >= 0):
        print(0, B - (K - A))
    else:
        print(0, 0)



main()

Solution (Python):
a,b,k=map(int,input().split())
if a >= k:
  a -= k
elif a < k and a+b >= k:
  b -= (k-a)
  a = 0
elif a+b < k:
  a = 0
  b = 0
print(a,b)

Solution (Python):
a,b,k=map(int,input().split())
if a<k:
	if b<(k-a):
		print("0 0")
	else:
		print("0",b+a-k)
else:
	print(a-k,b)

Solution (Python):
l = [int(x) for x in input().split()]
A, B, K = l[0], l[1], l[2]
deltaA = A - K
if deltaA < 0:
    A = 0
    deltaB = B + deltaA
    if deltaB < 0:
        B = 0
    else:
        B = deltaB
else:
    A = deltaA
print(A, B)

Solution (Python):
A, B, K = map(int, input().split())

all_cookies = A + B
if K >= all_cookies:
  print('{} {}'.format(0, 0))
elif K <= A:
  print('{} {}'.format(A - K, B))
else:
  print('{} {}'.format(0, B - (K - A)))

Solution (Python):


A, B, K = map(int, input().split())

if A >= K:
    print(A-K, B)
elif B >= K - A:
    print(0, A+B-K)
else:
    print(0, 0)

Solution (Python):
A, B, K = map(int, input().split())

if A >= K:
    print(str(A-K), str(B))
elif B >= K-A:
    print(str(0), str(B-(K-A)))
else:
    print(str(0), str(0))

Solution (Python):
A,B,K=map(int,input().split())
A_print=A
B_print=B
if(K>=A+B):
  A_print=0
  B_print=0
elif(K>=A):
  A_print=0
  B_print=B-(K-A)
else:
  A_print=A-K
  B_print=B
print(A_print,B_print)

Solution (Python):
line = input()
a, b, k = line.split(" ")
a = int(a)
b = int(b)
k = int(k)
 
if k >= a+b:
    print(0,0)
else:
    if a - k < 0:
        print(0, b-(k-a))
    else:
        print(a - k, b)

Solution (Python):
A, B, K = list(map(int, input().split()))

if K >= A:
    K -= A
    A = 0
    if K > B:
        B = 0
    else:
        B -= K
else:
    A -= K

print(A, B)

Solution (Python):
a,b,k = map(int, input().split())
if a<k:
  k-=a
  a=0
else:
  a-=k
  k=0
if b<k:
  k-=b
  b=0
else:
  b-=k
  k=0
print(str(a) + " " + str(b))

Solution (Python):
a,b,k=map(int,input().split())
if a >= k:
  print(str(a-k) + " " + str(b))
else:
  k -= a
  print("0 " + str(max(0,b-k)))

Solution (Python):
A, B, K = map(int, input().split())

A -= K

if A < 0:
    B -= abs(A)
    A *= 0
    if B < 0:
        B *= 0

print("{} {}".format(A, B))

Solution (Python):
a, b, k = map(int, input().split())
if k - a > 0:
    k -= a
    if b - k >= 0:
        print(0, b - k)
    else:
        print("0 0")
else:
    print(a - k, b)

Solution (Python):
a,b,k = map(int, input().split())
if a >= k:
  print(a-k,b)
elif a+b >= k:
  print(0,a+b-k)
else:
  print(0,0)

Solution (Python):
a, b, k = map(int,input().split())

takahashi = max(0, a-k)
k -= a
k = max(0, k)

aoki = max(0, b-k)

print(takahashi, aoki)

Solution (Python):
A,B,K=map(int,input().split())

if A>0:
    if A<=K:
        K=K-A
        A=0
    else:
        A=A-K
        K=0
if A<=0:
    if B>0 and B<=K:
        K=K-B
        B=0
    if B>0 and B>=K:
            B=B-K
            K=0
print(A,B)

Solution (Python):
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

A, B, K = rl()

print(max(A-K, 0), max(B-max(K-A,0),0))

Solution (Python):
a, b, k = map(int,input().split())
if a>=k:
    print(a-k, b)
elif (a+b)>=k:
    print(0, (b+a)-k)
else:
    print(0,0)

Solution (Python):
A,B,K=[int(x) for x in input().rstrip().split()]
import sys




ans=0
if 0<=A-K:
  print(A-K,B)
else:
  if B+(A-K)<0:
    ans=0
  else:
    ans=B+(A-K)
  print(0,ans)

Solution (Python):
import sys
a, b, k = map(int, sys.stdin.readline().split())
if a < k:
  if a + b - k >= 0:
    print(0, a + b - k)
  else:
    print(0, 0)
else:
  print(a - k, b)

Solution (Python):
a, b, k = map(int, input().split())

if k - a >= 0:
    k = k - a
    a = 0

    if k - b >=0:
        b = 0
    else:
        b = b - k
else:
    a = a - k

print(a, b)

Solution (Python):
a,b,k=map(int,input().split())

aa=max(0,a-k)
bb=max(0,b-(k-(a-aa)))

print(aa,bb)

Solution (Python):

a,b,k = map(int,input().split())

if a >= k:
    print(a-k,b)
elif a +b >= k:
    print(0,b-(k-a))
else:
    print(0,0)

Solution (Python):
A,B,K=map(int,input().split())
if A-K>=0:
    print(A-K,end=" ")
    print(B)
elif B-(K-A)<=0:
    print(0,end=" ")
    print(0)
else:
    print(0,end=" ")
    print(B-(K-A))

Solution (Python):
A, B, K = map(int, input().split())

if K <= A:
  A = A - K
elif A < K <= A + B:
  B = B - ( K - A )
  A = 0
else:
  A = 0
  B = 0
print(A, B)

Solution (Python):
A, B, K = map(int, input().split())
if A >= K:
  print(A - K, B)
elif A+B>= K:
  print(0, A+B - K)
else:
  print(0, 0)

Solution (Python):
a,b,k = map(int,input().split())
A = max(0, a - k)
K = max(0, k - a)
B = max(0, b - K)
print(A, B)

Solution (Python):
A, B, K = map(int, input().split())

if K <= A:
    print(A-K, B)
elif A<K<=(A+B):
    print(0, B-(K-A))
else:
    print(0, 0)

Solution (Python):
a,b,k = map(int,input().split())

if k <= a:
  print(a-k,b)
elif k <= a+b:
  print(0,b+a-k)
else:
  print(0,0)

Solution (Python):
A, B, K = map(int, input().split())

if A >= K:
    print(A-K, B)
elif (A+B) >= K:
    print(0, (A+B)-K)
else:
    print(0, 0)

Solution (Python):

A, B, K = map(int, input().split())

if A >= K:
    print( A-K, B)
elif K <= A+B:
    print(0, B-(K-A))
else:
    print(0, 0)

Solution (Python):
a,b,k = map(int,input().split())
print(max(a-k,0),max(min(a+b-k,b),0))

Solution (Python):
a,b,k = map(int,input().split())
print(max(a-k,0),max(min(a+b-k,b),0))

Solution (Python):
a, b, k = map(int, input().split())
if a >= 1 and a <= k:
    k -= a
    a = 0

elif a >= 1 and a > k:
    a -= k
    k -= a

if b >= 1 and k > 0 and b <= k:
    k -= b
    b = 0
elif b >= 1 and k > 0 and b > k:
    b -= k
    k -= b


print(a, b)

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B, K = il()
    print(max(0, A-K), max(0, B-(max(0,K-A))))


if __name__ == '__main__':
    main()

Solution (Python):
a,b,k = map(int,input().split())
if a>=k:
  print(a-k,b)
elif k-a <=b:
  print(0,b+a-k)
else:
  print(0,0)

Solution (Python):
a,b,k = map(int, input().split())

if a-k >= 0:
    print(a-k, b)
elif a+b-k>=0:
    print(0, a+b-k)
else:
    print(0, 0)

Solution (Python):
a, b, k = map(int, input().split());

new_a = max(0, a - k);

if new_a == 0:
  b = max(0, b - k + a);
  
print(new_a,b);

Solution (Python):
a,b,c = map(int, input().split())
if a<=c:
    if b<=c-a:
        print('0 0')
    else:
        print('0 {}'.format(a+b-c))
else:
    print('{} {}'.format(a-c,b))

Solution (Python):

A, B, K = map(int, input().split())

print(max(0, A-K), max(B-(max(0, K-A)), 0))

Solution (Python):
A,B,C=map(int,input().split())
if A<C:
  B=B-(C-A)
  A=0
else:
  A=A-C
print(A,max(B,0))

Solution (Python):
a, b, k = map(int,(input().split()))

if a >= k:
    print(a-k, b)
elif a+b >= k:
    print(0, b-(k-a))
else:
    print(0,0)

Solution (Python):
a, b, k = map(int, input().split())
if a - k <= 0:
	k = k - a
	a = 0
else:
	a -= k
	k = 0

if b - k <= 0:
	b = 0
	
else:
	b -= k

print(a, b)

Solution (Python):
n = input().split()
a = int(n[0])
b = int(n[1])
k = int(n[2])

if a < k:
  k -= a
  a = 0
else:
  a -= k
  k = 0
  
if b > k:
  b -=k
else:
  b = 0

  
print(str(a)+" "+str(b))

Solution (Python):
a, b, k = map(int, input().split())

if a > k:
    a -= k
else:
    k -= a
    a = 0
    b = b - k if k < b else 0
print(a, b)

Solution (Python):
a, b, k = map(int, input().split())
if a-k >= 0:
    print(a-k, b)
elif b-abs(a-k) >= 0:
    print('0', b-abs(a-k))
else:
    print('0', '0')

Solution (Python):
import sys

a,b,k = map(int,input().split())
a1 = k-a
if a1 >=1:
  a2=b-a1
  if a2 <=0:
    a2 = 0
  a1=0
else:
  a1=a-k
  a2=b
print(a1,a2)

Solution (Python):
a,b,k=map(int,input().split())
if a>k:
  a-=k
elif a+b>k:
  a,b=0,b-k+a
else:
  a=0
  b=0
print(str(a)+' '+str(b))

Solution (Python):
A, B, K = (int(x) for x in input().split())
if K >= A+B:
  A = 0
  B = 0
elif K >= A:
  B = B + A - K
  A = 0
elif K < A:
  A = A - K
print(A,B)

Solution (Python):
line = input()
a, b, k = line.split(" ")
a = int(a)
b = int(b)
k = int(k)
 
if k >= a+b:
    print(0,0)
else:
    if a - k < 0:
        print(0, b-(k-a))
    else:
        print(a - k, b)

Solution (Python):
line = input()
a, b, k = line.split(" ")
a = int(a)
b = int(b)
k = int(k)

if k >= a+b:
    print(0,0)
else:
    if a - k < 0:
        print(0, b-(k-a))
    else:
        print(a - k, b)

Solution (Python):
a,b,k = map(int,input().split())


if a>= k:
    print(a-k,b)
elif a+b>=k:
    print(0,a+b-k)
else:
    print(0,0)

Solution (Python):
a,b,k = list(map(int,input().split()))

if a >= k:
    print(a-k,b)
elif a < k:
    print(0, max(a+b-k,0))

Solution (Python):
def main():
    A, B, K = map(int, input().split())
    print(max(0, A-K), max(0, min(B, B-(K-A))))


if __name__ == "__main__":
    main()

Solution (Python):
A, B, K = map(int, input().split())

print(max(0, A-K), max(0, B-max(0, K-A)))

Solution (Python):
A, B, K = map(int,input().split())

val1 = K-A

if val1 > 0:
    val2 = B-val1
    if val2 > 0:
        print(str(0)+' '+str(val2))
    else:
        print(str(0)+' '+str(0))
else:
    print(str(-val1)+' '+str(B))

Solution (Python):
a,b,k=map(int, input().split())
if a<k: 
  if a+b<k:
    b=0
  else:b=a+b-k
  a=0
else:
  a=a-k
print('%d %d'%(a,b))

Solution (Python):
a,b,k = map(int,input().split())
print(max(0,a-k),min(b,max(0,a+b-k)))

Solution (Python):
A,B,K=map(int,input().split())
a=max(0,A-K)
b=max(0,B-max(0,K-A))
print(a,b)

Solution (Python):
a,b,k = map(int,input().split())
if a>=k:
  print('{} {}'.format(a-k,b))
else:
  if b-k+a>=0:
    print('{} {}'.format(0,b-k+a))
  else:
    print('0 0')

Solution (Python):
a,b,k = list(map(int,input().split()))
x = max(0,a-k)
y = max(0,b-max(0,k-a))
print(x,y)

Solution (Python):
A,B,K=map(int,input().split())
a=max(0,A-K)
b=max(0,B-max(0,K-A))
print(a,b)

Solution (Python):
a, b, k = map(int, input().split())

if a + b <= k:
    a = 0
    b = 0
elif a + b > k and a >= k:
    a = a - k
elif a < k:
    b = b - abs(a - k)
    a = 0

print(a, b)

Solution (Python):
import sys
A,B,K=map(int,input().split())

if A-K>=0:
    print(A-K,B)
    sys.exit()
else:
    if B>=K-A:
        print(0,B-(K-A))
    else:
        print(0,0)

Solution (Python):
a, b, k = map(int, input().split())

if a >= k:
  print(a - k, b)
elif a + b >= k:
  print(0, a + b - k)
else:
  print(0, 0)

Solution (Python):
a, b, k = map(int, input().split())
print(max(a - k, 0), max(min(a + b - k, b), 0))

Solution (Python):
a, b, k = map(int, input().split())

if k > a:
    k -= a
    a = 0
else:
    print(a - k, b)
    exit()

if k > b:
    print(0, 0)
    exit()
else:
    print(0, b - k)

Solution (Python):
A, B, K = map(int, input().split())

print(A-K, B) if A>=K else print(0, B-(K-A)) if K<=A+B else print(0, 0)

Solution (Python):
from decimal import Decimal

a,b,k = map(Decimal, input().split())

b = max(0,b - max(0,k-a))
a = max(0, a - k)
print(a,b)

Solution (Python):
A,B,K=map(int,input().split())
M=K-A
if A+B>=K:
  if M>=0:
    print(0,B-M)
  else:
    print(A-K,B)
else:
  print(0,0)

Solution (Python):
a, b, k = [int(x) for x in input().split()]

a -= k
if a < 0:
    b += a
    a = 0
    if b < 0:
        b = 0
print(a, b)

Solution (Python):
a,b,k = map(int,input().split())
if a>=k:
    print(a-k,b)
else:
    print(0,max(a+b-k,0))

Solution (Python):
a,b,k = map(int,input().split())

if a >= k:
	print(a-k,b)
else:
	if b < k-a:
		print(0,0)
	else:
		print(0,b-(k-a))

Solution (Python):
a, b, k = map(int, input().split())

if a > k:
    a -= k
    print(a, b)
if a <= k and b > k-a:
    print(0, b-(k-a))
if b <= k-a:
    print(0, 0)

Solution (Python):
a,b,k = map(int,input().split())

if a >= k:
	print(a-k,b)
else:
	if b < k-a:
		print(0,0)
	else:
		print(0,b-(k-a))

Solution (Python):
A, B, T = map(int,input().split())

t = A - T
if t >= 0:
    print(t, B)
elif B+t >= 0:
    print(0, B+t)
else:
    print(0, 0)

Solution (Python):
a, b, k = list(map(int, input().split()))
if a-k>0:
    print(a-k,b)
elif a+b-k>0:
    print(0,a+b-k)
else:
    print(0,0)

Solution (Python):
a,b,k=[int(x) for x in input().split()]

if(a-k>0):
  print(a-k,b)
elif a+b-k>0:
  print(0,a+b-k)
else:
  print(0,0)

Solution (Python):
a, b, k = map(int, input().split())


if k <= a:
    print(a-k, b)
elif k <= a + b:
    print(0, b-k+a)
else:
    print(0, 0)

Solution (Python):
a, b, k = map(int, input().split())

if a > k:
    print(a-k, b)
elif a + b < k:
    print(0, 0)
else:
    print(0, b-(k-a))

Solution (Python):
A, B, K = map(int, input().split())
if  A >= K:
    A = A - K
elif A + B >= K:
    B = B - (K - A)
    A = 0
else:
    A, B = 0, 0
print('{} {}'.format(A, B))

Solution (Python):
a, b, k = map(int, input().split())
if k <= a:
    print(a-k, b)
elif k <= a + b:
    print(0, a+b-k)
else:
    print(0, 0)

Solution (Python):
def q2():
    A, B, K = (int(i) for i in input().split())

    if A >= K:
        A -= K
    else:
        K -= A
        A = 0
        if B >= K:
            B -= K
        else:
            B = 0

    print('{} {}'.format(A, B))


if __name__ == '__main__':
    q2()

Solution (Python):
icase=0
if icase==0:
    a,b,k=map(int,input().split())
    if k<=a:
        a1=a-k
        b1=b
    elif k<=a+b:
        a1=0
        b1=b-(k-a)
    else:
        a1=0
        b1=0
    print(a1,b1)

Solution (Python):
import math

a, b, k = map(int, input().split(" "))

if a < k:
    print(0, max(0, b - abs(a - k)))
    exit()

if a >= k:
    print(a - k, b)

Solution (Python):

import sys


def solve(A: int, B: int, K: int):
    if A <= K:
        K -= A
        A = 0
        if B <= K:
            B = 0
        else:
            B-=K
    else:
        A -= K
    print(A,B)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    K = int(next(tokens))  
    solve(A, B, K)

if __name__ == '__main__':
    main()

Solution (Python):
a, b, k = map(int, input().split())

if a - k < 0:
    print(0, max(0, b - abs(a - k)))
else:
    print(a - k, b)

Solution (Python):
a,b,k=map(int,input().split())
if a>=k:
    print(a-k, b)
elif a+b<k:
    print(0, 0)
else:
    print(0, a+b-k)

Solution (Python):
A,B,K=map(int,input().split())

A1=max(0,A-K)
if A1>0:
    B1=B
else:
    B1=max(0,B-abs(A-K))

print(A1,B1)

Solution (Python):
a,b,k = map(int, input().split())
if a>=k:
  print(a-k,b)
elif a+b>=k:
  print(0,a+b-k)
else:
  print(0,0)

Solution (Python):
def main():
    A, B, K = map(int, input().split())
    if K > A:
        K -= A
        A = 0
        if K > B:
            K -= B
            B = 0
            print(A, B)
        else:
            B -= K
            print(A, B)
    else:
        A -= K
        print(A, B)
main()

Solution (Python):
A, B, K = map(int, input().split())

x = min(A, K)
y = min(B, K - x)
print(A - x, B - y)

Solution (Python):
a, b, k = map(int, input().split())
if a >= k:
    print(a - k, b)
elif a + b >= k:
    print(0, a + b - k)
else:
    print(0, 0)

Solution (Python):
A, B, K = list(map(int, input().split()))

a = A
b = B

if K >= a + b:
    ans1 = 0
    ans2 = 0
else:
    if K <= a:
        ans1 = a - K
        ans2 = b
    else:
        ans1 = 0
        ans2 = b - (K - a)
print(ans1, ans2)

Solution (Python):
a,b,k = map(int,input().split())
if a+b<=k:
    print(0,0)
elif a<=k and a+b>k:
    print(0,a+b-k)
else:
    print(a-k,b)

Solution (Python):
a, b, k = map(int, input().split())
a_ans = max(0, a-k)
b_ans = max(0, b-max(0, k-a))
print(a_ans, b_ans)

Solution (Python):
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)


args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v):
    print(["Yes", "No"][not v])



def main():
    A, B, K = input([int, 3])
    a = A - K
    if K <= A:
        print(A - K, B)
        return
    if K <= A + B:
        print(0, B - (K - A))
        return
    print(0, 0)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Solution (Python):
a,b,k = map(int, input().split())
if a>=k:
    print(str(a-k)+" "+str(b))
elif b>=k-a:
    print("0 "+str(b-k+a))
else:
    print("0 0")

Solution (Python):
A, B, K = map(int, input().split())
if A>=K:
    A = A - K
else:
    B = max(0,B-(K-A))
    A = 0
print(A,B)

Solution (Python):
A, B, K = map(int, input().split())
if A>=K:
    A = A - K
else:
    K -= A
    A = 0
    B = max(0,B-K)
print(A,B)

Solution (Python):
a,b,k=map(int,input().split())
print(max(0,a-k),max(0,min(a+b-k,b)))

Solution (Python):
a, b, k = map(int, input().split())
ca = max(0, a-k)
cb = max(0, b - max((k - a), 0))
print(ca, cb)

Solution (Python):
a, b, k = map(int, input().split())
if a <= k:
    k -= a
    a = 0
    if b <= k:
        k -= b
        b = 0
    else:
        b -= k
        k = 0       
else:
    a -= k
    k = 0
    
print('{0} {1}'.format(a, b))

Solution (Python):
A, B, K = map(int, input().split())
if A>=K:
    A = A - K
    print(A,B)
else:
    K -= A
    A = 0
    B = max(0,B-K)
    print(A,B)

Solution (Python):
a,b,k=map(int,input().split())
print(a-k,b) if a>=k else print(0,a+b-k) if a+b>=k else print(0,0)

Solution (Python):
a,b,k = map(int,input().split())

if k<=a:
    print(a-k,b)
elif k>a:
    if a+b<=k:
        print(0,0)
    else:
        print(0,b-(k-a))

Solution (Python):
a, b, k =map(int, input().split())

if k>=a+b:
	print(0, 0)
elif a>k:
	print(a-k, b)
else:
	print(0, a+b-k)

Solution (Python):
a, b, k = map(int, input().split())
if a >= k:
    a -= k
elif a < k and a + b >= k:
    b = b - (k-a)
    a = 0
else:
    a = 0
    b = 0
print(a, b)

Solution (Python):
a, b, k = map(int, input().split())
if a >= k:
    print(a - k, b)
elif a + b >= k:
    print(0, b - (k - a))
else:
    print(0, 0)

Solution (Python):
a,b,c=map(int,input().split())
print(a-c,b) if a>=c else print(0,b-(c-a)) if b>=c-a else print(0,0)

Solution (Python):
A, B, K = map(int, input().split())
if A>K>=0:
    print(A-K, B)
elif A+B<=K:
    print(0, 0)
else:
    print(0, B+A-K)

Solution (Python):
A, B, K = [int(i) for i in input().split()]
a = max(0, A - K)
b = max(0, B - K + A - a)
print(a, b)

Solution (Python):
a,b,k = map(int, input().split())
if (a+b <= k):
    print(*[0,0])
elif (a >= k):
    print(*[a-k,b])
else:
    print(*[0,b+a-k])

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  A, B, K = map(int, readline().split())
  if A>=K:
    print(A-K, B)
  else:
    print(0, max(B-K+A,0))
  
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):
A, B, K = map(int,input().split())

if A+B <= K:
    print(0,0)
elif A <= K:
    print(0,A+B-K)
else:
    print(A-K,B)

Solution (Python):
A,B,K=map(int,input().split())
if A>=K:
    print(A-K,B)            
elif (A+B)>=K:
    print(0,A+B-K)
else:
    print(0,0)

Solution (Python):
a, b, k = map(int, input().split())
print(max(a-k, 0), max(b+min(a-k, 0), 0))

Solution (Python):
a,b,k=map(int,input().split())
if a>=k:
  print(a-k,b)
elif a+b>=k:
  print(0,b-(k-a))
else:
  print(0,0)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, K = MAP()
if K - A > 0:
  B -= K-A
print(max(0, A-K), max(0, B))

Solution (Python):
a,b,k=map(int,input().split())
ans1=max(0,a-k)
ans2=max(0,b-max(0,k-a))
print(ans1,ans2)

Solution (Python):
A,B,K=map(int,input().split())

if A-K>=0:
    A=A-K
elif B-(K-A)>=0:

    B=B-(K-A)
    A=0
else:
    A=0
    B=0
print(A,B)

Solution (Python):
A, B, K = map(int, input().split())

if A + B < K:
    print(0, 0)
elif A < K:
    print(0, B - K + A)
else:
    print(A-K, B)

Solution (Python):
A, B, K = map(int, input().split())
 
if A-K > 0:
  a = A-K
  b = B
elif A+B-K > 0:
  a = 0
  b = A+B-K
else:
  a = 0
  b = 0
 
print(a, " ", b)

Solution (Python):
A, B, K = map(int, input().split())
if K <= A:
    print(A - K, B)
elif K - A <= B:
    print(0, B - (K - A))
else:
    print(0, 0)

Solution (Python):
A,B,K = map(int, input().split())

if A >= K:
  print(A-K, B)
else:
  print(0, max(0, B-(K-A)))

Solution (Python):
A, B, K = (int(x) for x in input().split())

M = A + B
if K >= M:
    A = 0
    B = 0
else:
    if K >= A:
        B = B - (K - A)
        A = 0
    else:
        A = A - K

print(A, B)

Solution (Python):
a, b, k = map(int, input().split())

if k>a:
  print(0, max(0,b-(k-a)))
else:
  print(a-k, b)

Solution (Python):
a,b,k = map(int,input().split())
if a > k:
    print(a-k,b)
elif a + b > k:
    print(0,a+b - k)
else :
    print(0,0)

Solution (Python):
a, b, k = map(int, input().split())
if a+b <= k:
    print(0, 0)
elif k <= a:
    print(a-k, b)
else:
    print(0, b-k+a)

Solution (Python):

def input2():
	return map(int,input().split())


def input_array():
	return list(map(int,input().split()))





a,b,k=input2()



if k<=a:
	a-=k
elif a+b>k:
	k-=a
	a=0
	b-=k
elif (a+b)<=k:
	a=0
	b=0

print("{} {}".format(a,b))

Solution (Python):
a,b,k = map(int,input().split())
if k>=(a+b): print(0,0)
elif k>=a: print(0,' ',b-(k-a))
else: print(a-k,' ',b)

Solution (Python):

import io

nim, mike, kite = map(int, input().split())
print(max(nim - kite, 0), max(mike - max(kite - nim, 0), 0))

Solution (Python):
a,b,k=map(int,input().split())
if k<a+b:
  if a<k:
    b=b-(k-a)
    print("0 "+str(b))
  else:
    a-=k
    print(str(a),str(b))
else:
  print("0 0")

Solution (Python):
a,b,k=map(int,input().split())
print(max(0,a-k),max(0,b-max(0,k-a)))

Solution (Python):
A,B,K=map(int,input().split())
if A<=K:
    B-=K-A
    A=0
    if B<0:
        B=0
else:
    A=A-K

print(A,B)

Solution (Python):
a,b,k = map(int,input().split())
if a+b <= k:
  print(0,0)
elif a <= k:
  print(0,a+b-k)
else:
  print(a-k,b)

Solution (Python):
a, b, k = map(int, input().split())
if a >= k:
  print(a-k, b)
elif a+b >= k:
  print(0, a+b -k)
else:
  print(0,0)

Solution (Python):
a,b,k = map(int, input().split())
 
if a > k:
  print(a-k,b)
  
elif a+b>k:
  print(0,b-k+a)
else:
  print(0,0)

Solution (Python):
a,b,k=map(int,input().split())
if a>=k:
    print(a-k,b)

if a<k:
    if b>(k-a):
        print(0,int(b-(k-a)))
    else:
        print(0,0)

Solution (Python):
A, B, K = map(int, input().split())

A -= K
if A < 0:
    B += A
    A = 0

if B < 0:
    B = 0
print(A, B)