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 = input().split( )
num = int(a[2]) - (int(a[0]) - int(a[1]))

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

Solution (Python):
l = list(map(int, input().split()))
ans = l[1] - l[0] + l[2]
if ans < 0:
  print("0")
else:
  print(str(ans))

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

x = a - b
z = c - x

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

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

Solution (Python):
import sys

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

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

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

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

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

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

Solution (Python):


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

tmp = A - B

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

Solution (Python):
a_max,a_in,b_in = map(int,(input().split()))
a = a_max - a_in
ans = b_in - a
if ans < 0:
  ans = 0
print(ans)

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

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

main()

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())
D = C - (A - B)
if D > 0:
	print(D)
else:
	print(0)

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

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

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

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

Solution (Python):
from sys import stdin

a, b, c = map(int, open(0).read().split()) 

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

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

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

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

Solution (Python):
lst = list(map(int, input().split()))
emp = lst[0] - lst[1]
ans = lst[2] - emp
if ans < 0:
  ans = 0
  

print(ans)

Solution (Python):
from enum import Enum
from queue import Queue
import collections

import sys
import math

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

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

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

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

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

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

j = i[2] - (i[0] - i[1])
if j < 0:
  j = 0

print(j)

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

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

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

Solution (Python):
A, B, C = (int(i) for i in input().split())
D = A - B
E = C - D

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

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, b + c - a))

Solution (Python):



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


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

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

print(re)

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

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

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(c-(a-b),0))

Solution (Python):
import sys

a,b,c= [ int(x) for x in sys.stdin.readline().split() ]
r= a-b
print( max(c-r,0) )

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

Solution (Python):
import numpy as np

I=input()
L=np.array(I.split(),dtype=np.int32)

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

diff=A-B


if(C-diff<0):
    print(0)
else:
    print(C-diff)

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

out = C - (A -B)

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

Solution (Python):
A,B,C=[int(i) for i in input().split(" ")]
ans=C-(A-B)
if ans>=0:
    print(ans)
else:
    print("0")

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

one = a - b

if one > c :
    ret = 0
else:
    ret = c - one

print(ret)

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

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

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

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

Solution (Python):
def inpl():
    return list(map(int, input().split()))


A, B, C = inpl()

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

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

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

Solution (Python):
x,y,z = map(int,input().split())
if z+y -x > 0 :
  print(z+y-x)
else:
  print(0)

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

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

one = a - b
two = c

if two-one < 0:
    ans = 0
else:
    ans = two-one
print(ans)

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

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

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

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

Solution (Python):
S = input()

S = list(map(int, S.split()))

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

D = C-(A-B)

if D >= 0:
  print(D)
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())

tmp = c-(a-b)

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

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

Solution (Python):

input = input().split()

A = int(input[0])
B = int(input[1])
C = int(input[2])

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

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

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

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


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

Solution (Python):
a, b, c = input().strip().split(' ')
a, b, c = [int(a), int(b),int(c)]

ans = 0

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

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

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

answer = i[2] + i[1] - i[0]
answer = max(answer, 0)
print(answer)

Solution (Python):

l = list(map(int,input().split()))
diff = l[0] - l[1]
if diff == 0:
        print(l[2])
else:
        res = l[2] - diff
        print(max(0,res))

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

if A-B>=C:
    ans=0
    
if A-B<C:
    ans=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())
if b + c <= a:
  print(0)
else:
  print(b + c - a)

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

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
if a <= b + c:
  print(c-(a-b))
else:
  print(0)

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

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

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, raw_input().split())
if (c-(a-b)) > 0:
    print(c-(a-b))
else:
    print(0)

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

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

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

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

if ((C - (A - B)) > 0):
    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())

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

Solution (Python):

def main():
    A,B,C = map(int,input().split())
    D = C-(A-B)
    if D < 0:
        print(0)
        return
    print(D)


if __name__ == '__main__':
    main()

Solution (Python):
import sys

def solve(a, b, c):
    ans = c - (a - b)
    return ans if ans >= 0 else 0


