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



Sample input:
6 4 3


Sample output:
1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

container_A = int(A) - int(B)
container_C = min(container_A, int(C))

ans = int(C) - container_C

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
ans = c-(a-b)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = C-(A-B)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if 1 <= b <= a <= 20 and 1 <= c <= 20:
    if b + c <= a:
        print(0)
    else:
        print(b + c - a)
else:
    print('invalid value.')

Submission status: Accepted

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

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

Submission status: Accepted

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

# a-b 容器１の空き容量
# 容器2の余り量を求める
ans = c - (a-b)
if ans < 0 :
    print(0)
else :
    print(ans)

Submission status: Accepted

Solution code:
def solve():
    leftCapacity, leftContent, rightContent = map(int, input().split())
    leftRemain = leftCapacity - leftContent

    if leftRemain >= rightContent:
        print(0)
    else:
        print(rightContent - leftRemain)
solve()

Submission status: Accepted

Solution code:
A,B,C = [int(char) for char in input().split(' ')]
out = 0 if C-(A-B)<=0 else C-(A-B)
print(out)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
cup1_water = a - b
cup2_left_water = c - cup1_water
if cup2_left_water < 0:
  cup2_left_water = 0
 
print(cup2_left_water)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
free = a - b
remaining = c - free
if remaining < 0:
  remaining = 0

print(remaining)

Submission status: Accepted

