peterverebics/CodeNet_Python_118 huggingface dataset:
a = [int(i) for i in input().split()]


for I in range(a[2]):
    if a[0] and a[1] == 0:
        print(0,0)
        break
    elif a[0]+a[1] < a[2]:
        print(0,0)
        break
    elif a[0]>=1:
        a[0] = a[0]-1
        if I == 2:
            print(a[0],a[1])
    elif a[0] < 1 and a[1]>=1:
        a[1] = a[1]-1
        if I == 2:
            print(a[0],a[1])
a,b,k=map(int,input().split())
if a > k:
    print(a-k,b)
else:
    print(0,b-(k-a))
a,b,c = map(int, input().split())
print(max(a - c, 0), b + min(a - c, 0))
a, b, c = input().split()
x = int(a)
y = int(b)
z = int(c)
if z >= x:
    z -= x
    x = 0

else:
    x -= z
    z = 0

if z >= y:
    z -= y
    y = 0

else:
    y -= z
    z = 0
a,b,k=map(int, input().split())
for i in range(k):
    if a>0:
        a -=1
    elif b>0 :
        b -=1
    else:
        exit()
print('{} {}'.format(a, b))
a,b,k = map(int, input().split())
num = a + b - k
if(num <= 0):
  print(0, 0)
elif(a - k >= 0):
  print(a - k, num)
else:
  print(0, num)
A, B, K = map(int, input().split())
C = K - A
if A >= K:
  A -= K
else:
  A *= 0
  B -= C
print(A, B)
a,b,k=map(int,input().split())
if a+b<=k:
    print(0,0)
elif a<b:
    print(0,a+b-k)
else:
    print(a-b-k,0)
a,b,c=map(int,input().split())
if a>c:
    print(a-c,b)
elif a<=c and b<=(a-c):
    print(0,0)
else:
    print(0,b-(c-a))
def main():
    A, B, K = map(int, input().split())
    print(max(0, A-K), max(0, B-(K-A)))


if __name__ == "__main__":
    main()
A, B , K = map(int,input().split())
if K >= A &K >= B:
    print(0, 0)
elif K >= A:
    print(0, B-K)
elif K >= B:
    print(A-K, 0)
else:
    print(A-K, B-K)
a,b,k = map(int,input().split())
while k > 0:
  if a == b:
    k = 0
    a -= k//2 + k%2
    b -= k//2
  elif a > b:
    k -= a-b
    a = b
  elif b > a:
    k -= b-a
    b = a
print(a,b)
a,b,k=map(int,input().split())

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

S=max([0,A-K])
T=max([0,B-(K-A)])

print(str(S)+" "+str(T))
a = input().split(" ")
a[0] = int(a[0])
a[1] = int(a[1])

if not a[0] == 0 and a[1] == 0:
  for i in range(0, int(a[2])):
      if a[0] >= 1: 
        a[0] -= 1
      elif a[1] >= 1:
        a[1] -= 1
      else:
        break
print(str(a[0]) + " " + str(a[1]))
a, b, k = map(int, input().split())

if k > a + b:
    ans_a = 0
    ans_b = 0
if a >= k:
    ans_a = a - k
    ans_b = b
else:
    ans_a = 0
    ans_b = b - (k - a)

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

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

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

if a < k:
    print(0, a+b-k)
else:
    print(a-k)
a,b,k = map(int,input().split())
#print(a)
#print(b)
#print(k)
i = 0
#ans = [int(a),int(b)]
while i <= k:
    i += 1
    #print(i)
    if a >= 1:
        a = a-1
        #print('a='+str(a))
    elif a < 1 & b >= 1:
        b =b - 1
        #print('b='+str(b))
    else:
        break
#ans = [int(a),int(b)]
print(str(a)+' '+str(b))
def cookies(takahashi, aoki, action):
  for i in range(action):
    if takahashi > 0:
      takahashi -= 1

    elif aoki > 0:
      aoki -= 1
      
    else:
      break
      
  return takahashi, aoki
