#C12132. Prime Numbers Finder
Prime Numbers Finder
Prime Numbers Finder
You are given two integers start and end. Your task is to print all prime numbers between start and end (inclusive). A prime number is defined as a natural number greater than 1 that has no positive divisors other than 1 and itself. If no prime numbers exist in the specified range or if start > end, print an empty line.
Note: Any numbers less than 2 should be ignored.
inputFormat
The input consists of a single line containing two space-separated integers, start and end.
outputFormat
Output the prime numbers in ascending order, separated by a single space. If there are no prime numbers in the range, output an empty line.
## sample10 30
11 13 17 19 23 29