peterverebics/CodeNet_Python_118 huggingface dataset:
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)
A, B, K = map(int, input().split())
if A >= K:
    print (A-K, B)
elif A < K <= A+B:
    print (0, A+B-K)
else:
    print (0, 0)
a, b, k = map(int, input().split())
print(max(0, a - k), max(0, b - max(0, k - a)))
a,b,k = map(int,input().split())

print( max(0,a-k), max(0,min(a+b-k,b)) )
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)
A, B, K = map(int, input().split())
print(max(A - K, 0), max(B - max(K - A, 0), 0))
A, B, K = list(map(lambda x: int(x), 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")
a, b, k = map(int, input().split())
if a + b <= k:
    print(0, 0)
else:
    print(0 if a < k else a - k, b + (a - k) if a < k else b)
A, B, K = list(map(int, input().split()))

taka = max(A - K, 0)
aoki = min(max(B + (A - K), 0), B)
print(taka, aoki)
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)
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)
A, B, K = map(int, input().split())

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

if A - K >= 0:
    print(A-K ,B)
elif A + B - K >= 0:
    print(0, A+B-K)
else:
    print(0, 0)
A, B, K = map(int, input().split())
a = max(0, A-K)
b = max(min(B, A+B-K), 0)
print(a, b)
a,b,k=map(int,input().split())
ans=0
if a+b<k:
  print(0,0)
  
elif k <= a:
  ans=a-k
  print(ans,b)
  
else:
  ans=0
  print(ans,b-(k-a))
A, B, K = map(int,input().split())
if K>A and K<(A+B):
    B = B-(K-A)
    l = [0,B]
elif K>A and K>=(A+B):
    l = [0, 0]
else:
    l = [A-K,B]
print(' '.join(map(str, l)))
a, b, k = map(int, input().split())
if a < k:
  k -= a
  a = 0
  b = max(b - k, 0)
else:
  a -= k
print(a, b)
a,b,k = map(int,input().split())

if a > k:
  aa = a - k
  bb = b

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

print(aa , bb)
takahashi, aoki, count = map(int,input().split())
k = count
if takahashi - count >= 0:
  takahashi -= count
else:
  count -= takahashi
  takahashi = 0
  if aoki - count > 0:
    aoki -= count
  else:
    aoki = 0
print(takahashi, aoki)
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)
import sys
input=sys.stdin.readline
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)
import sys
input=sys.stdin.readline
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

a,b,k=MAP()
if a<=k:
    k-=a
    print(0,max(0,b-k))
else:
    print(a-k,b)
if __name__ == '__main__':
    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)
A, B, K = map(int, input().split())
if K <= A:
    print(A - K, B)
else:
    print(0, max(B - (K - A), 0))
a,b,k = map(int, input().split())

if a >= k:
    print(a-k, b)
elif k > a and b >= (k-a):
    print(0, b-(k-a))
else:
    print(0, 0)
A,B,K = map(int, input().split())

if A>=K:
    print(A-K,B)
elif (A+B)>K and A<K:
    print(0,B-(K-A))
else:
    print(0,0)
a, b, k = map(int, input().split())
a = a-k
if a < 0:
    b += a
print(max(a, 0), max(b, 0))
a, b, k =map(int, input().split())

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

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

else:
    print(a-k, b)
#abc149b

a,b,k=map(int,raw_input().split())
if a>=k:
 print a-k,b
elif a<k and b>=(k-a):
 print 0,b-(k-a)
else:
 print 0,0
a, b, k = map(int, input().split())
ca = max(0, a-k)
cb = max(0, b - max((k - a), 0))
print(ca, cb)
a,b,k = map(int,input().split())

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

if A - K >= 0:
  res_A = A - K
  res_B = B
else:
  if B - abs(A - K) >= 0:
    res_A = 0
    res_B = B - abs(A - K)
  else:
    res_A = 0
    res_B = 0
print(res_A, res_B)
a,b,k = (int(x) for x in input().split())

if k>=a:
    tn = 0
    an = max(0,b-k+a)
else:
    tn = a-k
    an = b

