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):
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 (N + 1) // 2 >= K 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 2 * k - 1 <= n : print("YES")
else : print("NO")

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

Solution (Python):
a,b=map(int,input().split())
if (a+1)//2>=b:
  print("YES")
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):
if __name__=="__main__":
    n, k = input().split(' ')
    n = int(n)
    k = int(k)
    if k * 2 - 1 <= n:
        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())

w_n = 0
if n % 2 == 0:
    w_n = n
else:
    w_n = n + 1

if (w_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())
res = "NO"
if (N + 1) / 2 >= K:
  res = "YES"
print(res)

Solution (Python):

import sys

YES = "YES"  
NO = "NO"  

def solve(N: int, K: int):
    if N >= 2 * (K - 1) + 1:
        ret = YES
    else:
        ret = NO
    print(ret)
    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):
import math
 
a,b=map(int,input().split())
if math.ceil(a/2)>=b:
  print('YES')
else:
  print('NO')

Solution (Python):
import sys,math
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float('inf')
MOD = 10**9+7
dy = [0,1,0,-1]
dx = [1,0,-1,0]
ddy = [0,1,1,1,0,-1,-1,-1]
ddx = [1,1,0,-1,-1,-1,0,1]

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

Solution (Python):
import sys

d=list(map(int, input().split()))
c=(d[0]+1)//2
if d[1] > c: print("NO")
else: print("YES")

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

Solution (Python):
n,k=map(int,input().split());print('YNEOS'[k*2>=n+2::2])

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N,K=MAP()

if N%2==0:
    if K<=N//2:
        YES()
    else:
        NO()
else:
    if K<=N//2+1:
        YES()
    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 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 = (int(i) for i in input().split())

if k <= (n+1)//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())

