This problem states to find lcm from 1 to n. I firstly did sieve from 1 to 100000000. Then, calculated the multiple results of all prime powers which does not exceed x (2 <= x <= 100000000). And then processed the query.
I tried out every possible cases I found and don't see any RTE in my compiler. Even for this case in the Ideone.