{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv\u003ecandy 和 vv 网恋很久了\u003c/div\u003e\n\u003cdiv\u003e他们约定出来见一面 ,他们处于同一条长为L的轴线上,且这条轴线是头尾相连的\u003c/div\u003e\n\u003cdiv\u003ecandy的初始坐标是X , 他自左向右蹦跶,每蹦跶一次可以走m米\u003c/div\u003e\n\u003cdiv\u003evv的初始坐标是Y , 她自左向右蹦跶,每蹦跶一次可以走n米\u003c/div\u003e\n\u003cdiv\u003evv想知道,她到底要蹦跶几次,才能看见candy呢?\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e输入只包括一行5个整数x,y,m,n,L,其中x≠y \u0026lt; 2000000000,0 \u0026lt; m、n \u0026lt; 2000000000,0 \u0026lt; L \u0026lt; 2100000000。\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e输出碰面所需要的蹦跶次数,如果永远不可能碰面则输出一行\"Impossible\"\u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e1 2 3 4 5\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e4\u003c/pre\u003e"}}]}