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

fin = sys.stdin.readline
A, B, C = [int(elem) for elem in fin().split()]

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

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    A, B, C = map(int, input().split())
    return max(C - (A-B), 0)

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

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

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

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

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

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

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

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

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

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

A, B, C = [int(item) for item in 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 = [int(zz) for zz in input().split()]

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

Solution (Python):

def debug(*args):
    if 1 == 0:
        print(*args)

def solve(N, A):
    pass

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

main()

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

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

Solution (Python):

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

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

rest = a - b

if c-rest < 0:
    print(0)
else:
    print(c-rest)

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

Solution (Python):
a,b,c=list(map(int,input().strip().split(' ')))
con1=min(c+b,a)
con2=b+c-con1
print(con2)

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

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

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools, os
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def _pf(s): return print(s, flush=True)
def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('- {} -> {}'.format(name, val), file=sys.stderr)
            return None

def main():
    return


if __name__ == '__main__':
    if 'LOCAL' in os.environ:
        
        
        input_values = [
                """
                """.strip(),
                """
                """.strip()
                ]
        for input_value in input_values:
            input_value = input_value.split('\n')
            
            
            ans = main()
            expected_value = int(input_value[2])
            assert ans == expected_value, 'failed: ans: {ans}, exp: {exp}'.format(ans=ans, exp=expected_value)
    else:
        A, B, C = LI()
        ans = C- (A-B)
        if ans < 0:
            ans = 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())

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

Solution (Python):

a, b, c = [ int(v) for v in input().split() ]

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

print(ans)

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 = 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):
def solve():
    a, b, c = read()
    result = think(a, b, c)
    write(result)


def read():
    return read_int(3)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a, b, c):
    if b + c >= a:
        return b + c - a
    else:
        return 0


def write(result):
    print(result)


if __name__ == '__main__':
    solve()

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

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

print(ans)

Solution (Python):

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

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

Solution (Python):

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

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

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

Solution (Python):
from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools

INF = 10 ** 10

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

tmp = A -B
C -= tmp

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

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

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

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

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

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

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

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

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

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

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

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

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

main()

Solution (Python):
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [A,B,C] = string_to_int(inputs[0])
    cap = A - B
    return C - cap if C - cap >= 0 else 0



def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
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 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

A,B,C=MAP()

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):
import sys
input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

remain = A - B

remain_2 = C - remain

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

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

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

Solution (Python):
"""


 = sys.stdin.readline().rstrip()
 = list(sys.stdin.readline().rstrip())


 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  


a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 
"""

import math
import sys
import itertools
import queue
from fractions import gcd

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

mod = 1000000007

if __name__ == "__main__":
    A, B, C = map(int, sys.stdin.readline().split())
    print(max(0, C -(A - B)))

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

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

Solution (Python):
from collections import defaultdict, deque
import sys

sys.setrecursionlimit(100000)

MIN = -10 ** 9
MAX = 10 ** 9 + 7


def main():
    
    a, b, c = [int(a) for a in input().split()]
    
    
    
    
    

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


if __name__ == '__main__':
    main()

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

ans = c-(a-b)

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
from functools import reduce
import sys
import math
import bisect
import random
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return list(map(float, sys.stdin.readline().split()))
def LS():return sys.stdin.readline().split()
def SR(n): return [list(sys.stdin.readline())[:-1] for i in range(n)]
def IR(n): return [int(sys.stdin.readline()) for i in range(n)]
def LIR(n): return [list(map(int, sys.stdin.readline().split())) for i in range(n)]
def LSR(n): return [list(map(list, sys.stdin.readline().split())) for i in range(n)]
_gcd = lambda x, y: _gcd(y, x%y) if (x%y) else y
_lcm = lambda x, y: x*y // _gcd(x, y)
def gcd(*numbers):
    return reduce(_gcd, numbers)
def lcm(*numbers):
    return reduce(_lcm, numbers)
sys.setrecursionlimit(1000000)
INF = float('inf')
mod = 1000000007
dire4 = [(1,0), (0,1), (-1,0), (0,-1)]
dire8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]

A, B, C = LI()

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

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

print(C)

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

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

if __name__ == '__main__':
	main()

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

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

	tmp = A-B


	print(max(0,C-tmp))


if __name__ == "__main__":
	main()

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

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

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

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

Solution (Python):
import math

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

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

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

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

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

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

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    a, b, c = rli()
    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):
A, B, C = map(int, input().split())

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

Solution (Python):
import sys


def solve(A: int, B: int, C: int):
    if A - B < C:
        return C - (A - B)
    else:
        return 0


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))  
    ans = solve(A, B, C)
    if ans is not None:
        print(ans)


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

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

aki = A - B

print(max(0, C - aki))

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

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

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

t = A - B
ans = C - t

if ans > 0:
    print(ans)
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):
A, B, C = [int(i) for i in input().split()]
first_in = A - B
print(max(C - first_in, 0))

Solution (Python):
Tmp = []
Tmp = input().rstrip().split(' ')

nA = int(Tmp[0])
nB = int(Tmp[1])
nC = int(Tmp[2])

nAns = nC - (nA-nB)

if nAns < 0:
  nAns = 0

print(nAns)

Solution (Python):
def main():

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)

    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    if __name__ != '__main__':
        
        sys.stdin = open('sample.txt')
        
    
    

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

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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(x) for x in 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())
hoge = min(A,B+C)
print(B+C-hoge)

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

Solution (Python):



import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7

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

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