Problem:
Score : 200 points

Problem Statement

We have A cards, each of which has an integer 1 written on it. Similarly, we also have B cards with 0s and C cards with -1s.

We will pick up K among these cards. What is the maximum possible sum of the numbers written on the cards chosen?

Constraints

All values in input are integers.

0 \leq A, B, C

1 \leq K \leq A + B + C \leq 2 \times 10^9

Input

Input is given from Standard Input in the following format:

A B C K

Output

Print the maximum possible sum of the numbers written on the cards chosen.

Sample Input 1

2 1 1 3

Sample Output 1

2

Consider picking up two cards with 1s and one card with a 0.
In this case, the sum of the numbers written on the cards is 2, which is the maximum possible value.

Sample Input 2

1 2 3 4

Sample Output 2

0

Sample Input 3

2000000000 0 0 2000000000

Sample Output 3

2000000000

Solution in C# (Mono-mcs 6.8.0.105) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;

namespace ConsoleApp1
{
    class Program
    {
        static string Rl()
        {
            return Console.ReadLine().Trim();
        }

        static IEnumerable<string> Spr(string s)
        {
            return s.Split(' ');
        }

        static Int64 C2I(string c)
        {
            return Int64.Parse(c);
        }


        static void Main(string[] args)
        {
            var rl = Spr(Rl()).Select(x => C2I(x)).ToList();
            var a = rl[0];
            var b = rl[1];
            var c = rl[2];
            var k = rl[3];
            long ret = 0;
            if (k <= a)
            {
                ret = k;
            }
            else if (k <= (a + b))
            {
                ret = a;
            }
            else
            {
                ret = 2 * a + b - k;
            }

            Console.WriteLine(ret);
            return;
        }
    }
}