Problem:
 Score : 100 points    Problem Statement We have two bottles for holding water.  Bottle 1 can hold up to A milliliters of water, and now it contains B milliliters of water.  Bottle 2 contains C milliliters of water.  We will transfer water from Bottle 2 to Bottle 1 as much as possible.  How much amount of water will remain in Bottle 2 ?      Constraints  All values in input are integers.  1 \leq B \leq A \leq 20  1 \leq C \leq 20         Input Input is given from Standard Input in the following format:  A  B  C       Output Print the integer representing the amount of water, in milliliters, that will remain in Bottle 2 .        Sample Input 1 6 4 3      Sample Output 1 1  We will transfer two milliliters of water from Bottle 2 to Bottle 1 , and one milliliter of water will remain in Bottle 2 .       Sample Input 2 8 3 9      Sample Output 2 4       Sample Input 3 12 3 7      Sample Output 3 0

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

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

x = c - a + b

if (x < 0):
    x = 0

print(x)

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

available = A - B
nokori = C - available

if nokori < 0:
  print(0)
else:
  print(nokori)

Solution (Python):
if __name__ == "__main__":
  a, b, c = map(int, input().split())
  
  res_1 = a - b
  
  res_2 = c - res_1
  if res_2 <= 0:
    print(0)
  else:
    print(res_2)

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

empty = a - b

if c <= empty:
    print(0)
else:
    remain = c - empty
    print(remain)

Solution (Python):
a,b,c=[int(x) for x in input().split()]
print(max(0,b+c-a))

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

Solution (Python):
line = input()
tmp = line.split(" ")
a = int(tmp[0])
b = int(tmp[1])
c = int(tmp[2])

p = b + c

if p > a:
  print(p-a)
else:
  print(0)

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


ans = c - (a - b)

if ans < 0:
    ans = 0
print(ans)

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

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

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

if s[2]-s[0]+s[1] < 0 :
    print(0)
else :
    print(s[2]-s[0]+s[1])

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

Solution (Python):
A, B, C = list(map(int, input().split()))
 
ABgap = A - B
remain = max(0, C - ABgap)
 
print(remain)

Solution (Python):


res = str(input())

list = res.split(" ")

a = int(list[0])
b = int(list[1])
c = int(list[2])
transferrable = a - b

if c <= transferrable:
    c = 0

else:
    c -= transferrable

print(c)

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

if b + c <= a:
  restc = 0
elif b + c > a:
  restc = (c+b)-(a)
  
print(restc)

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

if( c-(a-b) > 0):
    print(c-(a-b))
else:
    print(0)

Solution (Python):
a, b, c = (int(i) for i in input().split())  
diff = c - (a - b)
if diff > 0 :
    ret  = diff
else:
    ret = 0
print(ret)

Solution (Python):
list1=[int(i) for i in input().split()]
A = list1[0]
B = list1[1]
C = list1[2]


tobe = int(A)- int(B)
if tobe < 0:
  tobe = int(0)



answer = int(C) - int(tobe)
if answer < 0:
  answer = int(0)
print(int(answer))

Solution (Python):
a,b,c = [int(x) for x in input().split()]
print(max(c-(a-b),0))

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

if B < A:
  D = A - B
  result = C - D
  if result < 0:
    print(0)
  else:
    print(result)

else:
  print(C)

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

rest = a-b

ans = c-rest
if ans<0: ans = 0

print(ans)

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

Solution (Python):



from sys import stdin
import math


int_list  = [int(x) for x in stdin.readline().rstrip().split()]


a = int_list[0] 
b = int_list[1] 
c = int_list[2] 

insert_amount_of_water = a - b

surplus = c - insert_amount_of_water 

if surplus <= 0:
    surplus = 0

print(surplus)

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

if int(str[0])-int(str[1]) >= int(str[2]):
    print(0)
else:
    print(int(str[2])-int(str[0])+int(str[1]))

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

r=c-(a-b)
if r > 0:
    print(r)
else:
    print(0)

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

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

else:
  print(0)

Solution (Python):




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


