{"raw_statement":[{"iden":"problem statement","content":"You are given two integer sequences of length $N$: $A=(A_1,A_2,\\dots,A_N)$ and $B=(B_1,B_2,\\dots,B_N)$.\nYou may perform at most $31000$ operations of the following kind:\n\n*   Choose a pair of integers $(i,j)$ with $1 \\le i < j \\le N$, then replace $A_i$ with $A_j - 1$ and $A_j$ with $A_i + 1$.\n\nYour goal is to make $A = B$. Determine whether the goal is achievable, and if it is, output one sequence of operations that achieves it."},{"iden":"constraints","content":"*   $2 \\le N \\le 100$\n*   $1 \\le A_i,B_i \\le 100$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$A_1\\ A_2\\ \\dots\\ A_N$\n$B_1\\ B_2\\ \\dots\\ B_N$"},{"iden":"sample input 1","content":"4\n2 2 1 4\n3 2 2 2"},{"iden":"sample output 1","content":"Yes\n2\n1 4\n3 4\n\nThe following operations make $A = B$:\n\n*   Choose $(i,j) = (1,4)$. Then $A = (3,2,1,3)$.\n*   Choose $(i,j) = (3,4)$. Then $A = (3,2,2,2)$.\n\nSince minimizing the number of operations is not required, the following output is also accepted:\n\nYes\n6\n1 4\n3 4\n1 2\n1 2\n1 2\n1 2"},{"iden":"sample input 2","content":"6\n5 4 4 3 4 2\n5 1 2 3 4 1"},{"iden":"sample output 2","content":"No"},{"iden":"sample input 3","content":"7\n2 4 2 4 3 2 5\n5 4 3 2 5 1 2"},{"iden":"sample output 3","content":"Yes\n18\n5 7\n1 7\n2 4\n1 5\n1 5\n1 4\n4 5\n4 5\n3 4\n5 7\n1 5\n1 7\n1 6\n6 7\n1 7\n2 4\n2 5\n4 5"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}