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

long long k , m , n , h[10000000] , x = 0;
bool d = true;

struct game
{
	long long a , b , c;
};game g[10000000];

bool cmp(game x , game y) 
{
	return x.b > y.b;
}

int main()
{
	cin >> k >> m >> n;
	for(int i = 0; i < m; ++i) {
		cin >> g[i].a >> g[i].b;
		g[i].c = i + 1;
	}
	sort(g , g + m , cmp);
	for(int i = 0; i < m; ++i) {
		if(n - k / g[i].a * g[i].b <= 0){
			h[x++] = g[i].c;
			d = false;
		}
	}
	sort(h , h + x);
	for(int i = 0; i < x; ++i) cout << h[i] <<" ";
	if(d) cout << -1;
	return 0;
}