#include<algorithm>
#include<stdio.h>
#include<math.h>
using namespace std;
;
;
;
struct Jewel{ int id, v, w; }arr[maxn];
struct st{
    double val; int id;
    bool operator < (const st & rhs) const{
        return this->val > rhs.val;
    };
}c[maxn];
int N, K, ans[maxn];

bool OK(double key)
{
    ; i<=N; i++){
        c[i].val = arr[i].v - arr[i].w * key;
        c[i].id = arr[i].id;
    }
    sort(c+, c++N);
    ;
    ; i<=K; i++)
        sum += c[i].val;
    if(sum >= 0.0){
        ; i<=K; i++)
            ans[i] = c[i].id;
        return true;
    }else return false;
}

int main(void)
{
    while(~scanf("%d %d", &N, &K)){
        ; i<=N; i++){
            if(i <= K) ans[i] = i;///注意要提前给 ans 赋上初值，因为 OK 函数可能永远不为真，例如所有物品的 v = 0
            arr[i].id = i;
            scanf("%d %d", &arr[i].v, &arr[i].w);
        }

        double L = 0.0;
        double R = INF;
        while(R - L > EPS){
            double mid = ( R + L ) / 2.0;
            if(OK(mid)) L = mid;
            else R = mid;
        }

        ; i<=K; i++){
            printf("%d", ans[i]);
            if(i < K) putchar(' ');
            else putchar('\n');
        }
    }
    ;
}