Baekjoon #10775

#include<bits/stdc++.h>

using namespace std;

constexpr int MAXN = 100005;
int uf[MAXN];

int find(int x) {
    if(uf[x] < 0) return x;
    return uf[x] = find(uf[x]);
}

bool merge(int a, int b){
    a = find(a);
    b = find(b);
    if(a == b)return false;
    uf[b] = a;
    return true;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N, M; cin >> N >> M;
    for(int i=0;i<=N;i++) uf[i] = -1;
    int answer = 0;
    for(int i=0;i<M;i++){
        int x;cin >> x;
        int cur = find(x);
        if(cur == 0) break;
        merge(cur - 1, cur);
        answer ++;
    }
    cout << answer;

    return 0;
}

import sys

def input():
    return sys.stdin.readline().rstrip()

G = int(input())
P = int(input())
gates = list(range(G + 1))

def find_max(x):
    if gates[x] != x:
        gates[x] = find_max(gates[x])
    return gates[x]

answer = 0
for _ in range(P):
    plane = int(input())
    gate_n = find_max(plane)
    if gate_n == 0:
        print(answer)
        sys.exit(0)
    answer += 1
    gates[gate_n] = gates[gate_n - 1]
print(answer)