CF963E Circles of Waiting

Description

A chip was placed on a field with coordinate system onto point $ (0,0) $ . Every second the chip moves randomly. If the chip is currently at a point $ (x,y) $ , after a second it moves to the point $ (x-1,y) $ with probability $ p_{1} $ , to the point $ (x,y-1) $ with probability $ p_{2} $ , to the point $ (x+1,y) $ with probability $ p_{3} $ and to the point $ (x,y+1) $ with probability $ p_{4} $ . It's guaranteed that $ p_{1}+p_{2}+p_{3}+p_{4}=1 $ . The moves are independent. Find out the expected time after which chip will move away from origin at a distance greater than $ R $ (i.e. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF963E/246aa7b086b7ae016d999e705d5862993be04853.png) will be satisfied).

Input Format

N/A

Output Format

N/A

Explanation/Hint

In the first example initially the chip is located at a distance $ 0 $ from origin. In one second chip will move to distance $ 1 $ is some direction, so distance to origin will become $ 1 $ . Answers to the second and the third tests: ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF963E/1afdb873d5404107498744fbaddde38ee83fd279.png) and ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF963E/4c1b0d15ba2866c8474bd814731c993c182c0d7d.png).