#include<cstdio>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fi("sboost.in");
ofstream fo("sboost.out");
struct CH
{
	double a;
	int num,f,m;
	bool operator < (const CH& x) const
    {
		return a>x.a;
    }
};
vector<CH>a;
vector<int>Ans;
int main()
{
	//freopen("sboost.in","r",stdin);
	//freopen("sboost.out","w",stdout);
	int ff,mm,i,n,F,M;
	//scanf("%d %d %d\n",&F,&M,&n);
	fi>>F>>M>>n;
	//double A=F/M;
	for(i=0;i<n;i++)
	{
		//scanf("%d %d\n",&ff,&mm);
		fi>>ff>>mm;
		CH K;
		K.a=ff/mm;K.a=i+1;K.f=ff;K.m=mm;
		a.push_back(K);
		//a.push_back((CH){double(ff/mm),i+1,ff,mm});
	}
	sort(a.begin(),a.end());
	for(i=n-1;i>=0;i--)
	{
		
		if(double((F+a[i].f)/(M+a[i].m))>double(F/M))
		{
			F+=a[i].f;
			M+=a[i].m;
			Ans.push_back(a[i].num);
		}
		else
			goto NEXT;
	}
	fo<<"NONE";
	return 0;
	NEXT:;
	sort(Ans.begin(),Ans.end());
	for(i=0;i<Ans.size();i++)fo<<Ans[i]<<endl;
		//printf("%d\n",Ans[i]);
	return 0;
}