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())
b_ = b
if a - k < 0:
    b_ = b + (a - k)
print(max(0, a - k), max(0, 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(max(0,a-k),b)
else:
    print(0, max(a+b-k,0))

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

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

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 = map(int, input().split())

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

Solution (Python):
In = input().split(" ")
T = int(In[0])
A = int(In[1])
K = int(In[2])
 
if K <= T:
  print("{0} {1}".format(T-K,A))
elif K <= T+A:
  print("0 {0}".format(A-(K-T)))
else:
  print("0 0")

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    a,b,k=map(int,input().split())
    if(a>=k):
        print(a-k,b)
    else:
        k-=a
        b=max(0,b-k)
        print(0,b)
resolve()

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

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

Solution (Python):
import sys
bbn=1000000007
	

		
def main():
	a, b, k = map(int, input().split())
	ret_a=a
	ret_b=b
	if a >= k:
		print(str(a-k)+' '+str(b))
	elif a+b >= k:
		print('0 '+str(a+b-k))
	else:
		print('0 0')
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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

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

RA = max(A - K, 0)
KK = max(K - A, 0)
RB = max(B - KK, 0)

print('{} {}'.format(RA, RB))

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

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

Solution (Python):
a=[int(i) for i in input().split()]
if a[0]+a[1]<=a[2]:
    print(0,0)
else:
    if a[0]<=a[2]:
        print(0,a[1]-(a[2]-a[0]))
    elif a[0]>a[2]:
        print(a[0]-a[2],a[1])

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

if k < a:
    a = a-k
    b = b
    print(str(a) + " " + str(b))
elif k >= a and k-a < b:
    b = b - (k-a)
    print(str(0) + " " + str(b))
elif k >= a and k-a >= b:
    a = 0
    b = 0
    print(str(0) + " " + str(0))

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

Solution (Python):
from sys import stdin, stdout

input = stdin.readline()[:-1].split(' ')

takahashi = int(input[0])
aoki = int(input[1])
k = int(input[2])

if k > 0:
    if takahashi > k:
        prev_k = k
        takahashi = takahashi - prev_k
        k = prev_k - takahashi
    else:
        k = k - takahashi
        takahashi = 0

if k > 0:
    if aoki > k:
        aoki = aoki - k
    else:
        aoki = 0

print('{} {}'.format(takahashi, aoki))

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

Solution (Python):
x = input().split()
A = int(x[0])
B = int(x[1])
K = int(x[2])

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

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

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

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


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

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

a=0
b=0

if A>=K:
    a=A-K
    b=B
elif B-(K-A)>=0:
    b=B-(K-A)
else:
    pass

print(a,b)

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

Solution (Python):
l = list(map(int, input().split()))
a =l[0]
b =l[1]
k =l[2]

t = a - k
if (t < 0):
    a = 0
    u = b + t
    if(u < 0):
        b = 0
    else:
        b = u
else:
    a = t

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

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

Solution (Python):
import sys

sys.setrecursionlimit(1000000000)


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

if a >= k:
    a = a - k
    print("{} {}".format(a, b))
elif k > a and a + b >= k:
    b = a + b - k
    print("{} {}".format(0, b))
else:
    print("{} {}".format(0, 0))

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

Solution (Python):
A, B, K = list(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)
elif A+B>K:
    print(0,A+B-K)
else:
    print(0,0)

Solution (Python):
t_a_k = list(map(int,input().split()))

a = 0
b = 0

c = t_a_k[0] - t_a_k[2]

if c >= 0:
    print("{0} {1}".format(c, t_a_k[1]))
elif c < 0:
    d = c + t_a_k[1]
    if d < 0:
        print("0 0")
    else:
        print("0 {0}".format(d))

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

Solution (Python):

A, B, K = (int(n) for n in input().split())

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

Solution (Python):

a,b,c=map(int,input().split())
if a==0 and b==0:
	print("0 0")
elif a==0 and b>0:
	if b>c:
		print("0",b-c)
	elif c>=b:
		print("0 0")
elif b==0 and a>0:
	if a>c:
		print(a-c,"0")
	elif c>=a:
		print("0 0")
elif a+b==c:
	print("0 0")
elif a>c:
	print(a-c,'',b)
elif c>=a:
	i=c-a;
	if(b>i):
		j=b-i
	else:
		j=0
		
	print("0",j)

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

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

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

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

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

Solution (Python):
def main():
    numbers = input().split(" ")
    takahashi = int(numbers[0])
    aoki = int(numbers[1])
    repeat = int(numbers[2])
    if repeat == 0:
        pass
    elif takahashi >= repeat and takahashi > 0:
        takahashi -= repeat
    elif aoki == 0:
        takahashi -= min(takahashi, repeat)
    elif takahashi == 0 and aoki >= repeat:
        aoki -= repeat
    elif takahashi + aoki < repeat:
        aoki = 0
        takahashi = 0
    else:
        aoki += takahashi
        aoki -= repeat
        takahashi = 0

    print(str(takahashi) + " " + str(aoki))


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

Solution (Python):

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

main()

Solution (Python):
maisu = [int(i) for i in input().split()]

if maisu[0] + maisu[1] <= maisu[2]:
    print(0, 0)

elif maisu[0] >= maisu[2]:
    print((maisu[0] - maisu[2]), maisu[1])
    
elif maisu[0] < maisu[2]:
    print(0, maisu[1] - (maisu[2] - maisu[0]))

Solution (Python):
a, b, k = [int(i) for i in input().split(' ')]
if(k>a):
    k -= a
    a = 0
    if(k>b):
        b = 0
    else:
        b -= k
else:
    a -= k
print(str(a) + ' ' + str(b))

Solution (Python):
a,b,k=map(int,input().split())
if (a-k)>=0:
    a=a-k
    b=b
elif (a-k)<0:
    b=b-(k-a)
    if b<0:
        b=0
    a=0
print("{} {}".format(a,b))

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

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


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


if A or B:
    for i in range(K):
        if A >= 1:
            A -= 1
        elif B >= 1:
            B -= 1
        else:
            pass

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

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

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

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

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

    print(A, B)


if __name__ == '__main__':
    main()

Solution (Python):
t, a, times = [ int(i) for i in input().split(" ")]
 
a_count = times - t
if t == 0 and a == 0:
  print(0, 0)
elif a_count <= 0:
  print(t-times, a)
else:
  if a_count > a:
    print(0, 0)
  else:
    print(0, a-a_count)

Solution (Python):
def f(x, k):
    delt = min(x, k)
    return x - delt, k - delt


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

Solution (Python):
in_li = list(map(int,input().split()))
A = in_li[0]
B = in_li[1]
K = in_li[2]
if A + B <= K :
    print("0 0")
else :
    if A > K :
        print(A-K,"",B)
    elif B > K - A :
        print("0",B-(K-A))

Solution (Python):

strings = input().split(' ')
A = int(strings[0])
B = int(strings[1])
K = int(strings[2])

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

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

a = min(A, K)
A -= a
K -= a

b = min(B, K)
B -= b

print(A, B)

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

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

Solution (Python):
a,b,k=input().split()
aa=int(a)
bb=int(b)
kk=int(k)
res=(aa+bb)-kk
if res<=0:
    print(0,'',0)
elif aa>kk:
    print(aa-kk,'',bb)
elif aa<=kk:
    print(0,'',res)

Solution (Python):



if __name__=='__main__':
  a, b ,c= map(int, input().strip().split())
  if a>c:
    a=a-c
  else:
    b=b+a-c
    a=0
    if b<0:
      b=0
  
  print(a,b)

Solution (Python):


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

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

print(A, B)

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

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

Solution (Python):
a,b,k=input().split()
aa=int(a)
bb=int(b)
kk=int(k)
res=(aa+bb)-kk
if res<=0:
    print(0,'',0)
elif aa>kk:
    print(aa-kk,'',bb)
elif aa<=kk:
    print(0,'',res)

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def solve():
    a, b, k = LI()
    A = max(0, a - k)
    k = k - (a - A)
    B = max(0, b - k)
    print(A,B)
    return



if __name__ == '__main__':
    solve()

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

K1 = K - A

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

if K1 > 0:
    if B >= K1:
        B = B - K1
    else:
        B = 0
        

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

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

if K < A:
    print(A - K, B)
    sys.exit()

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

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




def main(a, b, k):
    if a == 0 and b == 0:
        print(0, 0)

    elif k <= a:
        print(a - k, b)

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

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


main(A, B, K)

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

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

Solution (Python):
from sys import stdin

A, B, K = [int(x) for x in stdin.readline().rstrip().split()]

if A <= K:
    K_ = K-A
    A = 0
    if B <= K_:
        print("0 0")
    else:
        print("0 {}".format(B-K_))

else:
    print("{} {}".format(A-K, B))

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

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

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

print(str(x) + " " + str(y))

Solution (Python):

import sys


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

    a = A - K
    if a < 0:
        ans_b = B + a
    else:
        ans_b = B
    print(max(a, 0), ans_b)



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())

ans = 0
if 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:
  print(a - k, b)
else:
  print(0, max(0, b - (k - a)))

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

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

print(int(a),int(b))

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





if (a + b) <= k:
    a = 0
    b = 0
elif a <= k:
    b = b - (k - a)
    a = 0
else:
    a = a - k
    b = b
    
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, B-(K-A))
else:
    print(0, 0)

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

