Problem:
 Score : 100 points    Problem Statement We have a sandglass that runs for X seconds. The sand drops from the upper bulb at a rate of 1 gram per second. That is, the upper bulb initially contains X grams of sand.  How many grams of sand will the upper bulb contains after t seconds?      Constraints  1≤X≤10^9  1≤t≤10^9  X and t are integers.         Input The input is given from Standard Input in the following format:  X  t       Output Print the number of sand in the upper bulb after t second.        Sample Input 1 100 17      Sample Output 1 83  17 out of the initial 100 grams of sand will be consumed, resulting in 83 grams.       Sample Input 2 48 58      Sample Output 2 0  All 48 grams of sand will be gone, resulting in 0 grams.       Sample Input 3 1000000000 1000000000      Sample Output 3 0

Solution (Python):
X, t = map(int, input().split())
print(max(X-t, 0))

Solution (Python):
X, t = (int(i) for i in input().split())

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

Solution (Python):
X, t = map(int, input().split())

if X - t > 0:
    print(X - t)
else:
    print(0)

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

Solution (Python):
x, t = map(int, input().split())
print(max(x - t, 0))

Solution (Python):
x,t = map(int,input().split())
print(max([0,x-t]))

Solution (Python):
x, t = map(int, input().split())
print(max(x - t, 0))

Solution (Python):




x,t = list(map(int,input().split(" ")))

if x - t >= 0:
  print(x - t)
else:
  print(0)

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

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

Solution (Python):
x,t = map(int, input().split())
if x-t > 0:
    print(x-t)
else:
    print('0')

Solution (Python):
x,t = list(map(int,input().split()))
print(max(x-t,0))

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

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

Solution (Python):
x, t = input().split()
x, t = int(x), int(t)
if (t > x) : print(0)
else : print(x-t)

Solution (Python):
x, t = map(int, input().split())
ans = x - t
if ans < 0:
  ans = 0
print(ans)

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

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

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

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

Solution (Python):
x,t = map(int, input().split())
if x >= t:
    print(x-t)
if x < t:
    print(0)

Solution (Python):
import sys, re, os
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 = MAP()
if a - b <= 0:
    print(0)
else:
    print(a-b)

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

if x < t:
    print(0)
else:
    print(x-t)

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

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

Solution (Python):
X, t = map(int, input().split())

ans = X - t
if ans < 0:
    print(0)
else:
    print(ans)

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):
X,t=map(int, input().split())
print(max(0, X-t))

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

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

Solution (Python):
x, t = map(int, input().split())
print(max(0, x - t))

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

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

Solution (Python):

X, t = map(int, input().split())
if X >= t:
    print(X-t)
else:
    print(0)

Solution (Python):
X,t=map(int,input().split())

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

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

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

if x - t < 0:
    print(0)
else:
    print(x - t)

Solution (Python):
x,t=map(int,input().split())
print(max([0,x-t]))

Solution (Python):

X,t = map(int,input().split())

print (max(X-t,0))

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

Solution (Python):
x, t = map(int, input().split())
print(max(x-t, 0))

Solution (Python):
X, t = map(int, input().split())

if X <= t:
    print(0)
else:
    print(X-t)

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):



X, t = map(int, input().split())


print(X - t if X > t else 0)

Solution (Python):
X, t = map(int, input().split())

print(max(X-t, 0))

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

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

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

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

if a[0] <= a[1]:
  print(0)
else:
  print(a[0]-a[1])

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

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

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

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

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

Solution (Python):

X,t = map(int,input().split())
if X <= t:
    print(0)
else:
    print(X-t)

Solution (Python):

X,t = map(int,input().split())
if X <= t:
    print(0)
else:
    print(X-t)

Solution (Python):

X,t = map(int,input().split())
if X <= t:
    print(0)
else:
    print(X-t)

Solution (Python):

X,t = map(int,input().split())
if X <= t:
    print(0)
else:
    print(X-t)

Solution (Python):
x,t= map(int, input().split())
print(max(x-t,0))

Solution (Python):
def resolve():
	x,t=map(int,input().split())
	ans=0 if x<=t else x-t
	print(ans)
resolve()

Solution (Python):
X,t = map(int,input().split())
print(0 if X - t < 0 else X - t)

Solution (Python):



 
X, t = map(int, input().split())




diff = X - t


if diff < 0:
    diff = 0
    
print(diff)

Solution (Python):



X, t = map(int, input().split())
if X - t > 0:
    print(X - t)
else:
    print(0)

Solution (Python):
def print_ans(X,t):
    """Print max(X-t,0)

    Parameters
    --------------

    Examples
    ------------
    >>> print_ans(3,0)
    3
    >>> print_ans(3,2)
    1
    >>> print_ans(2,5)
    0
    """
    print(max(0,X-t))

