Hello 2018 D. Too Easy Problems（贪心+优先队列）

http://codeforces.com/contest/913/problem/D

D. Too Easy Problems

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are preparing for an exam on scheduling theory. The exam will last for exactly T milliseconds and will consist of n problems. You can either solve problem i in exactly ti milliseconds or ignore it and spend no time. You don't need time to rest after solving a problem, either.

Unfortunately, your teacher considers some of the problems too easy for you. Thus, he assigned an integer ai to every problem imeaning that the problem i can bring you a point to the final score only in case you have solved no more than ai problems overall (including problem i).

Formally, suppose you solve problems p1, p2, ..., pk during the exam. Then, your final score s will be equal to the number of values of jbetween 1 and k such that k ≤ apj.

You have guessed that the real first problem of the exam is already in front of you. Therefore, you want to choose a set of problems to solve during the exam maximizing your final score in advance. Don't forget that the exam is limited in time, and you must have enough time to solve all chosen problems. If there exist different sets of problems leading to the maximum final score, any of them will do.

Input

The first line contains two integers n and T (1 ≤ n ≤ 2·105; 1 ≤ T ≤ 109) — the number of problems in the exam and the length of the exam in milliseconds, respectively.

Each of the next n lines contains two integers ai and ti (1 ≤ ai ≤ n; 1 ≤ ti ≤ 104). The problems are numbered from 1 to n.

Output

In the first line, output a single integer s — your maximum possible final score.

In the second line, output a single integer k (0 ≤ k ≤ n) — the number of problems you should solve.

In the third line, output k distinct integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the indexes of problems you should solve, in any order.

If there are several optimal sets of problems, you may output any of them.

Examples

input

5 300
3 100
4 150
4 80
2 90
2 300

output

2
3
3 1 4

input

2 100
1 787
2 788

output

0
0

input

2 100
2 42
2 58

output

2
2
1 2

Note

In the first example, you should solve problems 3, 1, and 4. In this case you'll spend 80 + 100 + 90 = 270 milliseconds, falling within the length of the exam, 300 milliseconds (and even leaving yourself 30 milliseconds to have a rest). Problems 3 and 1 will bring you a point each, while problem 4 won't. You'll score two points.

In the second example, the length of the exam is catastrophically not enough to solve even a single problem.

In the third example, you have just enough time to solve both problems in 42 + 58 = 100 milliseconds and hand your solutions to the teacher with a smile.

【题意】

你要从n个题目中选出一些题目来，使得你得分最多，且耗时不能超过T

得分规则：如果你选了k道题，那么其中score>=k的那部分题目每个的1分。

最后输出得分，和选中的题目。

【分析】

贪心。按耗时排序，从耗时最小的题目开始考虑，这样能考虑尽量多的题目，从而获得最大分。

至于选中的题目，可以用优先队列保存。这是一个动态的过程，当加入新题目之后，要将队列中无法得分的题目删掉，这就是优先队列的有利之处。

【代码】

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node{
    int s,t,id;
    friend bool operator<(node a,node b){
        if(a.s==b.s)return a.t<b.t;
        return a.s>b.s;
    }
}a[202020];
int n,T;
bool cmp(node a,node b)
{
    return a.t<b.t;
}
int main()
{
    cin>>n>>T;
    for(int i=0;i<n;i++){
        cin>>a[i].s>>a[i].t;
        a[i].id=i+1;
    }
    sort(a,a+n,cmp);//按耗时升序
    priority_queue<node> q;
    ll sumt=0;
    for(int i=0;i<n;i++)
    {
        if(T-sumt>=a[i].t)//剩余时间充足时，加一个新题
        {
            q.push(a[i]);
            sumt+=a[i].t;
        }
        //加入新题后，要淘汰掉分值低于题数且耗时偏长的那些题，优先队列实现
        while(!q.empty()&&q.top().s < q.size()){
            sumt-=q.top().t;
            q.pop();
        }
    }
    cout<<q.size()<<endl;
    cout<<q.size()<<endl;
    while(!q.empty()){
        cout<<q.top().id<<' ';
        q.pop();
    }
    cout<<endl;
}