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(x-t if x-t>=0 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(0)
else:
    print(X - t)

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

Solution (Python):
print(max(0,eval(input().replace(" ", "-"))))

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

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

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

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

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

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

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

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

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

Solution (Python):
lst = input().split()

d = int(lst[0]) - int(lst[1])

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



weight = 0
if x > t:
    weight = x - t
else:
    weight = 0

print(weight)

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

Solution (Python):

[X,t] = list(map(int,input().split()))

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

Solution (Python):

X,t=map(int,input().split())
if (1<=X and X<=10**9) and (1<=t and t<=10**9):
    if X<=t:
        print(0)
    else:
        print(X-t)

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

def answer(x: int, t: int) -> int:
    if x > t:
        return x - t
    else:
        return 0

print(answer(x, t))

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

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

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

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

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):
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())
if x-t>0:
    print(x-t)
else:
    print(0)

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

answer = x - t

if answer <= -1:
    print(0)
else:
    print(answer)

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

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

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

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

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

Solution (Python):
print(max(eval(input().replace(' ','-')),0))

Solution (Python):
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( x-t if x-t > 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().rstrip().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):



import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """100 17"""
        output = """83"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """48 58"""
        output = """0"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """1000000000 1000000000"""
        output = """0"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    
    resolve()

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(X - t if X - t >= 0 else 0)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    x, t = map(int, readline().split())

    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):
A,B=list(map(int,input().split()))
print(A-B if A-B>0 else 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([0, x - t]))

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

result = X - t

if result < 0:
    result = 0

print(result)

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 else 0)

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

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())
x = X - t
 
if x > 0:
    print(x)
else:
    print(0)

Solution (Python):


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

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

Solution (Python):











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


result = 0

if x > t:   
    result = x - t
else:
    result = 0  

print(result)

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 t >= x:
  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:
    print(0)
else:
    print(X - t)

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

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

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

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

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

Solution (Python):
import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())

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

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

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

Solution (Python):
import sys

X, t = map(int, sys.stdin.readline().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(X-t if t<X else 0)

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

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

print(main())

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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

Solution (Python):
def LI():
    return list(map(int, input().split()))


X, t = LI()
ans = max(X-t, 0)
print(ans)

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

x,t = inpl()
print(max(x-t,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())
ans = X-min(X,t)
print(ans)

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

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

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

print(max(0,x-y))

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  

X,t = MI()
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())
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())

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

Solution (Python):

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

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

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

Remain = X - t
if Remain > 0:
    print(Remain)
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(x-t) if x-t>=0 else print(0)

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

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):
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(X - t if X-t>0 else 0)

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

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

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

kekka = S_list[0] - S_list[1]
if kekka >= 0 :
    print(kekka)
else:
    print(0)

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

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


if __name__ == "__main__":
    main()

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

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 t <= X:
    answer = X - t
else:
    answer = 0


print(answer)

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:
    answer = x - t
else:
    answer = 0


print(answer)

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

if a < b:
    print(0)
if a >= b:
    print(a-b)

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

if x - t >= 1:
    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(x-t, 0))

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

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

Solution (Python):
sand_weight, drop_sand_per_second = map(int, input().split())

if sand_weight > drop_sand_per_second:
    remain_sand = sand_weight - drop_sand_per_second
    print(remain_sand)
else:
    print(0)

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

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

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

if X >= t:
    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())
print(max(x - t, 0))

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

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

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

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

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

Solution (Python):
x,t= map(int,input().split())
time = x-t
if time>=0:
  print(time)
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(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):
X, T =map(int,input().split())
print(max(0,X-T))

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

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    X, t = map(int, readline().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(0)
else:
  print(ans)

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

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

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(0, x-t))

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(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 <= 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(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(x - t) if x > t else print(0)

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

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

Solution (Python):
print(max(eval(input().replace(' ','-')),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(x-t if x-t > 0 else 0)

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

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(x-t)
else:
    print(0)

Solution (Python):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, t = MAP()
print(max([X - t, 0]))

Solution (Python):
tmp = input().split(" ")
 
print(max([int(tmp[0]) - int(tmp[1]), 0]))

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

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

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

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

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

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())
if t <= x:
	print(x-t)
else:
	print(0)

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

print(max(X-t, 0))

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    print(max(X - t, 0))

    return


if __name__ == '__main__':
    main()

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


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

if __name__ == "__main__":
    main()

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

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(X-t if X-t>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())
print(max(0,X-t))

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

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(max(X-t, 0))

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    x, t = i_map()

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

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(x-t, 0))

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

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):
n,t = map(int,input().split())
print(max(0,n-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 <= 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(' '))
print(max(0,X-t))

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

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

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())
if X > t:
  print(X-t)
else:
  print(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())
print(max(x-t, 0))

Solution (Python):
x,t = map(int,input().split())
print("0" if x<t else 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())

print(max(0, x-t))

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
x, t = M()
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())
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(x - t, 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())
if X>t:
    a=X-t
else:
    a=0
print(a)

Solution (Python):
X, t = map(int, input().split())
A = X - t
if A > 0:
    print(A)
else:
    print(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())
if x <= t:
  print(0)
else:
  print(x - t)

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

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

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

Solution (Python):
print(max(0,eval(input().replace(*' -'))))

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

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

Solution (Python):
def resolve():
    x, t = map(int, input().split())
    ans = x-t

    if x-t < 0:
        ans = 0
    print(ans)
resolve()

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

ans = X-t

if ans>=0:
  print(ans)
else:
  print(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:
    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())
z = x-t
if x-t > 0:
    print(z)
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):
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(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>0:
  print(x-t)
else:
  print("0")

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

Solution (Python):
print(max(eval(input().replace(*' -')),0))

Solution (Python):
print(max(eval(input().replace(*' -')),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(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(X-t,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(0,x-t))

Solution (Python):
import sys
X,t = map(int,input().split())
if X < 0 or t < 0 or X > 10 ** 9 or t > 10 ** 9:
    sys.exit()

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

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

if (X-t)>0:
	print(X-t)
    
if (X-t)<=0:
  	print('0')

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

rem = X - t

if (X <= t):
    print("0")

else:
    print(rem)

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, y = map(int,input().split())
print(x - y if x >= y else "0")

Solution (Python):
def actual(X, t):
    if X <= t:
        return 0

    return X - t

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

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
X,t = map(int,list(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(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(0,x-t))

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

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

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

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

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