Solution code:
A,B,C = [int(s) for s in input().split(" ")]
print(max(0,C - (A-B)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getlist():
	return list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

# print(A)
# print(B)
# print(C)

# print(A - B)

# print(C - (A - B))

x = C - (A - B)

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]

x = a[2] - (a[0] - a[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(remain)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
temp=list(map(int, input().split()))

temp=temp[2]-(temp[0]-temp[1])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#容器 1には水をAミリリットルまで入れることができ、水がB ミリリットル入っています。

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
matchNums=input().split(" ")
matchNums=list(map(int, matchNums))

a=(matchNums[0]-matchNums[1])
if a>matchNums[2]:
    print(0)
else:
    print(matchNums[2]-a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A, B, C = [int(_) for _ in input().split()]
    if (A-B) < C:
      print (C-A+B)
    else:
      print(0)
main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
a, b, c = map(int, input().split())
need = a - b
put = min(c, (a-b))
print(c - put)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputs = [int(x) for x in input().split()]
a, b, c = inputs[0], inputs[1], inputs[2]

ans = b + c - a
print("{}".format(ans if ans > 0 else 0))

Submission status: Accepted

Solution code:
#ACB136 -A1

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

new1 = min(B+C,A)
new2 = C - min(B+C,A) + B

print(new2)

Submission status: Accepted

Solution code:
import sys

for line in sys.stdin:
    A, B, C = map(int, line.split())


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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
X = A-B
Y = C-X
if Y < 0:
  Y = 0
print(Y)

Submission status: Accepted

Solution code:
_list = input().split()
a, b, c = int(_list[0]), int(_list[1]), int(_list[2])
 
result = c - (a -b)
if result < 0:
    print(0)
else:
    print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input().split()
a = int(num[0])
b = int(num[1])
c = int(num[2])
ans = b + c - a
if ans > 0:
    print(ans)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
con1 = a - b
con2 = c

if con1 >= con2:
  print(0)
else:
  print(con2 - con1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
A,B,C = [int(i) for i in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
number = list(map(int,input().split()))
if (number[0]-number[1])<number[2]:
    print(number[2]-number[0]+number[1])
else:
    print(0)

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print("{}".format(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()] 
r = a[2] - (a[0] - a[1])
l = lambda r: print(r) if r > 0 else print(0)
l(r)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main_func():
    
    cap1, init_vol, cap2  = map(int, input().split())
    if cap1 > init_vol + cap2:
        print(0)
    else:
        print(init_vol + cap2 - cap1)
        
main_func()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans1 = a - b
ans2 = c - ans1

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

Submission status: Accepted

Solution code:
intlist= [i for i in input().split()]
a = int(intlist[0])
b = int(intlist[1])
c = int(intlist[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
water = list(map(int,input().split()))
#print(water)
diff = water[0]-water[1]
result = water[2]-diff
if result>=0:
  print(result)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

A, B, C = list(map(int, sys.stdin.read().strip().split(" ")))
print(max(0, C - (A - B)))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int, C: int):
    empty = A - B
    C -= empty
    if C < 0:
        C = 0
    print(C)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
print (C - min(A - B, C))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = c - (a-b)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

import bisect
import collections
import itertools


def getint(): return int(input())
def getints(): return list(map(int, input().split()))
def getint2d(rows): return [getints() for _ in range(rows)]
def getgrid(rows): return [input() for _ in range(rows)]
def array1d(n, value): return [value for _ in range(n)]
def array2d(n, m, value): return [array1d(m, value) for _ in range(n)]

a,b,c=getints()
move = min(a-b,c)
print(c-move)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

water = c - (a - b)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
while True:
    try:
        a,b,c = map(int,input().strip().split())
        print(max(b + c - a,0))
    except:
        break

Submission status: Accepted

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

result = c - (a - b)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

d = C - (A - B)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def A_Transfer():
    A, B, C = map(int, input().split())
    ans = max(0, C-A+B)
    print(ans)
    
if __name__ == "__main__":
    A_Transfer()

Submission status: Accepted

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

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

Submission status: Accepted

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

aa = C - (A - B)

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

Submission status: Accepted

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

X = C - (A - B)

if X < 0:
	X = 0

print(X)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
a,b,c=map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
a, b, c = [int(x) for x in stdin.readline().rstrip().split()]

l = c - (a - b)

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

Submission status: Accepted

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

Submission status: Accepted

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

d = c - (a-b)

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

Submission status: Accepted

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

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

else:
    print(0)

Submission status: Accepted

Solution code:
#Coding:utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = [int(x) for x in input().split()]
a = A[0]
b = A[1]
c = A[2]
zan = 0
if a >= b:
  zan = a - b
res = c - zan
if res <= 0:
  res = 0
print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = tuple([int(i) for i in input().split(' ')])
print(max([0, c - (a - b)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# t = "abcdefghijklmnopqrstuvwxyz"
a,b,c = map(int,input().split())

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

Submission status: Accepted

Solution code:
# A:容器１の最大容量
# B:容器１に入っている現在の数量
# C:容器２に入っている現在の数量

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

to_A = A-B # Aに入れることが出来る数量

result = 0

if to_A < C:
    result = C - to_A
else :
    result = 0

print(result)

Submission status: Accepted

Solution code:
#標準入力受け取り
A, B ,C = (int(i) for i in input().split())
#結果表示
print(max(B+C-A, 0))

Submission status: Accepted

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

if 1 <= b <= a <= 20:
    if 1 <= c <= 20:
        x=c-(a-b)

if x<0:
    x=0

print(x)

Submission status: Accepted

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

re = a - b

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input().split()
A=int(x[0])
B=int(x[1])
C=int(x[2])
if B+C-A>0:
    print(B+C-A)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
# input A,B,C
A,B,C = (int(x) for x in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: UTF-8 -*-

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Mon Aug 12 18:39:30 2019

@author: doppe
"""

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

x = C - (A - B) if C - (A - B) >= 0 else 0

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import io
import sys

MOD = 10 ** 9 + 7


def IN_S():
  return input()


def IN_I():
  return int(input())


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


def IN_L_S():
  return list(map(str, input().split()))


def STR_SPLIT(s, n):
  for l in range(0, len(s), n):
    yield s[0 + l:n + l]


def T_IN():
  global test_str
  sys.stdin = io.StringIO(test_str[1:-1])


test_str = '''
12 3 7
'''


def MAIN():
  # T_IN()
  A()


def A():
  a, b, c = IN_L_I()
  w = c - (a - b)
  if w < 0:
    w = 0

  print(w)

  return None


def B():
  return None


def C():
  return None


MAIN()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
AtCoder
    :author: vierbein
"""
from __future__ import absolute_import, division, print_function

# import itertools as it
# import collections
import sys


def pp(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
r = i[2] - (i[0] - i[1])
if r < 0:
    print("0")
else:
    print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#一行数値　複数
a,b,c = map(int, input().split())
ans = c-(a-b)
if ans < 0:
    ans = 0
print(ans)

Submission status: Accepted

Solution code:
N = list(map(int, input().split()))
a,b,c = N[0],N[1],N[2]
ans = c-(a-b)
if ans < 0:
    ans = 0
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
#n=int(input())
#m=int(input())
#r=[input() for _ in range(n)]
#p=list(map(int,input().split()))
if a-b<c:
    print(c-(a-b))
else:
    print(0)

Submission status: Accepted

Solution code:
water=input().split()
w1=int(water[0])
w2=int(water[1])
w3=int(water[2])

def main(a,b,c):
    noko=c-min(a-b,c)
    print(str(noko))
main(w1,w2,w3)

Submission status: Accepted

Solution code:
from sys import stdin
a,b,c = map(int,stdin.readline().rstrip().split())
a_limit = a-b
if c < a_limit:
    print(0)
else:
    print(c-a_limit)

Submission status: Accepted

Solution code:
inputs = input().split()
# print(inputs)
contA_amount = int(inputs[0]) - int(inputs[1])
contB_amount = int(inputs[2])

if contA_amount >= contB_amount:
    contB_left = 0

else:
    contB_left = contB_amount - contA_amount

print(contB_left)

Submission status: Accepted

Solution code:
S = input().split() # S = [A, B, C]

# ==== ここまで問題設定を変数に ===

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

cup1_capacity = int(A)
cup1_containing = int(B)
cup2_containing = int(C)

# === 解く ===

water_moved_from_cup2_to_cup1 = cup1_capacity - cup1_containing
cup2_remaining = cup2_containing - water_moved_from_cup2_to_cup1

print(max(cup2_remaining, 0))

Submission status: Accepted

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

Submission status: Accepted

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

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