if __name__ == '__main__':
    a, b, c = map(int, sys.stdin.readline().strip().split(" "))
    print solve(a, b, c)

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


remaining = A - B

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

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

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

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

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

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

Solution (Python):

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

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

Solution (Python):


import sys
import math
import collections
import itertools
def input(): return sys.stdin.readline().strip()
def gcd(x, y): return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y): return (x * y) // gcd(x, y)
MOD = 10 **9 + 7



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)
    exit(0)
print(abs(a - (b + c)))

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

C = C - (A - B)

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

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

Solution (Python):
a, b, c = list(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(C-A+B)
else:
    print(int(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())

nokori = A-B
amari = C-nokori
if amari < 0:
    print(0)
    exit()  
print(C-nokori)

Solution (Python):


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

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

aki = a - b

nokori = c - aki

if nokori <= 0:
    nokori = 0

print(nokori)

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

cap = a - b
ans = c - cap
print(ans if ans >= 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())
res = c-(a-b)
if res>0:
    print(res)
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())

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

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

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

Solution (Python):






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





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

Solution (Python):


import copy
import sys


tmp = input().split()
hoge = list(map(lambda a: int(a), tmp))

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

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

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

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())
if a-b>c:
    print(0)
else:
    print(c-(a-b))

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

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

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

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

cap=a-b
c=c-cap
if(c>0):
    print(c)
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())

d = a - b

result = c - d


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

Solution (Python):


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

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

Solution (Python):
A,B,C=map(int,input().split())
tmp = B+C
if tmp >= A:
    print(tmp-A)
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())

x = c - (a - b)


if x > 0 :
    print(x)
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 = map(int,input().split())

one = a - b

ans = c - one

if c - one <= 0:
  print("0")
  exit()
print(c-one)

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 A - B > C:
  print(0)   
else:
  print(C - A + B)
print("")

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())
c=max(c-a+b,0)
print(c)

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

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

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

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

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

nokori = a-b

ans = c - nokori
if (ans < 0):
  ans = 0

print(ans)

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

Solution (Python):
import numpy as np

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

    onemax = a
    one = b
    two = c

    yoryoku = onemax - one

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



if __name__ == "__main__":
    main()

Solution (Python):
a = [int(i) for i in input().split(" ")]
b = max(a[2]-(a[0]-a[1]), 0)
print(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 (b - a + c) >= 0:
    print(b-a+c)
else:
    print(0)

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

answer = num_list[2] - (num_list[0] - num_list[1])

if answer < 0:
  answer = 0

print(answer)

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

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())
m=c-a+b
if m < 0: m=0
print(m)

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())
r = (A - B)
if C > r:
    print("{}".format(C - r ))
else:
    print("{}".format(0))

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

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

print(max(c - (a - b), 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())

ans = c-(a-b)

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

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

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

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:
    print(0)
else:
    print(ans)

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

if capa >= c:
  print(0)
else:
  print(c - capa)

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


print(LeftC())

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

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())
print(max(C-(A-B),0))

Solution (Python):
import decimal
decimal.getcontext().prec = 100
def sum1(pre,l,r):
    l=max(l,0)
    if(l==0):
        return pre[r]
    return pre[r] - pre[l - 1]


a,b,c=map(int,raw_input().split())
if(b+c<=a):
    print 0
    exit()
print c-(a-b)

Solution (Python):

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

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

print(ans)

Solution (Python):
def LIST(): return list(map(int, input().split()))


def main():
    A, B, C = LIST()

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

if __name__ == '__main__':
    main()

Solution (Python):

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

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

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

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

print(ans)

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

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

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

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

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

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

ans = C - (A - B)

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

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

sum = B+C-A

if sum < 0:
  sum = 0

print(sum)