if (N-1) >= 2*(K-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 math

N, K = map(int, input().split())
print("YES" if K <= math.ceil(N/2) else "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):
N,K = map(int,input().split())
ans_num = N // 2 if N%2 == 0 else N//2+1
if ans_num >= K:
    print('YES')
else:
    print('NO')

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

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

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

ans = 2 * K - 1 <= N

print("YES" if ans else "NO")

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

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

Solution (Python):
n,k = input().split()
n = int(n)
k = int(k)
for l in range(k):
  l = 2*l +1
  c = l
if c <= n:
  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())

tmp = 0
for i in range(1, N + 1):
    if i%2 == 1:
        tmp += 1
        
if tmp >= K:
    print('YES')
else:
    print('NO')

Solution (Python):
n,k = map(int,input().split())
m = int(n/2)+n%2
ans = 'YES' if m>=k else '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())
ans = 'YES' if K <= ((N >> 1) + (N & 1)) else 'NO'
print(ans)

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

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

Solution (Python):
N, K = list(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:
    temp = N / 2
else:
    temp = N / 2 + 1

ans = 'YES'

if K > temp:
    ans = 'NO'
    
print(ans)

Solution (Python):
import sys


line = sys.stdin.readline()
N, K = line.split(" ")
N = int(N)
K = int(K)
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())
if (n+1)//2>=k:
    print("YES")
else:
    print("NO")

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

if N % 2 == 1:
  if len([i for i in range(N+1) if i % 2 == 1]) >= K:
    print("YES")
  else:
    print("NO")
else:
  if len([i for i in range(N) if i % 2 == 1]) >= K:
    print("YES")
  else:
    print("NO")

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

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

Solution (Python):
n,k=(int(x) for x in input().split())
a = k*2-1
if a<=n:
  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 = [int(s) for s in input().split(' ')]
x = 0
if N%2:
    x = (N + 1) / 2
else:
    x = N/ 2
if x>=K:
    print("YES")
else:
    print("NO")

Solution (Python):
import math


def solution(N, K):
    if (math.floor((N + 1) / 2) >= K):
        return "YES"
    else:
        return "NO"


n, k = [int(s) for s in input().split(' ')]
print(solution(n, k))

Solution (Python):

import math

n,k = map(int,input().strip().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("YES" if 2*K-1 <= N else "NO")

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

Solution (Python):

import array
import bisect
import collections
import fractions
import heapq
import itertools
import math
import re
import string
 
class joshu:
 
  
  @staticmethod
  def getInt():
    return int(raw_input().strip())
  @staticmethod
  def getInts():
    return [int(i) for i in raw_input().strip().split()]
  @staticmethod
  def getFloat():
    return float(raw_input().strip())
  @staticmethod
  def getFloats():
    return [float(i) for i in raw_input().strip().split()]
  @staticmethod
  def getStr():
    return str(raw_input().strip())
  @staticmethod
  def getStrs():
    return [str(i) for i in raw_input().strip().split()]
 
def main():
  n, k = joshu.getInts()
  if (n + 1) / 2 >= k:
    print('YES')
  else:
    print('NO')
  pass
 
if __name__ == '__main__':
  main()

Solution (Python):

import array
import bisect
import collections
import fractions
import heapq
import itertools
import math
import re
import string

class joshu:

  
  @staticmethod
  def getInt():
    return int(raw_input().strip())
  @staticmethod
  def getInts():
    return [int(i) for i in raw_input().strip().split()]
  @staticmethod
  def getFloat():
    return float(raw_input().strip())
  @staticmethod
  def getFloats():
    return [float(i) for i in raw_input().strip().split()]
  @staticmethod
  def getStr():
    return str(raw_input().strip())
  @staticmethod
  def getStrs():
    return [str(i) for i in raw_input().strip().split()]

def main():
  n, k = joshu.getInts()
  if (n + 1) / 2 >= k:
    print('YES')
  else:
    print('NO')

if __name__ == '__main__':
  main()

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

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

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

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

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

if k * 2 <= n+1:
    print('YES')

else:
    print('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 k+(k-1) <= n:
    print("YES")
else:
    print("NO")

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

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

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

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

result = 'YES' if N>=1+(K-1)*2 else 'NO'

print(result)

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

Solution (Python):
input_string = input().split()
N = int(input_string[0])
K = int(input_string[1])

r = int(N / 2 + 0.5)

if (r >= 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):
import math
n, k = map(int, input().split())
print( "YES" if k <= math.ceil(n/2) else "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)//2 >= k:
    print('YES')

else:
    print('NO')

Solution (Python):
n,k = (int(num) for num in input().split())
if (n+1)//2 >= k:
    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 k <= (n+1)/2:
    print("YES")
else:
    print("NO")

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

else:
    print("NO")

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

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

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

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

Solution (Python):
'''input
31 10
'''
import time
import math
n, k = map(int, input().strip().split())
d = (n + 1) / 2
if k <= d:
	print("YES")
else:
	print("NO")

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

Solution (Python):
h, w = map(int, input().split())
if h%2==0:
    a=h//2
    if a>=w:
        print("YES")
    else:
        print("NO")
else:
    a=h//2+1
    if a>=w:
        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):
n ,k=map(int,input().split())
d=[]
for i in range(1,n+1,2):
  d.append(i)
  if len(d)==k:
    break
if len(d)>=k:
  print("YES")
else:
  print("NO")

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b



def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)



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


def main():
    N, K = map(int, input().split())
    num = 0
    for i in range(1, N + 1, 2):
        num += 1
    if num >= K:
        print(YES)
    else:
        print(NO)


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
n,k = list(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 N >= K*2-1 else "NO")

Solution (Python):
s = input()
n, k = [int(i) for i in s.split(' ')]

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

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

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

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

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

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

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

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

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

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 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):
m,n = map(int,input().split())
if int((m-1) / 2) >= n-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 2 * k - 1 <= n else 'NO')

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

for n in range(1,N+1):
    if n%2!=0:
        num += 1
if num<K:
    print("NO")
else:
    print("YES")

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

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 1 + (n - 1) / 2 >= k else "NO")

