#include <fstream>

using namespace std;

ifstream fin ("grupuri.in");

ofstream fout ("grupuri.out");

int main () {

	int k, n;

	fin >> k >> n;

	int v[n + 1];

	for (int i = 1; i <= n; ++i)
		fin >> v[i];

	int poz = n + 1, st = 1, dr = n;

	while (st <= dr) {

		int mij = st + (dr - st) / 2;

		if (v[mij] > k) {

			poz = mij;

			dr = mij - 1;
		}
		else
			st = mij + 1;
	}

	fout << poz - 1;

	return 0;
}