#!/usr/bin/env python
import math
def isprime(n):
return all([(n%j) for j in range(2, int(math.sqrt(n))+1)]) and n>1
num = raw_input().split()
if len(num) > 1:
for i in range(int(num[0]),int(num[1])+1):
if isprime(i):
print i
else:
if isprime(int(num[0])):
print num[0]
Could not understand why it's going Wrong answer.