print(str(tn) + ' ' + str(an))
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)
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)
A, B, K = map(int, input().split())
 
if K <= A:
  A -= K
elif A+B >= K > A:
  B -= K-A
  A = 0
else:
  A, B = 0, 0
  
print(A, B)
import sys
import decimal # 10進法に変換，正確な計算

def input():
    return sys.stdin.readline().strip()

def main():
    a, b, k = map(int, input().split())
    if k <= a:
        print(a-k, b)
        return
    elif k <= a + b:
        print(0, b-k+a)
        return
    print(0, 0)

    
    
main()
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)
A, B, K = map(int, input().split())
A, K = max(0, A - K), max(0, K - A)
B = max(0, B - K)
print(A, B)
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)
# abc149_b.py
A, B, K = map(int,input().split())
print(max(0, A-K), max(0, B - max(0, K-A)))
a,b,k = map(int, input().split())
aa = max(0, a-k)
b = b + min(0, a-k)
print(aa,max(b,0))
a,b,k=map(int,input().split())
if k <= a:
  print(a-k,b)
else:
  print(0,max(0,b-(k-a)))
A, B, K = map(int, input().split())

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

if(K >= A):
    result1 = 0
    x = K - A
    B = B - x
    result2 = B if B >= 0 else 0
else:
    result1 = A - K
    result2 = B

print('{} {}'.format(result1, result2))
A, B, K = map(int, input().split())
if K <= A:
    a = A - K
    b = B
else:
    a = 0
    b = max(0, B - (K-A))
print(a, b)
A, B, K = map(int, input().split())
if A >= K:
  ans_a = A - K
  ans_b = B
elif A < K and A + B >= K:
  K = K - A
  ans_a = 0
  ans_b = B - K
else:
  ans_a = 0
  ans_b = 0
print(str(ans_a) + " " + str(ans_b))
a, b, k = map(int, input().split())
print(0,max(0,b+a-k)) if a<=k else print(a-k,b)
a,b,k=map(int,input().split())
if k<=a:
  a-=k
  print(a,b)
else:
  k-=a
  a=0
  b=max(b-k,0)
  print(a,b)
A,B,K=map(int,input().split())

if K-A>=0:
  print(0,max(0,B-K+A))
else:
  print(A-K,B)
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)
A, B, K = map(int, input().split())

if A>K:
    print(A-K,B)
elif A<=K and B+A-K>=0:
    print(0,B+A-K)
else:
    print(0,0)
a, b, k = map(int, input().split())
if a >= k:
    print(a-k, b)
else:
    print(0, max(0, b-k+a))
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);
a,b,k = map(int,input().split())
if a+b<k:
  print(0,0)
if a>k:
  print((a-k),b)
else:
  if b>=(k-a):
    print(0,b-(k-a))
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')
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))
A,B,K = map(int,input().split())

A,rem = max(A-K,0),max(K-A,0)
B = max(B-rem,0)

print(A,B)
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)
A,B,K =map(int,input().split())
if A >= K:
    print(A-K,B)
elif B-(K-A) >= 0:
    print(0,B-(K-A))
else:
    print(0,0)
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)
a,b,k = list(map(int,input().split(" ")))

if a > k:
    a -= k
    print(str(a) + " " + str(b))
else:
    left = k - a
    b -= left
    if b < 0:
        b = 0
    print(str(0) + " " + str(b))
# AtCoder
A, B, K = map(int, input().split())
c = K-A
s = A-K
if 0 > s:
    A = 0
else:
    A = s

if A == 0:
    B = B-c
    if 0 > B:
        B = 0


print(A, B)
a,b,k = map(int,input().split())
if a >= k:
    print(a-k,b)
else:
    print(0,max(0,b-(k-a)))
A, B, K = map(int, input().split())
A_take = min(K, A)
B_take = min(K - A_take, B)
print(A - A_take, B - B_take)
a,b,k=map(int, input().split())
if a+b-k>0:
  if a>=k:
    print(a-k, b)
  else:
    print(0, b-(k-a))