Solution (Python):


def resolve():
    A, B, K = map(int, input().rstrip().split())

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


if __name__ == "__main__":
    resolve()

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

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

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+b <= k:
    a = b = 0
else:
    if a > k:
        a -= k
    else:
        b -= k-a
        a = 0
        
print(a,b)

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

print(A, B)

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

Solution (Python):
import sys
input = sys.stdin.readline

def print_ans(A, B, K):
    """Test Case
    >>> print_ans(2, 3, 3)
    0 2
    >>> print_ans(500000000000, 500000000000, 1000000000000)
    0 0
    """
    if K <= A:
        print(str(A-K) + " " + str(B))
    elif K <= A + B:
        print("0 " + str(A + B - K))
    elif K > A + B :
        print("0 0")


if __name__ == '__main__':
    A, B, K = map(int, input().rstrip().split())
    print_ans(A, B, K)

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

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

Solution (Python):

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

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

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

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

if K >= A+B:
    print(str(0)+' '+str(0))

elif K < A:
    print(str(A-K)+' '+str(B))

elif K >= A:
    print(str(0)+' '+str(B-(K-A)))

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

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

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

if K <= A:
  print(A - K, B)
elif A < K <= A + B:
  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)
else:
  print(0,max(b+a-k,0))

Solution (Python):

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


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

