#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>

#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int main(void){
	int n,m;
	cin>>n>>m;
	list<int> v;
	re(i,n)v.push_back(i+1);
	while(m--){
		int a;
		cin>>a;
		auto it=v.begin();
		re(i,a-1)it++;
		auto t=*it;
		v.erase(it);
		v.push_front(t);
	}
	cout<<*v.begin()<<endl;
	return 0;
}