else:
  print(0,0)
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)
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))
a, b, k = map(int, input().split())
print(min(a, max(a-k, 0)), min(b, max(b-k+a, 0)))
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60


def main():
    A, B, K = map(int, readline().split())
    if K <= A:
        print(A - K, B)
    elif K <= A + B:
        print(0, A + B - K)
    else:
        print(0, 0)

    return


if __name__ == '__main__':
    main()
A,B,N = map(int,input().split())
if A>=0:
  if N<=A:
    print(A-N,B)
  else:
    N = N-A
    if N<=B:
      print(0,B-N)
    else:
      print(0,0)
a,b,k = map(int,input().split())

if a == k :
    print(0,b)
elif a > k :
    print(a-k,b)
elif a < k :
    c = b - (k-a)
    if c >= 0 :
        print(0,c)
    else :
        print(0,0)
A, B, K = map(int, input().split(' '))
if A < K:
    K = K - A
    A = 0
else:
    A = A - K
    K = 0
if B < K:
    K = K - B
    B = 0
else:
    B = B - K
    K = 0
print(A, B)
# Greedy Takahashi

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

# solve
resA = max(0, A - K)
resB = max(0, B - max(0, K - A))

# output
print(resA, resB)
T, S, K = list(map(int, input().split()))

if T - K > 0:
    print(T - K, S)
elif T - K + S < 0:
    print(0, 0)
else:
    print(0, T - K + S)
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)
A,B,K=map(int,input().split())
print(max(0,A-K),max(0,B-abs(max(0,K-A))))
a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
if x >= z:
    a_b = str(x-z)
    print(a_b +' '+ str(y))
elif x+y >= z:
    a_c = str(x+y-z)
    print('0 ' + a_c)
else:
    print('0 0')
a, b, k = map(int, input().split())

print(max(0, a - k), end = ' ')
print(max(0, b - max(0, k - a)))
a,b,k=map(int,input().split());print(max(0,a-k),max(min(b,b+a-k),0))
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)
a = [int(i) for i in input().split()]

if a[0]+a[1]<=a[2]:
    print(0,0)
elif a[0]>=a[2]:
    print(a[0]-a[2],a[1])
elif a[0]<a[2]:
    b = a[2]-a[0]
    print(0,a[1]-b)
a,b,k = (int(x) for x in input().split())
if k > a:
    b = max(0, b-k+a)
    a = 0
else:
    a = a - k
print(a,b)
A,B,K = map(int,input().split())

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

if A-K >= 0:
    print(A-K, B)
else:
    print(0, max(0, B - (K - A)))
a, b, k = map(int, input().split())
if a + b <= k:
    print("0 0")
elif a >= k:
    print("{} {}".format(a-k, b))
elif k > a:
    print("{} {}".format(0, b+a-k))
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)
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)
inp=input().split()
a = int(inp[0])
b = int(inp[1])
k = int(inp[2])
if (k>=a+b):
    print('0 0')
else:
    if (a>=k):
        print('{} {}'.format(a-k, b))
    else:
        print('0 {}'.format(a+b-k))
A,B,K = map(int,input().split())
if A >= K:
    A -= K
    K = 0
else:
    K -= A
    A = 0
if B >= K:
    B -= K
else:
    B = 0
print(A,B)
n, m, k = [int(s) for s in input().split()]
if k - n > 0:
  print(0, max(0, m - k + n))
else:
  print(n - k, m)
a,b,k = map(int,input().split())
if a >= k:
  print(a-k,b)
else:
  print(0,max(0, a+b-k))
a, b, k = map(int, input().split())
print(max(0, a-k), max(0, b-max(k-a, 0)))
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

a,b,k = inm()
print("{} {}".format(max(0,a-k), max(0,b-max(0,k-a))))
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)
a, b, k = map(int, input().split())

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

print(a, b)
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()
a, b, k = map(int, input().split())

if a >= k:
    a-=k
    print(a, b)
else:
    k -= a
    a = 0
    b = max(0, (b - k))
    print(a, b)
def main():
    a, b, k = map(int, input().split(" "))
    temp = min(a, k)
    a -= temp
    k -= temp
    b -= min(b, k)
    print(a, b)