a,b,k=map(int,input().split())
for i in range(1,k+1):
  if a>0:
    a-=1
  elif a<0 and b>0:
    b-=1
print(a,b)
a,b,k=map(int,input().split())
if a >= k:
  a -= k
elif a < k and a+b>=k:
  a = 0
  b -= (k-a)
elif a+b < k:
  a = 0
  b = 0
print(a,b)
a, b, k = map(int, input().split())
print(max(a-k, 0), max(b+a-k, 0))
A, B, K = map(int, input().split())

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

elif A<K and K-A>B:
    print(0,0)
x = input().split()
 
a = int(x[0])
b = int(x[1])
k = int(x[2])
 
if(a >= k):
  print(a-k,b)
elif(a < k and (a-k) <b):
  print(0,b-(k-a))
elif(a < k and (a-k) > b):
  print(0,0)
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())
a = min(a - k, 0)
k -= a
b = min(b-k, 0)
print(a, b)
a,b,k=map(int, input().split())
print( max(0,a-k), min(b,a+b-k) )
A, B, K = map(int, input().split())

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

def eat_cookie(A,B,K):
    if A >= K:
        return A-K,B
    else:
        return 0,B-K+A


resultA,resultB = eat_cookie(A,B,K)
print(resultA,resultB)
a,b,k = map(int, input().split())
if k <= a: print(k-a, b)
elif k-a <= b: print(0, b-k+a)
else: print(0, 0)
A,B,K = map(int,input().split())
if A - K < 0:
    B = B + A - K 
    A = 0
elif A - K <= 0:
    A = A - K
print(A,B)
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

A, B, K = input_nums()

res_a = A - K if A >= K else 0
remain = K - A
res_b = B - remain if B >= remain else 0
print('{} {}'.format(res_a, res_b))
A,B,K = map(int,input().split())

a = 0
b = 0

if A <= 10**12 and B <=10**12 and K <= 10**12:
    if A >= K :
        a = A-K
    elif  (A + B) > K:
        a = 0
        b = B-(K-A)
    elif  (A + B)  < K:
        a = 0
        b = 0
else :
     a = 0
     b = 0
     
    


print(a,b,end='')
A,B,K=map(int,input().split())
if A>K:
    A=A-K
else:
    B=B-(K-A)
    A=0
print(A,B)
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,k=INTM()
    if k<=a:
        a=a-k
    else:
        b=b-(k-a)
        a=0
    print(a,b)
if __name__ == '__main__':
    do()
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
print(A,B)
a, b, k = map(int, input().split())
a, k = max(0, a-k), k-a
b = max(0, b-k)
print(a, b)
a,b,k = map(int,input().split())
if(a < k):
  print(a + b -k)
else:
  print(a -k)
A, B, K =map(int, input().split())
if K <= A:
    print(A-K, B)
elif A == B and A == 0:
    print(A, B)
else:
    print(0, A+B-K)
#ABC149 B

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

if A>100000000000:
    print("0 0")
elif B>100000000000:
    print("0 0")
elif K>1000000000000:
    print("0 0")
else:
    i=0
    while i<K:
        if A>0:
            A-=1
            i+=1
        elif B>1:
            B-=1
            i+=1
        else:
            i+=1

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

if A <= K:
    print( 0, B-(K-A) )
elif A >= K:
    print(A-K, B)
else:
    print(A,B)
a, b, k = map(int, input().split())
if a - k < 0:
    print("0 " + str(b - abs(a - k)))
else:
    print(str(a - k) + " " + str(b))
a,b,k=map(int,input().split())
m=max(a,k)
a-=m
k-=m
b-=k
print(a,max(b,0))
a,b,k = input().split(" ")
a = int(a)
b = int(b)
k = int(k)
c = a + b
if k >= a:
    b = c - k
    a =0
else:
    a = a - k
