#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>
#include <stdio.h>

using namespace std;

int main() {

	int N, M, A[100005];
	for (int i = 0; i < 100005; i++) A[i] = i + 1;
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		int tmp;
		cin >> tmp;
		int v = A[tmp-1];
		for (int j = tmp - 1; j > 0; j--) {
			A[j] = A[j - 1];
		}
		A[0] = v;
	}

	cout << A[0] << endl;

	return 0;
}