#K47212. Perfect Squares in a Range

    ID: 28149 Type: Default 1000ms 256MiB

Perfect Squares in a Range

Perfect Squares in a Range

Given two integers start and end, your task is to find all perfect square numbers between start and end (inclusive). A number \( n \) is a perfect square if there exists an integer \( k \) such that \( n = k^2 \).

You need to read the input from stdin and output the result to stdout. The perfect squares should be printed in increasing order separated by a single space. If there are no perfect squares in the given range, output an empty line.

inputFormat

The input consists of a single line containing two integers start and end separated by spaces.

Constraints: \(0 \leq start \leq end \leq 10^5\).

outputFormat

Output a single line containing the perfect square numbers in the range [start, end] separated by a space. If there are no perfect squares in the range, output an empty line.

## sample
1 20
1 4 9 16