if a - b > c:
    ans = 0
else:
    ans = c - (a - b)


print(ans)

Solution (Python):
H = list(map(int,input().split()))
print (max(H[2]-(H[0]-H[1]),0))

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

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

print(max(0, c - max(0, a - b)))

Solution (Python):
x = input()
A, B, C = [int(y) for y in x.split(" ")]

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

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

Solution (Python):
def main():
    a = list(map(int, input().split()))
    print(max(a[2] - (a[0] - a[1]), 0))
main()

Solution (Python):
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")


def main():
    A, B, C = map(int, input().split())

    answer = B + C - A

    if answer < 0:
        answer = 0

    print(answer)
    
    
if __name__ == "__main__":
    main()

Solution (Python):
from sys import stdin


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

def main():
    x = B + C
    ans = x - A
    if ans >= 0:
        print("{}".format(ans))
    else:
        print("{}".format(0))
if __name__ == '__main__':
    main()

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

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

A = N[0]
B = N[1]
C = N[2]

if (A - B) <= C:
    print(C - (A - B))
else:
    print(0)

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

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

if a>b+c:
      print("0")
else:
      print(b+c-a)

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

def move(a, b, c):
    ava = a-b
    wat = b
    
    if(ava >= c):
        ava -= c
        wat += c
        c = 0
    elif(ava < c):
        c = c - ava
        wat += ava
        ava = 0

    print(c)
move(a, b, c)

Solution (Python):

a, b, c = (int(x) for x in input().split())

if a == b:
    print(c)
elif a - b >= c:
    print(0)
else:
    print(c - (a - b))

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

c1 = b
c2 = c
cap = a - b

c1 = c1 + cap
c2 = c2 - cap

if c2 < 0:
    c2 = 0
print(c2)

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

j = A - B
if j > C:
    print('0')
else:
    print(C - j)

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

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

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

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

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

if b + c - a > 0:
    print( b + c - a )
else:
    print(0)

Solution (Python):
a,b,c = map(int,input().split())
d = c - a + b

if d>=0:
    print(d)

else:
    print(0)

Solution (Python):
i = list(map(int, input().split()))
A = i[0]
B = i[1]
C = i[2]

if C - (A - B) >= 0:
    print(int(C - (A - B)))
else:
    print("0")

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

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

if B + C <= A:
  print('0')
else:
  print(B + C - A)

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

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

if num[1] + num[2] >= num[0]:
    print(num[1] + num[2] - num[0])
else:
    print(0)

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

result = b + c - a

if result < 0:
  result = 0

print(result)

Solution (Python):
a, b, c = tuple([int(_) for _ in input().split()])

print(max(c - (a - b), 0))

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

Solution (Python):
A,B,C = map(int, input().split())
d = C - A + B

if d <= 0: print(0)
else: print(d)

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

ans = c - (a - b)
if ans < 0:
    ans = 0

print(ans)

Solution (Python):
A,B,C = map(int,input().split())
X = B+C

Y = X-A
if Y <= 0:
  print(0)
else:
  print(Y)

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

print(max([C - (A - B), 0]))

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

Solution (Python):


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



print("{}".format(max(0, c-(a-b))))

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

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

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

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

if (c-(a-b) > 0):
    print(int(c - (a - b)))
else:
    print(0)

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

container1 = B
container2 = C

if A-B > C:
    container1 += C
    container2 = 0
else:
    container1 += A-B
    container2 -= A-B
print(container2)

Solution (Python):
a, b, c = input().split()
A = int(a)
B = int(b)
C = int(c)

k = A - B

if k > C:
    print(0)
else:
    print(C - k)

Solution (Python):
a = list(map(int, input().split()))
ans = a[2] - (a[0] - a[1])
if ans >= 0:
    print(ans)
else:
    print(0)

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

if b + c < a:
    print(0)
else:
    print(c - (a - b))

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

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial

def main():
    a, b, c = map(int, input().split())
    ans = max(0, c - a + b)
    print(ans)






if __name__ == '__main__':
    main()

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

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

