{"problem":{"name":"Trick Taking","description":{"content":"$N$ players with **ID numbers** $1, 2, \\ldots, N$ are playing a card game.   Each player plays one card. Each card has two parameters: **color** and **rank**, both of which are represented by positive","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc299_b"},"statements":[{"statement_type":"Markdown","content":"$N$ players with **ID numbers** $1, 2, \\ldots, N$ are playing a card game.  \nEach player plays one card.\nEach card has two parameters: **color** and **rank**, both of which are represented by positive integers.  \nFor $i = 1, 2, \\ldots, N$, the card played by player $i$ has a color $C_i$ and a rank $R_i$. All of $R_1, R_2, \\ldots, R_N$ are different.\nAmong the $N$ players, one **winner** is decided as follows.\n\n*   If one or more cards with the color $T$ are played, the player who has played the card with the greatest rank among those cards is the winner.\n*   If no card with the color $T$ is played, the player who has played the card with the greatest rank among the cards with the color of the card played by player $1$ is the winner. (Note that player $1$ may win.)\n\nPrint the ID number of the winner.\n\n## Constraints\n\n*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq T \\leq 10^9$\n*   $1 \\leq C_i \\leq 10^9$\n*   $1 \\leq R_i \\leq 10^9$\n*   $i \\neq j \\implies R_i \\neq R_j$\n*   All values in the input are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $T$\n$C_1$ $C_2$ $\\ldots$ $C_N$\n$R_1$ $R_2$ $\\ldots$ $R_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc299_b","tags":[],"sample_group":[["4 2\n1 2 1 2\n6 3 4 5","4\n\nCards with the color $2$ are played. Thus, the winner is player $4$, who has played the card with the greatest rank, $5$, among those cards."],["4 2\n1 3 1 4\n6 3 4 5","1\n\nNo card with the color $2$ is played. Thus, the winner is player $1$, who has played the card with the greatest rank, $6$, among the cards with the color of the card played by player $1$ (color $1$)."],["2 1000000000\n1000000000 1\n1 1000000000","1"]],"created_at":"2026-03-03 11:01:14"}}