Prime Numbers Identification

Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

Explanation:

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. Example: 2, 3, 17, etc.

Input:

N = 10

Output:

2 3 5 7

Example:

Input:

N = 20

Output:

2 3 5 7 11 13 17 19

Constraints:

• 2 <= N <= 10^7
• The solution should work within a 1-second time limit.

Note:

You are not required to print anything; it has already been taken care of. You need to implement the logic to determine the prime numbers.