else:
    K -= A
    A = 0

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

else:
    B = 0
    
print("{} {}".format(A, B))

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

if a >= k:
  a -= k
  print(str(a)+" "+str(b))

elif a< k and a+b >=k:
  b -= (k-a)
  a = 0
  print(str(a)+" "+str(b))

else:
  a = 0
  b = 0
  print(str(a)+" "+str(b))

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

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 < K and (A + B) > K:
    print(0, A + B - K)
else:
    print(0, 0)

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

    if a == b == 0:
        print(0, 0)
        return

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

    print(a, b)


if __name__ == '__main__':
    main()

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

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

print(a,b)

Solution (Python):
ABK = input().split()
A = int(ABK[0])
B = int(ABK[1])
K = int(ABK[2])

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

    if (B <= 0):
        B = 0
else:
    A -= K

print(str(A) + " " + str(B))

Solution (Python):
a=list(map(int, input().split()))
taka=a[0]
ao=a[1]
K=a[2]
if K==taka:
    print(0,ao)
elif K<taka:
    print(taka-K,ao)
elif K>taka and K-taka<=ao:
    print(0,ao-(K-taka))
elif K>taka and K-taka>=ao:
    print(0,0)

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

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

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

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):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

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

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

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

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("{} {}".format(0, max(b - k + a, 0)))
else:
    print("{} {}".format(a - k, b))

