Count Prime Numbers Within a Range

Given two integers \(X\) and \(Y\), count the number of prime numbers between \(X\) and \(Y\) (inclusive). A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

inputFormat

The input consists of a single line containing two space-separated integers \(X\) and \(Y\).

outputFormat

Output a single integer representing the count of prime numbers between \(X\) and \(Y\) (inclusive).

sample

1 10

4