#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <cctype>
using namespace std;
typedef long long ll;

int main()
{
	int n, m, a;
	vector<int>v;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)v.push_back(i);
	for (int i = 0; i < m; i++)
	{
		cin >> a;
		int p = v[a - 1];
		v.erase(v.begin() + a - 1);
		vector<int>w = v;
		v.clear();
		v.push_back(p);
		for (int j = 0; j < n - 1; j++)v.push_back(w[j]);
		w.clear();
	}
	cout << v[0] << endl;
	return 0;
}