if __name__ == '__main__':
    X,t = map(int,input().split())
    print_ans(X,t)

Solution (Python):
X, t = map(int, input().split())
print(max(0, X-t))

Solution (Python):
x, t = map(int,input().split())
ans = x-t
if ans >= 0:
    print(ans)
else:
    print(0)

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

X, t = nl()
if t >= X:
    print(0)
else:
    print(X - t)

Solution (Python):

import sys


def solve(X: int, t: int):
    if X - t <= 0:
        print(0)
        return

    print(X - t)
    return


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
x, t = map(int, input().split())
print(max(x-t,0))

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

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

Solution (Python):
X, t = map(int, input().split())
print(max(0, X - t))

Solution (Python):
def main():
    X, t = map(int, input().split())
    if t > X:
        print(0)
    else:
        print(X - t)


main()

Solution (Python):
x,t = map(int,input().split())
print(max(0,x-t))

Solution (Python):
x, t = map(int, input().split())
if x > t :
        print(x-t)
elif x <= t :
        print(0)

Solution (Python):
X,t = map(int,input().split())

print(max(0, X-t))

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

Solution (Python):

x, t = map(int, input().split())


ans = max(x-t, 0)


print(ans)

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):
from collections import defaultdict, Counter
import itertools

def main():
    x, t = map(int, input().split())
    print(max(0, x - t))



if __name__ == '__main__':
    main()

Solution (Python):
x, t = map(int, input().split())
print(max(x - t, 0))

Solution (Python):
X, t = map(int, input().split())

print (max(0, X-t))

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


abc()

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

Solution (Python):
X,t=map(int, input().split())
if X<t:
  print(0)
else:
  print(X-t)

Solution (Python):
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) 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 MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))


x, t = MI()
print(max(0, x-t))

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

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

Solution (Python):
X, t = map(int, input().split())
if 0 < (X - t):
    print(X - t)
else:
    print(0)

Solution (Python):


x, t = map(int, input().split(' '))

if x-t >= 0:
    print(x-t)
else:
    print(0)

Solution (Python):

import sys


def solve(X: int, t: int):
    ret = max(0, X - t)
    print(ret)
    return


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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):
X, t = [int(i) for i in input().split()]
print(max(0, X - t))

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

Solution (Python):
X,t = map(int,input().split())

if(X>t):
    print(X-t)
else:
    print('0')

Solution (Python):
X, t = map(int, input().split())
if X <= t: print(0)
else: print(X-t)

Solution (Python):

X,t=map(int,input().split())
print(max(X-t,0))

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

a  = x - t

if a > 0 :
  print(x-t)
else:
  print('0')

Solution (Python):











import sys
input=sys.stdin.readline
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 [input() 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():
    X, t = MI()
    print(max(0,X-t))
if __name__ == '__main__':
    main()

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

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

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

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

print(max(x-t, 0))

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

Solution (Python):
X, T = [int(s) for s in input().split()]
print(max([X - T, 0]))

Solution (Python):
X,t=map(int,input().split())
print(max(0,X-t))

Solution (Python):
x, t = [ int(v) for v in input().split() ]

print(max(0,x-t))

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

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

Solution (Python):
X, t = map(int, input().split())

print(max(0, X-t))

Solution (Python):

import sys
input = sys.stdin.readline

x, t = map(int, input().split())
if x <= t:
    ans = 0
else:
    ans = x-t
print(ans)

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

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

answer=x-t

if answer<0:
    print("0")

else:
    print(answer)

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

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

print(x-t if x>t else 0)

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

Solution (Python):
x, t = map(int, input().split())
print(max(x-t, 0))

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

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

if (x-t) > 0 :
    print(x-t)
else :
    print("0")

Solution (Python):
X, t = map(int, input().split())
if X < t:
  print(0)
else:
  print(X - t)

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

Solution (Python):
x, t = map(int, input().split())
print(max(0, x - t))

Solution (Python):
x,t=map(int,input().split())
print(max(0,x-t))

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

print(max(x-t,0))

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

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):
x,t = map(int, input().split())
if x - t > 0:
    print(x-t)
else:
    print("0")

Solution (Python):
x, t = [int(i) for i in input().split()]
print(max(x-t, 0))

Solution (Python):

l = list(map(int, input().split()))

ans = l[0] - l[1] if (l[0] - l[1]) >= 0 else 0
print(ans)

Solution (Python):
X, t = map(int,input().split())
print(max(0, X - t))

Solution (Python):
a, b = map(int, raw_input().split())
if a > b:
    print a - b
elif a == b:
    print "0"
else:
    print "0"

Solution (Python):
X,t = map(int,input().split(' '))
print(max(X-t,0))

Solution (Python):