Solution (Python):



def main():
    a, b, c = map(int, input().split())
    r = max(c - (a - b), 0)
    print('%d' % r)


if __name__ == '__main__':
    main()

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

print(C - min(A - B, C))

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

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

Solution (Python):
data=input().rstrip().split(" ")
a = int(data[0])
b = int(data[1])
c = int(data[2])
if b+c-a>0:
  print(b+c-a)
else:
  print(0)

Solution (Python):
a_max, a_in, b_in = input().split()
print(max(0, int(a_in) + int(b_in) - int(a_max)))

Solution (Python):
inpl = lambda: list(map(int,input().split()))
A, B, C = inpl()
print(max(0,B+C-A))

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

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

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

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

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

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

print(max(0, c - a + b))

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

sa_youki2 = c- (a - b)

if sa_youki2 <0:
    sa_youki2 =0
print(sa_youki2)

Solution (Python):
from sys import stdin


def main():
    A, B, C = [int(x) for x in stdin.readline().rstrip().split()]

    x = A - B

    if x <= C:
        print(C-x)
    else:
        print(0)


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):


args = input().split()
a = int(args[0])
b = int(args[1])
c = int(args[2])

water_numbers = b + c
rest = water_numbers - a

if rest < 0:
    rest = 0
print(rest)

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

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

Solution (Python):
import os,re
from collections import Counter,deque
from operator import itemgetter
from itertools import accumulate,combinations
from sys import stdin,setrecursionlimit
from copy import deepcopy
setrecursionlimit(10**6)

a,b,c=map(int,input().split())
now1=max(0,a-b)
print(max(0,c-now1))

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

Solution (Python):
a,b,c=list(map(int,input().split()))
           
d=a-b
e=c-d

if e>0:
  print(e)
else:
  print(0)

Solution (Python):
param = list(map(int, input().split()))
tmp = param[2] - (param[0] - param[1])

if(tmp > 0):
    ans = tmp
else:
    ans = 0
print(ans)

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

Solution (Python):


hl = [int(i) for i in input().split()] 

capacity = hl[0] - hl[1]

if capacity - hl[2] < 0:
  print(abs(capacity - hl[2]))
else:
  print("0")

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

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

if C-(A-B) <=0:
    ans = 0
else:
    ans = C-(A-B)
print(ans)

Solution (Python):
x = input().split()


d = int(x[2])-(int(x[0])-int(x[1]))

if d>=0:
  print(d)
else:
  print(0)

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

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




result = a - b
result = c - result
if result > 0:
    print(result)
else:
    print(0)

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

if b+c<a:
  ans = 0
else:
  ans = c-a+b
  
print(ans)

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

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

Solution (Python):
import sys
A,B,C = map(int, sys.stdin.readline().rstrip().split())
print(max([C-(A-B), 0]))

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

Solution (Python):
import sys
input = sys.stdin.readline
 
a, b, c = map(int, input().split())
 
d = a-b
ans = c-d
if ans > 0:
    print(c-d)
else:
    print(0)

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

Solution (Python):
a, b, c = list(map(int, input().strip().split()))
ans = max(c - (a - b), 0)
print(ans)

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

if a-b<=c:
    print(c-(a-b))
else:
    print(0)

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

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

Solution (Python):
a, b, c = (int(x) for x in input().split())
res = c - a + b
if res < 0:
  res = 0
  
print(res)

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

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

print(max(ans, 0))

Solution (Python):
import sys

def main():
    A,B,C = tuple(map(int, sys.stdin.readline().split()))

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

if __name__=='__main__':
    main()

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

result = c - (a - b)

if result > 0:
  print(result)
else:
  print(0)

Solution (Python):
import numpy

def main():
    a,b,c = input().split()
    a,b,c = int(a), int(b), int(c)

    rest = a - b
    if rest < c:
        print(c-rest)
    else:
        print('0')
        
if __name__ == '__main__':
    main()

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

c = A-B

if C>c:
    print(C-c)
else:
    print(0)

