0 0 2
-2 1  2 1
1
3 -1  -3 -3 100

Correct answer "-2 1" but my program gave answer "Impossible". =)

Try this test:
0 0 0
5 5 6 6
1
1 1 2 2 1

Maybe test 5 is even more simple (I'm only sure that A, B and S lie on the same line and the answer is "Impossible"), but this test shows incorrectness of some logic.

what might be the mistake?

i checked- a) whether skyscraper lies in between line and s
                   b) whether s,a and b really makes a plane
                   c) my algo is like that

- for each skyscraper
        - for each side
               calculate interval if any
           then total interval for that sky scrapper if any
union all such intervals from each sky scrapper.
find the first point which is on the right border of some sky scrapper but not through any.

      is this test precision error or did i forget to check something?

      please help me.

              -thanks in advance