Solution (Python):
a = list(map(int,input().split()))
b = a[0] - a[2]
if b <= 0:
  ans = a[1] + b
  if ans < 0:
    print('0 0')
  else:
    print('0 {}'.format(ans))
elif b == 0:
  print('0 {}'.format(a[1]))

elif b > 0:
  print('{} {}'.format(b, a[1]))

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (a, b, k) = [int(e) for e in lines[0].split(" ")]

    return (a, b, k)


def solve(a, b, k):

    a2 = a
    b2 = b
    if a >= k:
        a2 = a - k
        b2 = b
    else:
        a2 = 0
        b2 = max([b - (k - a), 0])

    return [a2, b2]


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        print("%d %d" % (result[0], result[1]))
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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

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 k>a+b:
  print('0 0')
elif k>a:
  print('0 {}'.format(b-k+a))
else:
  print('{} {}'.format(a-k,b))

Solution (Python):
import sys
input = sys.stdin.readline

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

if A + B <= K:
    print(0, 0)
    exit()

if K <= A:
    print(A - K, B)
    exit()

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

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

Solution (Python):

import sys


def solve(A: int, B: int, K: int):
    if (A<K):
        print(0,max(0,B+A-K))
    else:
        print(A-K,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 = list(map(int, input().split()))
if(a >= k):
  print(a-k, b)
  exit()
print(0, max([b-(k-a),0]))

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

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

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

Solution (Python):
data = input().split(' ')

data_int = [int(data[i]) for i in range(3)]

if(data_int[0] - data_int[2] >= 0):
    print(str(data_int[0] - data_int[2]) + ' ' + str(data_int[1]))
else:
    result = data_int[1] - (data_int[2] - data_int[0])
    if(result < 0 ):
        result = 0
    print('0 ' + str(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("0 "+str(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, A + B - K)
else:
    print(0,0)

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

Solution (Python):
def main():
    s = input()
    items = s.split()
    A = int(items[0])
    B = int(items[1])
    K = int(items[2])

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


if __name__ == '__main__':
    main()

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

def print_ans(A,B):
        print(A,end=" ")
        print(B)


if A+B<=K:
    print("0 0")
elif A==B and A==0:
    print(A,end=" ")
    print(B)
else:

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

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

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

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

print(A, B)

Solution (Python):



def main():
    (a, b, k) = map(int, input().split(" "))
    if a > k:
        print("%d %d" % (a - k, b))
    elif a + b > k:
        r = k - a
        print("%d %d" % (0, b - r))
    else:
        print("0 0")


if __name__ == '__main__':
    main()

Solution (Python):
x = input().split()
total = int(x[0]) + int(x[1])
k = int(x[2])
if(total <= k):
  print('0 0')
else:
  if(k <= int(x[0])):
    print(str(int(x[0]) - k) + ' ' + x[1])
  else:
    print('0 ' + str(total - k))

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

Solution (Python):
str=input().split(" ")

a = int(str[0])
b = int(str[1])
c = int(str[2])

taka = a - c
if taka < 0:
    taka = 0

res = a - c
if res > 0:
    res = 0

ao = res + b
if ao < 0:
    ao = 0

print(taka, end = " " )
print(ao)

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

p = k
if a < k:
    k = k - a
    a = 0
else:
    k = k - a
    a = a - p

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
li = [int(i) for i in input().split()]
A = li[0]
B = li[1]
K = li[2]
A-=K
de = 0
if A <= 0 :
    de = abs(A)
    A = 0
B -= de
if B <= 0 :
    B = 0
print(A,B)

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))

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

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

Solution (Python):
cookies = [int(x) for x in input().split()]
leftOver = cookies[0] - cookies[2]
takahashi = max(0, leftOver)
print(str(takahashi)+ ' ' + (str(cookies[1]) if takahashi > 0  else str(max(0,cookies[1] - abs(leftOver)))))