A10470 | Meeting of Old Friends

Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!

Sonya is an owl and she sleeps during the day and stay awake from minute $l_{1}$ to minute $r_{1}$ inclusive. Also, during the minute $k$ she prinks and is unavailable for Filya.

Filya works a lot and he plans to visit Sonya from minute $l_{2}$ to minute $r_{2}$ inclusive.

Calculate the number of minutes they will be able to spend together.

The only line of the input contains integers $l_{1}$ , $r_{1}$ , $l_{2}$ , $r_{2}$ and $k$ ( $1<=l_{1},r_{1},l_{2},r_{2},k<=10^{18}$ , $l_{1}<=r_{1}$ , $l_{2}<=r_{2}$ ), providing the segments of time for Sonya and Filya and the moment of time when Sonya prinks.

Print one integer — the number of minutes Sonya and Filya will be able to spend together.