Solution (Python):
a, b, c = [int(i) for i in input().split()]
print(max(c-(a-b), 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(c-(a-b)>0):
    print(c-(a-b))
else:
    print("0")

Solution (Python):


def main():
    A, B, C = map(int, input().split())
    rest = A - B
    result = C - rest
    if result <= 0:
        print(0)
    else:
        print(result)


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):
a, b, c = map(int, raw_input().strip().split())
x = c - (a - b)

print max(0, x)

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

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

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

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

print(fun(A,B,C))

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

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

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

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

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

Solution (Python):
max_1, water_1, water_2 = map(int, input().split(' '))

transfer = min(water_2, max_1 - water_1)
print(water_2 - transfer)
exit(0)

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

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

Solution (Python):
a, b, c= (int(i) for i in input().split())
ans = max(c+b-a,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())
ans = C - (A - B)

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

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

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

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

ans = C-(A-B)

if ans < 0:
    print(0)
else:
    print(int(ans))

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

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

Solution (Python):
S = input().split(" ")
A, B, C = [int(i) for i in S]
rest = A - B
if rest - C >= 0: print("0")
else: print(C - rest)

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

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

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

Solution (Python):
a, b, c = map(int, input().split())
kotae = c - (a - b)
if kotae > 0:
  print(kotae)
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())
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(' '))

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

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())
ans = c - (a - b)

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

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

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 = [int(i) for i in input().split()]
if c-(a-b)<0:
    print(0)
else:
    print(c-(a-b))

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

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

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

Solution (Python):

if __name__ == "__main__":
    A = list(map(int,input().split()))
    B = A[1]
    C = A[2]
    A = A[0]
    nokori = C - (A-B)
    if nokori < 0:
        print(0)
    else:
        print(nokori)

Solution (Python):

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

aki = A - B

minus = min(aki, C)



ans = C - minus

print(int(ans))

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

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

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

Solution (Python):
a,b,c=[int(i)for i in 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)
print(ans) if ans >= 0 else print(0)

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

r = A - B

if (r >= C):
    print(0)
else:
    print(C - r)

Solution (Python):
A, B, C = [int(i) for i in input().split()]
possible = A - B
print(max(C - max(possible, 0), 0))

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

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

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

Solution (Python):



def solv(A, B, C):
    return max(C - (A - B), 0)


if __name__ == '__main__':

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

    ans = solv(A, B, C)

    print(ans)

Solution (Python):
def int_multiple():
    return  [int(c) for c in input().split()]

def int_single():
    return int(input())

def str_multiple():
    return [c for c in input().split()]

def str_single():
    return input()


a, b, c = int_multiple()

rest = c-(a-b)

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

Solution (Python):


def solve():
    a,b,c = map(int, input().split())
    res = max(0,c-(a-b))
    
    return str(res)

if __name__ == '__main__':
    print(solve())

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

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

Solution (Python):


from itertools import combinations
from collections import defaultdict
from pprint import pprint
import math
import datetime
import sys
import fcntl
import time

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

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

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

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

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

Solution (Python):


import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    A, B, C = i2nn()
    r = C - (A - B)
    if r < 0:
        r = 0
    print(r)
    return

main()

Solution (Python):
from sys import stdin


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


if __name__ == "__main__":
    main()

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(_) for _ in 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+B > A:
    d = (C+B)-A
else:
    d = 0

print(d)

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

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

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(lambda x: int(x), input().split())
ans = c - (a - b)
print(ans) if ans >= 0 else print(0)

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

tmp = A-B
result = C - tmp

if result <= 0:
    result = 0

print(result)

Solution (Python):
import numpy as np

def main():
    A,B, C = map(int, input().split())
    print(max([C - A + B, 0]))




if __name__ == "__main__":
    main()

Solution (Python):
import sys
def main():
    input = sys.stdin.readline
    ABC = list(map(int, input().split()))
    A = ABC[0]
    B = ABC[1]
    C = ABC[2]
    
    ans = C - (A -B)
    if ans < 0:
      print(0)
    else:
      print(ans)

if __name__ == '__main__':
    main()

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 A - B >= C:
  print(0)
else:
  print(C - (A - B))

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

A -= B
C -= A

if C < 0:
    print(0)
else:
    print(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())
ans = max(0,  C+B-A)
print(ans)

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())
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())
ans =  b + c - a
if ans < 0:
    ans = 0
print(ans)

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

    print(remain)


main()

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

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

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

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