D. Mysterious Present

Peter decided to wish happy birthday to his friend from Australia and send him a card. To make his present more mysterious, he decided to make a chain. Chain here is such a sequence of envelopes A = {a1,  a2,  ...,  an}, where the width and the height of the i-th envelope is strictly higher than the width and the height of the (i  -  1)-th envelope respectively. Chain size is the number of envelopes in the chain.

Peter wants to make the chain of the maximum size from the envelopes he has, the chain should be such, that he'll be able to put a card into it. The card fits into the chain if its width and height is lower than the width and the height of the smallest envelope in the chain respectively. It's forbidden to turn the card and the envelopes.

Peter has very many envelopes and very little time, this hard task is entrusted to you.

Input

The first line contains integers n, w, h (1  ≤ n ≤ 5000, 1 ≤ w,  h  ≤ 106) — amount of envelopes Peter has, the card width and height respectively. Then there follow n lines, each of them contains two integer numbers wi and hi — width and height of the i-th envelope (1 ≤ wi,  hi ≤ 106).

Output

In the first line print the maximum chain size. In the second line print the numbers of the envelopes (separated by space), forming the required chain, starting with the number of the smallest envelope. Remember, please, that the card should fit into the smallest envelope. If the chain of maximum size is not unique, print any of the answers.

If the card does not fit into any of the envelopes, print number 0 in the single line.

Examples

input

Copy

2 1 1
2 2
2 2

output

Copy

1
1 

input

Copy

3 3 3
5 4
12 11
9 8

output

Copy

3
1 3 2 

题意：就是给定宽度和高度，然后在给n个宽度，高度，选出一个最长的序列前面的宽度，高度均小于后面的，并且最小的要大于最先给定的宽度，高度。

思路：

这个有两个纬度要考虑，我先排序，把一个条件满足，在根据另一个条件作一次类似最长上升子序列，用个数组同时记录位置。

在dfs输出序列。

代码:

#include<iostream>
#include<cmath>
#include<cstring>
#include<vector>
#include<algorithm>
#define LL long long

using namespace std;
const int maxn=5e3+100;
struct node
{
    int  w,h,id;
    bool operator <(const node &rhs) const
    {
        if(w==rhs.w)
        {
            return h<rhs.h;
        }
        return w<rhs.w;
    }
};
node a[maxn];
int vis[maxn];
int dp[maxn];
vector<int>st;
void dfs(int gg)
{
    st.push_back(gg);
   // cout<<a[gg].id<<endl;
    if(gg==vis[gg])
    {
        return ;
    }
    dfs(vis[gg]);
}
int main()
{
    int n,w,h;
    cin>>n>>w>>h;

    for(int i=1;i<=n;i++)
    {
        cin>>a[i].w>>a[i].h;
        a[i].id=i;
    }
    sort(a+1,a+1+n);
    for(int i=1;i<=n;i++)
    {
        if(a[i].w>w&&a[i].h>h)
        {
            //cout<<a[i].w<<" "<<a[i]
            dp[i]=1;
            vis[a[i].id]=a[i].id;
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(a[i].w<w||a[i].h<h)
        {
            //cout<<a[i].id<<endl;
            continue;
        }
        for(int j=1;j<i;j++)
        {
            if(dp[i]<dp[j]+1&&a[i].h>a[j].h&&a[i].w>a[j].w&&a[j].w>w&&a[j].h>h)
            {
                dp[i]=dp[j]+1;
                vis[a[i].id]=a[j].id;
            }
        }
    }
    int ans=0,pos=0;
    for(int i=1;i<=n;i++)
    {
        if(dp[i]>ans)
        {
            //cout<<dp[i]<<" "<<a[i].id<<endl;
            ans=dp[i];
            pos=a[i].id;
        }
    }
    cout<<ans<<endl;
    //cout<<pos<<endl;
    if(vis[pos])
    {
        dfs(pos);
        reverse(st.begin(),st.end());
        for(int i=0;i<st.size();i++)
        {
            cout<<st[i]<<" ";
        }
        cout<<endl;
    }
    return 0;
}
/*
4 12 140
172 60
71 95
125 149
53 82

5 13 13
4 4
10 10
7 7
1 1
13 13

*/

总结：虽然我很快的建模，但边界处里还是low。