AT_awc0005_b 成績表の更新

Takahashi is managing student grades as the homeroom teacher of a school class. There are $ N $ students in the class, numbered from $ 1 $ to $ N $ . The initial score of the $ i $ -th student is $ S_i $ points. At the end of the term, it is time to update the report cards. A total of $ M $ updates are performed. In the $ j $ -th update, the score of student $ P_j $ is changed to $ V_j $ points. The same student may be updated multiple times, in which case their score is overwritten with each update. After all updates are completed, students with a score strictly less than $ K $ points are required to attend supplementary lessons. For Takahashi's sake, determine the number of students who are required to attend supplementary lessons. Note that students with exactly $ K $ points are not included.

> $ N $ $ M $ $ K $ $ S_1 $ $ S_2 $ $ \cdots $ $ S_N $ $ P_1 $ $ V_1 $ $ P_2 $ $ V_2 $ $ \vdots $ $ P_M $ $ V_M $ - The first line contains $ N $ representing the number of students, $ M $ representing the number of updates, and $ K $ representing the threshold score for supplementary lessons, separated by spaces. - The second line contains the initial scores $ S_1, S_2, \ldots, S_N $ of each student, separated by spaces. - $ S_i $ represents the initial score of the $ i $ -th student. - Lines $ 3 $ through $ 2 + M $ contain the details of the updates (if $ M = 0 $ , this part does not exist). - Line $ 2 + j $ contains the student number $ P_j $ whose score is changed in the $ j $ -th update and the new score $ V_j $ , separated by a space.

After all updates are completed, output in a single line the number of students whose score is strictly less than $ K $ points and are therefore required to attend supplementary lessons.

### Constraints - $ 1 \leq N \leq 10^5 $ - $ 0 \leq M \leq 10^5 $ - $ 0 \leq K \leq 100 $ - $ 0 \leq S_i \leq 100 $ $ (1 \leq i \leq N) $ - $ 1 \leq P_j \leq N $ $ (1 \leq j \leq M) $ - $ 0 \leq V_j \leq 100 $ $ (1 \leq j \leq M) $ - All input values are integers