시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 1 1 1 100.000%

## 문제

The tournament of generalized poker is going to start! The tournament uses a special deck. It consists of cards that contain integers from $1$ to $n$. Every number has infinitely many occurrences in the deck.

There is only one hand in generalized poker: a straight. A straight is a sequence of $m$ cards that contain consecutive integers: $i, i+1, \ldots, i+m-1$. The rules of poker are the following: each player has $s$ hole cards, and there are $m$ community cards. Each player therefore sees $s+m$ cards and tries to choose $m$ of them so that they formed a straight.

You are watching the tournament, so you can only see community cards. You wonder how many distinct straights are possible with such community cards for some hole cards. Two straights are distinct if they start with different $i$ value.

## 입력

The first line contains three integers $n$, $m$ and $s$ ($1 \le n \le 10^9$, $1 \le s < m \le 10^5$) --- the maximum value of the card, the number of community cards and the number of hole cards.

The second line contains $m$ integers, each from $1$ to $n$ --- community cards values.

## 출력

Output the number of distinct straights that can be potentially obtained by the players.

## 예제 입력 1

10 5 2
7 1 3 5 6


## 예제 출력 1

5


## 예제 입력 2

11 6 2
5 5 5 5 5 5


## 예제 출력 2

0


## 힌트

The first example has the following possible straights: $1$, $2$, $3$, $4$, and $5$.