Problem:
 Score : 100 points    Problem Statement Determine if we can choose K different integers between 1 and N (inclusive) so that no two of them differ by 1 .      Constraints  1\leq N,K\leq 100  N and K are integers.         Input Input is given from Standard Input in the following format:  N  K       Output If we can choose K integers as above, print YES ; otherwise, print NO .        Sample Input 1 3 2      Sample Output 1 YES  We can choose 1 and 3 .       Sample Input 2 5 5      Sample Output 2 NO       Sample Input 3 31 10      Sample Output 3 YES       Sample Input 4 10 90      Sample Output 4 NO

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, groupby
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
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

N, K = MAP()

print("YES" if -(-N//2) >= K else "NO")

Solution (Python):
import sys
N, K = map(int, input().split())

ans = 0

for i in range(1,N+1,2):
    ans = ans + 1

if ans >= K:
    print("YES")
    sys.exit()

print("NO")

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
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 STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

n, k = MAP()
if (n + 1) // 2 >= k:
    print('YES')
else:
    print('NO')

Solution (Python):
n , k = map(int, input().split())
print('YES' if (n + 1) // 2 >= k else 'NO')

Solution (Python):
n,k = map(int,input().split())
x = [i for i in range(n+2) if i % 2 == 1]
for i in range(len(x)):
    if x[i] >=100:
        x.pop(i)

if int(len(x)) >= k:
    print("YES")
else:
    print("NO")

Solution (Python):
n,k = map(int,input().split())
print ("YES") if -(-n//2) >= k else print ("NO")

Solution (Python):
n,k=map(int,input().split())
if (n-1)//2+1>=k:
  print("YES")
else:
  print("NO")

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    
    if a[0] % 2 ==1:
        a[0] +=1


    if a[0]//2 >=a[1] :
        print("YES")
    else:
        print("NO")

Solution (Python):
N, K = map(int, input().split())
if N%2==0:
    n = N//2
else:
    n = N//2+1

if n>=K:
    print('YES')
else:
    print('NO')

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

n,k =iim()
if n%2 == 0:
    if k <= n//2:
        print('YES')
    else:
        print('NO')
elif k <= (n-1)//2+1:
    print('YES')
else:
    print('NO')

Solution (Python):
N , K = map (int,input().split())
 
if (N+1)//2 >= K:
  print("YES")
else:
  print("NO")

Solution (Python):
N,K=map(int,input().split())
if(N>(2*(K-1))):
  print("YES")
else:
  print("NO")

Solution (Python):
n, k = map(int, input().split())
if (-(-n // 2) >= k):
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = map(int, input().split())

print("YES" if 2*K-1 <= N  else "NO")

Solution (Python):
n,k=map(int,input().split())
print("YES" if n//2+n%2>=k else "NO")

Solution (Python):
N, K = map(int, input().split())

if (N+1)//2 >= K:
  print("YES")
else:
  print("NO")

Solution (Python):
import math
n,k = map(int,input().split())
if math.ceil(n/2) >= k:
    print("YES")
else:
    print("NO")

Solution (Python):
import math

n, k = map(int, input().split())
if math.ceil(n / 2) >= k:
    print('YES')
else:
    print('NO')

Solution (Python):
import math
N, K = map(int, input().split())
tmp = math.ceil(N / 2)
if tmp >= K:
    print("YES")
else:
    print("NO")

Solution (Python):
N,K = [int(i) for i in input().split()]
if N % 2 == 0:
    if (N//2) >= K:
        print('YES')
        exit()
    else:
        print("NO")
        exit()
else:
    if (N+1)//2 >= K:
        print("YES")
    else:
        print("NO")

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

if n % 2 == 0:
    if n / 2 >= k:
        print("YES")
    else:
        print("NO")
else:
    if (n + 1) / 2 >= k:
        print("YES")
    else:
        print("NO")

Solution (Python):
n,k=map(int,input().split())
if (n+1)//2>=k:
    print("YES")
else:
    print("NO")

Solution (Python):
import math
N,K = map(int,input().split())

if (math.ceil(N/2) >= K) :
    print("YES")
else :
    print("NO")

Solution (Python):
def main():
    N, K = (int(i) for i in input().split())
    if (N+1)//2 >= K:
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    main()

Solution (Python):
N, K = map(int, input().split())
ans = 0

for i in range(1, N+1):
  if i % 2 == 1:
    ans += 1

if ans >= K:
  print("YES")
else:
  print("NO")

Solution (Python):
n, k = map(int, input().split())
c = 0

for i in range(1,n + 1):
	if i % 2 != 0:
		c += 1

if k <= c:
	print("YES")
else:
	print("NO")

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

if k * 2 -1 <= n:
	print("YES")
else:
	print("NO")

Solution (Python):
def main():
    n, k = map(int, input().split())
    print("YES" if 2 * (k - 1) + 1 <= n else "NO")


if __name__ == '__main__':
    main()

Solution (Python):
n,k=map(int,input().split())
if k*2-1 <= n:
    print('YES')
else:
    print('NO')

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

q, r = divmod(n, 2)
if k <= q + r:
    ans = "YES"
else:
    ans = "NO"

print(ans)

Solution (Python):
n,k=map(int,input().split())
if n//2+n%2>=k:print("YES")
else:print("NO")

Solution (Python):
n,k = map(int,input().split())
a=n/2+0.5
if a>=k:
    print("YES")
else:
    print("NO")

Solution (Python):
def main():
    n, k = map(int, input().split())
    if n >= 2*k-1:
        print("YES")
    else:
        print("NO")

if __name__ == "__main__":
    main()

Solution (Python):
n, k = map(int, input().split())
odd = (n + 1) // 2
print('YES' if odd >= k else 'NO')

Solution (Python):
import math
N, K = map(int, input().split())
if math.ceil(N/2) >= K:
    print('YES')
else:
    print('NO')

Solution (Python):
N,K=map(int,input().split())

if (K*2)-1<=N:
    print("YES")
else:
    print("NO")

Solution (Python):
n,k = map(int,input().split())
print('YES' if (n-1)//2+1 >= k else 'NO')

Solution (Python):
n, k = map(int, input().split())
ans = ""
if n % 2 == 0:
  if n / 2 >= k:
    ans = "YES"
  else:
    ans = "NO"
else:
  if n // 2 + 1 >= k:
    ans = "YES"
  else:
    ans = "NO"
print(ans)

Solution (Python):
N,K=map(int,input().split())
print('NYOE S'[N>=2*K-1::2])

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

if((n%2 == 0 and n >= 2*k) or (n%2 == 1 and n+1>=2*k)):
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = map(int, input().split())

if (N + 1) // 2 >= K:
    print("YES")
else:
    print("NO")

Solution (Python):
n,k=map(int,input().split())
if n>=2*k-1:
    print("YES")
else:
    print("NO")

Solution (Python):
n, k = map(int, input().split())
if n >= k*2-1:
    print('YES')
else:
    print('NO')

Solution (Python):
N,K=map(int, input().split())
print("YNEOS"[not(K*2-1<=N)::2])

Solution (Python):
n, k = map(int, input().split())
cnt = 0
for i in range(0,n,2):
    cnt += 1
if cnt >= k:
    print("YES")
else:
    print("NO")

Solution (Python):


n, k = [int(x) for x in input().split()]
print("YES" if n >= k * 2 - 1 else "NO")

Solution (Python):
import sys





import time


mod = int(1e9+7)
INF = 1<<29

def main():
    n,k = map(int,input().split())
    if (n + 1) // 2 >= k:
        print("YES")
    else:
        print("NO")
    return

if __name__=='__main__':
    main()

Solution (Python):
N, K = map(int, input().split())
print("YES" if 2 * (K - 1) + 1 <= N else "NO")

Solution (Python):
''' Hey stalker :) '''
INF = 10**10
def main():
    print = out.append
    ''' Cook your dish here! '''
    n, k = get_list()
    print("YES") if k<=(n+1)//2 else print("NO")

''' Pythonista fLite 1.1 '''
import sys
from collections import defaultdict, Counter
from bisect import bisect_left, bisect_right

import math
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()

print(*out, sep='\n')

Solution (Python):
"""
NTC here
"""
import sys
inp= sys.stdin.readline
input = lambda : inp().strip()
flush= sys.stdout.flush




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




def main():
    n, k = lin()
    print('YES' if k*2-1<=n else 'NO')





        
main()

Solution (Python):
N, K = map(int, input().split())
if 2 * (K - 1) + 1 <= N:
    print('YES')
else:
    print('NO')

Solution (Python):
n,k=map(int,input().split())
if (n%2==0 and k <=n//2) or (n%2==1 and k <= (n+1)//2):
  print("YES")
else:
  print("NO")

Solution (Python):
def examA():
    N, K = LI()
    if (N+1)//2>=K:
        print("YES")
    else:
        print("NO")
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LFI(): return list(map(float,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

Solution (Python):
N, K = map(int, input().split())

if 2 * (K - 1) + 1 <= N:
    print('YES')
else:
    print('NO')

Solution (Python):
N,K = map(int,input().split())
print("YES" if N>=2*K-1 else "NO")

Solution (Python):
N,K = map(int,input().split())
if N >= K * 2 - 1:
	print("YES")
else:
	print("NO")

Solution (Python):

N,K = map(int,input().split())

if (N+1)//2 >= K:
  print ("YES")
else:
  print ("NO")

Solution (Python):
n,k=map(int,input().split())
print('YES' if n>=2*k-1 else 'NO')

Solution (Python):
N, K = map(int, input().split())
if N % 2 == 0:
    ans = int(N / 2)
else:
    ans = int(N / 2) + 1
if K <= ans:
    print("YES")
else:
    print("NO")

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

if int((n+1)/2)>=k:
  print("YES")
else:
  print("NO")

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

print("NO" if (n-1)//2+1 < k else "YES")

Solution (Python):
n,k = map(int, input().split())
ans = 2*k-1
if n < ans:
  print('NO')
else:
  print('YES')

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

if (n+1) // k >= 2:
    print("YES")
else:
    print("NO")

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

if n>=2*k-1:
    ans="YES"
else:
    ans="NO"
    
print(ans)

Solution (Python):
from sys import stdin
n,k = [int(x) for x in stdin.readline().rstrip().split()]

if (n-1)//2 + 1 < k:
    print("NO")
else:
    print("YES")

Solution (Python):
n,k = map(int,input().split())
cnt=0
for i in range(1,n+1,2):
  cnt += 1

if k <= cnt:
  print("YES")
else:
  print("NO")

Solution (Python):
n, k = map(int, input().split())
if n >= 2*k-1:
    print('YES')
else:
    print('NO')

Solution (Python):
def main():
    N,K = map(int,input().split())
    if N%2==0:
        pass
    else:
        N += 1
    
    if K<=N//2:
        print("YES")
    else:
        print("NO")
if __name__ == '__main__':
    main()

Solution (Python):
n,k = map(int,input().split())
if n>=2*k-1:
  print("YES")
else:
  print("NO")

Solution (Python):
a,b= map(int,input().split())
print("YES" if (a+1)//2>=b else "NO")

Solution (Python):
n,k=map(int,input().split())
if (n+1)//2>=k:
  print("YES")
else:
  print("NO")

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

if k <= (n-1) // 2 + 1:
    print('YES')
else:
    print('NO')

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

if 2 * k - 1 <= n:
    print("YES")
else:
    print("NO")

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

n,k=map(int,input().split())
if 0--n//2>=k:
    print("YES")
else:
    print("NO")

Solution (Python):

 
import math
import itertools
import sys
import copy
 





N, K = map(int, input().split())

if N%2 == 0 :
  if N//2 >= K :
    print ("YES")
  else :
    print ("NO")
else :
  if N//2 + 1 >= K :
    print ("YES")
  else :
    print ("NO")

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

s = -(-n//2)

if s>=k :
	print("YES")
else:
	print("NO")

Solution (Python):
N,K=map(int,input().split())

if N>=2*K-1:
    print('YES')
else:
    print('NO')

Solution (Python):
N,K=map(int,input().split())
print('YES' if K*2-1<=N else 'NO')

Solution (Python):
N, K = map(int, input().split())

if 1 + 2 * (K - 1) <= N :
  print('YES')
else :
  print('NO')

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

if -(-n//2) >=k:
	ans="YES"
else:
	ans="NO"
print(ans)

Solution (Python):
N,K = map(int,input().split())
if N >= 2*K-1:
    print("YES")
else:
    print("NO")

Solution (Python):

n, k = map(int, input().split())
if n >= 2*k-1:
  print('YES')
else:
  print('NO')

Solution (Python):
n,k=map(int,input().split())
print('NO' if n<2*k-1 else 'YES')

Solution (Python):
N,K = map(int,input().split())
if N>=2*K-1:
    print("YES")
else:
    print("NO")

Solution (Python):
n,k=map(int,input().split());print("YNEOS"[k>-~n//2::2])

Solution (Python):
n,k=map(int,input().split())
if k*2<=n+n%2:
  print("YES")
else:
  print("NO")

Solution (Python):
n, k = map(int, input().split())
if n % 2 == 0:
    if n / 2 >= k:
        print('YES')
    else:
        print('NO')
else:
    if (n + 1) / 2 >= k:
        print('YES')
    else:
        print('NO')

Solution (Python):
N,K = map(int,input().split())
if N%2 ==0:
  if N//2 >= K:
    print('YES')
  else:
    print('NO')
    
else:
  if N//2+1 >= K:
    print('YES')
  else:
    print('NO')

Solution (Python):
N,K=map(int,input().split())
print('YES' if N>=2*K-1 else 'NO')

Solution (Python):
n, k = map(int, input().split())
if (n+1)//2 >= k:
  print("YES")
else:
  print("NO")

Solution (Python):

N,K = map(int,input().split())
j = N//2 + N%2
if K <= j:
    print("YES")
else:
    print("NO")

Solution (Python):


n,k=map(int,input().split())
print('YES' if -(-n//2)>=k else 'NO')

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n, k = list(map(int, readline().split()))
    n += 1 if n % 2 != 0 else 0
    print("YES" if n // 2 >= k else "NO")


if __name__ == '__main__':
    solve()

Solution (Python):
N,K = (int(i) for i in input().split())

if (N + 1) // 2 >= K:
    print('YES')
else:
    print('NO')

Solution (Python):
N, K = map(int, input().split())
if (N + 1) // K >= 2:
    print("YES")
else:
    print("NO")

Solution (Python):
n,k = map(int,input().split())
if n >= k * 2 - 1:
	print("YES")
else:
	print("NO")

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

if (n+1)//2 >= k:
    print("YES")
else:
    print("NO")

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random

import os
 




 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N,K = inputMap()
    
    ans = 0
    for i in range(1, N+1):
        if i % 2 == 1:
            ans += 1
            if ans >= K:
                print("YES")
                sys.exit()
                
    print("NO")
    
    
if __name__ == "__main__":
	main()

Solution (Python):
import math
N, K = map(int,input().split())
if math.ceil(N / 2) >= K:
  print("YES")
else:
  print("NO")

Solution (Python):
n, k = map(int, input().split())
if (n+1)//2 >= k:
  print("YES")
else:
  print("NO")

Solution (Python):
n,k=map(int,input().split())
print(("NO","YES")[(n+1)//2>=k])

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

if n%2 == 0:
    cnt = n//2
else:
    cnt = n//2 + 1
    
if cnt >= k:
    print("YES")
else:
    print("NO")

Solution (Python):
n, k = map(int, input().split())
print("YES" if (n + 1) // 2 >= k else "NO")

Solution (Python):

n, k = [int(s) for s in input().split()]
print('YES' if k * 2 - 1 <= n else 'NO')

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

if n>=2*k-1:
  print('YES')
else:
  print('NO')

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

if n >= 2*k - 1:
    print('YES')
else:
    print('NO')

Solution (Python):
N, K = map(int, input().split())
if (N+1)//2 >= K:
	print("YES")
else:
	print("NO")

Solution (Python):
n,m=map(int,input().split())
if (n+1)//2>=m:
    print('YES')
else:
    print('NO')

Solution (Python):
n,k=map(int,input().split())
print('YES' if -(-n//2)>=k else 'NO')

Solution (Python):
N,K=map(int,input().split())
if(K*2-1<=N):
  print("YES")
else:
  print("NO")

Solution (Python):
n, k = map(int, input().split())
if k > (n+1)//2:
  print('NO')
else:
  print('YES')

Solution (Python):
n, k = map(int, input().split())
if k > (n+1)//2:
  print('NO')
else:
  print('YES')

Solution (Python):
N, K = list(map(int, input().split()))
if((N + 1) // 2 >= K):
    print("YES")
else:
    print("NO")

Solution (Python):
n,k=map(int,input().split())
print('YES' if -(-n//2)>=k else 'NO')

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

x = [i for i in range(1, n+1)][::2]

if len(x) >= k:
    print('YES')
else:
    print('NO')

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    print("YES" if (n + 2 - 1) // 2 >= k else "NO")


if __name__ == '__main__':
    slove()

Solution (Python):
import math
n, k = map(int, input().split())

if round(n / 2) >= k or (n == 1 and k == 1):
    print("YES")
else:
    print("NO")

Solution (Python):

n, k = map(int, input().split())
if n - 1 >= 2*(k-1):
    print('YES')
else:
    print('NO')

Solution (Python):
from sys import stdin
N,K = [int(x) for x in stdin.readline().rstrip().split()]
if len(list(range(1,N+1))[0::2]) >= K:
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = tuple(map(int, input().split()))
if (N + 1) // 2 >= K:
    print("YES")
else:
    print("NO")

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

if (n+1)//2>=k:
    print('YES')
else:
    print('NO')

Solution (Python):

import sys

YES = "YES"  
NO = "NO"  


def solve(N: int, K: int):
    from math import ceil
    if(ceil(N/2) >= K):
        print(YES)
    else:
        print(NO)
    return



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

if __name__ == '__main__':
    main()

Solution (Python):
n,k = map(int, input().split())
od = [i for i in range(1,n+1)]
odn = od[::2]
if len(odn) >=k:
  print('YES')
else:
  print('NO')

Solution (Python):
N,K=map(int,input().split())

N+=N%2
N//=2

print("YES" if N>= K else "NO")

Solution (Python):
import math


def resolve():
    n, k = map(int, input().split())
    print("YES" if k <= math.ceil(n / 2) else "NO")


if __name__ == "__main__":
    resolve()

Solution (Python):
N,K=list(map(int,input().split()))
print("YES" if N>=2*K-1 else "NO")

Solution (Python):
import sys
N, K = map(int, input().split())

if N % 2 == 0:
    if K <= (N // 2):
        print('YES')
    else:
        print('NO')
else:
    if K <= (N // 2) + 1:
        print('YES')
    else:
        print('NO')

Solution (Python):
n,k=map(int,input().split())
print("YES" if (n+1)//2>=k else "NO")

Solution (Python):
n, k = map(int, input().split())
if (n - 1) // 2 >= k - 1:
    print("YES")
else:
    print("NO")

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

if n>=2*k-1: 
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = map(int, input().split())
if N >= 2*K-1:
  print("YES")
else:
  print("NO")

Solution (Python):
def main():

    N, K = map(int, input().split())
    if (N+1) // 2 >= K:
        return "YES"
    return "NO"


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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    c = (n + 1) // 2
    print("YES" if c >= k else "NO")


if __name__ == '__main__':
    slove()

Solution (Python):
n,k = map(int,input().split())
print("YES") if -(-n//2) >= k else print("NO")

Solution (Python):
n,k=map(int,input().split());print("YNEOS"[-~n//2<k::2])

Solution (Python):



N, K = map(int, input().split())









if (N // 2) + (N % 2) >= K:
    print('YES')
else:
    print('NO')

Solution (Python):
n,k = map(int,input().split())
if int((n+1)/2) >= k:
    print('YES')
else:
    print('NO')

Solution (Python):
n, k = map(int, input().split())
if (n + 1) // k >= 2:
  print("YES")
else:
  print("NO")

Solution (Python):
N, K = map(int, input().split())
if (N+1)//2 >= K:
  print("YES")
else:
  print("NO")

Solution (Python):
n, k = map(int, input().split())
if n%2 == 0:
    if n//2 >= k:
        print('YES')
    else:
        print('NO')
else:
    if n//2 + 1 >= k:
        print('YES')
    else:
        print('NO')

Solution (Python):
n,k=map(int,input().split())
print('YES' if n/2+0.5>=k else 'NO')

Solution (Python):
N, K = map(int, input().split())
print("YES" if K+K-1 <= N else "NO")

Solution (Python):
n,k=map(int, input().split())
if (n+1)//2>=k:
    print("YES")
else:
    print("NO")

Solution (Python):
n, k= [ int(v) for v in input().split() ]
print("YES" if k <= (n+1)//2 else "NO")

Solution (Python):
def solve(n, k):
    return "YES" if (2*k-1 <= n) else "NO"

n, k = map(int, input().split())
print(solve(n, k))

Solution (Python):
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from heapq import *
from math import *
from fractions import Fraction

N, K = map(int, input().split())
if N >= K*2-1:
    print('YES')
else:
    print('NO')

Solution (Python):
n, k = map(int,input().split())
if n % 2 == 0:
    if n // 2 >= k:
        print('YES')
        exit()
else:
    if n // 2 + 1 >= k:
        print('YES')
        exit()
print('NO')

Solution (Python):
def main(N, K):
    if K * 2 - 1 <= N:
        return 'YES'
    else:
        return 'NO'


if __name__ == '__main__':
    N, K = map(int, input().split(' '))
    print(main(N, K))

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

print('YES' if (n+1)//2 >= k else 'NO')

Solution (Python):
N,K=map(int,input().split())
if N>=2*K-1:
  print("YES")
else:
  print("NO")

Solution (Python):
n, k = map(int, input().split())
if k <= -(-n // 2):
    print('YES')
else:
    print('NO')

Solution (Python):
N, K = [int(_) for _ in input().split()]

if K <= (N+1) // 2:
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = map(int, input().split())

if K * 2 - 1 <= N:
    print ('YES')
else:
    print ('NO')

Solution (Python):
N, K = map(int, input().split())
temp = -1
if N % 2 != 0:
  temp = (N+1)//2
else:
  temp = N // 2
if K > temp:
  print('NO')
else:
  print('YES')

Solution (Python):
n,k = map(int,input().split())
f = (0-((0-n)//2)) >= k
print('YES' if f else 'NO')

Solution (Python):
n,k = map(int,input().split())
if n / 2 + 1 > k :
    print("YES")
else:
    print("NO")

Solution (Python):
n,k = map(int,input().split())
if n / 2 + 1 > k and not (n == 2 and k == 2):
    print("YES")
elif n == 2 and k == 2:
    print("NO")
else:
    print("NO")

Solution (Python):
N,K=map(int,input().split())
if N>=2*K-1:
    print("YES")
else:
    print("NO")

Solution (Python):
N,K = map(int,input().split())

if (N + 1)//2 >= K:
    print("YES")
else:
    print("NO")

Solution (Python):
n,k=map(int,input().split())
print("YES" if k==1 or (n+1)//2>=k else "NO")

Solution (Python):
n, k = [int(item) for item in input().split()]
if (n+1) // 2 >= k:
    print("YES")
else:
    print("NO")

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

if((n%2 == 0 and n >= 2*k) or (n%2 == 1 and n+1>=2*k)):
    print("YES")
else:
    print("NO")

Solution (Python):
a,b=map(int,input().split())
print('YES' if (a+1)//2>=b else "NO")

Solution (Python):

def main():
    n, k = list(map(int, input().rstrip().split()))
    print("YES" if (n + 1) // 2 >= k else "NO")


if __name__ == "__main__":
    main()

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

if n % 2 != 0:
    n += 1

if n // k >= 2:
    print('YES')
else:
    print('NO')

Solution (Python):

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

    if (a + 1) // 2 >= b:
        print('YES')
    else:
        print('NO')



if __name__ == '__main__':
    main()

Solution (Python):
N,K=map(int,input().split())
if (N+1)//2<K:print("NO")
else:print("YES")

Solution (Python):
N, K = map(int, input().split())
if N % 2 == 0 and K <= (N // 2):
    print("YES")
elif N % 2 == 1 and K <= ((N // 2) + 1):
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = map(int, input().split())

print(["YES", "NO"][not(K <= ((N + 1) // 2))])

Solution (Python):
n, k = map(int, input().split())
import math
if k <= math.ceil(n/2):
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = map(int, input().split())
if K*2-1 <= N:
    print('YES')
else:
    print('NO')

Solution (Python):
n,k=map(int,input().split())
if n%2==1:
    if k<=n//2+1:
        print('YES')
    else:
        print('NO')
else:
    if k<=n//2:
        print('YES')
    else:
        print('NO')

Solution (Python):
n, k = map(int, input().split())
if k <= (n+1)//2:
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = map(int, input().split())
print('YES' if (N+1) // K >= 2 else 'NO')

Solution (Python):
n,k=map(int,input().split())
if n>=2*k-1:
  print("YES")
else:print("NO")

Solution (Python):
N, K = map(int, input().split())

for i in range(1, N+1):
    if i%2 != 0:
        K -= 1

print('YES' if K <= 0 else 'NO')

Solution (Python):
N, K = map(int, input().split())
if N >= K*2-1:
    print('YES')
else:
    print('NO')

Solution (Python):
N, K = map(int, input().split())
if int((N + 1) / 2) >= K:
    print("YES")
else:
    print("NO")

Solution (Python):
n, k = [int(i) for i in input().split()]
if n >= (k-1)*2+1:
    print("YES")
else:
    print("NO")

Solution (Python):
n,k=map(int,input().split())
M=1+(n-1)//2
if k<=M:
  print("YES")
else:
  print("NO")

Solution (Python):
import math
n,k=map(int,input().split())
ans='NO'
if math.ceil(n/2)>=k:
    ans='YES'
print(ans)

Solution (Python):
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

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

sys.setrecursionlimit(2147483647)
INF = float("inf")

N, K = list(map(int, sys.stdin.readline().split()))

a = list(range(1, N+1, 2))
if len(a) >= K:
    print('YES')
else:
    print('NO')

Solution (Python):
N,K = map(int,input().split())
x = (N+1)//2
bl = (x >= K)
answer = 'YES' if bl else 'NO'
print(answer)

Solution (Python):
N,K=map(int,input().split())
if K<=(N+1)//2:
  print('YES')
else:
  print('NO')

Solution (Python):
n,k=map(int,input().split())
if n>=2*k-1:
    print("YES")
else:
    print("NO")

Solution (Python):
n, k = map(int, input().split())
if k <= (n+1) // 2:
  print('YES')
else:
  print('NO')

Solution (Python):
n, k = map(int, input().split())
if n >= 2*k-1:
  print('YES')
else:
  print('NO')

Solution (Python):
n,k = map(int,input().split())
pos = -(-n//2)
if pos >= k :
    print("YES")
else:
    print("NO")

Solution (Python):
N, K = map(int, input().split(" "))
if int((N + 1) / 2) >= K:
  print("YES")
else:
  print("NO")

Solution (Python):
N, K = map(int, input().split())
print("YES" if (N-1)//2>=K-1 else "NO")

Solution (Python):
import math
n,k=map(int,input().split())
print("YES" if math.ceil(n/2)>=k else "NO")

Solution (Python):
print("YNEOS"[eval(input().replace(" ","<")+"*2-1")::2])

Solution (Python):
N, K = map(int, input().split())

if 1 + 2 * (K - 1) <= N:
  print("YES")
else:
  print("NO")

Solution (Python):
a,b = map(int,input().split())
a = -(-a // 2)
print('YES') if a >= b else print('NO')

Solution (Python):

import sys
input = sys.stdin.readline
def mi(): return map(int, input().split())


N, K = mi()

if N >= (K*2 - 1):
  print('YES')
else: print('NO')

Solution (Python):
n,k=map(int,input().split())
ans='NO'
if k<=(n+1)//2:
  ans='YES'
print(ans)

Solution (Python):
import math
N, K = map(int, input().split())
n = math.ceil(N / 2)
if n >= K:
	print("YES")
else:
	print("NO")

Solution (Python):
n,k = map(int,input().split())
if 2*k-1 <= n:
  print("YES")
else:
  print("NO")

Solution (Python):
n,k=map(int,input().split())
print('YES') if n>=2*k-1 else print('NO')

Solution (Python):
n, k = map(int, input().split())
num = n/2+ 0.5
if num >= k:
    print("YES")
else:
    print("NO")

Solution (Python):

"""
A - Anti-Adjacency
https://atcoder.jp/contests/yahoo-procon2019-qual/tasks/yahoo_procon2019_qual_a

"""
import sys


def solve(N, K):
    if (N+1) //2 >= K:
        return 'YES'
    return 'NO'


def main(args):
    N, K = map(int, input().split())
    ans = solve(N, K)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
print("YNEOS"[eval(input().replace(" ","+1<2*"))::2])

Solution (Python):
print("YNEOS"[eval(input().replace(" ","<-1+2*"))::2])

Solution (Python):
a,b = list(map(int, input().split()))
if a % 2 == 0:
    if a / 2 >= b:
        print("YES")
    else:
        print("NO")
else:
    if (a + 1) / 2 >= b:
        print("YES")
    else:
        print("NO")

Solution (Python):
N, K = map(int, input().split())
ans = "YNEOS"
print(ans[(N+1)//2 < K::2])

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

if N % 2 == 0:
	if K <= int(N/2):
		print("YES")
	else:
		print("NO")
else:
	if K <= int(N/2)+1:
		print("YES")
	else:
		print("NO")