X, t = map(int, input().split())
print(X-t) if X-t>0 else print(0)

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

Solution (Python):
a=int(eval(input().replace(' ','-')))
print(a if a>0 else 0)

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

Solution (Python):
x,t=map(int,input().split())
if x-t>=0:
  print(x-t)
else:
  print('0')

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):
X, t = map(int, input().split())

print(max(X-t, 0))

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

Solution (Python):
X,t=map(int,input().split())
print(max(0,X-t))

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

Solution (Python):
import sys


def input():
    return sys.stdin.readline()[:-1]








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

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

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

Solution (Python):
x,t = map(int,input().split())
 
print(max(x - t,0))

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

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

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

Solution (Python):
X,t=list(map(int,input().split()))
print(max([X-t,0]))

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

Solution (Python):
x, t = list(map(int, input().split()))
if t > x:
  print(0)
else:
  print(x-t)

Solution (Python):
x,t = map(int,input().split())
print(max(0,x-t))

Solution (Python):
X,t = map(int,input().split())
print(max(0,X-t))

Solution (Python):
n,m=map(int,input().split())
print(max(0,n-m))

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

Solution (Python):
X,t = map(int,input().split())
print(0 if X<=t else X-t)

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

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

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

if x-t>0:
  print(int(x-t))
else:
  print(int(0))

Solution (Python):
X, t = map(int, input().split())

print(X - t if (X > t) else 0)

Solution (Python):
X,t = map(int,input().split(" "))
print(max(0,X-t))

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

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

Solution (Python):

def read_input():
    x, t = map(int, input().split())
    return x, t


def submit():
    x, t = read_input()

    print(max(0, x - t))

if __name__ == '__main__':
    submit()

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

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

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

if x - y >= 0:
    print(x-y)
else:
    print(0)

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x, t = f()
    print(max(0, x -t))

solve()

Solution (Python):
l = [int(i) for i in input().split()]
a = l[0] - l[1]
if a < 0:
  a = 0
print(a)

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    x,t = (int(_) for _ in input().split())
    
    print(max(x-t,0))
    
if __name__ == '__main__':
    main()

Solution (Python):
X, t = map(int, input().split())

ans = X - t
if ans > 0:
    print(ans)
else:
    print(0)

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

Solution (Python):
x,t = list(map(int, input().split()))
print(x-t if x>t else "0")

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

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

Solution (Python):
X,t = map(int, input().split())
ans = X-t
if ans < 0:
  ans = 0
print(ans)

Solution (Python):
X, t = map(int, input().split())
print(max(0, X-t))

Solution (Python):
X, t = map(int, input().split())
print(max(X-t, 0))

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

Solution (Python):
X,t = map(int, input().split())
if X <= t:
    print(0)
else:
    print(X - t)

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

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

ans = x - t
if ans < 0:
  ans = 0

print(ans)

Solution (Python):


x, t = map(int, input().split())

if x < t:
    print(0)
else:
    print(x-t)

Solution (Python):
def getInt(): return int(input())
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n

INF = 10**18

class Debug():
    def __init__(self):
        self.debug = True
 
    def off(self):
        self.debug = False
 
    def dmp(self, x, cmt=''):
        if self.debug:
            if cmt != '':
                w = cmt + ': ' + str(x)
            else:
                w = str(x)
            print(w)
        return x

def prob():
    d = Debug()
    d.off()
    X, T = getIntList()
    return max(X-T, 0)


ans = prob()
print(ans)

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

Solution (Python):
X, t = map(int,input().split())
if t>=X:
  print("0")
else:
  print(X-t)

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

Solution (Python):
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


x, y = inl()
print(max(x-y,0))

Solution (Python):
X, t = map(int, input().split())
print(max(0,X-t))

Solution (Python):

x, t = list(map(int, input().rstrip().split()))
print(x - t if x > t else 0)

Solution (Python):
x,t=map(int,input().split())
print(max(0,x-t))

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

if x>=t:
    print(x-t)
else:
    print('0')

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

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

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

print(max(0, x - t))

Solution (Python):
X,t = map(int,input().split())
print(max(X-t,0))

Solution (Python):
X,t = map(int,input().split())
if X-t < 0:
    print(0)
else:
    print(X-t)

Solution (Python):
x,t = map(int,input().split())
print(max(x-t,0))

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

Solution (Python):
X, t = map(int, input().split())
print(max(X - t, 0))

Solution (Python):
x,t = map(int,input().split())
print(max(0,x-t))

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

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

Solution (Python):
X, t = map(int, input().split())

if (X-t) < 0:
  print(0)
else:
  print(X-t)

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

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

Solution (Python):
x, t = [int(n) for n in input().split()]

print(x-t if x>=t else 0)

Solution (Python):
X, t = map(int, input().split())
print(max(X - t, 0))

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