Solution (Python):






def main():
    N, K = [int(i) for i in raw_input().strip().split(' ')]

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


if __name__ == '__main__':
    main()

Solution (Python):
n,k=map(int,input().split())
if n>2*k-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):
a = list(map(int,input().split()))
if(a[1]<=-(-a[0]//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):
l=[]
n,k=map(int,input().split())
for i in range(1,n+1,2):
    l.append(i)

if k<=len(l):
    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):
N, K = map(int, input().split(' '))

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

Solution (Python):
def func():
    pass


def main():
    n, k = map(int, input().split())

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


if __name__ == '__main__':
    main()

Solution (Python):
print("YNEOS"[(lambda n,k:n<k*2-1)(*map(int,input().split()))::2])

Solution (Python):


n,k = map(int,input().strip().split(' '))
c = 0
for i in range(n):
  if i%2 == 0:
    c+=1
if(c>=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):
import math

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

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

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())
print("YES") if 2*k-1<=n else print("NO")

Solution (Python):



def main():
    from math import ceil
    n, k = map(int, input().split())

    if ceil(n / 2) < k:
        print('NO')
    else:
        print('YES')


if __name__ == '__main__':
    main()

Solution (Python):
import math
 
N, K = [int(i) for i in input().split()]
 
ans = "YES"
if math.ceil(N / 2)< K:
    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())
m=n//2 if n%2==0 else n//2+1
print("YES") if k<=m 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())
if n+1>=k*2:
    print("YES")
else:
    print("NO")

Solution (Python):
import math

N, K = [int(i) for i in input().split()]

ans = "YES"
if math.ceil(N / 2)< K:
    ans = "NO"

print(ans)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
n,k=map(int,input().split())
print(["NO","YES"][n>=k*2-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=map(int,input().split())
if (a+1)/b >= 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):
print('YNEOS'[eval(input().replace(' ','<-1+2*'))::2])

Solution (Python):
n,k=map(int,input().split());print('YNEOS'[2*k-1>n::2])

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

for i in range(1,N+1):
  if i % 2 == 1:
    count += 1
    
if count >= K:
  print('YES')
else:
  print('NO')

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

Solution (Python):
n, k = map(int, input().split())
import math
print('YES' if k <= math.ceil(n/2) else '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(' '))
if K * 2 - 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+1)//2 >= k:
    print("YES")
else:
    print("NO")

Solution (Python):


I=raw_input()
n,k=map(int, I.split(" "))

def f(n):
    if n<3:return 0
    if n==3:return 2
    if n%2==0:return f(n-1)
    return f(n-1)+1

if f(n)>=k or k==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())
c=1
i=1
while i+2<=n:
    i+=2
    c+=1
if c>=k:
  print('YES')
else:
  print('NO')

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

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

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

