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

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

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

Solution (Python):
import sys

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

if __name__ == "__main__":
    resolve()

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

Solution (Python):




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

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


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

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

Solution (Python):
a, b, c = [int(x) for x in raw_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(0,C-(A-B)))

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

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

Solution (Python):
import math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque

from itertools import product

from itertools import permutations

from itertools import combinations

from itertools import accumulate
from bisect import bisect_left, bisect_right

import re







def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]
 
def i_inpl(): return int(input())
def l_inpl(): return list(map(int, input().split()))
def line_inpl(x): return [i_inpl() for _ in range(x)]

INF = int(1e50)
MOD = int(1e9)+7 


def create_grid(H, W, value = 0):
    return [[ value for _ in range(W)] for _ in range(H)]



def main():
    A, B, C =l_inpl()
    print(max(C-(A-B), 0))

if __name__ == "__main__":
    main()

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

Solution (Python):

import sys


def solve(A: int, B: int, C: int):
    print(max(C-(A-B), 0))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    solve(A, B, C)

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):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

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

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

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

print(c)

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

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

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

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

Solution (Python):
from bisect import bisect_left, bisect_right; from collections import Counter, defaultdict, deque, OrderedDict; from copy import deepcopy; from fractions import gcd; from functools import lru_cache, reduce; from math import ceil, floor; from sys import stdin, setrecursionlimit
import heapq as hq; import itertools as its; import operator as op



inf = float('inf')
input = stdin.readline


def main():
    a, b, c = get_li()
    print(max(0, c - (a - b)))
    return


def get_int():
    return int(input())


def get_float():
    return float(input())


def get_str():
    return input().strip()


def get_li():
    return [int(i) for i in input().split()]


def get_lf():
    return [float(f) for f in input().split()]


def get_lc():
    return list(input().strip())


def gets(n, types, sep=None):
    if len(types) == 1:
        return [types[0](input().strip()) for _ in range(n)]
    return list(zip(*(
        [t(x) for t, x in zip(types, input().strip().split(sep=sep))]
        for _ in range(n)
    )))


if __name__ == '__main__':
    setrecursionlimit(4100000)
    main()

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

Solution (Python):
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

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

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

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

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

Solution (Python):
inf = [int(i) for i in input().split()]

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

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

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

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

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


if __name__ == '__main__':
    main()

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):
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]






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

Solution (Python):
x,y,z = map(int,input().split())

s = x-y

print(max(0, z-s))

Solution (Python):


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

Solution (Python):


def readInts():
  return [int(s) for s in input().split(" ")]

def main():
  A, B, C = readInts()
  print(max(0, C - (A - B)))

if __name__ == "__main__":
  main()

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

Solution (Python):
import math


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

room = A-B

res = max(0,C-room)

print(res)

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    
    a, b, c = map(int, input().split())
    diff = a - b
    print(max(0, c - diff))
    
    return 0

main()

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

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

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

ans = B+C-A

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

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


if __name__ == "__main__":
    main()

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

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

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

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

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

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= [int(s) for s in input().split()]
print(max([0, c-(a-b)]))

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a,b,c=LI()
  a-=b
  return max(0,c-a)


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

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

x = min(b + c, a)
use = x - b
print(c - use)

Solution (Python):
def InputToInt():
    A = input().split()
    for i in range(len(A)):
        A[i] = int(A[i])
    return A
    
if __name__ == '__main__':
    A, B, C = InputToInt()
    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 = list(map(int, input().split()))
print(max(C-(A-B),0))

Solution (Python):
import sys
input = sys.stdin.readline

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

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

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

Solution (Python):



if __name__ == '__main__':
    a, b, c = map(int, input().split(' '))
    print(max(0, c - (a - b)))

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


import sys

class ATransfer:
    def solve(self):
        a, b, c = [int(_) for _ in input().split()]
        print(max(0, c - (a - b)))

solver = ATransfer()
input = sys.stdin.readline

solver.solve()

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,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):
def get_numbers():
    return map(int, input().split())


a, b, c = get_numbers()

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

Solution (Python):











import sys
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A,B,C=MI()
    print(max(0,C-(A-B)))
if __name__ == '__main__':
    main()

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

Solution (Python):
import sys
input = sys.stdin.readline

a, b, c = map(int, input().split())
ans =  b+c - 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):
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)


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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

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

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(l):
	x = l.pop()
	y = l.pop()
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	l.append(min(x,y))
	return gcd(l) if len(l) > 1 else l[0]

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa == x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))


l = l()


print(max(l[2]-(l[0]-l[1]),0))

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

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 permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()

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

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

Solution (Python):
import numpy as np

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

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

Solution (Python):

import sys


def solve(A: int, B: int, C: int):
    print(max(C-(A-B),0))

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    solve(A, B, C)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):


import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop

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

if __name__ == '__main__':
    main()

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

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

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

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



from math import *

def main():
    import sys
    sys.dont_write_bytecode = True
    sys.setrecursionlimit(10000000)

    input = sys.stdin.readline

    
    

    

    import os
    import math, itertools, operator
    from math import factorial as fact
    from operator import itemgetter, attrgetter
    from itertools import permutations, combinations
    from functools import reduce, lru_cache
    
    
    from fractions import gcd
    from fractions import Fraction as Frac

    inf = float('inf')
    pow = __builtins__.pow

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

    def perm(a, b):
        import scipy.special
        return scipy.special.perm(a, b, exact = True)

    def comb(a, b):
        import scipy.special
        return scipy.special.comb(a, b, exact = True)

    def dfact(n):
        import scipy.special
        return scipy.special.factorial2(n, exact = True)

    def prod(l):
        return reduce(operator.mul, l)

    def input_ints(func = input, sep = None, conv = int):
        return list(map(conv, func().split(sep = sep)))

    if os.environ.get('GOROOT') is None:
        def dprint(*args, **kwargs):
            kwargs['file'] = sys.stderr
            import inspect
            frame = inspect.currentframe().f_back
            print('[' + os.path.basename(frame.f_code.co_filename)
                    + ':' + str(frame.f_lineno) + ']', *args, **kwargs)
    else:
        def dprint(*args, **kwargs):
            pass


    


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


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

import sys
INF = float("inf")


def solve(A: int, B: int, C: int):
    print(C - min(A-B, C))
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    solve(A, B, C)


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):

import sys
import math
from collections import defaultdict


sys.setrecursionlimit(10**7)


mod = 10**9 + 7


def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
  read_all = [tuple(map(int, input().split())) for _ in range(N)]
  return map(list,zip(*read_all))



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

Solution (Python):
import os
import sys

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

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7

A, B, C = list(map(int, sys.stdin.readline().split()))
ans = max(0, C - (A - B))

print(ans)

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

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res

def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    a,b,c = LI()
    c -= a-b
    print(max(0,c))
    return


def B():

    return


def C():

    return


def D():

    return


def E():

    return


def F():

    return


if __name__ == "__main__":
    A()

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

Solution (Python):

import sys
sys.setrecursionlimit(300000)


def solve(A: int, B: int, C: int):
    ret = max(0, C - (A - B))
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    solve(A, B, C)

if __name__ == '__main__':
    main()

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