main()
A, B, K = map(int, input().split())
a = max(0, A-K)
K = max(0, K-A)
b = max(0, B-K)
print(str(a) + ' ' + str(b))
a,b,k = map(int, input().split())
if k > a and k >= a+b:
  print( 0 , 0 )
elif k < a :
  print(a-k , b)
elif k == a:
  print(0 , b)
elif k>a and k < a+b:
  print(0 , b-(k-a))
A, B, K = map(int, input().split(" "))

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

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

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

print(ans1,ans2)
a, b, k = [int(x) for x in input().split()]
if a >= k:
  a -= k
else:
  b -= k - a
  b = max(0, b)
  a = 0
print(a, b)
A, B, K = map(int, input().split())

ans = 0
if A >= K:
  print(str(A-K) + " " + str(B))
else:
  K -= A
  print(str(0) + " " + str(max(0, B-K)))
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)
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)
a, b, k= map(int, input().split(" "))
if a > k:
    a -= k
else:
    k-=a
    a = 0
    if b > k:
        b-=k
    else:
        b = 0

print(a, b)
A, B, K= map(int, input().split())
 
if A >= K:
  ans_t = A - K
  ans_a = B
elif B >= ( K - A):
  ans_t = 0
  ans_a = B - ( K - A)
else:
  ans_t = 0
  ans_a = 0
 
print( '{} {}'.format( ans_t, ans_a))
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('b1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    A, B, K = read_int_list()
    a = A - K
    if a < 0:
      a = 0

    b = B - abs(A - K)
    if b < 0:
      b = 0
    if A > K:
      b = B

    if A == 0 and B == 0:
      a = b = 0
    print(a, b)


main()
import copy
def main():
    A, B, K = map(int, input().split())
    alterK = copy.copy(K)
    K = K - A
    if K > 0:
        B = B - K
        if B <= 0:
            print('0 0')
            return
        else:
            print('0 ' + str(B))
            return
    else:
        print(str(A - alterK) + ' ' + str(B))
        return
main()
def main():

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

    if A > K:
        A -= K
    else:

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

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


if __name__ == "__main__":
    main()
r=input().split()
A=int(r[0])
B=int(r[1])
K=int(r[2])
if K>=A+B:
    print("0 0")
elif K>=A:
    print("0 "+str(B-K+A))
else:
    print(str(A-K)+" "+str(B))
A,B,K=map(int,input().split())
ans=[0]*2

if A>=K:
  ans[0]=A-K
  ans[1]=B
else:
  ans[1]=max(0,B-(K-A))

print(ans[0],ans[1])
a, b, k = map(int, input().split(' '))

if k >= a+b: print("0 0")
else:
    if a > k:
        print(a-k, b)
    else:
        if b-k+a >= 0:
            print(0, b-k+a)
        else:
            print(0, 0)
A,B,K = map(int,input().split())
if K<=A:
    print(A-K,B)
else:
    print(0,max(0,A+B-K))
def main():
    a, b, k = map(int, input().split())
    if a > k:
        c = a-k
        d = b
    else:
        c = 0
        d = b-(k-a)
    if d < 0:
        print(0, 0)
    else:
        print(c, d)


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

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

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

print(A,B)
args=input().split()

A=int(args[0])
B=int(args[1])
K=int(args[2])

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


print(A,B)
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60


def main():
    A, B, K = map(int, readline().split())

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

    return


if __name__ == '__main__':
    main()
A,B,K=map(int, input().split())
count=0
if (A-K)<0:
    B=B+A-K
    A=0
    if B<0:
        B=0
else:
    A=A-K
print(A,B)
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)
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b,k = map(int,input().split())
"""for i in range(k):
    if a > 0: a-=1
    elif b > 0: b-= 1"""
if a>k: a,b = a-k,b
elif k <= a+b: a,b = 0,b+a-k
else: a,b = 0,0
print(a,b)
a,b,k = map(int,input().split())
if a<=k:
  print(0,max(a+b-k,0))
else:
  print(a-k,b)
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)
A, B, K = map(int, input().split())
i = 0

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