Solution (Python):
a, b, c = map(int, input().split())
left_in_c = c - (a -b )
if left_in_c <=0:
  left_in_c =0
print("{}".format(left_in_c));

Solution (Python):


def main():

    A,B,C= map(int,input().split())
    cap = A-B

    if C-cap > 0:
        print(C-cap)
    else:
        print(0)

        
    
if __name__== "__main__":
    main()

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

print(k if (k >= 0) else 0)

Solution (Python):
inputed_info = input()

A = int(inputed_info[0:inputed_info.find(" ")])
inputed_info = inputed_info[inputed_info.find(" ")+1:]
B = int(inputed_info[0:inputed_info.find(" ")])
inputed_info = inputed_info[inputed_info.find(" ")+1:]
C = int(inputed_info)

C_after = C - A + B

if C_after > 0:
	print(C_after)
else:
	print('0')

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

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

print(B)

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

ans = max(0, C - (A - B))
print(ans)

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

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

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

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

Solution (Python):

ABC =  list(int(i) for i in input().split())
"""
ABC=[12,3,7]
"""
ans = ABC[2]-ABC[0]+ABC[1]
if ans < 0:
    ans = 0

print(ans)

Solution (Python):
def main():
    a, b, c = [int(x) for x in input().split()]
    ans = c - (a -b)
    print(ans if ans > 0 else 0)

if __name__ == "__main__":
    main()

Solution (Python):

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

print(max(B+C-A,0))

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

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

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

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

Solution (Python):

s = input().rstrip().split(' ')
x = int(s[2])+int(s[1])-int(s[0])
if x > 0:
  print(x)
else:
  print("0")

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

x = max(c - (a - b), 0)

print(x)

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

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

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

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

Solution (Python):

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



ans = max(C - (A - B), 0)


print(ans)

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

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

print(max(0, c - (a - b)))

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

ans = b+c-a
if(ans>0):
    print(ans)
else:
    print(0)

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

result = b + c - a
if result > 0:
  print(result)
else:
  print(0)

Solution (Python):
numbers = input().split(" ")
A = int(numbers[0])
B = int(numbers[1])
C = int(numbers[2])

amount = C - (A - B)
if amount < 0:
  amount = 0
print(amount)

Solution (Python):

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

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

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

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

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

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

Solution (Python):



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




occ_1 = A - B
if occ_1 >= C:
    print(0)
else:
    print(C - occ_1)

Solution (Python):
a,b,c = list(map(int,input().split()))
d = c-a+b

if d>0:
  print(d)
else:
  print(0)

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

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

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

Solution (Python):
abc = [int(i) for i in input().split()]
d =  abc[2] - (abc[0] - abc[1]) 
print(d if d > 0 else 0)

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

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

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

if A == B:
  print(C)
elif A -B >= C:
  print(0)
else:
  print(C-(A-B))

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

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

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

Solution (Python):
"""
https://atcoder.jp/contests/abc136/tasks/abc136_a
"""

import numpy as np


def calc(A: int, B: int, C: int) -> int:
    irerareru = clamp(A - B, 0, C)
    return C - irerareru


def clamp(value: int, min_: int, max_: int) -> int:
    return min(max_, max(min_, value))


def load_input_as_int_array() -> np.ndarray:
    return np.array([int(v) for v in input().split(" ")])


def main() -> None:
    A, B, C = load_input_as_int_array()
    result = calc(A, B, C)
    print(result)


main()

Solution (Python):
a = list(map(int,input().split()))
out =(a[1] + a[2]) - a[0]
if out <0:
  out = 0
print(out)

Solution (Python):

from collections import defaultdict, deque
import math
from math import factorial
import fractions
import re

BIGNUM = 10 ** 9 + 7

def main():
    A, B, C = map(int, input().split())

    remain = A - B
    result = max([0, C - remain])

    print(result)

if __name__ == '__main__':
    main()

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

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

Solution (Python):

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

res = c-(a-b)
if(res<0):
    print(0)
else:
    print(res)

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

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

gap = A - B
if C > gap:
    print(C-gap)
