Problem
Get a number X from the user and a seed S (both positive), then print out X, X+S, X+2S, X+3S... Outputs must occur on the same line with a space in between, and your program should terminate right before overflow occurs (hint: overflow happens when, starting from a positive number, it gets too big to be represented over 32bits. What is in 2's Complement the biggest number that can be represented on 32bits? Realize your branching condition around this idea).