import java.util.ArrayList;
import java.util.List;

public class Main {

    // Function to find all prime numbers up to n using the Sieve of Eratosthenes
    public static List<Integer> sieve(int n) {
        boolean[] prime = new boolean[n + 1];
        for (int i = 0; i <= n; i++) {
            prime[i] = true;
        }
        prime[0] = false;
        prime[1] = false;

        int limit = (int) Math.sqrt(n);
        for (int p = 2; p <= limit; p++) {
            if (prime[p]) {
                for (int i = p * p; i <= n; i += p) {
                    prime[i] = false;
                }
            }
        }

        List<Integer> primes = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            if (prime[i]) {
                primes.add(i);
            }
        }
        return primes;
    }

    // Function to find primes in a range [start, end] using a segmented sieve
    public static List<Integer> sieveRange(int start, int end) {
        List<Integer> primes = sieve(end);
        List<Integer> rangePrimes = new ArrayList<>();

        for (int prime : primes) {
            if (prime >= start) {
                rangePrimes.add(prime);
            }
        }

        return rangePrimes;
    }

    public static void main(String[] args) {
        int l = 1; 
        int r = 100; 
        List<Integer> primesInRange = sieveRange(l, r);

        
        for (int prime : primesInRange) {
            System.out.println(prime);
        }
    }
}