Kodkraft

Nicolas wants to start competing in programming on the site kodkraft\texttrademark. There are many different divisions to compete in, but since Nicolas is a new participant on kodkraft™, he has to start in the lowest division (division 1). Nicolas's goal is to reach the highest division (division $K$) as quickly as possible and win a contest in it.

According to kodkraft™'s rules, you can only move up one division per contest, so he will have to compete in at least one contest in each division. However, Nicolas is very confident and therefore believes he will need to compete in exactly one contest in each division to move up to the next division. When a contest is held on kodkraft™, only one division competes at a time, and two contests never overlap in time. The contests also follow the same schedule every year.

Nicolas may begin his competing on kodkraft™ on whichever date of the year he wants. What Nicolas means by as quickly as possible is that as few contests as possible should take place on kodkraft™ (whether he participates in them or not) between the first contest he participates in and his first win in the highest division. Help Nicolas compute how many contests are required!

The first line contains two integers $N$ and $K$ ($1 \leq K \leq N \leq 10^6$), the number of contests per year and the number of divisions.

This is followed by a line with $N$ integers $x_1, \dots, x_N$ ($1 \leq x_i \leq K$), the schedule of contests during one year. $x_i$ is the division that competes in the $i$-th contest after New Year's. Every division between $1$ and $K$ has at least one contest during the year.

One integer, the smallest number of contests that need to take place on kodkraft™ from when he starts competing there until he has won division $K$.