Problem:
Score : 100 points

Problem Statement

The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)

We will close the window so as to minimize the total horizontal length of the uncovered part of the window.
Find the total horizontal length of the uncovered parts of the window then.

Constraints

1 \leq A \leq 100

1 \leq B \leq 100

A and B are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the total horizontal length of the uncovered parts of the window.

Sample Input 1

12 4

Sample Output 1

4

We have a window with a horizontal length of 12, and two curtains, each of length 4, that cover both ends of the window, for example. The uncovered part has a horizontal length of 4.

Sample Input 2

20 15

Sample Output 2

0

If the window is completely covered, print 0.

Sample Input 3

20 30

Sample Output 3

0

Each curtain may be longer than the window.

Solution in Haskell (GHC 7.10.3) (judge verdict: Accepted)

import qualified Data.ByteString.Char8 as BS

main = do
    -- numbers <- map (BS.unpack) . BS.words <$> BS.getLine
    -- numbers <- map (read . BS.unpack) . BS.words <$> BS.getLine
    [a,b] <- map (read . BS.unpack) . BS.words <$> BS.getLine :: IO [Int]
    -- let num_i = (read . BS.unpack) num :: In
    -- putStrLn $ show $ a * b
    putStrLn $ show $ max (a - b * 2) 0
    -- putStrLn $ show $ numbers !! 0