else:
    print(0)

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

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

ans = c - (a-b)

if ans <= 0:
    print(0)

else:
    print(ans)

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

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

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

if R > 0:
  print(R)
else:
  print(0)

Solution (Python):


A, B, C = list(map(int, input().split()))

differ = A-B
print(C - differ) if C >= differ else print(0)

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

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

Solution (Python):
values = input().split(' ')
answer = int(values[2]) - (int(values[0]) - int(values[1]))
if(answer < 0):
  print('0')
else:
  print(str(answer))

Solution (Python):



def main():
    a, b, c = map(int, input().split())
    print(max(0, c - (a - b)))


if __name__ == '__main__':
    main()

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

A=line[0]
B=line[1]
C=line[2]

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

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

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

Solution (Python):


A = list(map(int,input().split()))
remain = 0

if A[2] - (A[0] - A[1]) <= 0:
	print(remain)
else:
	remain = A[2] - (A[0] - A[1])
	print(remain)

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

print(max(0,c-a+b))

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

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

intMinus = a - b 
if c >= intMinus:
    print(c - intMinus)
else:
    print(0)

Solution (Python):


def main(A, B, C):
    ans = C - (A - B)
    if ans > 0:
        return ans
    else:
        return 0

if __name__ == '__main__':
    A, B, C = list(map(int, input().split()))
    print(main(A, B, C))

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

if (A - B <= C):
    print(C - (A - B))
else:
    print("0")

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

D = A-B
if D < C:
	print(C-D)
else:
	print(0)

Solution (Python):


n=input().split(" ")
for i in range(3):
  n[i]=int(n[i])
ans=(n[2]-(n[0]-n[1]))
if ans < 0:
	print(0)
else:
     print(ans)

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

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

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

d=a-b
if c-d>=0:
    print(c-d)
else:
    print(0)

Solution (Python):

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

d = a - b
ans = max(0, c- d)
print(ans)

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

Solution (Python):
abc = list(map(int, input().split(' ')))
a = abc[0]
b = abc[1]
c = abc[2]
r = max(0, c - (a - b))
print(r)

Solution (Python):

a=list(map(int,input().split(" ")))
print(max(0,a[2]-a[0]+a[1]))

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

sum = 0

if (A-B) > C:
    sum = 0
else:
    sum = C - A + B

print(sum)

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

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

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

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

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

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

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

s=c-(a-b)

if s<0:
    print(0)
else:
    print(s)

Solution (Python):
max, first , second = list(map(int, input().split()))

if max >= first + second:
    print(0)
else:
    print(first + second - max)

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

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

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

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


res = c[2]-(c[0]-c[1])

if (res <= 0):
  res = 0
  
print(res)

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

Solution (Python):

a, b, c = map(int,input().split())
print(max(0, c-(a-b)))

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

Solution (Python):


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

Solution (Python):

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

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

Solution (Python):
a, b, c = [int(v) for v in input().split(" ")]
res = c - (a - b) if c - (a - b) > 0 else 0
print(res)

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

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

answer = C - (A - B)
if answer < 0:
  answer = 0
print(answer)

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


if __name__ == '__main__':
  main()

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

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

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

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

sub = a - b
result = 0
if sub < c:
    result = c - sub

print(result)

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

x = a
y = c

space = a - b
if(space == c):
    y = 0

if(space > c):
    y = 0

if(space < c):
    y = c - space

print(y)

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

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

sub = a-b

if sub >= c:
    result = 0
elif sub < c:
    result = c - sub
    
print(result)

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

if c > a-b:
    ans = c-a+b
else:
    ans = 0
print(ans)

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

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

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

Solution (Python):


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

total = c-a+b

if total >= 0:
    print(c-a+b)
    
else:
    print(0)

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


if __name__ == '__main__':
    main()

Solution (Python):

A = list(map(int, input().split()))

b = A[0] - A[1]  
c = A[2] - b
if c >= 0:
    pass
else:
    c = 0

print(c)

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline

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

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

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

print(max(b+c-a,0))

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