{"raw_statement":[{"iden":"problem statement","content":"Takahashi has $N$ pieces of chocolate. The $i$\\-th piece has a rectangular shape with a width of $A_i$ centimeters and a length of $B_i$ centimeters.  \nHe also has $M$ boxes. The $i$\\-th box has a rectangular shape with a width of $C_i$ centimeters and a length of $D_i$ centimeters.\nDetermine whether it is possible to put the $N$ pieces of chocolate in the boxes under the conditions below.\n\n*   A box can contain at most one piece of chocolate.\n*   $A_i \\leq C_j$ and $B_i \\leq D_j$ must hold when putting the $i$\\-th piece of chocolate in the $j$\\-th box (they cannot be rotated)."},{"iden":"constraints","content":"*   $1 \\leq N \\leq M \\leq 2\\times 10^5$\n*   $1 \\leq A_i,B_i,C_i,D_i \\leq 10^9$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $\\ldots$ $A_N$\n$B_1$ $\\ldots$ $B_N$\n$C_1$ $\\ldots$ $C_M$\n$D_1$ $\\ldots$ $D_M$"},{"iden":"sample input 1","content":"2 3\n2 4\n3 2\n8 1 5\n2 10 5"},{"iden":"sample output 1","content":"Yes\n\nWe can put the first piece of chocolate in the third box and the second piece in the first box."},{"iden":"sample input 2","content":"2 2\n1 1\n2 2\n100 1\n100 1"},{"iden":"sample output 2","content":"No\n\nA box can contain at most one piece of chocolate."},{"iden":"sample input 3","content":"1 1\n10\n100\n100\n10"},{"iden":"sample output 3","content":"No"},{"iden":"sample input 4","content":"1 1\n10\n100\n10\n100"},{"iden":"sample output 4","content":"Yes"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}