CF_4D_MysteriousPresent

D. Mysterious Present

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

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

2 1 1
2 2
2 2

output

1
1 

input

3 3 3
5 4
12 11
9 8

output

3
1 3 2 

题意

给出信的长宽

有一大堆信封n个给出长宽

然后问信外最多可以套多少个信封

内部的信封只有长宽严格小于外部的才可以

典型的dp题，与摞箱子如出一辙，只不过相当于高度是1

先按排序1序长2序宽排序

初始化所有的不能套在信外的信封为负无穷，能的为1

然后

dp[i]=所有合法的j,max(dp[j])+1

需要记录步骤，并且反着输出（从信往外的顺序）

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;

const int M=5005;
const int IN=1e9;
struct Node
{
    int w,h,p;
    bool operator<(Node a)const
    {
        if(w==a.w)
            return h<a.h;
        return w<a.w;
    }
}node[M];
int dp[M];
int step[M];
int ansc[M];

int main()
{
    int n,w,h;
    scanf("%d%d%d",&n,&w,&h);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&node[i].w,&node[i].h);
        node[i].p=i;
    }
    sort(node+1,node+n+1);
    for(int i=1;i<=n;i++)
    {
        if(node[i].w>w&&node[i].h>h)
            dp[i]=1;
        else
            dp[i]=-IN;
    }
    for(int i=2;i<=n;i++)
    {
        for(int j=1;j<i;j++)
        {
            if(node[j].w<node[i].w&&node[j].h<node[i].h&&dp[i]<dp[j]+1)
            {
                dp[i]=dp[j]+1;
                step[i]=j;
            }
        }
    }
    int ans=0,ansp=0;
    for(int i=1;i<=n;i++)
    {
        if(dp[i]>ans)
        {
            ans=dp[i];
            ansp=i;
        }
    }
    printf("%d\n",ans);
    for(int i=ans;i>0;i--)
    {
        ansc[i]=node[ansp].p;
        ansp=step[ansp];
    }
    for(int i=1;i<ans;i++)
        printf("%d ",ansc[i]);
    if(ans)
        printf("%d\n",ansc[ans]);
    return 0;
}