Archive Envelope Chain

An assessment center stores candidate cards inside envelopes. A card can go into an envelope only when both the envelope width and height are strictly larger than the card. Envelopes can then be nested, but every next envelope must again be strictly wider and strictly taller than the previous one. For each batch, report the maximum number of envelopes that can appear in one valid nesting chain around the starting card. Input Format: The first line contains t. Each case starts with n, w, and h: the number of envelopes and the card size. The next n lines contain the width and height of one envelope. Output Format: For each case, print one integer: the maximum valid chain length. Print 0 if no envelope can contain the card.