Tomatoes

There are $n$ tomatoes in a long row, numbered from $1$ to $n$. Three of them, numbers $t_1$, $t_2$, and $t_3$, are already ripe when the simulation starts on day $0$. Every day, each unripe tomato that is directly next to a ripe tomato ripens. After day $1$, the neighbors of the first three ripe tomatoes have ripened. After day $2$, the neighbors of the tomatoes that ripened on day $1$ have also ripened, and so on.

Write a program that, given $n$, $d$, and the numbers $t_1$, $t_2$, and $t_3$, computes how many tomatoes are ripe after $d$ days.

The first line contains two integers $n$ ($3 \le n \le 100$) and $d$ ($1 \le d \le 100$).

The second line contains $t_1$, $t_2$, and $t_3$. They are all different and lie in the range $1 \dots n$.

Print a single integer: the number of ripe tomatoes after $d$ days.