print(A)
print(B)
#!/usr/bin/env python3
a, b, k = map(int, input().split())
if k >= a + b:
    print(0)
    print(0)
elif a > k:
    print(a-k)
    print(b)
else:
    print(0)
    print(b+a-k)
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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

print(max(0, A-K), max(0, min(B, B-(K-A))))
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)
a,b,k = map(int,input().split(" "))
if a+b<k:
	print(0,0)
elif a<k:
	print(0,b-k+a)
elif a>=k:
	print(a-k,b)
a,b,k=[int(i) for i in input().split()]
n=a-k if a-k>0 else 0
m=b if n>0 else a+b-k if a+b-k>0 else 0
print(n,m)
A,B,K=map(int, input().split())

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

    a -= k

    if a < 0:
        return (0, b+a) if b+a > 0 else (0, 0)
    else :
        return (a, b)

def main():
    a, b, k = map(int, input().split())
    print(*greedyTakahashi(a, b, k))

if __name__ == '__main__':
    main()
a,b,k = map(int,input().split())
if a > k:
    a -= k
    k = 0
else:
    k -=a
    a = 0
if b > k:
    b -= k
else:
    b = 0
print(a,b)
a,b,k = map(int, input().split())

if k <= a:
    print(a-k,b)
else:
    rem = k-a
    if rem <= b:
        print(0, b-rem)
    else:
        print(0,0)
A, B, K = map(int, input().split())

# takahashi has A cookies, aoki has B cookies
# takahashi eats K times

if K >= A+B:
	print(0, 0)
elif K > A:
	print(0, B-(K-A))
else:
	print(A-K, B)
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))
A,B,K=map(int,input().split())
if A>=K:
  print (A-K,B)
else:
  if A+B>=K:
    print(0,A+B-K)
  else:
    print(0,0)
from sys import stdin
import math

a, b, k = [int(x) for x in stdin.readline().rstrip().split()]

if a >= k:
    print(str(a - k) + ' ' + str(b))
elif a + b >= k:
    print('0 ' + str(a + b - k))
else:
    print('0 0')
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)
tc, ac, tasks = map(int, input().split())

if tasks >= (tc + ac): tc, ac = 0,0
else:
  if tc >= tasks: tc -= tasks
  else: tc,ac = 0,ac + tc - tasks


print(tc, ac)
def main():
	a,b,k = list(map(int,input().split()))	
	if a>=k:
		print(str(a-k),str(b))
	elif a<k and b+a>k:
		print(str(0),str(b-(k-a)))
	else:
		print(str(0),str(0))
main()
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

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

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

if __name__ == '__main__':
    main()
a, b, k = map(int, input().split())
if k <= a:
  print(a-k,b)
elif k-a<=b:
  b=b-(k-a)
  print(0,b)
else:
  print(0,0)
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)])))
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)
a, b, k = 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)
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    A, B, K = map(int, readline().split())

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

    print(A, B)


if __name__ == '__main__':
    main()
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)
A,B,K=map(int,input().split())
if A>=K:
    c=A-K
    d=B
elif A==0 and B>=K:
    c=0
    d=B-K
elif A+B<=K:
    c=0
    d=0
else:
    d=B-(K-A)
    c=0
print(str(c)+' '+str(d))
def cookie(a, b, n):
    
    if a >= n:
        return [a-n, b]
    elif n < a+b:
        
        return[0, b-(n-a)]
    else:
        return [0, 0]

if __name__ == "__main__":
    a, b, n = map(int, input().split())
    j = cookie(a, b, n)
    print(j[0], j[1])
a,b,k=map(int,input().split())
if a>=k:
    print(a-k,b)
elif a<k<a+b:
    print(0,a+b-k)
else:
    print(0,0)
num = list(map(int,input().split()))

a = num[0]
b = num[1]

if a+b<=num[2]:
  a=0
  b=0
elif a+b>num[2] and a>num[2]:
  a = a - num[2]
elif a+b>num[2] and a<=num[2]:
  b = b - (num[2] - a)
  a = 0


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

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