#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn=10000+1;
double w[maxn],v[maxn],a[maxn];
int m,f,n;
bool fabc[maxn];
double g[maxn];
double x,y;
int flag[maxn];
int main()
{
	freopen("sboost.in","r",stdin);
	freopen("sboost.out","w",stdout);
	
	cin>>f>>m>>n;
	double q=f*1.0/m;
	for (int i=1; i<=n; i++)
	{
		cin>>w[i]>>v[i];
		a[i]=w[i]*1.0/v[i];
		if (q>a[i])
			fabc[i]=true;
	}
	for (int i=1; i<=n; i++)
	{
		
		if (!fabc[i])
		{
			x+=w[i]; y+=v[i];
			double t=x*1.0/y;
			if (t>g[i-1])
			{
				g[i]=t;
				flag[i]=1;
			}
			else
			{
				g[i]=g[i-1];
				x-=w[i]; y-=v[i];
			}	
		}
	}
	for (int i=1; i<=n; i++)
	{
		if (flag[i]==1)
			cout<<i<<endl;
	}
	return 0;
}