#include <algorithm>

 #include <iostream>

 #include <iomanip>

 #include <cstring>

 #include <climits>

 #include <complex>

 #include <cassert>

 #include <cstdio>

 #include <bitset>

 #include <vector>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <ctime>

 #include <set>

 #include <map>

 #include <cmath>

 using namespace std;

 typedef struct P {

     int id;

     double v;

 }P;

 const int maxn = ;

 const double eps = 1e-;

 int ret[maxn];

 int v[maxn], w[maxn];

 int n, k;

 P p[maxn];

 bool cmp(P a, P b) {

     return a.v > b.v;

 }

 bool ok(double r) {

     for(int i = ; i < n; i++) {

         p[i].id = i;

         p[i].v = v[i] - w[i] * r;

     }

     sort(p, p+n, cmp);

     double s = .;

     for(int i = ; i < k; i++) {

         s += p[i].v;

     }

     return s >= ;

 }

 int main() {

     // freopen("in", "r", stdin);

     while(~scanf("%d%d",&n, &k)) {

         for(int i = ; i < n; i++) {

             scanf("%d%d",&v[i], &w[i]);

         }

         double lo = ., hi = 1e7;

         while(hi - lo > eps) {

             double mid = (lo + hi) / 2.0;

             if(ok(mid)) lo = mid;

             else hi = mid;

         }

         for(int i = ; i < k; i++) {

             printf("%d%c", p[i].id + , i==k-?'\n':' ');

         }

     }

     return ;

 }