print(str(a) + " "+ str(b))
a, b, k = map(int,input().split())
ans_a = a - k
if ans_a < 0:
    ans_a = 0
ans_b = b - (k - a)
if ans_b < 0:
    ans_b = 0
print(str(ans_a) + " " + str(ans_b))
A, B, K = map(int, input().split())
if A <= K:
    B -= K - A
    A = 0
else:
    A -= K
print(A, B)
# input
A, B, K = map(int, input().split())

# check
if A <= K:
    A = 0
    K = K - A
    B -= K
else:
    A -= K

print(A, B)
T,A,K = map(int,input().split())
if T<=K:
    print(0,T+A-K)
else:
    print(T-K,A)
input1 = input()
a = int(input1.split()[0])
b = int(input1.split()[1])
c = int(input1.split()[2])

if a + b > c:
    if a >= c:
        a = a -c
        c = c - a
    else:
        c = c - a
        a = 0
    if b >= c:
        b = b - c
        c = c - b


else:
    a = 0
    b = 0

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

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

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

if K//2>=A and K//2>=B:
  print('0 0')
elif K//2<=A and K//2<=B:
  if K%2 == 0: 
    X = int(K/2)
    print('{} {}'.format(A-X,B-X))
  else:
    X = int(K//2)
    print('{} {}'.format(A-X-1, B-X))
elif K//2>A:
  X = K//2 - A
  print('0 {}'.format(0,B-A-X))
else:
  X = K//2 - B
  print('0 {}'.format(A-B-X,0))
x = list(map(int, input().split()))
a = x[0] - x[2]
b = x[1]
c = x[2] - x[0]
if a <= 0:
  a = 0
if b >= 0:
  b -= c
print(str(a)+' '+str(b))
a, b, k = map(int, input().split())

if k >= a + b:
    print(0, 0)
else:
    if k < a:
        print(k - a, b)
    else:
        print(0, b-k+a)
"""
author : halo2halo
date : 8, Jan, 2020
problem : ABC149
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A, B, K = map(int, read().decode('utf-8').split())

TA = max(A - K, 0)
AO = min(B, B - (K - A))
print(TA, AO)
A,B,K =map(int,input().split())

if A>=1 and K>0:
    K=K-A
    A=0
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)
a,b,c=map(int,input().split())
x=max(0,a-c)
bb=max(0,c-a)
print(x,b-bb)
A, B, K = map(int, input().split())

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

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

if B <= K:
  K -= B
  B = 0
else:
  B -= K
  K = 0
  
print(A,B)
a,b,k = [int(_) for _ in input().split()]

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

print("{} {}".format(a,b))
a,b,k=map(int,input().split())
if a<k:
    c=b-(k-a)
    print(0,c)
else:
    print(a-k,b)
A, B, K = map(int, input().split())
i = 0
for i in range(K):
  i += 1
  if A >= 1:
    A -= 1
  elif B >= 1:
    B -= 1
  else:
    A += 0
    B += 0

print("高橋君：", A ,"枚、", "青木君：", B, "枚")
A,B,K = map(int,input().split())
if K <= A:
    print(A-K,B)
elif K > A & K <= (A + B):
    print(0,B-(K-A))
else:
    print(0,0)
A, B, K = map(int, input().split())

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


print(A, B)
# n = input()
a,b,k = map(int,raw_input().split())
 
if a>k :
    print a-k,b
elif a<k:
     
    k = k-a
     
    if k > b :
        print 0,0
    else:
        print 0,b-k
a, b, k = map(int, input().split())

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


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

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

n[0]-=n[2]

if n[0]<0:
  n[1]+=n[0]
  n[0]=0
print(n[0],n[1])
a, b, k = map(int, input().split())

if a >= k:
  if b-(k-a) > 0:
    print(0, b-(k-a))
  else:
    print(0, 0)
else:
  print(a-k, b)
a, b, k = [int(i) for i in input().split(" ")]
if a >= k:
    print("%d %d" % (a - k, b))
else: # a < k
    print("%d %d" % (0, b + (a - k)))
a, b, k = map(int, input().split())


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

if((a[0]+a[1]) == a[2]):
    print("0 0 ")

if((a[0]+a[1]) != a[2]):
    if(a[0] >= a[2]):
        a[0] = a[0] -a[2]
    elif(a[1] >= a[2]):
        a[2] = a[2] - a[0]
        a[0] = 0
        a[1] = a[1] -a[2]
    else:
        a[1] = 0
    print("%d %d"%(a[0],a[1]))
A, B, K = map(int, input().split())
if K <= A:
    a = A - K
    b = B
else:
    a = 0
    b = B - (K-A)
print(a, b)
A, B, K = map(int, input().split())

n = 0
while (A >= 1):
    A = A - 1
    n += 1
    #print(A, n)

B_l = B - (K - n)

print(A, B_l)
# Greedy Takahashi

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

# solve
res = [str(s) for s in [max(0, A - K), max(0, B - (K - A))]]

# output
print(' '.join(res))
a, b, k = map(int, input().split())
if a >= k:
    print(a-k, b)
else:
    print(0, b-(k-a))
A, B, K = map(int, input().split())

if A <= K:
    print('{} {}'.format(0, B - (K - A)))
else:
    print('{} {}'.format(A - K, B))
a, b, k = map(int, input().split())
print(max(0, a-k), b - max(0, k-a))
x = list(map(int, input().split()))
a = x[0] - x[2]
c = x[2] - x[0]
b = x[1] - c
if a <= 0:
  a = 0
print(str(a)+' '+str(b))
a,b,k=[int(x) for x in input().split()]

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

if A==0 and B==0:
    a,b = A,B
    print(a,b)
    exit()
elif A<K:
    a=0
    b=B-(K-A)
    print(a, b)
else:
    a=A-K
    b=B
    print(a, b)
n = input().split()
a = int(n[0])
b = int(n[1])
k = int(n[2])

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

  
print(str(a)+" "+str(b))
A,B,K = map(int,input().split())
if A >= 1000000000000 or B >= 1000000000000 or K >= 1000000000000:
  A = 0; B = 0 
for _ in range(K):
  if A >= 1:
    A -= 1
  elif B >= 1:
    B -= 1
  else:
    break
print(A,B)
A, B, K = map(int, input().split())

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

print('{} {}' .format(A, B))
a,b,k = map(int,input().split())
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:
    print(A-K,B)
else:
    print(0,B+A-K)
A,B,K = map(int, input().split())
if A<K:
    A,K = 0,K-A
else:
    A,K = A-K,K-A
print(K)
if B<K:
    B=0
else:
    B-=K
print(A,B)
l = list(map(int,input().split()))

A = (l[0]-l[2])*(l[0]-l[2] > 0)
B = l[1] - (-(l[0]-l[2]))*(l[0]-l[2] < 0)
print(A,B)
A, B, K = [int(_) for _ in input().split()]
if A >= K:
    print(A-K, B)
else:
    print(0, min(0, B-(K-A)))
a, b, k = map(int, input().split())
a2 = max(a-k, 0)
b2 = b - (k - (a - a2))
print(a2, b2)
a,b,k=map(int,input().split())
print(a-k if a>k else 0, b if a>k else b+a-k)
A,B,K = map(int,input().split())
if A+B<K or K >= 1000000000000 or A >= 1000000000000 or B >= 1000000000000 :
  print("0 0")
elif A >= K:
  print(str(A-K)+' '+str(B))
else:
  print(str(0) + ' ' + str(A+B-K) )
a,b,k=map(int,input().split())
if k<=a:
    a-=k
elif k<=a+b:
    a=0
    b-=k-a
else:
    a=0
    b=0
print(a,b)
a,b,k = map(int,input().split())

t_zan = a - k
if t_zan < 0:
  aoki_zan = b + t_zan
  t_zan = 0
else:
  aoki_zan = b

print(str(t_zan) + ' ' + str(aoki_zan))
a, b, k = map(int, input().split())

a = max(a - k, 0)
b = max(b - max(a, 0), 0)
print(a, b)
A, B, K = map(int, input().split())
C = max(0, A-K)
D = A+B-K
print(C, D)
A,B,K = map(int,input().split())
if A+B < K:
    print(0,0)
    exit()
elif A - K < 0:
    B = B + A - K 
    A = 0
elif A - K <= 0:
    A = A - K
print(A,B)
a, b, k = [int(i) for i in input().split()]
if k <= a:
    taka = 0
    aoki = b
elif k > a:
    taka = 0
    aoki = b-(k-a)
elif k > a+b:
    taka = 0
    aoki = 0
print(taka, aoki)
a, b, k = list(map(int, input().split(" ")))

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

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

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

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

if A >= K:
    print(A - K, B)
else:
    print(0, A + B - K)
a,b,k=map(int,input().split())
if a>=k:
    print(a-k,b)
else:
    print(0,b+a-k)
a,b,k=map(int,input().split())
if a>=k:
  print(a-k,b)
if a+b<k:
  print(0,0)
else:
  print(0,a+b-k)
def greedy_takahashi(A, B, C):
    while A > 0 and B >0 and C > 0:
        if A >= 1:
            A -= 1
        elif B >= 1:
            B -= 1
        else:
            continue
        C -= 1
    print(A)
    print(B)
    
A, B, C = input().split()
A, B, C = int(A), int(B), int(C)
greedy_takahashi(A, B, C)
INPUT = list(map(int, input().split()))

A = INPUT[0]
B = INPUT[1]
K = INPUT[2]

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

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

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

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

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

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

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

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

if A >= K :
    print(A-K, B)
else :
    print(K-A, B+A-K)
A, B, K = [int(i) for i in input().split()]

a = max(A - K, 0)
print("{} {}".format(a, B - max(K - A, 0)))
A, B, K = map(int,input().split())
if A >= 10**12 or B >= 10**12 or K >= 10**12:
  print(0,0)
else:
  for _ in range(K):
    if A != 0:
      A = A - 1
    elif B != 0:
      B = B - 1
    else:
      break
  print(A,B)
a,b,k=map(int,input().split())
if a<k:
    b-=k-a
    a=0
else:
    a-=k
print(a,b)
a,b,k=map(int,input().split())
if k-a > 0:
  if b-(k-a) > 0:
    print(0, b-(k-a))
  else:
    print(0, 0)
else:
  print(k-a, b)
def main():
    A,B,K = list(map(int,input().split()))

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


if __name__ == "__main__":
    main()
a, b, k = map(int, input().split())
 
if a > k:
  print(a-k, b)
else:
  if a+b > k:
    print(0, b-(k-a)+1)
  else:
    print(0,0)
A, B, K = map(int, input().split())
t = A - K
print('%d %d' % (max(t, 0), max(t + B, 0)))
import sys
row = sys.stdin.readline

def read_ints(row):
    return list(map(int, row().split()))
  
A ,B ,K = read_ints(row)

result_A = 0 if A < K else A-K
result_B = B -(K-A) if A < K else B
print(result_A,result_B)
a,b,k=map(int,input().split())
if a>=k:
  a-=k
else:
  a=0
  if k!=0:
    b-=(k-a)
    b=max(b,0)
print(str(a)+" "+str(b))
a, b, k = map(int, input().split())
tmp=0
if a > k:
  a-=k
else:
  tmp+=a
  a=0
if b >= k-tmp:
  b-=(k-tmp)
else:
  b=0
print(a,b)
if __name__ == "__main__":
    a, b, k = map(int, input().split())
    ans_a = max(a - k, 0)
    if ans_a == 0:
        k = k - a
    ans_b = max(b - k, 0)
    print(ans_a,ans_b)
A, B, K = map(int, input().split())
print(max(0, A-K), max(0, K-A-B))
import sys
a,b,k = [int(_) for _ in input().split()]

if k == 0:
  print("{} {}".format(a,b))
  sys.exit()

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

print("{} {}".format(a,b))
#ABC149.B
A,B,K = map(int,input().split())
if K<=A:
    print(A-K)
    print(B)
elif A <K and B-K-A <=0:
    print(0)
    print(B-K-A)
else:
    print(0)
    print(0)
A, B, K = map(int, input().split())
if A > K:
    print(A-K, B)
if A == K:
    print(0, B)
if A < K:
    print(0, B - (K - A))
a, b, k = list(map(int, input().split()))
if a-k>0:
    print(a-k,b)
else:
    print(0,a+b-k)
A, B, K = list(map(int, input().split()))
a = max(A - K, 0)
b = max(B - K + A, 0)
print(a, b)
A, B, K = list(map(int, input().split()))
print(max(A + B - K, 0))
A,B,K = map(int,input().split())

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

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


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

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

if a >= k:
    print(a-k,b)
elif a<k<=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
if b <= k:
    k -= b
    b = 0
else:
    b -= k
print(a, b)
A, B, K = list(map(int, input().split()))
 
if A == 0:
  print(0, max(0, B - K))
elif B == 0:
  print(max(0, A - K), 0)
elif K == 0:
  print(A, B)
 
A_from_0 = A
B_from_0 = B
 
if (A_from_0 - K) >= 0:
  A -= K
  K = 0
else:
  A = 0
  K -= A_from_0
  
if (B_from_0 - K) > 0:
  B -= K
  K = 0
else:
  B = 0
  K -= B_from_0
 
if K == 0:
  print(A, B)
if K == 1:
  print(0, 1)
elif K > 1:
  print(0, 0)
A,B,K=map(int,input().split())
if A>=K:
  print(str(K-A)+" "+str(B))
else:
  t=K-A+1
  print("0"+" "+str(t))
A, B, K = tuple(map(int, input().split()))
new_A = max(0, A - K)
K -= A
new_B = max(0, B - K)
print(new_A, new_B)
a, b, k = map(int , input().split())

#もし高橋君がクッキーを 1 枚以上持っているなら、高橋君のクッキーを 1 枚食べる。
#そうでなく、もし青木君がクッキーを 1 枚以上持っているなら、青木君のクッキーを 1 枚食べる。
#高橋君も青木君もクッキーを持っていないなら、何もしない。

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

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

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

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

if a <= k:
  print(k-a,b)
elif a<k<=a+b:
  print(0,b-(k-a))
else:
  print(0,0)
a,b,k=map(int, input().split())
s = a-k if k<a else 0 
t = b if k<a else a+b-k
if (a-k)or(a+b-k): s,t=0,0
print('%d %d'%(s, t))
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()
    
if a <= k:
    print(0, b -(k-a))
else:
    print(k-a, b)
inp=input()
a,b,c = inp.split()
a=int(a)
b=int(b)
c=int(c)
a = a-c
b = b+min(0,a)
a=max(a,0)
print(a,b)
a,b,k=map(int,input().split())
if a-k>0:
    print(str(a-k)+" "+str(b))
elif a-k <= 0:
    print(str(0)+" "+str(b-(a-k)*(-1)))
a, b, k = map(int, input().split())
if a > 0 and a < k:
  a = 0
  K = k - a
  if b > 0 and b > K:
    b = b - K
  elif b > 0 and K >= b:
    b = 0
elif a > 0 and a >= k:
  a = a - k
  exit()
else:
  if b > 0 and b > k:
    b = b - k
  elif b > 0 and k >= b:
    b = 0
print(a, b)
a,b,k=(int(x) for x in input().split())

for i in range(1,k):
    if a>=1:
        a=a-1
    elif b>=1:
        b=b-1
    else:
        pass

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

print(A,B)