Plz provide the solution asap in python or cpp $.$Plz it is a request

Description

Problem Statement

You own a chocolate shop with chocolates priced from $1$ to ${10}^9$ consecutively. A student visits your shop for $K$ consecutive days and buys chocolates indexed at $($A$1,A2,A3,....,An)$ on each day.

Formally, you are given an array $\text{'}$A$\text{'}$ representing the chocolate indexes the student buys each day. Your task is to determine the minimum$-$priced chocolate remaining in your shop after the $K^{th}$ day.

Input format

The first line of input contains an integer $N,$ denoting the indexes.

Next N lines contain an integer A$[$i$]$ where A$[1]$ A$[2]$ A

The next line contains $an$ integer $K,$ denoting the number $of$ days.

Constraints

$1N500$

$1A[i]<msup\; id="EditorElement\_1748220"><mrow><mn\; id="EditorElement\_1748212">1</mn><mn\; id="EditorElement\_1748213">0</mn></mrow><mrow\; id="EditorElement\_1748219"><mn\; id="EditorElement\_1748216">9</mn></mrow></msup>$

$1K{10}^5$

Output format

Print the minimum$-$priced chocolate remaining in your shop after the Kth day.

Sample test cases

Input

$5$

$1$

$2$

$4$

$5$

$6$

$1$

Output

$3$

Explanation

$1$st day: $1$st$,2$nd$,4$th$,5$th$,$ and $6$th chocolate is removed

$\{1,2,3,4,5,6,7,8$dots........,${10}^9\}.$

So the chocolate set changes to $\{3,7,8,9,$dotsdots...,${10}^9\}.$

Since $K=1,$ the minimum price of chocolate left after the $K^{th}$ day equals $3.$

Input