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

Solution (Python):
from sys import *

a, b, c = map(int, stdin.readline().split())
ans = c - (a - b)
print(max(0, ans))

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

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

Solution (Python):

"""
Created on Fri May 15 00:48:45 2020

@author: Kanaru Sato
"""

a,b,c = list(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):
import itertools
import math
import fractions
import functools
a, b, c = map(int, input().split())
if a-b > c:
    print(0)
else:
    print(c-a+b)

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

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


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

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

Solution (Python):
A, B, C = map(int, 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())
print(max((c-(a-b)),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=map(int,input().split())
print(max(0,c-(a-b)))

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())
  
a,b,c=i2()
if a>=b+c:
	print(0)
elif a<b+c and a>=b:
	print(c-a+b)
elif a<b:
	print(c)

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

Solution (Python):
import sys
import math
import bisect

def main():
    a, b, c = map(int, input().split())
    if a - b <= c:
        c -= a - b
        b = a
    else:
        b += c
        c = 0
    print(c)
    
if __name__ == "__main__":
    main()

Solution (Python):
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))

def main():
    a,b,c=L()
    c=c-(a-b) if c>=a-b else 0
    print(c)

if __name__=='__main__':
    main()

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





A,B,C = inputIL()

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

Solution (Python):

import collections
import itertools as it
import math

 


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





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

Solution (Python):


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

l = A - B

ans = C - l

if ans <= 0:
    ans = 0

print(ans)

Solution (Python):
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
from collections import deque



def input1():
	return int(input())


def input2():
	return map(int,input().split())


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

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	
	return fact(x+y)/fact(x)/fact(y)


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
	
def count_str(m):
	tmp={}
	for i in range(10):
		if i in tmp:
			tmp[i]=1
		else:
			tmp[i]+=1
	return tmp

def is_prime(n):
	if n==1: return True

	for i in range(2,int(math.sqrt(n))+1):
		if n%i==0:
			return False
	return True

a,b,c=input2()

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

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

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

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

if __name__ == '__main__':

    ABC_136_A()

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

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

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

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

Solution (Python):
import sys

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

    return


if __name__ == '__main__':
    main()
    sys.exit(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().strip().split()))

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


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

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

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

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

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

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

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

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

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


solve()

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

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

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

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


import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))


def resolve():
    a,b,c=pin()
    t=(c-(a-b))
    if t<0:t=0
    print(t)

resolve()

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

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


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

Solution (Python):

import sys
input = sys.stdin.readline
A,B,C = (int(x) for x in input().split())
C_residue =C-(A-B)
if 0 <=C_residue:
    print(C_residue)
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(max(C - (A - B), 0))

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

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


if __name__ == "__main__":
    main()

Solution (Python):

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

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

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

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

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

Solution (Python):
p=eval("-"+input().replace(" ","+"));print(0 if p<0 else p)

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

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

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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

Solution (Python):


def main():
    A, B, C = map(int, open(0).read().split())
    if C - (A - B) >= 0:
        print(C - (A - B))
    else:
        print(0)


main()

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

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

else:
    print(c+b-a)

Solution (Python):
a=-eval(input().replace(' ','-'));print((a>0)*a or 0)

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

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

Solution (Python):
a,b,c = (int(x) for x in input().split())
d = c-(a-b)
print(d if d >= 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())
if b + c <= a:
    print(0)
else:
    print(c + b -a)

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

Solution (Python):

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

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

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

main()

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

amari = a - b

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

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(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 = list(map(int, input().split()))
print(max(c-a+b, 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 a > b:
    print(max(c - (a - b), 0))
else:
    print(c)

Solution (Python):
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd 
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) 







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

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

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

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

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

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

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

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

if d > 0:
    print(d)
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,input().split())
print(max(0,c+b-a))

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

mi = lambda: map(int, input().split())

a, b, c = mi()

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

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

print(b - (a-c) if b - (a-c)>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(C-(A-B), 0))

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

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

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

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

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 = list(map(int,input().split()))
print(max(0,c-(a-b)))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Solution (Python):
bottle1, water, bottle2 = map(int, input().split())
empty = bottle1 - water
if empty <= bottle2:
  print(bottle2 - empty)
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()))
if C-(A-B) > 0:
    print(C-(A-B))
else:
    print(0)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()
N = int(input())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

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

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

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

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

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

diff = A - B
C = C - diff
if C < 0:
    C = 0

print(C)

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

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

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

X = C-(A-B)

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

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

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

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

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

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

t = C - (A - B)

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

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

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

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

tmp = a-b

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

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

if c > a-b:
  print(b+c-a)
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 =  list(map(int, input().split()))

b = a[2] + a[1] - a[0]

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

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

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

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

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

eq= b+c
eq2= a-b
eq3= c-eq2

if eq < a:
	print('0')
else :
	print(eq3)

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

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

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

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

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

ans=(C-(A-B))

ans=max(0,ans)
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())
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 = list(map(int,input().split()))
print(max(c-a+b,0))

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