output_description: Print the minimum distance the second rectangle needs to be moved.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      W a b
attempt: w, a, v = map(int, input().split())
  print(min(abs(a + w - v), abs(a - w - v)))
  
problem_description: Statement
  
  AtCoDeer the deer found two rectangles lying on the table, each with height 1
  and width W. If we consider the surface of the desk as a two-dimensional
  plane, the first rectangle covers the vertical range of [0,1] and the
  horizontal range of [a,a+W], and the second rectangle covers the vertical
  range of [1,2] and the horizontal range of [b,b+W], as shown in the following
  figure:
  
  ![](https://atcoder.jp/img/abc056/5c3a0ed9a07aa0992011c11ffbc9441b.png)
  
  AtCoDeer will move the second rectangle horizontally so that it connects with
  the first rectangle. Find the minimum distance it needs to be moved.
samples: [{"input": "3 2 6", "output": "1\n    \n\nThis input corresponds to the figure in the statement. In this case, the\nsecond rectangle should be moved to the left by a distance of 1.\n\n* * *"}, {"input": "3 1 3", "output": "0\n    \n\nThe rectangles are already connected, and thus no move is needed.\n\n* * *"}, {"input": "5 10 1", "output": "4"}]