Solution (Python):
X, T = map(int, input().split())
print(max([0, X - T]))

Solution (Python):
x, t = map(int, input().split())
if (x <= t):
  print('0')
else:
  print(x - t)

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

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

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

Solution (Python):
[X,t] = list(map(int, input().split()))
print(max(0,X-t))

Solution (Python):
x, t = [int(i) for i in input().split()]
ans = x - t
if ans > 0:
    print(ans)
else:
    print(0)

Solution (Python):
import sys
MOD = 10 ** 9+7
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())



X, t = mi()
print(max(X-t,0))

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

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

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

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

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

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

Solution (Python):
X, t = map(int, input().split())

print(max(X-t, 0))

Solution (Python):
X, t = map(int, input().split())
print(max(X-t, 0))

Solution (Python):
x, t = map(int, input().split())
print(max(0, x - t))

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):


if __name__ == '__main__':
    X, t = map(int, input().split())
    if X < t:
        print("0")
    else:
        print(X-t)

Solution (Python):
x, t = map(int, input().split())
print(max(x-t,0))

Solution (Python):
X, t = map(int, input().split())
print(max(X-t, 0))

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

print(max(0, X-t))

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):
X,t=[int(i) for i in input().split()]
print(max(0,X-t))

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

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

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

Solution (Python):
x,t=map(int,input().split())
ans=x-t
if x<t:
    ans=0
print(ans)

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

Solution (Python):
x,t = map(int, input().split())
print(max(x-t,0))

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

print(max(a - b, 0))

Solution (Python):
x, f = map(int, input().split())
ans = x - f if x >= f else 0
print(ans)

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

Solution (Python):

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

print(max(a - b, 0))

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

Solution (Python):
x, t = map(int, input().split())
if x-t <= 0:
    print("0")
else:
    
    print(x-t)

Solution (Python):
x,t=map(int,input().split());print([x-t,0][x<t])

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

Solution (Python):


import itertools
import collections
import bisect

def main():
    X, t = map(int, input().split())
    print(max(0, X - t))

if __name__ == '__main__':
    main()

Solution (Python):
n,m=map(int,input().split(' '))
a=n-m
if a>=0:
    print(a)
else:
    print(0)

Solution (Python):
x, t = map(int, input().split())
print(max(x - t, 0))

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

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

Solution (Python):

X,t =map(int,input().split())
print(max((X-t),0))

Solution (Python):
inputArr = input().split(" ")
X =  inputArr[0]
t =  inputArr[1]
remain_sand = int(X) - int(t)
if remain_sand > 0 :
  print(remain_sand)
else :
  print(0)

Solution (Python):
x, t = map(int, input().split())
ans = x - t
if ans > 0:
    print(ans)
else:
    print(0)

Solution (Python):


x,t = map(int,input().split())

print(max(0,x-t))

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

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

if m > n:
  print(0)
else:
  print(n-m)

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    X, t = map(int, input().split())

    return max(0, X - t)


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

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

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

ans = 0
if X-t>0:
	ans = X-t

print(ans)

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

Solution (Python):
x,t=map(int,input().split())
print(max(0,x-t))

Solution (Python):
x,t=map(int,input().split())
print(max(x-t,0))

Solution (Python):
x,t=map(int,input().split())
print(max(0,x-t))

Solution (Python):
X, t = map(int, input().split())
if X > t:
    print(X - t)
else:
    print('0')

Solution (Python):
X,t = [int(x) for x in input().split()]
left = X-t if X-t>=0 else 0
print(left)

Solution (Python):
X, t =list(map(int, input().split( )))
print(max(X-t,0))

Solution (Python):
def sandglass2(X: int, t: int)->int:
    return max(0, X-t)


if __name__ == "__main__":
    X, t = map(int, input().split())
    ans = sandglass2(X, t)
    print(ans)

Solution (Python):
X,t=map(int,input().split())
if X<=t:
  ans=0
else:
  ans=X-t
print(ans)

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

Solution (Python):
x,t = map(int, input().split())
res = x-t if x-t >=0 else 0
print(res)

Solution (Python):
X, t = map(int, input().split())
print(max(0, X - t))

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

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

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

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

Solution (Python):
x, t = map(int, input().split())
print(max(x-t, 0))

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

Solution (Python):
X,t=map(int,input().split(' '))
print(str(max(0,X-t)))

Solution (Python):

x, t = map(int, input().split())
print(max(0,x-t))

Solution (Python):



def main():
    X, t = map(int, input().split())
    print(0 if X-t<=0 else X-t)


if __name__ == '__main__':
    main()

Solution (Python):
X, t = map(int, input().split())
print(0 if X-t<=0 else X-t)

Solution (Python):
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

A,B = IL()

print(max(0,A-B))