Solution (Python):
N, K = [int(i) for i in input().split()]
print('YES' if sum(divmod(N, 2)) >= K else '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:
    X = N / 2
    if X >= K:
      print('YES')
    else:
      print('NO')
  else:
    X = (N + 1)/2
    if X >= K:
      print('YES')
    else:
      print('NO')
main()

Solution (Python):
inp = input().split(' ')

N = int(inp[0])
K = int(inp[1])
cnt = 0
for i in range(1, N + 1, 2):
  cnt += 1

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

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

Solution (Python):
import sys
n,k = input().split()

N = int(n)
K = int(k)

if N < K:
    print("NO")
    
    
elif N == 1 and K == 1:
    print("YES")
    

elif N % 2 == 0:
    if 2 * K <= N:
        print("YES")
    else:
        print("NO")

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

Solution (Python):
def a_anti_adjacency(N, K):
    if N % 2 == 0:
        ans = 'YES' if N // 2 >= K else 'NO'
    else:
        ans = 'YES' if (1 + N // 2) >= K else 'NO'
    return ans

N, K = [int(i) for i in input().split()]
print(a_anti_adjacency(N, K))

Solution (Python):
import math

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

if n % 2 != 0:
	if k <= math.floor(n / 2) + 1:
		print('YES')
	else:
		print('NO')

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

Solution (Python):
N, K = list(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())
upper = (n + 1) // 2
if k <= upper:
    print('YES')
else:
    print('NO')

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

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

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

if N % 2 ==0:
    N //= 2
else:
    N = (N//2) + 1

if K <= N:
    print('YES')
else:
    print('NO')

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

if __name__ == '__main__':
	main()

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

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

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

Solution (Python):
i = list(map(int, input().split()))
n = i[0]
k = i[1]

if n >= 1 and k <= 100:
  if n == 1 and k == 1:
    print("YES")
  elif n > k:
    if n % 2 == 1:
      if int(n / k) >= 2:
        print("YES")
      elif int(n / k) == 1 and (int(n % k) == k - 1):
        print("YES")
      else:
        print("NO")
    else:
      if int(n / k) >= 2:
        print("YES")
      elif n % k == 0:
        print("YES")
      else:
        print("NO")
  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())

ans = "NO"

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


print(ans)

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

Solution (Python):




def solveProblem(LimitInteger,SelectNumber):
	MaxSelectLength = SelectNumber * 2 -1
	if MaxSelectLength <= LimitInteger:
		answer="YES"
	else :
		answer="NO"
	return answer


if __name__ == '__main__':
	N,K = map(int,input().strip().split(' '))
	solution = solveProblem(N,K)
	print("{}".format(solution))

Solution (Python):
def compare(num):
    count=0
    d=list(range(1,num+1,2))
    return len(d)

b, c = map(int, input().split())
answer=compare(b)

if answer>=c:
    print("YES")
else:
    print("NO")

Solution (Python):
n,k = list(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())
re = ""
if (2 * k - 1) <= n:
    re = "YES"
else:
    re = "NO"
print(re)

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

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

main()

Solution (Python):
import sys
A,B = [int(n) for n in input().split()]

if((A+1)/2 >=B):
    print("YES")
    sys.exit()

print("NO")

Solution (Python):
import sys
n,k=map(int,input().split())
tmp=1
count=1
if n==1 and k==1:
    print('YES')
    sys.exit(0)
if k==0:
    print('YES')
    sys.exit(0)
for i in range(2,n+1):
    if i-tmp>1:
        tmp=i
        count+=1
    if count==k:
        print('YES')
        sys.exit(0)
print('NO')

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

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

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

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

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

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

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

Solution (Python):

import sys



def solve(lines):
    N,K = map(int, lines.pop(0).split(' '))
    re = int(N / 2)
    if N % 2 == 0:
        if re >= K:
            print('YES')
        else:
            print('NO')
    else:
        if re + 1 >= K:
            print('YES')
        else:
            print('NO')






lines = [x.strip() for x in sys.stdin.readlines()]




solve(lines)

Solution (Python):
import math

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

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

Solution (Python):
in_list = input().split()
n = int(in_list[0])
k = int(in_list[1])
if(1+2*(k-1)<=n):
   print("YES")
else:
   print("NO")

Solution (Python):


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

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

Solution (Python):


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

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

if n<3:
    n=0

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

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

if cnt>=b:
    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):
nData = []
nData  = input().rstrip().split(' ')

nN = int(nData[0])
nK = int(nData[1])
nN += 1
nTmp = nK * 2


if (nN >= nTmp):
  print('YES')
else:
 print('NO')

Solution (Python):

line = input().split()
 
 
if (int(line[0])+1)//2>=int(line[1]):
    print("YES")
else :
    print("NO")

Solution (Python):

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

Solution (Python):

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


if nk[0] > 0 and 0 <= nk[1] < 101:
    if nk[0] >= nk[1]:
        s = int(nk[0] / 2)
        j = nk[0] % 2
        if nk[1] <= s + j:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")
else:
    print("NO")