0:\n for p in range(x,x+a):\n l[j][p%n]=1\n c-=1\n else:\n for p in range(x,x+a+1):\n l[j][p%n]=1\n x+=1\n x%=n\n if k%n:\n ans=2\n else:\n ans=0\n else:\n ans=0\n print(ans)\n for j in l:\n print(*j,sep='')\n \n \n \n \n \n \n \n"}}},{"rowIdx":5670,"cells":{"id":{"kind":"string","value":"1394_A. Boboniu Chats with Du_26761"},"description":{"kind":"string","value":"Have you ever used the chat application QQ? Well, in a chat group of QQ, administrators can muzzle a user for days.\n\nIn Boboniu's chat group, there's a person called Du Yi who likes to make fun of Boboniu every day.\n\nDu will chat in the group for n days. On the i-th day:\n\n * If Du can speak, he'll make fun of Boboniu with fun factor a_i. But after that, he may be muzzled depending on Boboniu's mood. \n * Otherwise, Du won't do anything. \n\n\n\nBoboniu's mood is a constant m. On the i-th day:\n\n * If Du can speak and a_i>m, then Boboniu will be angry and muzzle him for d days, which means that Du won't be able to speak on the i+1, i+2, ⋅⋅⋅, min(i+d,n)-th days. \n * Otherwise, Boboniu won't do anything. \n\n\n\nThe total fun factor is the sum of the fun factors on the days when Du can speak.\n\nDu asked you to find the maximum total fun factor among all possible permutations of a.\n\nInput\n\nThe first line contains three integers n, d and m (1≤ d≤ n≤ 10^5,0≤ m≤ 10^9).\n\nThe next line contains n integers a_1, a_2, …,a_n (0≤ a_i≤ 10^9).\n\nOutput\n\nPrint one integer: the maximum total fun factor among all permutations of a.\n\nExamples\n\nInput\n\n\n5 2 11\n8 10 15 23 5\n\n\nOutput\n\n\n48\n\n\nInput\n\n\n20 2 16\n20 5 8 2 18 16 2 16 16 1 5 16 2 13 6 16 4 17 21 7\n\n\nOutput\n\n\n195\n\nNote\n\nIn the first example, you can set a'=[15, 5, 8, 10, 23]. Then Du's chatting record will be:\n\n 1. Make fun of Boboniu with fun factor 15. \n 2. Be muzzled. \n 3. Be muzzled. \n 4. Make fun of Boboniu with fun factor 10. \n 5. Make fun of Boboniu with fun factor 23. \n\n\n\nThus the total fun factor is 48."},"code":{"kind":"string","value":"#! /usr/bin/python3\n\nn, d, m = [int(inp) for inp in input().split()]\naArr = sorted([int(inp) for inp in input().split()], reverse = True)\n\ni = sum([j > m for j in aArr])\n\naU = aArr[:i]\naL = aArr[i:]\n\naUS = aU\nfor i in range(1, len(aU)):\n\taUS[i] += aUS[i - 1]\naUS = [0] + aUS\n\naLS = aL\nfor i in range(1, len(aL)):\n\taLS[i] += aLS[i - 1]\naLS = [0] + aLS\n\nfromU = min(1 + (n - 1)//(d + 1), len(aU))\n\nmaxFun = aUS[0] + aLS[-1]\n\nfor j in range(1, fromU + 1):\n\tnewFun = aUS[j] + aLS[min(max(0, n - 1 - (j - 1)*(d + 1)), len(aL))]\n\tif newFun > maxFun:\n\t\tmaxFun = newFun\n\nprint(maxFun)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"20 2 16\\n20 5 8 2 18 16 2 16 16 1 5 16 2 13 6 16 4 17 21 7\\n\",\n \"5 2 11\\n8 10 15 23 5\\n\",\n \"10 1 73\\n46 83 26 98 96 83 87 42 10 17\\n\",\n \"10 3 10\\n17 17 17 8 7 6 5 4 1 1\\n\",\n \"39 37 39\\n38 56 198 166 86 51 13 54 101 143 82 138 122 146 86 198 81 177 92 56 107 58 124 82 41 126 79 47 191 41 188 108 38 12 18 57 68 134 79\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 20 49 38 57 86 77 59 74 86 12 8 79 32 70 69 43 78 37 88 71 22 0 21 21 30 3 76 87 98 52 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 17 31 65 89\\n\",\n \"5 3 3\\n8 5 5 1 14\\n\",\n \"100 61 71\\n11 18 0 47 33 75 91 13 8 21 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 36 45 33 21 68 57 79 75 23 67 37 99 27 30 56 75 62 75 63 46 19 79 42 11 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 51 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"1 1 0\\n0\\n\",\n \"4 4 8\\n84 25 75 21\\n\",\n \"1 1 1\\n2\\n\",\n \"10 3 10\\n17 17 12 8 7 6 5 4 1 1\\n\",\n \"39 37 39\\n38 56 198 166 86 51 13 54 101 143 82 138 122 146 65 198 81 177 92 56 107 58 124 82 41 126 79 47 191 41 188 108 38 12 18 57 68 134 79\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 20 49 38 57 86 77 107 74 86 12 8 79 32 70 69 43 78 37 88 71 22 0 21 21 30 3 76 87 98 52 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 17 31 65 89\\n\",\n \"5 1 3\\n8 5 5 1 14\\n\",\n \"100 61 71\\n11 18 0 47 33 75 91 13 8 21 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 36 45 33 21 68 57 79 75 23 67 37 99 27 30 56 75 62 75 63 1 19 79 42 11 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 51 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"1 0 0\\n0\\n\",\n \"4 4 15\\n84 25 75 21\\n\",\n \"1 1 0\\n2\\n\",\n \"20 2 16\\n20 2 8 2 18 16 2 16 16 1 5 16 2 13 6 16 4 17 21 7\\n\",\n \"5 2 11\\n8 10 15 34 5\\n\",\n \"10 5 10\\n17 17 12 8 7 6 5 4 1 1\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 32 70 69 43 78 37 88 71 22 0 21 21 30 3 76 87 98 52 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 17 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 75 91 13 8 21 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 36 45 33 21 68 57 79 75 23 21 37 99 27 30 56 75 62 75 63 1 19 79 42 11 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 51 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"20 2 16\\n20 2 8 2 18 16 2 16 16 1 5 16 2 13 6 16 4 17 21 14\\n\",\n \"5 2 11\\n8 10 5 34 5\\n\",\n \"10 5 10\\n17 9 12 8 7 6 5 4 1 1\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 32 70 69 43 78 37 88 137 22 0 21 21 30 3 76 87 98 52 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 17 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 75 91 13 8 21 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 18 45 33 21 68 57 79 75 23 21 37 99 27 30 56 75 62 75 63 1 19 79 42 11 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 51 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"1 1 -1\\n1\\n\",\n \"10 5 10\\n17 18 12 8 7 6 5 4 1 1\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 32 70 19 43 78 37 88 137 22 0 21 21 30 3 76 87 98 52 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 17 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 75 91 13 8 21 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 19 79 42 11 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 51 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"20 2 16\\n20 2 8 1 18 16 2 21 16 1 5 16 2 13 6 16 4 17 21 14\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 32 70 19 43 78 37 88 137 22 0 21 21 30 3 76 87 98 52 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 4 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 75 91 13 8 30 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 19 79 42 11 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 51 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"20 2 16\\n20 2 8 1 18 16 2 21 16 1 5 16 2 13 6 16 4 22 21 14\\n\",\n \"10 5 10\\n17 21 12 8 7 6 5 8 1 1\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 32 70 19 43 78 37 88 137 19 0 21 21 30 3 76 87 98 52 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 4 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 75 91 13 8 30 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 19 79 42 11 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 32 70 19 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 4 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 19 79 42 11 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"20 2 16\\n20 2 8 1 18 16 2 15 16 1 5 16 4 13 6 16 4 22 21 14\\n\",\n \"10 5 10\\n17 25 12 8 7 6 10 8 1 1\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 32 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 4 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 19 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"20 2 16\\n20 2 8 1 18 16 2 15 16 1 5 16 4 13 6 16 4 22 14 14\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 41 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 4 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 73 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"20 2 16\\n20 2 8 1 18 16 2 15 16 1 7 16 4 13 6 16 4 22 14 14\\n\",\n \"10 5 10\\n17 25 12 8 2 6 10 9 1 1\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 78 41 38 49 38 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 4 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 36 68 32 64 74 32 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"10 5 10\\n17 25 12 8 2 6 18 9 1 1\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 66 41 38 49 38 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 4 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 36 68 32 64 74 63 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 1 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"10 5 10\\n17 25 12 5 2 6 18 9 1 1\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 66 41 38 49 38 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 65 7 53 81 21 63 11 31 35 0 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 36 68 32 64 74 63 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 2 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 66 41 38 49 38 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 66 79 60 56 31 19 89 73 81 79 16 76 79 94 23 110 7 53 81 21 63 11 31 35 0 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 13 68 32 64 74 63 77 81 41 23 44 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 2 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 13 68 32 64 74 63 77 81 41 23 1 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 2 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 94 41 38 49 38 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 57 79 60 56 31 19 89 73 81 79 16 76 79 94 23 110 7 53 81 21 63 11 31 35 0 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 13 68 32 64 74 63 77 81 41 23 1 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 62 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 3 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 94 41 38 49 38 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 34 83 57 79 60 56 31 19 89 73 81 79 16 76 79 94 23 110 7 53 81 21 63 11 31 35 0 31 65 89\\n\",\n \"100 61 71\\n11 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 13 68 32 64 74 63 77 81 41 23 1 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 39 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 3 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"10 5 8\\n17 25 12 5 2 0 13 9 2 1\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 28 21 198 81 177 30 56 107 115 124 82 41 126 58 47 191 0 188 108 38 8 21 57 68 132 79\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 94 41 38 49 30 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 34 83 57 79 60 56 31 19 89 73 81 79 16 76 79 94 23 110 7 53 81 21 63 11 31 35 0 31 65 89\\n\",\n \"100 61 71\\n0 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 13 68 32 64 74 63 77 81 41 23 1 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 39 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 3 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"10 7 8\\n17 25 12 5 2 0 13 9 2 1\\n\",\n \"39 37 39\\n38 37 198 166 57 51 13 61 101 143 91 3 122 28 21 198 81 177 30 56 107 115 124 82 41 126 58 47 191 0 188 108 38 8 21 57 68 132 79\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 94 41 38 49 30 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 34 83 57 135 60 56 31 19 89 73 81 79 16 76 79 94 23 110 7 53 81 21 63 11 31 35 0 31 65 89\\n\",\n \"10 7 8\\n17 25 12 5 2 0 13 18 2 1\\n\",\n \"39 37 39\\n38 37 198 166 57 51 19 61 101 143 91 3 122 28 21 198 81 177 30 56 107 115 124 82 41 126 58 47 191 0 188 108 38 8 21 57 68 132 79\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 94 41 38 49 30 57 86 77 107 74 86 12 8 79 39 70 6 43 78 61 88 137 19 0 21 21 30 3 76 87 98 34 83 57 135 60 56 31 19 89 73 81 79 16 76 79 94 23 110 7 53 81 21 63 11 31 35 0 31 65 89\\n\",\n \"100 61 71\\n0 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 13 68 32 64 93 63 77 81 41 23 1 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 39 75 60 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 3 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"10 7 8\\n24 25 12 5 2 0 13 18 2 1\\n\",\n \"100 61 71\\n0 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 13 68 32 64 93 63 77 81 41 3 1 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 39 75 60 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 3 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"39 37 39\\n38 46 198 166 57 51 19 61 101 143 91 3 122 28 21 198 81 177 30 56 107 136 124 82 41 126 58 47 191 0 188 108 38 8 21 57 68 132 79\\n\",\n \"39 37 39\\n38 56 198 166 86 51 13 54 101 143 82 138 122 146 65 198 81 177 92 56 107 58 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"1 1 -1\\n2\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 54 101 143 82 138 122 146 65 198 81 177 92 56 107 58 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"20 2 16\\n20 2 8 1 18 16 2 16 16 1 5 16 2 13 6 16 4 17 21 14\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 54 101 143 53 138 122 146 65 198 81 177 92 56 107 58 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"10 5 10\\n17 21 12 8 7 6 5 4 1 1\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 54 101 143 53 138 122 146 44 198 81 177 92 56 107 58 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 54 101 143 53 3 122 146 44 198 81 177 92 56 107 58 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"20 2 16\\n20 2 8 1 18 16 2 21 16 1 5 16 4 13 6 16 4 22 21 14\\n\",\n \"10 5 10\\n17 21 12 8 7 6 10 8 1 1\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 54 101 143 53 3 122 146 44 198 81 177 30 56 107 58 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 54 101 143 91 3 122 146 44 198 81 177 30 56 107 58 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"10 5 10\\n17 25 12 8 2 6 10 8 1 1\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 146 44 198 81 177 30 56 107 58 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 146 44 198 81 177 30 56 107 70 124 82 41 126 79 47 191 41 188 108 38 8 18 57 68 134 79\\n\",\n \"20 2 16\\n20 2 8 1 18 16 2 15 16 1 7 21 4 13 6 16 4 22 14 14\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 146 44 198 81 177 30 56 107 70 124 82 41 126 79 47 191 41 188 108 38 8 21 57 68 134 79\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 146 44 198 81 177 30 56 107 70 124 82 41 126 58 47 191 41 188 108 38 8 21 57 68 134 79\\n\",\n \"10 5 10\\n17 25 12 5 2 1 18 9 1 1\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 28 44 198 81 177 30 56 107 70 124 82 41 126 58 47 191 41 188 108 38 8 21 57 68 134 79\\n\",\n \"10 5 10\\n17 25 12 5 2 1 18 9 2 1\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 28 44 198 81 177 30 56 107 70 124 82 41 126 58 47 191 0 188 108 38 8 21 57 68 134 79\\n\",\n \"79 14 68\\n55 91 81 39 60 85 43 53 48 12 23 70 26 61 51 92 52 23 66 41 38 49 38 57 86 77 107 74 86 12 8 79 39 70 6 43 78 37 88 137 19 0 21 21 30 3 76 87 98 95 83 57 79 60 56 31 19 89 73 81 79 16 76 79 94 23 110 7 53 81 21 63 11 31 35 0 31 65 89\\n\",\n \"10 5 10\\n17 25 12 5 2 1 13 9 2 1\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 28 44 198 81 177 30 56 107 70 124 82 41 126 58 47 191 0 188 108 38 8 21 57 68 132 79\\n\",\n \"10 5 10\\n17 25 12 5 2 0 13 9 2 1\\n\",\n \"39 37 39\\n38 56 198 166 57 51 13 61 101 143 91 3 122 28 44 198 81 177 30 56 107 115 124 82 41 126 58 47 191 0 188 108 38 8 21 57 68 132 79\\n\",\n \"100 61 71\\n0 18 0 47 33 37 91 13 8 30 73 64 50 97 62 50 2 13 68 32 64 93 63 77 81 41 23 1 40 18 45 33 21 68 57 79 107 23 21 37 99 27 30 56 75 39 75 63 1 15 79 42 18 66 21 25 2 12 89 48 75 7 57 85 80 14 82 29 66 47 29 10 3 84 79 39 33 81 135 26 80 67 52 25 38 68 57 53 38 83 83 3 86 29 50 46 3 68 88 10\\n\",\n \"39 37 39\\n38 37 198 166 57 51 19 61 101 143 91 3 122 28 21 198 81 177 30 56 107 136 124 82 41 126 58 47 191 0 188 108 38 8 21 57 68 132 79\\n\",\n \"10 7 9\\n24 25 12 5 2 0 13 18 2 1\\n\"\n ],\n \"output\": [\n \"195\\n\",\n \"48\\n\",\n \"493\\n\",\n \"64\\n\",\n \"396\\n\",\n \"2038\\n\",\n \"22\\n\",\n \"2765\\n\",\n \"0\\n\",\n \"84\\n\",\n \"2\\n\",\n \"64\\n\",\n \"396\\n\",\n \"1994\\n\",\n \"27\\n\",\n \"2720\\n\",\n \"0\\n\",\n \"84\\n\",\n \"2\\n\",\n \"195\\n\",\n \"59\\n\",\n \"55\\n\",\n \"2012\\n\",\n \"2674\\n\",\n \"202\\n\",\n \"62\\n\",\n \"58\\n\",\n \"2055\\n\",\n \"2656\\n\",\n \"1\\n\",\n \"56\\n\",\n \"2074\\n\",\n \"2664\\n\",\n \"196\\n\",\n \"2061\\n\",\n \"2673\\n\",\n \"201\\n\",\n \"61\\n\",\n \"2058\\n\",\n \"2648\\n\",\n \"2006\\n\",\n \"2685\\n\",\n \"206\\n\",\n \"68\\n\",\n \"1993\\n\",\n \"2692\\n\",\n \"207\\n\",\n \"2000\\n\",\n \"2688\\n\",\n \"209\\n\",\n \"69\\n\",\n \"2007\\n\",\n \"2716\\n\",\n \"66\\n\",\n \"2073\\n\",\n \"2747\\n\",\n \"63\\n\",\n \"2069\\n\",\n \"2748\\n\",\n \"2016\\n\",\n \"2725\\n\",\n \"2682\\n\",\n \"1941\\n\",\n \"2683\\n\",\n \"1975\\n\",\n \"2660\\n\",\n \"51\\n\",\n \"398\\n\",\n \"1967\\n\",\n \"2649\\n\",\n \"47\\n\",\n \"435\\n\",\n \"1995\\n\",\n \"48\\n\",\n \"441\\n\",\n \"2019\\n\",\n \"2646\\n\",\n \"54\\n\",\n \"2626\\n\",\n \"404\\n\",\n \"396\\n\",\n \"2\\n\",\n \"396\\n\",\n \"202\\n\",\n \"396\\n\",\n \"59\\n\",\n \"396\\n\",\n \"396\\n\",\n \"201\\n\",\n \"64\\n\",\n \"396\\n\",\n \"396\\n\",\n \"68\\n\",\n \"396\\n\",\n \"396\\n\",\n \"206\\n\",\n \"396\\n\",\n \"396\\n\",\n \"59\\n\",\n \"396\\n\",\n \"59\\n\",\n \"396\\n\",\n \"2007\\n\",\n \"58\\n\",\n \"396\\n\",\n \"58\\n\",\n \"396\\n\",\n \"2649\\n\",\n \"441\\n\",\n \"54\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nHave you ever used the chat application QQ? Well, in a chat group of QQ, administrators can muzzle a user for days.\n\nIn Boboniu's chat group, there's a person called Du Yi who likes to make fun of Boboniu every day.\n\nDu will chat in the group for n days. On the i-th day:\n\n * If Du can speak, he'll make fun of Boboniu with fun factor a_i. But after that, he may be muzzled depending on Boboniu's mood. \n * Otherwise, Du won't do anything. \n\n\n\nBoboniu's mood is a constant m. On the i-th day:\n\n * If Du can speak and a_i>m, then Boboniu will be angry and muzzle him for d days, which means that Du won't be able to speak on the i+1, i+2, ⋅⋅⋅, min(i+d,n)-th days. \n * Otherwise, Boboniu won't do anything. \n\n\n\nThe total fun factor is the sum of the fun factors on the days when Du can speak.\n\nDu asked you to find the maximum total fun factor among all possible permutations of a.\n\nInput\n\nThe first line contains three integers n, d and m (1≤ d≤ n≤ 10^5,0≤ m≤ 10^9).\n\nThe next line contains n integers a_1, a_2, …,a_n (0≤ a_i≤ 10^9).\n\nOutput\n\nPrint one integer: the maximum total fun factor among all permutations of a.\n\nExamples\n\nInput\n\n\n5 2 11\n8 10 15 23 5\n\n\nOutput\n\n\n48\n\n\nInput\n\n\n20 2 16\n20 5 8 2 18 16 2 16 16 1 5 16 2 13 6 16 4 17 21 7\n\n\nOutput\n\n\n195\n\nNote\n\nIn the first example, you can set a'=[15, 5, 8, 10, 23]. Then Du's chatting record will be:\n\n 1. Make fun of Boboniu with fun factor 15. \n 2. Be muzzled. \n 3. Be muzzled. \n 4. Make fun of Boboniu with fun factor 10. \n 5. Make fun of Boboniu with fun factor 23. \n\n\n\nThus the total fun factor is 48.\n\n### Input:\n20 2 16\n20 5 8 2 18 16 2 16 16 1 5 16 2 13 6 16 4 17 21 7\n\n### Output:\n195\n\n\n### Input:\n5 2 11\n8 10 15 23 5\n\n### Output:\n48\n\n\n### Code:\n#! /usr/bin/python3\n\nn, d, m = [int(inp) for inp in input().split()]\naArr = sorted([int(inp) for inp in input().split()], reverse = True)\n\ni = sum([j > m for j in aArr])\n\naU = aArr[:i]\naL = aArr[i:]\n\naUS = aU\nfor i in range(1, len(aU)):\n\taUS[i] += aUS[i - 1]\naUS = [0] + aUS\n\naLS = aL\nfor i in range(1, len(aL)):\n\taLS[i] += aLS[i - 1]\naLS = [0] + aLS\n\nfromU = min(1 + (n - 1)//(d + 1), len(aU))\n\nmaxFun = aUS[0] + aLS[-1]\n\nfor j in range(1, fromU + 1):\n\tnewFun = aUS[j] + aLS[min(max(0, n - 1 - (j - 1)*(d + 1)), len(aL))]\n\tif newFun > maxFun:\n\t\tmaxFun = newFun\n\nprint(maxFun)"}}},{"rowIdx":5671,"cells":{"id":{"kind":"string","value":"1436_E. Complicated Computations_26767"},"description":{"kind":"string","value":"In this problem MEX of a certain array is the smallest positive integer not contained in this array.\n\nEveryone knows this definition, including Lesha. But Lesha loves MEX, so he comes up with a new problem involving MEX every day, including today.\n\nYou are given an array a of length n. Lesha considers all the non-empty subarrays of the initial array and computes MEX for each of them. Then Lesha computes MEX of the obtained numbers.\n\nAn array b is a subarray of an array a, if b can be obtained from a by deletion of several (possible none or all) elements from the beginning and several (possibly none or all) elements from the end. In particular, an array is a subarray of itself.\n\nLesha understands that the problem is very interesting this time, but he doesn't know how to solve it. Help him and find the MEX of MEXes of all the subarrays!\n\nInput\n\nThe first line contains a single integer n (1 ≤ n ≤ 10^5) — the length of the array. \n\nThe next line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ n) — the elements of the array.\n\nOutput\n\nPrint a single integer — the MEX of MEXes of all subarrays.\n\nExamples\n\nInput\n\n\n3\n1 3 2\n\n\nOutput\n\n\n3\n\n\nInput\n\n\n5\n1 4 3 1 2\n\n\nOutput\n\n\n6"},"code":{"kind":"string","value":"class SegmentTree:\n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n self.range = [(-1,n)] * 2 * self.num\n # 配列の値を葉にセット\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n self.range[self.num + i] = (i,i)\n # 構築していく\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n self.range[i] = (self.range[2 * i][0],self.range[2 * i + 1][1])\n\n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n def bisect_l(self,l,r,x):\n l += self.num\n r += self.num\n Lmin = -1\n Rmin = -1\n while l<r:\n if l & 1:\n if self.tree[l] <= x and Lmin==-1:\n Lmin = l\n l += 1\n if r & 1:\n if self.tree[r-1] <=x:\n Rmin = r-1\n l >>= 1\n r >>= 1\n\n if Lmin != -1:\n pos = Lmin\n while pos<self.num:\n if self.tree[2 * pos] <=x:\n pos = 2 * pos\n else:\n pos = 2 * pos +1\n return pos-self.num\n elif Rmin != -1:\n pos = Rmin\n while pos<self.num:\n if self.tree[2 * pos] <=x:\n pos = 2 * pos\n else:\n pos = 2 * pos +1\n return pos-self.num\n else:\n return -1\n\nn = int(input())\np = list(map(int,input().split()))\n\npos = [[] for i in range(n+2)]\nfor i in range(n):\n pos[p[i]].append(i)\n\nquery = [[] for i in range(n)]\n\nfor i in range(1,n+2):\n for j in range(len(pos[i])-1):\n L = pos[i][j] + 1\n R = pos[i][j+1] - 1\n if L<=R:\n query[R].append((L,i))\n if pos[i]:\n if pos[i][0]!=0:\n query[pos[i][0]-1].append((0,i))\n if pos[i][-1]!=n-1:\n query[n-1].append((pos[i][-1]+1,i))\n else:\n query[n-1].append((0,i))\n\n#print(query)\n\nflag = [False for i in range(n+3)]\n\ninit = [-1]*(n+2)\ninit[0] = n\nlastappeared = SegmentTree(init,min,-1)\nfor i in range(n):\n lastappeared.update(p[i],i)\n for l,val in query[i]:\n check = lastappeared.bisect_l(0,n+2,l-1)\n #print(l,i,val,check)\n #pp = [lastappeared.tree[j+lastappeared.num] for j in range(n)]\n\n if check>=val or check==-1:\n flag[val] = True\n\n\nfor i in range(1,n+3):\n if not flag[i]:\n print(i)\n break"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"5\\n1 4 3 1 2\\n\",\n \"3\\n1 3 2\\n\",\n \"94\\n23 8 25 27 33 16 8 8 15 11 33 23 13 18 26 20 21 10 18 15 6 11 21 14 27 16 5 1 33 11 31 33 3 21 31 7 28 32 19 16 20 22 23 18 24 16 24 18 22 12 31 9 14 29 25 29 29 16 12 15 21 6 30 21 28 11 2 33 7 12 33 16 28 32 28 27 21 18 27 17 24 22 23 4 16 2 5 23 2 21 3 17 2 2\\n\",\n \"100\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"54\\n17 16 24 6 14 17 19 21 21 19 23 4 13 21 8 6 4 15 5 2 16 8 3 24 19 6 1 11 7 16 18 20 3 3 21 15 12 24 6 22 10 18 11 23 22 5 23 25 11 16 13 7 11 12\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 73 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 91 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 35 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 53 92 93 94 95 96 97 98 99 100\\n\",\n \"84\\n60 20 43 2 59 10 25 82 84 41 39 35 33 48 21 67 79 81 16 56 27 31 6 23 3 74 56 39 41 54 15 21 9 54 13 15 79 55 34 7 42 68 22 50 47 83 16 76 62 8 58 84 83 60 83 24 79 9 68 10 52 17 21 30 1 58 15 81 24 68 34 53 38 10 74 5 65 78 27 40 11 75 5 44\\n\",\n \"100\\n100 2 3 99 5 6 7 8 9 10 65 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 48 32 83 79 35 36 37 38 39 40 41 42 43 44 45 46 47 31 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 11 66 67 68 69 70 71 72 73 80 75 76 77 78 34 74 81 82 33 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 4 1\\n\",\n \"100\\n1 55 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 92 19 20 21 22 23 24 25 26 27 28 29 30 31 83 33 34 35 36 37 38 78 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 2 56 57 58 82 60 61 62 63 64 65 85 67 68 69 70 71 72 73 74 75 76 77 39 79 80 81 59 32 84 66 86 87 88 89 90 91 18 93 94 95 96 97 98 99 100\\n\",\n \"96\\n5 24 24 7 15 10 31 1 21 19 30 18 28 14 6 33 11 9 29 25 23 25 5 16 19 1 32 1 29 28 25 10 16 23 17 27 7 22 3 22 14 30 13 21 32 26 11 10 19 23 20 22 22 13 21 14 17 22 14 21 29 24 3 33 30 24 2 25 30 5 9 12 8 16 25 10 30 33 1 23 12 27 4 9 12 29 11 13 30 15 31 3 3 1 15 25\\n\",\n \"100\\n78 2 3 4 5 6 7 8 9 10 11 12 13 18 15 16 17 14 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 1 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 73 8 9 10 11 12 13 14 15 16 17 18 19 56 21 22 23 24 25 44 27 28 80 30 31 32 33 34 35 36 37 38 39 40 41 42 43 26 45 59 75 96 49 50 51 52 53 54 55 20 57 58 46 60 61 62 63 64 65 66 67 68 69 70 71 72 7 74 47 76 77 78 79 29 81 82 83 84 85 86 87 88 89 90 99 92 93 94 95 48 97 98 91 100\\n\",\n \"80\\n25 24 1 7 20 21 25 16 19 22 20 19 17 14 24 19 7 21 5 13 3 10 11 5 4 24 8 4 3 4 15 8 4 5 24 18 16 18 20 8 23 16 1 12 25 6 19 25 4 2 11 14 24 21 15 2 9 14 23 23 13 25 23 14 2 3 22 17 9 12 24 17 15 8 9 9 24 2 24 4\\n\",\n \"100\\n1 2 3 4 5 6 7 8 24 10 11 12 13 14 15 16 92 18 19 20 21 22 23 70 25 26 27 81 29 30 31 32 33 34 35 36 37 38 39 40 41 80 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 93 63 64 65 66 67 68 69 74 71 72 73 9 75 76 77 78 79 42 28 82 83 84 85 86 87 88 89 90 91 17 62 94 95 96 100 98 99 97\\n\",\n \"9\\n5 4 3 2 1 2 3 4 5\\n\",\n \"51\\n12 11 8 3 13 14 8 4 39 43 45 21 49 27 8 28 22 47 38 38 25 32 38 25 41 29 39 13 44 35 26 29 34 26 15 5 11 25 17 34 8 23 31 6 37 34 42 19 36 42 28\\n\",\n \"75\\n17 30 2 50 5 42 19 22 4 21 15 30 36 30 1 32 12 7 25 11 39 2 6 11 41 19 46 42 24 42 9 34 9 21 19 28 6 46 16 46 43 43 30 46 18 15 7 36 20 1 3 20 39 36 13 22 18 30 31 19 1 48 1 11 22 39 47 3 31 2 2 38 4 20 18\\n\",\n \"52\\n23 3 18 18 10 18 25 19 2 1 1 19 14 19 22 15 17 25 6 7 2 12 4 4 24 18 11 4 3 11 5 13 19 13 16 24 10 25 12 19 19 21 6 17 23 19 3 6 15 13 25 10\\n\",\n \"56\\n42 33 13 55 38 6 25 10 25 53 8 52 40 15 54 6 16 23 19 38 7 2 8 53 23 21 39 44 50 29 55 1 51 43 5 8 44 55 14 8 51 18 13 21 52 45 48 9 37 7 31 37 34 14 44 21\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 76 16 17 18 19 20 21 22 23 47 25 26 27 28 29 30 31 32 44 34 33 36 37 38 39 40 41 42 43 35 45 46 24 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 80 65 66 67 68 69 70 71 72 73 74 75 15 77 78 79 97 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 64 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 74 64 65 66 67 68 69 70 71 72 73 63 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"10\\n1 2 3 4 5 6 7 8 9 10\\n\",\n \"58\\n5 11 38 39 29 31 3 42 10 38 52 52 15 20 57 32 45 28 34 58 29 34 36 29 53 47 2 37 47 46 19 18 10 45 23 53 18 29 21 35 30 55 26 42 43 54 37 3 28 10 22 11 11 50 34 17 33 47\\n\",\n \"100\\n19 17 3 4 5 6 7 8 9 10 11 59 60 14 15 29 2 18 1 20 21 22 55 24 25 26 27 28 16 30 31 32 33 84 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 23 58 57 56 66 13 61 62 63 64 65 12 67 68 69 70 71 72 73 76 75 74 77 78 79 80 81 82 83 34 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 45 15 16 17 18 35 20 21 22 23 24 25 26 27 88 29 43 31 32 33 34 19 36 37 30 39 40 41 42 38 72 90 46 47 48 49 50 51 52 53 54 55 56 57 58 59 77 61 62 63 64 93 66 67 68 69 70 71 44 73 74 75 76 60 78 79 92 81 82 83 84 85 86 87 28 89 14 91 80 65 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 99 22 84 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 23 85 86 87 88 89 90 91 92 93 94 95 96 97 98 21 100\\n\",\n \"68\\n18 16 20 6 32 23 6 17 19 5 12 14 28 26 18 14 33 21 5 22 26 15 32 33 9 22 4 29 29 24 17 30 24 21 16 13 18 4 22 3 28 7 18 12 23 4 30 33 16 7 21 18 23 3 4 25 13 5 13 29 18 30 16 11 3 1 11 21\\n\",\n \"4\\n4 1 3 2\\n\",\n \"51\\n45 37 1 8 4 41 35 15 17 2 7 48 20 42 41 5 26 25 37 1 19 43 3 49 33 2 45 43 39 14 1 21 22 17 18 8 49 24 35 26 22 43 45 1 3 17 1 16 35 33 5\\n\",\n \"1\\n1\\n\",\n \"100\\n1 2 3 4 92 6 7 8 9 10 11 63 13 14 15 30 17 18 19 20 21 22 23 24 25 26 27 28 46 16 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 29 47 48 49 50 51 52 53 55 54 56 57 58 59 60 61 72 12 64 65 66 67 68 69 70 71 62 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 5 93 94 95 96 97 98 99 100\\n\",\n \"73\\n39 43 10 18 10 8 29 32 18 2 47 1 14 1 25 14 49 10 39 30 44 1 8 23 50 33 23 45 29 23 15 31 46 47 6 40 19 33 2 42 42 38 23 17 3 12 44 36 25 21 3 8 46 15 46 17 23 7 12 42 39 14 18 9 17 19 49 1 35 18 3 2 7\\n\",\n \"94\\n23 8 25 27 33 16 8 8 15 11 33 23 13 18 26 20 21 10 18 15 6 11 21 14 27 16 5 1 33 11 31 33 3 21 31 7 28 32 19 16 20 22 23 18 24 16 24 18 22 12 31 9 14 29 25 29 29 16 12 15 21 6 30 21 28 11 2 33 7 12 33 16 28 32 28 27 21 18 27 17 24 22 23 4 16 2 5 26 2 21 3 17 2 2\\n\",\n \"100\\n1 2 3 4 5 7 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 81 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 91 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 35 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 53 92 93 94 95 96 97 98 99 100\\n\",\n \"96\\n5 24 24 7 15 10 31 1 21 19 30 18 28 14 6 33 11 9 29 25 23 25 5 16 19 1 32 1 29 28 25 10 16 23 17 27 7 22 3 22 14 30 13 21 32 26 11 10 19 23 20 22 22 13 21 14 17 22 14 21 29 24 3 2 30 24 2 25 30 5 9 12 8 16 25 10 30 33 1 23 12 27 4 9 12 29 11 13 30 15 31 3 3 1 15 25\\n\",\n \"100\\n1 2 3 4 7 6 73 8 9 10 11 12 13 14 15 16 17 18 19 56 21 22 23 24 25 44 27 28 80 30 31 32 33 34 35 36 37 38 39 40 41 42 43 26 45 59 75 96 49 50 51 52 53 54 55 20 57 58 46 60 61 62 63 64 65 66 67 68 69 70 71 72 7 74 47 76 77 78 79 29 81 82 83 84 85 86 87 88 89 90 99 92 93 94 95 48 97 98 91 100\\n\",\n \"80\\n25 24 1 7 20 21 25 16 19 22 20 19 17 14 24 19 7 21 5 13 3 10 11 5 4 24 8 4 3 4 15 8 4 5 24 18 16 18 20 8 23 16 1 12 25 6 19 25 4 2 11 14 24 21 15 2 9 14 23 23 13 25 23 14 2 3 22 17 9 12 24 17 15 8 9 9 24 2 24 3\\n\",\n \"100\\n1 2 3 4 5 6 7 8 24 10 11 12 13 14 15 16 92 18 19 20 21 22 23 70 25 26 27 81 29 30 31 32 33 34 35 36 37 38 39 36 41 80 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 93 63 64 65 66 67 68 69 74 71 72 73 9 75 76 77 78 79 42 28 82 83 84 85 86 87 88 89 90 91 17 62 94 95 96 100 98 99 97\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 45 15 16 17 18 35 20 21 22 23 24 25 26 27 88 29 43 31 32 33 34 19 36 37 30 39 40 41 42 38 72 90 46 47 48 49 50 51 52 53 54 55 56 57 58 59 77 61 62 63 64 93 66 67 68 69 70 71 44 73 74 75 76 60 78 79 92 81 82 83 84 85 86 87 28 89 8 91 80 65 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 99 38 84 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 23 85 86 87 88 89 90 91 92 93 94 95 96 97 98 21 100\\n\",\n \"52\\n23 3 18 18 10 18 25 19 2 1 1 19 14 19 22 15 17 25 6 2 1 12 4 4 24 18 11 4 3 11 5 13 19 13 16 24 10 25 12 19 19 21 6 17 23 19 3 6 15 13 25 10\\n\",\n \"54\\n17 16 24 6 14 17 19 21 21 19 23 4 13 21 8 3 4 15 5 2 16 8 3 24 19 6 1 11 7 16 18 20 3 3 21 15 12 24 6 22 10 18 11 23 22 5 23 25 11 16 13 7 11 12\\n\",\n \"84\\n60 20 43 2 59 10 25 82 84 41 39 35 44 48 21 67 79 81 16 56 27 31 6 23 3 74 56 39 41 54 15 21 9 54 13 15 79 55 34 7 42 68 22 50 47 83 16 76 62 8 58 84 83 60 83 24 79 9 68 10 52 17 21 30 1 58 15 81 24 68 34 53 38 10 74 5 65 78 27 40 11 75 5 44\\n\",\n \"100\\n100 2 3 99 5 6 7 8 9 10 65 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 13 28 29 30 48 32 83 79 35 36 37 38 39 40 41 42 43 44 45 46 47 31 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 11 66 67 68 69 70 71 72 73 80 75 76 77 78 34 74 81 82 33 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 4 1\\n\",\n \"100\\n1 55 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 92 19 20 21 22 23 24 25 26 27 28 29 30 31 83 33 34 35 36 37 38 78 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 2 56 57 58 82 60 61 62 63 64 65 85 67 68 69 70 71 72 73 74 75 76 77 39 79 80 81 59 32 84 66 86 87 88 89 90 91 18 93 94 95 96 84 98 99 100\\n\",\n \"100\\n78 2 3 4 5 6 7 8 9 10 11 12 13 18 15 16 17 14 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 56 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 1 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"9\\n5 4 3 4 1 2 3 4 5\\n\",\n \"75\\n17 30 2 50 5 42 19 22 4 21 15 30 36 30 1 32 12 7 25 11 39 2 6 11 41 19 46 42 24 42 5 34 9 21 19 28 6 46 16 46 43 43 30 46 18 15 7 36 20 1 3 20 39 36 13 22 18 30 31 19 1 48 1 11 22 39 47 3 31 2 2 38 4 20 18\\n\",\n \"52\\n23 3 18 18 10 18 25 19 2 1 1 19 14 19 22 15 17 25 6 2 2 12 4 4 24 18 11 4 3 11 5 13 19 13 16 24 10 25 12 19 19 21 6 17 23 19 3 6 15 13 25 10\\n\",\n \"56\\n42 33 13 55 38 6 25 10 25 53 8 52 40 15 54 6 16 23 19 11 7 2 8 53 23 21 39 44 50 29 55 1 51 43 5 8 44 55 14 8 51 18 13 21 52 45 48 9 37 7 31 37 34 14 44 21\\n\",\n \"100\\n1 2 3 4 5 1 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 74 64 65 66 67 68 69 70 71 72 73 63 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n19 17 3 4 5 6 7 8 9 10 11 59 60 14 15 29 2 18 1 20 21 22 55 24 25 26 27 28 16 30 31 32 33 84 35 36 37 38 39 40 41 42 43 44 45 46 47 3 49 50 51 52 53 54 23 58 57 56 66 13 61 62 63 64 65 12 67 68 69 70 71 72 73 76 75 74 77 78 79 80 81 82 83 34 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"68\\n18 16 20 6 32 23 6 17 19 5 12 14 28 26 18 14 33 21 5 22 26 15 32 33 9 22 4 29 29 24 17 30 24 21 16 13 18 4 22 3 28 7 18 12 23 4 30 33 16 7 21 18 23 3 4 21 13 5 13 29 18 30 16 11 3 1 11 21\\n\",\n \"51\\n45 37 1 8 4 41 35 15 17 3 7 48 20 42 41 5 26 25 37 1 19 43 3 49 33 2 45 43 39 14 1 21 22 17 18 8 49 24 35 26 22 43 45 1 3 17 1 16 35 33 5\\n\",\n \"73\\n39 43 10 18 10 8 29 32 18 2 47 1 9 1 25 14 49 10 39 30 44 1 8 23 50 33 23 45 29 23 15 31 46 47 6 40 19 33 2 42 42 38 23 17 3 12 44 36 25 21 3 8 46 15 46 17 23 7 12 42 39 14 18 9 17 19 49 1 35 18 3 2 7\\n\",\n \"94\\n23 8 25 27 33 16 8 8 15 11 33 23 13 18 26 20 21 10 18 15 6 11 21 14 27 16 5 1 33 11 31 36 3 21 31 7 28 32 19 16 20 22 23 18 24 16 24 18 22 12 31 9 14 29 25 29 29 16 12 15 21 6 30 21 28 11 2 33 7 12 33 16 28 32 28 27 21 18 27 17 24 22 23 4 16 2 5 26 2 21 3 17 2 2\\n\",\n \"54\\n17 16 24 6 14 17 19 21 21 19 23 4 13 21 8 3 4 15 5 2 16 8 3 24 19 6 1 11 7 16 18 20 3 3 21 15 12 24 6 22 10 18 11 23 22 5 23 25 9 16 13 7 11 12\\n\",\n \"100\\n1 2 3 4 5 7 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 70 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 81 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 91 54 55 56 92 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 35 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 53 92 93 94 95 96 97 98 99 100\\n\",\n \"84\\n60 20 43 2 59 10 25 82 84 41 39 35 44 48 21 67 79 81 16 56 27 31 6 23 3 74 56 39 41 54 15 21 9 54 13 15 79 55 34 7 42 68 22 50 47 83 16 76 62 8 58 84 83 60 83 24 66 9 68 10 52 17 21 30 1 58 15 81 24 68 34 53 38 10 74 5 65 78 27 40 11 75 5 44\\n\",\n \"100\\n100 2 3 99 5 6 7 8 9 10 65 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 13 28 29 30 76 32 83 79 35 36 37 38 39 40 41 42 43 44 45 46 47 31 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 11 66 67 68 69 70 71 72 73 80 75 76 77 78 34 74 81 82 33 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 4 1\\n\",\n \"100\\n1 55 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 92 19 20 21 22 23 24 25 26 27 28 29 30 31 83 33 34 35 36 37 38 78 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 2 56 57 58 82 60 61 62 63 64 65 85 67 68 69 62 71 72 73 74 75 76 77 39 79 80 81 59 32 84 66 86 87 88 89 90 91 18 93 94 95 96 84 98 99 100\\n\",\n \"96\\n5 24 24 7 15 10 31 1 21 19 30 18 28 14 6 33 11 9 29 25 23 25 5 16 19 1 32 1 29 28 25 10 16 23 17 27 7 22 3 22 14 30 13 21 32 26 11 10 19 23 20 22 22 13 21 14 17 22 14 21 29 24 3 2 30 24 2 25 30 5 9 12 8 16 25 10 30 33 1 23 12 27 4 9 23 29 11 13 30 15 31 3 3 1 15 25\\n\",\n \"100\\n78 2 3 4 5 6 7 8 9 10 11 12 13 18 15 16 17 14 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 56 61 62 63 64 65 66 67 68 69 70 71 54 73 74 75 76 77 1 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 7 6 73 8 9 10 11 12 13 14 15 16 17 18 19 56 21 22 23 24 25 44 27 28 80 30 31 32 33 34 35 36 37 38 39 40 41 42 43 21 45 59 75 96 49 50 51 52 53 54 55 20 57 58 46 60 61 62 63 64 65 66 67 68 69 70 71 72 7 74 47 76 77 78 79 29 81 82 83 84 85 86 87 88 89 90 99 92 93 94 95 48 97 98 91 100\\n\",\n \"80\\n25 24 1 7 20 21 25 16 19 22 20 19 17 14 24 19 7 21 5 13 3 10 11 5 4 24 8 4 3 4 15 8 4 5 24 18 16 18 20 8 23 16 1 12 25 6 19 25 4 2 11 14 24 21 15 2 9 14 23 23 13 25 23 14 2 3 22 31 9 12 24 17 15 8 9 9 24 2 24 3\\n\",\n \"100\\n1 2 3 4 5 6 7 8 24 10 11 12 13 14 15 16 92 18 19 20 21 22 23 70 25 26 27 81 29 30 31 32 33 34 35 36 37 38 39 36 41 80 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 93 63 64 65 66 67 68 69 74 71 72 73 9 75 76 77 78 79 42 28 82 83 84 85 86 87 54 89 90 91 17 62 94 95 96 100 98 99 97\\n\",\n \"9\\n5 4 2 4 1 2 3 4 5\\n\",\n \"75\\n17 30 2 50 5 42 19 22 4 21 15 30 36 30 1 32 12 7 25 11 39 2 6 11 41 19 46 42 24 42 5 34 3 21 19 28 6 46 16 46 43 43 30 46 18 15 7 36 20 1 3 20 39 36 13 22 18 30 31 19 1 48 1 11 22 39 47 3 31 2 2 38 4 20 18\\n\",\n \"56\\n42 33 13 55 38 6 25 10 25 53 8 52 40 15 54 6 23 23 19 11 7 2 8 53 23 21 39 44 50 29 55 1 51 43 5 8 44 55 14 8 51 18 13 21 52 45 48 9 37 7 31 37 34 14 44 21\\n\",\n \"100\\n1 2 3 4 5 1 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 6 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 74 64 65 66 67 68 69 70 71 72 73 63 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n19 17 3 4 5 6 7 8 9 10 11 59 60 14 15 29 2 18 1 20 21 22 55 24 25 26 27 28 16 30 31 32 33 84 35 36 37 38 39 40 41 42 43 44 45 46 47 3 49 50 51 52 53 54 23 58 77 56 66 13 61 62 63 64 65 12 67 68 69 70 71 72 73 76 75 74 77 78 79 80 81 82 83 34 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 45 15 16 17 18 35 20 21 22 23 24 25 26 27 88 29 43 31 32 33 34 19 36 37 30 39 40 41 42 38 72 90 46 47 48 49 50 51 52 53 54 55 56 57 58 28 77 61 62 63 64 93 66 67 68 69 70 71 44 73 74 75 76 60 78 79 92 81 82 83 84 85 86 87 28 89 8 91 80 65 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 99 38 84 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 23 85 86 87 88 89 90 91 35 93 94 95 96 97 98 21 100\\n\",\n \"68\\n18 16 20 6 32 23 6 17 19 5 12 14 28 26 18 14 33 21 5 22 26 15 32 33 9 22 7 29 29 24 17 30 24 21 16 13 18 4 22 3 28 7 18 12 23 4 30 33 16 7 21 18 23 3 4 21 13 5 13 29 18 30 16 11 3 1 11 21\\n\",\n \"51\\n45 37 1 8 4 41 35 15 17 3 7 48 20 42 41 5 26 25 37 1 19 43 3 49 33 2 45 43 39 14 1 21 22 17 18 8 49 24 35 26 22 43 45 1 3 17 1 5 35 33 5\\n\",\n \"73\\n39 43 10 18 10 8 29 32 18 2 47 1 9 1 25 14 49 10 39 30 44 1 8 23 50 33 23 45 29 23 15 31 46 47 6 40 19 33 2 42 42 38 23 17 3 12 44 36 25 21 3 8 46 15 46 17 23 7 12 59 39 14 18 9 17 19 49 1 35 18 3 2 7\\n\",\n \"94\\n23 8 25 27 33 16 8 8 15 11 33 23 13 18 26 20 21 10 18 15 6 11 21 14 27 16 5 1 45 11 31 36 3 21 31 7 28 32 19 16 20 22 23 18 24 16 24 18 22 12 31 9 14 29 25 29 29 16 12 15 21 6 30 21 28 11 2 33 7 12 33 16 28 32 28 27 21 18 27 17 24 22 23 4 16 2 5 26 2 21 3 17 2 2\\n\",\n \"54\\n17 16 24 6 14 17 19 21 21 19 23 4 26 21 8 3 4 15 5 2 16 8 3 24 19 6 1 11 7 16 18 20 3 3 21 15 12 24 6 22 10 18 11 23 22 5 23 25 9 16 13 7 11 12\\n\",\n \"100\\n1 2 3 4 5 7 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 83 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 70 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 3 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 81 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 91 54 55 56 92 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 35 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 53 92 93 94 95 96 97 98 99 100\\n\",\n \"84\\n60 20 43 2 59 10 25 82 84 41 39 35 44 48 21 71 79 81 16 56 27 31 6 23 3 74 56 39 41 54 15 21 9 54 13 15 79 55 34 7 42 68 22 50 47 83 16 76 62 8 58 84 83 60 83 24 66 9 68 10 52 17 21 30 1 58 15 81 24 68 34 53 38 10 74 5 65 78 27 40 11 75 5 44\\n\",\n \"100\\n100 2 3 99 5 6 7 8 9 10 78 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 13 28 29 30 76 32 83 79 35 36 37 38 39 40 41 42 43 44 45 46 47 31 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 11 66 67 68 69 70 71 72 73 80 75 76 77 78 34 74 81 82 33 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 4 1\\n\",\n \"100\\n1 55 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 92 19 20 21 22 23 24 25 26 27 28 29 30 31 83 33 34 35 36 37 38 78 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 2 56 57 58 82 60 61 62 63 64 65 85 67 68 69 62 71 72 73 74 75 76 77 39 79 80 81 59 32 84 66 86 87 88 89 90 91 18 93 77 95 96 84 98 99 100\\n\",\n \"96\\n5 24 24 7 15 10 31 1 21 19 30 18 28 14 6 33 11 9 29 25 23 25 5 16 19 1 32 1 35 28 25 10 16 23 17 27 7 22 3 22 14 30 13 21 32 26 11 10 19 23 20 22 22 13 21 14 17 22 14 21 29 24 3 2 30 24 2 25 30 5 9 12 8 16 25 10 30 33 1 23 12 27 4 9 23 29 11 13 30 15 31 3 3 1 15 25\\n\",\n \"100\\n78 2 3 4 5 6 7 8 9 10 11 12 13 18 15 16 17 14 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 87 53 54 55 56 57 58 59 56 61 62 63 64 65 66 67 68 69 70 71 54 73 74 75 76 77 1 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100\\n\",\n \"100\\n1 2 3 4 7 6 73 8 9 10 11 12 13 14 15 16 17 18 19 56 21 22 23 24 25 44 27 28 80 30 31 32 33 34 35 36 37 38 39 40 41 42 43 21 45 59 75 96 49 50 51 52 53 54 55 20 57 58 46 60 61 62 63 64 65 66 67 68 69 70 71 72 7 74 47 76 44 78 79 29 81 82 83 84 85 86 87 88 89 90 99 92 93 94 95 48 97 98 91 100\\n\"\n ],\n \"output\": [\n \"6\\n\",\n \"3\\n\",\n \"3\\n\",\n \"1\\n\",\n \"3\\n\",\n \"102\\n\",\n \"36\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"5\\n\",\n \"3\\n\",\n \"8\\n\",\n \"4\\n\",\n \"10\\n\",\n \"7\\n\",\n \"2\\n\",\n \"6\\n\",\n \"6\\n\",\n \"4\\n\",\n \"16\\n\",\n \"64\\n\",\n \"12\\n\",\n \"2\\n\",\n \"4\\n\",\n \"15\\n\",\n \"22\\n\",\n \"3\\n\",\n \"3\\n\",\n \"5\\n\",\n \"1\\n\",\n \"6\\n\",\n \"5\\n\",\n \"3\\n\",\n \"7\\n\",\n \"36\\n\",\n \"5\\n\",\n \"6\\n\",\n \"4\\n\",\n \"10\\n\",\n \"15\\n\",\n \"23\\n\",\n \"8\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"7\\n\",\n \"6\\n\",\n \"6\\n\",\n \"4\\n\",\n \"7\\n\",\n \"5\\n\",\n \"3\\n\",\n \"5\\n\",\n \"5\\n\",\n \"3\\n\",\n \"3\\n\",\n \"7\\n\",\n \"36\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"5\\n\",\n \"3\\n\",\n \"6\\n\",\n \"4\\n\",\n \"10\\n\",\n \"7\\n\",\n \"6\\n\",\n \"4\\n\",\n \"7\\n\",\n \"5\\n\",\n \"15\\n\",\n \"23\\n\",\n \"3\\n\",\n \"5\\n\",\n \"5\\n\",\n \"3\\n\",\n \"3\\n\",\n \"7\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"5\\n\",\n \"3\\n\",\n \"6\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nIn this problem MEX of a certain array is the smallest positive integer not contained in this array.\n\nEveryone knows this definition, including Lesha. But Lesha loves MEX, so he comes up with a new problem involving MEX every day, including today.\n\nYou are given an array a of length n. Lesha considers all the non-empty subarrays of the initial array and computes MEX for each of them. Then Lesha computes MEX of the obtained numbers.\n\nAn array b is a subarray of an array a, if b can be obtained from a by deletion of several (possible none or all) elements from the beginning and several (possibly none or all) elements from the end. In particular, an array is a subarray of itself.\n\nLesha understands that the problem is very interesting this time, but he doesn't know how to solve it. Help him and find the MEX of MEXes of all the subarrays!\n\nInput\n\nThe first line contains a single integer n (1 ≤ n ≤ 10^5) — the length of the array. \n\nThe next line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ n) — the elements of the array.\n\nOutput\n\nPrint a single integer — the MEX of MEXes of all subarrays.\n\nExamples\n\nInput\n\n\n3\n1 3 2\n\n\nOutput\n\n\n3\n\n\nInput\n\n\n5\n1 4 3 1 2\n\n\nOutput\n\n\n6\n\n### Input:\n5\n1 4 3 1 2\n\n### Output:\n6\n\n\n### Input:\n3\n1 3 2\n\n### Output:\n3\n\n\n### Code:\nclass SegmentTree:\n def __init__(self, init_val, segfunc, ide_ele):\n n = len(init_val)\n self.segfunc = segfunc\n self.ide_ele = ide_ele\n self.num = 1 << (n - 1).bit_length()\n self.tree = [ide_ele] * 2 * self.num\n self.range = [(-1,n)] * 2 * self.num\n # 配列の値を葉にセット\n for i in range(n):\n self.tree[self.num + i] = init_val[i]\n self.range[self.num + i] = (i,i)\n # 構築していく\n for i in range(self.num - 1, 0, -1):\n self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])\n self.range[i] = (self.range[2 * i][0],self.range[2 * i + 1][1])\n\n def update(self, k, x):\n k += self.num\n self.tree[k] = x\n while k > 1:\n self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])\n k >>= 1\n\n def query(self, l, r):\n res = self.ide_ele\n\n l += self.num\n r += self.num\n while l < r:\n if l & 1:\n res = self.segfunc(res, self.tree[l])\n l += 1\n if r & 1:\n res = self.segfunc(res, self.tree[r - 1])\n l >>= 1\n r >>= 1\n return res\n\n def bisect_l(self,l,r,x):\n l += self.num\n r += self.num\n Lmin = -1\n Rmin = -1\n while l<r:\n if l & 1:\n if self.tree[l] <= x and Lmin==-1:\n Lmin = l\n l += 1\n if r & 1:\n if self.tree[r-1] <=x:\n Rmin = r-1\n l >>= 1\n r >>= 1\n\n if Lmin != -1:\n pos = Lmin\n while pos<self.num:\n if self.tree[2 * pos] <=x:\n pos = 2 * pos\n else:\n pos = 2 * pos +1\n return pos-self.num\n elif Rmin != -1:\n pos = Rmin\n while pos<self.num:\n if self.tree[2 * pos] <=x:\n pos = 2 * pos\n else:\n pos = 2 * pos +1\n return pos-self.num\n else:\n return -1\n\nn = int(input())\np = list(map(int,input().split()))\n\npos = [[] for i in range(n+2)]\nfor i in range(n):\n pos[p[i]].append(i)\n\nquery = [[] for i in range(n)]\n\nfor i in range(1,n+2):\n for j in range(len(pos[i])-1):\n L = pos[i][j] + 1\n R = pos[i][j+1] - 1\n if L<=R:\n query[R].append((L,i))\n if pos[i]:\n if pos[i][0]!=0:\n query[pos[i][0]-1].append((0,i))\n if pos[i][-1]!=n-1:\n query[n-1].append((pos[i][-1]+1,i))\n else:\n query[n-1].append((0,i))\n\n#print(query)\n\nflag = [False for i in range(n+3)]\n\ninit = [-1]*(n+2)\ninit[0] = n\nlastappeared = SegmentTree(init,min,-1)\nfor i in range(n):\n lastappeared.update(p[i],i)\n for l,val in query[i]:\n check = lastappeared.bisect_l(0,n+2,l-1)\n #print(l,i,val,check)\n #pp = [lastappeared.tree[j+lastappeared.num] for j in range(n)]\n\n if check>=val or check==-1:\n flag[val] = True\n\n\nfor i in range(1,n+3):\n if not flag[i]:\n print(i)\n break"}}},{"rowIdx":5672,"cells":{"id":{"kind":"string","value":"1461_C. Random Events_26771"},"description":{"kind":"string","value":"Ron is a happy owner of a permutation a of length n.\n\nA permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).\n\n<image>\n\nRon's permutation is subjected to m experiments of the following type: (r_i, p_i). This means that elements in range [1, r_i] (in other words, the prefix of length r_i) have to be sorted in ascending order with the probability of p_i. All experiments are performed in the same order in which they are specified in the input data.\n\nAs an example, let's take a look at a permutation [4, 2, 1, 5, 3] and an experiment (3, 0.6). After such an experiment with the probability of 60\\% the permutation will assume the form [1, 2, 4, 5, 3] and with a 40\\% probability it will remain unchanged.\n\nYou have to determine the probability of the permutation becoming completely sorted in ascending order after m experiments.\n\nInput\n\nEach test contains one or more test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100).\n\nThe first line of each test case contains two integers n and m (1 ≤ n, m ≤ 10^5) — the length of the permutation and the number of experiments, respectively.\n\nThe second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ n) — contents of the permutation.\n\nThe following m lines of each test case each contain an integer r_i and a real number p_i (1 ≤ r_i ≤ n, 0 ≤ p_i ≤ 1) — the length of the prefix and the probability of it being sorted. All probabilities are given with at most 6 decimal places.\n\nIt is guaranteed that the sum of n and the sum of m does not exceed 10^5 (∑ n, ∑ m ≤ 10^5).\n\nOutput\n\nFor each test case, print a single number — the probability that after all experiments the permutation becomes sorted in ascending order. Your answer will be considered correct if its absolute or relative error does not exceed 10^{-6}.\n\nFormally, let your answer be a, and the jury's answer be b. Your answer is accepted if and only if \\frac{|a - b|}{max{(1, |b|)}} ≤ 10^{-6}.\n\nExample\n\nInput\n\n\n4\n4 3\n4 3 2 1\n1 0.3\n3 1\n4 0.6\n5 3\n4 2 1 3 5\n3 0.8\n4 0.6\n5 0.3\n6 5\n1 3 2 4 5 6\n4 0.9\n5 0.3\n2 0.4\n6 0.7\n3 0.5\n4 2\n1 2 3 4\n2 0.5\n4 0.1\n\n\nOutput\n\n\n0.600000\n0.720000\n0.989500\n1.000000\n\nNote\n\nExplanation of the first test case: It can be demonstrated that whether the final permutation is sorted or not depends solely on sorting being performed in the (4, 0.6) experiment."},"code":{"kind":"string","value":"# by the authority of GOD author: manhar singh sachdev #\n\nimport os,sys\nfrom io import BytesIO, IOBase\n\ndef main():\n for _ in range(int(input())):\n n,m = map(int,input().split())\n a = list(map(int,input().split()))\n j = n-1\n while j != -1 and a[j] == j+1:\n j -= 1\n if j == -1:\n for _ in range(m):\n x = input()\n print(1)\n continue\n ans = 0\n fac = 1\n for _ in range(m):\n r,p = map(float,input().split())\n r = int(r)\n if r >= j+1:\n ans += fac*p\n fac *= (1-p)\n print(ans)\n\n#Fast IO Region\nBUFSIZE = 8192\nclass FastIO(IOBase):\n newlines = 0\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\nif __name__ == '__main__':\n main()"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"4\\n4 3\\n4 3 2 1\\n1 0.3\\n3 1\\n4 0.6\\n5 3\\n4 2 1 3 5\\n3 0.8\\n4 0.6\\n5 0.3\\n6 5\\n1 3 2 4 5 6\\n4 0.9\\n5 0.3\\n2 0.4\\n6 0.7\\n3 0.5\\n4 2\\n1 2 3 4\\n2 0.5\\n4 0.1\\n\",\n \"1\\n5 5\\n1 2 3 5 4\\n5 0.5\\n5 0.5\\n5 0.5\\n5 0.5\\n5 0.5\\n\",\n \"4\\n9 1\\n1 2 3 4 5 6 7 8 9\\n6 0.000000\\n6 1\\n1 2 3 4 5 6\\n1 0.000033\\n4 1\\n1 2 3 4\\n1 0.000048\\n15 1\\n2 1 3 4 5 6 7 8 9 10 11 12 13 14 15\\n6 0.000097\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.022481\\n15 15\\n3 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n15 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n5 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.022481\\n15 15\\n0 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n15 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n5 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 7 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n4 3\\n4 5 2 1\\n1 0.3\\n3 1\\n4 0.6\\n5 3\\n4 2 1 3 5\\n3 0.8\\n4 0.6\\n5 0.3\\n6 5\\n1 3 2 4 5 6\\n4 0.9\\n5 0.3\\n2 0.4\\n6 0.7\\n3 0.5\\n4 2\\n1 2 3 4\\n2 0.5\\n4 0.1\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.8105457460412552\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 2 2 9 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 0 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 5 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"1\\n5 5\\n1 2 3 8 4\\n5 0.5\\n5 0.5\\n5 0.5\\n5 0.5\\n5 0.5\\n\",\n \"4\\n4 3\\n4 3 2 1\\n1 0.3\\n3 1\\n4 0.6\\n5 3\\n4 2 1 3 2\\n3 0.8\\n4 0.6\\n5 0.3\\n6 5\\n1 3 2 4 5 6\\n4 0.9\\n5 0.3\\n2 0.4\\n6 0.7\\n3 0.5\\n4 2\\n1 2 3 4\\n2 0.5\\n4 0.1\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n3 0.047829\\n4 0.022481\\n15 15\\n0 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n15 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n5 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.33750244022421916\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.45293260430418164\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 6 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n3 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.4426361365989963\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n10 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 2 2 9 5 2 4 8 9 10 3\\n6 0.3391434884890079\\n5 1\\n1 0 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 9 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 5 15\\n12 0.060138\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.22982062043492948\\n15 15\\n3 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n12 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n3 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n12 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 2 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n4 7 2 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.445888464896613\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 3 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 13\\n13 0.49980229731207027\\n15 1\\n6 13 4 1 2 15 15 3 10 10 5 9 12 8 9\\n11 0.657535\\n\",\n \"4\\n9 1\\n1 2 3 4 5 6 7 8 9\\n6 0.000000\\n6 1\\n1 2 3 4 5 6\\n1 0.000033\\n4 1\\n1 2 3 4\\n1 0.000048\\n15 1\\n2 1 3 4 5 6 7 8 3 10 11 12 13 14 15\\n6 0.000097\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.26306968124507313\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.022481\\n15 15\\n3 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n15 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n5 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.058685102227104186\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 3 12 13 14 15\\n12 0.060138\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.022481\\n15 15\\n0 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n15 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n10 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"4\\n4 3\\n4 5 2 1\\n1 0.3\\n3 1\\n4 0.6\\n5 3\\n4 2 1 3 5\\n3 0.8\\n4 0.6\\n5 0.3\\n6 5\\n1 3 2 4 5 6\\n4 0.9\\n5 0.35479162678898185\\n2 0.4\\n6 0.7\\n3 0.5\\n4 2\\n1 2 3 4\\n2 0.5\\n4 0.1\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.8105457460412552\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 7 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n4 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 2 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 10\\n12 0.060138\\n\",\n \"1\\n5 5\\n1 2 3 8 4\\n5 0.5\\n5 0.5\\n5 0.5\\n5 0.789679814579917\\n5 0.5\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 7 3 6 15 5\\n15 0.8637858408018791\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.8046632547098242\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.4470805642722162\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.5085176363523032\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.022481\\n15 15\\n3 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n12 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n3 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.22982062043492948\\n15 15\\n3 8 5 7 9 2 4 6 1 0 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n12 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n3 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n4 7 2 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.445888464896613\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 3 12 13 9 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.5782316383237981\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n2 0.011117\\n3 1\\n1 2 3\\n3 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 0 0 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 2 16 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n12 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.4624936523770503\\n15 1\\n6 13 4 1 1 14 2 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n0 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 6 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n0 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 3 10 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 6 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 13 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n0 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 11 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 3 10 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 6 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 1 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 13 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 1 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n0 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 11 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 3 10 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 6 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 1 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 1 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 13 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 6 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 7 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 6 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 2 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 2 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 2 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 2 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 5 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 2 2 9 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 5 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 2 2 9 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 5 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 2 2 9 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 0 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 9 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 2 2 9 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 0 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 9 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n1 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.022481\\n15 15\\n3 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n12 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n5 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 9 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 9 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 6 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 0 7 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n4 3\\n1 5 2 1\\n1 0.3\\n3 1\\n4 0.6\\n5 3\\n4 2 1 3 5\\n3 0.8\\n4 0.6\\n5 0.3\\n6 5\\n1 3 2 4 5 6\\n4 0.9\\n5 0.3\\n2 0.4\\n6 0.7\\n3 0.5\\n4 2\\n1 2 3 4\\n2 0.5\\n4 0.1\\n\",\n \"8\\n6 1\\n2 4 1 3 6 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.8105457460412552\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n3 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 0 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 6 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n2 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 13 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 0 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n0 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 11 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 3 10 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 3 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 6 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 22 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 4 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 7 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 0\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 3 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 23 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n10 0.657535\\n\",\n \"4\\n15 1\\n4 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 0 12 4 2 10 9 1 7 13 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 0 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 7 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 8 1 1 14 15 6 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 2 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 6 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 0 2 9 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 5 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 2 2 9 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 0 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 5 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 2 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 2 2 9 5 2 4 8 9 10 3\\n6 0.3391434884890079\\n5 1\\n1 0 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 9 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"2\\n5 12\\n3 2 1 4 5\\n4 0.024816\\n5 0.054959\\n2 0.063211\\n4 0.057224\\n3 0.033510\\n5 0.064656\\n4 0.080912\\n5 0.094426\\n2 0.065718\\n1 0.002728\\n2 0.047829\\n4 0.022481\\n15 15\\n3 8 5 7 9 2 4 6 1 10 11 12 13 14 15\\n7 0.035821\\n11 0.044624\\n4 0.014940\\n12 0.000655\\n12 0.002577\\n15 0.021032\\n9 0.087483\\n9 0.009845\\n13 0.010765\\n3 0.098312\\n10 0.040318\\n14 0.057622\\n11 0.029710\\n6 0.068983\\n15 0.044438\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 9 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 11 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n4 3\\n4 3 2 1\\n1 0.3\\n3 1\\n4 0.6\\n5 3\\n4 3 1 3 2\\n3 0.8\\n4 0.6\\n5 0.3\\n6 5\\n1 3 2 4 5 6\\n4 0.9\\n5 0.3\\n2 0.4\\n6 0.7\\n3 0.5\\n4 2\\n1 2 3 4\\n2 0.5\\n4 0.1\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 2 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 6 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 8 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n3 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 0 7 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n3 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 7 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 6 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 0 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n2 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 13 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 0 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 4 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n0 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 11 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 3 10 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 3 6 5 2 4 8 18 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 22 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 7 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 3 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 0\\n15 0.044144\\n12 1\\n11 1 5 9 7 10 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n4 7 2 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 3 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n2 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 23 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n4 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 16 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 0 12 4 2 10 9 1 7 13 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 8 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 0 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 11 11 12 13 14 15\\n12 0.33750244022421916\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.45293260430418164\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 1 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 6 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 0 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.6237949348952141\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 4 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 8 1 1 14 15 6 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n3 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 4 5 9 10 11 12 13\\n5 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 2 2 6 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.7639974040556413\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 0 3 6 6 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 4 5 6\\n5 0.036247\\n11 1\\n3 0 2 9 5 2 4 8 9 10 3\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 5 3 0 3 6 4 5 9 10 11 7 13\\n7 0.064301\\n15 1\\n3 2 10 12 9 8 1 4 5 3 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 9 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 11 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 14 15 3 7 10 5 9 9 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n2 0.011117\\n3 1\\n1 2 3\\n3 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 0 7 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n3 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 1 8 1 4 5 6 11 7 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 9\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 6 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 0 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n2 0.011117\\n3 1\\n1 2 3\\n2 0.026590087378265737\\n6 1\\n1 4 3 2 5 6\\n5 0.009130\\n13 1\\n1 4 7 0 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 13 1 4 5 11 3 12 13 14 15\\n12 0.060138\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 3 6 5 2 4 8 18 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 4 3 8 3 6 3 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 6 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 22 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 7 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 24 4 1 2 15 15 3 7 10 5 9 12 3 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 0\\n15 0.044144\\n12 1\\n11 1 5 9 7 10 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 3 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 10 2 10 6\\n2 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 23 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 5 13 11 3 6 15 5\\n15 0.4426361365989963\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n10 0.657535\\n\",\n \"4\\n15 1\\n4 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 16 2 10 7\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 0 12 4 2 10 9 1 7 13 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 1 13 12 13\\n13 0.326778\\n15 1\\n6 8 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 4 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 7 1 4 5 11 11 12 13 14 15\\n12 0.33750244022421916\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.45293260430418164\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 1 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 6 7 10 5 9 7 8 11\\n11 1.208692373631065\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 4 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 8 1 1 23 15 6 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 9 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 20 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 14 15 3 7 10 5 9 9 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 16 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n12 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 2 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 1 6 5 2 4 8 9 10 11\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.031733\\n4 1\\n2 1 3 4\\n2 0.011117\\n3 1\\n1 2 3\\n3 0.012880\\n6 1\\n1 4 3 2 5 6\\n5 0.9036602665451088\\n13 1\\n1 0 0 8 3 6 2 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 8 1 4 5 6 11 12 13 14 15\\n12 0.060138\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 10 10 5 9 12 8 9\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 6 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 22 7\\n13 0.326778\\n15 1\\n6 21 5 1 1 14 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 7 13 7 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 24 4 1 2 15 15 3 7 2 5 9 12 3 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 0\\n15 0.044144\\n12 1\\n11 1 5 9 7 10 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 0 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 3 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 10 2 10 6\\n2 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 23 8 11\\n11 0.9515042979977137\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 5 17 11 3 6 15 5\\n15 0.4426361365989963\\n12 1\\n11 1 5 9 7 12 3 4 14 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n10 0.657535\\n\",\n \"4\\n15 1\\n4 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 16 2 10 7\\n1 0.458573\\n13 1\\n12 8 10 9 5 2 4 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 0 12 4 2 10 9 1 7 13 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 1 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 1 13 12 13\\n13 0.326778\\n15 1\\n6 8 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 5 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 7 1 4 5 11 11 12 13 14 15\\n12 0.33750244022421916\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 11 3 6 15 5\\n15 0.45293260430418164\\n12 1\\n11 1 5 9 1 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 1 6 1 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 6 7 10 5 9 7 8 11\\n11 1.208692373631065\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 4 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 0 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 8 1 1 23 15 6 7 10 5 9 7 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 9 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 20 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 14 15 3 7 1 5 9 9 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 2 16 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n12 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 2 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 6 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 22 7\\n13 0.326778\\n15 1\\n6 21 5 1 1 6 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 16 12 4 2 10 9 1 7 13 7 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 24 4 1 2 15 15 3 7 2 5 9 12 3 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 0\\n15 0.044144\\n12 1\\n11 1 5 9 7 10 5 4 8 2 10 6\\n1 0.7482180517876534\\n13 1\\n11 8 10 9 5 2 4 6 1 0 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 3 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 10 2 10 6\\n2 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 1 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 23 8 11\\n11 0.9515042979977137\\n\",\n \"4\\n15 1\\n14 15 12 4 2 10 9 1 5 17 11 3 6 15 5\\n15 0.4426361365989963\\n12 1\\n11 1 5 9 7 12 3 4 21 2 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 6 1 3 13 12 13\\n13 0.326778\\n15 1\\n6 13 4 1 2 15 15 3 7 10 5 9 12 8 11\\n10 0.657535\\n\",\n \"4\\n15 1\\n14 0 12 4 2 10 9 1 7 13 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 1 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 1 1 1 13 12 13\\n13 0.326778\\n15 1\\n6 8 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 6 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 3 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 7 1 4 5 11 11 12 13 14 15\\n12 0.33750244022421916\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 13 4 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 0 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 8 1 1 23 15 6 7 10 5 9 7 14 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 9 12 3 5 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 20 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 14 15 3 7 1 5 9 9 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 2 16 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n12 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 2 3 7 10 5 9 12 8 11\\n11 0.8797001767040666\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 13\\n13 0.49980229731207027\\n15 1\\n6 13 4 1 2 15 15 3 10 10 5 9 6 8 9\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 2 6 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 22 7\\n13 0.326778\\n15 1\\n6 21 5 1 1 6 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 0\\n15 0.044144\\n12 1\\n11 1 5 9 7 10 5 4 8 2 10 6\\n1 0.7482180517876534\\n13 1\\n11 8 10 9 5 2 4 6 1 0 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 3 11\\n10 0.657535\\n\",\n \"4\\n15 1\\n14 8 7 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 10 2 10 6\\n2 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 1 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 23 8 11\\n11 0.9515042979977137\\n\",\n \"4\\n15 1\\n14 0 12 4 2 10 9 1 7 4 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 1 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 1 1 1 13 12 13\\n13 0.326778\\n15 1\\n6 8 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 6 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 5 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 8 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 7 1 4 5 11 11 12 13 14 15\\n12 0.33750244022421916\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 3 4 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 0 1 13 12 7\\n13 0.41604547963058514\\n15 1\\n6 21 8 1 1 23 15 6 7 10 5 9 7 14 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 6 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 9 12 3 5 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 20 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 2 14 15 3 7 1 5 9 9 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 2 16 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 18 7 12 3 4 8 2 10 6\\n12 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 3 13 12 7\\n13 0.326778\\n15 1\\n6 13 4 1 1 14 2 3 7 10 5 9 12 8 11\\n11 0.8797001767040666\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 2 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 13\\n13 0.49980229731207027\\n15 1\\n6 13 4 1 0 15 15 3 10 10 5 9 6 8 9\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 2 6 13 11 1 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 22 7\\n13 0.326778\\n15 1\\n6 21 5 1 1 6 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 0\\n15 0.044144\\n12 1\\n6 1 5 9 7 10 5 4 8 2 10 6\\n1 0.7482180517876534\\n13 1\\n11 8 10 9 5 2 4 6 1 0 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 3 11\\n10 0.657535\\n\",\n \"4\\n15 1\\n14 0 12 7 2 10 9 1 7 4 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 1 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 1 1 1 13 12 13\\n13 0.326778\\n15 1\\n6 8 4 1 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 6 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 5 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 2 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n3 2 10 7 9 7 1 4 5 11 11 12 13 14 15\\n12 0.33750244022421916\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 3 4 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 0 1 13 12 11\\n13 0.41604547963058514\\n15 1\\n6 21 8 1 1 23 15 6 7 10 5 9 7 14 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 0 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 2 13 12 13\\n13 0.49980229731207027\\n15 1\\n6 13 4 1 0 15 15 3 10 10 5 9 6 8 9\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 2 6 13 11 1 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 7 7\\n13 0.326778\\n15 1\\n6 21 5 1 1 6 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 1 0\\n15 0.044144\\n12 1\\n6 1 5 9 7 10 5 4 8 2 10 6\\n1 0.7482180517876534\\n13 1\\n11 8 10 9 5 2 4 6 1 0 13 12 7\\n13 0.326778\\n15 1\\n6 21 4 1 1 14 15 3 7 10 5 9 12 3 11\\n10 0.657535\\n\",\n \"4\\n15 1\\n14 0 12 7 2 10 9 1 7 4 11 3 6 15 3\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 14 1 10 6\\n6 0.458573\\n13 1\\n11 1 10 9 5 2 0 1 1 1 13 12 13\\n13 0.326778\\n15 1\\n6 8 4 2 2 15 15 3 7 10 5 9 12 8 11\\n11 0.657535\\n\",\n \"8\\n6 1\\n2 4 1 3 5 6\\n5 0.036247\\n11 1\\n3 7 2 6 5 2 6 8 9 10 5\\n6 0.020413\\n5 1\\n1 2 3 4 5\\n5 0.08219664706805084\\n4 1\\n2 1 5 4\\n4 0.011117\\n3 1\\n1 2 3\\n2 0.012880\\n6 1\\n1 4 3 3 5 6\\n5 0.9036602665451088\\n13 1\\n1 2 3 8 3 6 4 5 9 10 11 12 13\\n7 0.064301\\n15 1\\n4 2 10 7 9 7 1 4 5 11 11 12 13 14 15\\n12 0.33750244022421916\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 1 7 3 4 3 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 5 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 11 5 2 4 6 0 1 13 12 11\\n13 0.41604547963058514\\n15 1\\n6 21 8 1 1 23 15 6 7 10 5 9 7 14 11\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 9 1 7 13 11 3 6 15 5\\n15 0.044144\\n12 1\\n1 1 5 9 7 12 3 4 8 0 10 6\\n6 0.458573\\n13 1\\n11 8 10 9 5 2 4 12 1 2 13 12 13\\n13 0.49980229731207027\\n15 1\\n6 13 4 1 0 15 15 3 10 10 5 9 6 8 9\\n11 0.657535\\n\",\n \"4\\n15 1\\n14 8 12 4 2 10 3 2 6 13 11 1 6 15 5\\n15 0.044144\\n12 1\\n11 1 5 9 7 12 3 4 8 2 10 6\\n1 0.458573\\n13 1\\n11 8 10 9 5 2 4 6 1 1 13 7 7\\n13 0.326778\\n15 1\\n6 21 5 1 1 6 15 3 7 10 5 9 12 8 11\\n4 0.657535\\n\"\n ],\n \"output\": [\n \"\\n0.600000\\n0.720000\\n0.989500\\n1.000000\\n\",\n \"0.968750\\n\",\n \"1.000000\\n1.000000\\n1.000000\\n0.000097\\n\",\n \"0.360971\\n0.301294\\n\",\n \"0.036247\\n0.000000\\n1.000000\\n0.011117\\n1.000000\\n0.009130\\n0.000000\\n0.060138\\n\",\n \"0.044144\\n0.000000\\n0.326778\\n0.000000\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.36097078475712274\\n0.3012944667873305\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.6\\n0.72\\n0.9895\\n1\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.8105457460412552\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n0.08219664706805085\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.96875\\n\",\n \"0.6\\n0.30000000000000004\\n0.9895\\n1\\n\",\n \"0.3915349130929743\\n0.3012944667873305\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.33750244022421916\\n\",\n \"0.4529326043041817\\n0\\n0.41604547963058514\\n0\\n\",\n \"0\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.44263613659899637\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n0.08219664706805085\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0\\n\",\n \"0.4965140068687022\\n0.3012944667873305\\n\",\n \"0.04414399999999996\\n0.458573\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.44588846489661305\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.49980229731207027\\n0\\n\",\n \"1\\n1\\n1\\n0\\n\",\n \"0.5016935738421462\\n0.3012944667873305\\n\",\n \"0.05868510222710421\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.36097078475712274\\n0.3699856051685344\\n\",\n \"0.6\\n0.72\\n0.9903218744018347\\n1\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.8105457460412552\\n1\\n0.009129999999999971\\n0\\n0\\n\",\n \"0.04414399999999996\\n0\\n0\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0\\n\",\n \"0.9868549884112449\\n\",\n \"0.8637858408018791\\n0\\n0.326778\\n0\\n\",\n \"0.8046632547098242\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.4470805642722162\\n\",\n \"0.677936072425817\\n0.3012944667873305\\n\",\n \"0.4965140068687022\\n0.22669639701449684\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.44588846489661305\\n1\\n0.9036602665451088\\n0\\n0\\n\",\n \"0.5782316383237981\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0.458573\\n0.4624936523770503\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n0.08219664706805085\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n0.08219664706805085\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.36097078475712274\\n0.3012944667873305\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.6\\n0.72\\n0.9895\\n1\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.8105457460412552\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n0.08219664706805085\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n0.08219664706805085\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.36097078475712274\\n0.3012944667873305\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.6\\n0.30000000000000004\\n0.9895\\n1\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.33750244022421916\\n\",\n \"0.4529326043041817\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.009129999999999971\\n0\\n0.060138000000000025\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.44263613659899637\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.33750244022421916\\n\",\n \"0.4529326043041817\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0.458573\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.060138000000000025\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.44263613659899637\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.33750244022421916\\n\",\n \"0.4529326043041817\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0.458573\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.44263613659899637\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.33750244022421916\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0.458573\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.49980229731207027\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.33750244022421916\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0.458573\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.49980229731207027\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.33750244022421916\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.49980229731207027\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\",\n \"0.03624700000000003\\n0\\n1\\n0.011117000000000044\\n1\\n0.9036602665451088\\n0\\n0.33750244022421916\\n\",\n \"0.04414399999999996\\n0\\n0.41604547963058514\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.49980229731207027\\n0\\n\",\n \"0.04414399999999996\\n0\\n0.326778\\n0\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nRon is a happy owner of a permutation a of length n.\n\nA permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).\n\n<image>\n\nRon's permutation is subjected to m experiments of the following type: (r_i, p_i). This means that elements in range [1, r_i] (in other words, the prefix of length r_i) have to be sorted in ascending order with the probability of p_i. All experiments are performed in the same order in which they are specified in the input data.\n\nAs an example, let's take a look at a permutation [4, 2, 1, 5, 3] and an experiment (3, 0.6). After such an experiment with the probability of 60\\% the permutation will assume the form [1, 2, 4, 5, 3] and with a 40\\% probability it will remain unchanged.\n\nYou have to determine the probability of the permutation becoming completely sorted in ascending order after m experiments.\n\nInput\n\nEach test contains one or more test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100).\n\nThe first line of each test case contains two integers n and m (1 ≤ n, m ≤ 10^5) — the length of the permutation and the number of experiments, respectively.\n\nThe second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ n) — contents of the permutation.\n\nThe following m lines of each test case each contain an integer r_i and a real number p_i (1 ≤ r_i ≤ n, 0 ≤ p_i ≤ 1) — the length of the prefix and the probability of it being sorted. All probabilities are given with at most 6 decimal places.\n\nIt is guaranteed that the sum of n and the sum of m does not exceed 10^5 (∑ n, ∑ m ≤ 10^5).\n\nOutput\n\nFor each test case, print a single number — the probability that after all experiments the permutation becomes sorted in ascending order. Your answer will be considered correct if its absolute or relative error does not exceed 10^{-6}.\n\nFormally, let your answer be a, and the jury's answer be b. Your answer is accepted if and only if \\frac{|a - b|}{max{(1, |b|)}} ≤ 10^{-6}.\n\nExample\n\nInput\n\n\n4\n4 3\n4 3 2 1\n1 0.3\n3 1\n4 0.6\n5 3\n4 2 1 3 5\n3 0.8\n4 0.6\n5 0.3\n6 5\n1 3 2 4 5 6\n4 0.9\n5 0.3\n2 0.4\n6 0.7\n3 0.5\n4 2\n1 2 3 4\n2 0.5\n4 0.1\n\n\nOutput\n\n\n0.600000\n0.720000\n0.989500\n1.000000\n\nNote\n\nExplanation of the first test case: It can be demonstrated that whether the final permutation is sorted or not depends solely on sorting being performed in the (4, 0.6) experiment.\n\n### Input:\n4\n4 3\n4 3 2 1\n1 0.3\n3 1\n4 0.6\n5 3\n4 2 1 3 5\n3 0.8\n4 0.6\n5 0.3\n6 5\n1 3 2 4 5 6\n4 0.9\n5 0.3\n2 0.4\n6 0.7\n3 0.5\n4 2\n1 2 3 4\n2 0.5\n4 0.1\n\n### Output:\n\n0.600000\n0.720000\n0.989500\n1.000000\n\n\n### Input:\n1\n5 5\n1 2 3 5 4\n5 0.5\n5 0.5\n5 0.5\n5 0.5\n5 0.5\n\n### Output:\n0.968750\n\n\n### Code:\n# by the authority of GOD author: manhar singh sachdev #\n\nimport os,sys\nfrom io import BytesIO, IOBase\n\ndef main():\n for _ in range(int(input())):\n n,m = map(int,input().split())\n a = list(map(int,input().split()))\n j = n-1\n while j != -1 and a[j] == j+1:\n j -= 1\n if j == -1:\n for _ in range(m):\n x = input()\n print(1)\n continue\n ans = 0\n fac = 1\n for _ in range(m):\n r,p = map(float,input().split())\n r = int(r)\n if r >= j+1:\n ans += fac*p\n fac *= (1-p)\n print(ans)\n\n#Fast IO Region\nBUFSIZE = 8192\nclass FastIO(IOBase):\n newlines = 0\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\nif __name__ == '__main__':\n main()"}}},{"rowIdx":5673,"cells":{"id":{"kind":"string","value":"1486_D. Max Median_26775"},"description":{"kind":"string","value":"You are a given an array a of length n. Find a subarray a[l..r] with length at least k with the largest median.\n\nA median in an array of length n is an element which occupies position number ⌊ (n + 1)/(2) ⌋ after we sort the elements in non-decreasing order. For example: median([1, 2, 3, 4]) = 2, median([3, 2, 1]) = 2, median([2, 1, 2, 1]) = 1.\n\nSubarray a[l..r] is a contiguous part of the array a, i. e. the array a_l,a_{l+1},…,a_r for some 1 ≤ l ≤ r ≤ n, its length is r - l + 1.\n\nInput\n\nThe first line contains two integers n and k (1 ≤ k ≤ n ≤ 2 ⋅ 10^5).\n\nThe second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ n).\n\nOutput\n\nOutput one integer m — the maximum median you can get.\n\nExamples\n\nInput\n\n\n5 3\n1 2 3 2 1\n\n\nOutput\n\n\n2\n\nInput\n\n\n4 2\n1 2 3 4\n\n\nOutput\n\n\n3\n\nNote\n\nIn the first example all the possible subarrays are [1..3], [1..4], [1..5], [2..4], [2..5] and [3..5] and the median for all of them is 2, so the maximum possible median is 2 too.\n\nIn the second example median([3..4]) = 3."},"code":{"kind":"string","value":"import collections\n\ndef solveTestCase():\n\tn, k = [int(i) for i in input().split()]\n\ta = [int(i) for i in input().split()]\n\tr = n + 1\n\tl = 1\n\twhile r - l > 1:\n\t\tm = (r+l)//2\n\t\tb = [1 if i >= m else -1 for i in a]\n\t\tfor i in range(1, len(b)):\n\t\t\tb[i] += b[i - 1]\n\t\tans = False\n\t\tif b[k-1] > 0:\n\t\t\tans = True\n\n\t\tmm = 0\n\t\tfor i in range(k, n):\n\t\t\tmm = min(mm, b[i-k])\n\t\t\tif b[i] - mm > 0:\n\t\t\t\tans = True\n\t\t\t\tbreak\n\n\t\tif ans:\n\t\t\tl = m\n\t\telse:\n\t\t\tr = m\n\n\tprint(l)\n\nif __name__ == \"__main__\":\n\tt = 1\n\twhile t > 0:\n\t\tt -= 1\n\t\tsolveTestCase()\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"5 3\\n1 2 3 2 1\\n\",\n \"4 2\\n1 2 3 4\\n\",\n \"100 99\\n11 9 99 37 72 48 71 61 19 75 41 94 71 86 7 35 2 83 77 72 71 60 32 38 5 35 28 61 46 31 70 33 96 70 75 64 44 81 95 71 62 70 83 21 98 55 40 42 59 64 86 13 90 81 78 55 15 78 76 62 68 9 69 23 45 75 2 36 78 16 75 99 40 34 9 32 13 42 73 63 98 83 86 28 72 40 59 81 17 94 43 56 43 13 63 30 88 18 52 86\\n\",\n \"10 3\\n9 5 7 8 7 6 6 6 4 2\\n\",\n \"100 16\\n9 94 97 89 73 97 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 75 7 86 45 1 98 99 25 65 70 94 91 7 24 53 40 53 91 59 32 67 24 25 91 55 46 68 53 2 15 92 3 53 37 76 40 29 94 16 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 68 49 24 64 78 35 18\\n\",\n \"10 6\\n5 8 4 7 2 5 8 10 8 8\\n\",\n \"1 1\\n1\\n\",\n \"10 7\\n9 6 2 4 4 8 4 6 2 1\\n\",\n \"100 1\\n25 15 25 23 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 10 100 68 92 34 79 76 42 66 17 7 95 87 67 61 18 60 99 99 53 90 3 80 1 31 8 83 26 94 45 35 74 29 25 9 54 88 12 10 18 79 71 55 79 7 52 51 47 29 63 92 39 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"2 2\\n2 2\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 22 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 24 96 56 24 21 46 57 71 85 54 85 68 44 42 70 38 91 73 33 35 19 53 24 88 84 78 2 92 26 74 18 60 2 6 27 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 4 10 81 30 99 64 54\\n\",\n \"100 8\\n1 29 89 59 94 22 65 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 27 67 54 3 74 72 1 100 17 84 24 46 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 49 60 76 17 52 79 93 31 57 90 64 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"10 5\\n7 7 9 9 3 6 1 2 3 2\\n\",\n \"10 2\\n1 10 2 6 10 8 9 4 4 5\\n\",\n \"100 2\\n45 59 71 97 56 73 77 31 9 5 98 44 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 82 53 41 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 21 59 31 94 45 75 56 99 46 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 32 43 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 33 92 7 7 95 51 66 11 58 77 3 29 27 34 89 80 60 47 95 79 60 3 32 86 50 39 85 5 58 99 6 29 42 36 77 53 15 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 64\\n43 30 88 55 14 10 78 99 6 29 10 79 11 96 7 20 37 65 79 78 46 62 37 47 37 60 4 28 24 9 87 4 20 94 47 95 100 13 60 24 34 4 89 63 65 20 11 68 99 47 41 38 37 23 23 13 3 1 39 28 65 95 98 44 64 58 77 11 89 49 58 30 77 20 94 40 15 17 62 92 9 91 27 23 24 74 92 60 91 40 88 14 44 75 25 73 51 4 31 25\\n\",\n \"2 1\\n2 2\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 41 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 14 32 20 13 94 11 46 10 60 22 53 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 72 67 59 90 92 15 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"100 99\\n11 9 99 37 72 48 71 61 19 75 41 94 71 86 7 35 2 83 77 72 71 60 32 38 5 35 28 61 46 31 70 33 96 70 75 64 44 81 95 71 62 70 83 21 98 55 40 42 59 41 86 13 90 81 78 55 15 78 76 62 68 9 69 23 45 75 2 36 78 16 75 99 40 34 9 32 13 42 73 63 98 83 86 28 72 40 59 81 17 94 43 56 43 13 63 30 88 18 52 86\\n\",\n \"10 3\\n9 5 7 8 7 2 6 6 4 2\\n\",\n \"100 16\\n9 94 97 89 73 97 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 75 7 86 45 1 98 99 25 65 70 94 91 7 24 53 40 53 91 59 32 67 24 25 91 55 46 68 53 2 15 92 3 53 37 76 40 29 94 4 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 68 49 24 64 78 35 18\\n\",\n \"10 6\\n6 8 4 7 2 5 8 10 8 8\\n\",\n \"10 7\\n9 6 2 4 4 8 4 12 2 1\\n\",\n \"100 1\\n25 15 25 23 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 10 100 68 92 34 79 76 42 66 17 7 95 87 67 61 18 60 99 99 53 90 3 80 1 31 8 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 52 51 47 29 63 92 39 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 22 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 24 96 56 24 21 46 57 71 85 54 85 68 44 42 70 38 91 73 33 35 19 53 24 88 84 78 2 92 26 74 18 60 2 6 27 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 8\\n1 29 89 59 94 22 65 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 27 67 54 3 74 72 1 100 17 84 24 46 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 76 17 52 79 93 31 57 90 64 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"10 2\\n1 10 2 2 10 8 9 4 4 5\\n\",\n \"100 2\\n45 59 71 97 56 73 77 31 9 5 98 44 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 82 53 41 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 21 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 32 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 33 92 7 7 95 51 66 11 58 77 3 29 27 34 89 80 60 47 95 79 60 3 32 86 50 39 85 5 58 99 6 29 42 36 77 53 15 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 41 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 14 32 20 13 94 11 46 10 2 22 53 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 72 67 59 90 92 15 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n1 2 3 2 1\\n\",\n \"10 7\\n9 6 2 4 7 8 0 12 2 1\\n\",\n \"100 99\\n11 9 99 37 72 48 71 61 19 75 41 94 71 86 7 35 2 83 77 72 71 60 32 38 5 35 28 61 89 31 70 33 96 70 75 64 44 63 95 71 62 68 83 21 98 55 40 42 59 41 86 13 90 81 78 55 15 78 76 62 68 9 69 23 45 75 2 36 78 16 75 99 40 34 9 32 13 42 73 63 98 83 86 28 72 40 59 81 17 94 43 56 43 13 63 30 88 18 52 86\\n\",\n \"100 8\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 27 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 17 52 79 93 31 57 90 64 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 22 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 106 44 42 70 38 150 73 33 35 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 13 7 95 51 66 11 58 77 3 29 27 34 89 129 6 47 95 79 60 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 4 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"100 8\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 11 88 84 78 2 7 26 74 18 60 2 6 9 13 156 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 78 56 75 22 48 7 28 70 77 57 81 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 8\\n80 71 49 27 86 46 38 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 57 70 3 87 17 9 92 24 21 46 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 1 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 158 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 8\\n30 71 49 27 86 46 38 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 57 70 3 87 17 9 92 11 21 77 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 1 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 158 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 40 19 70 10 67 12 119 14 40 37 48 93 74 3 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 29 46 15 75 28 37 0 24 21 7 50 62 93 91 13 62 24 10 38 27 46 6 46 65 67 78 90 14 1 29 97 10 46 43 5 76 0 23 5 48 32 16 18\\n\",\n \"100 5\\n2 48 153 26 75 18 48 7 22 70 77 57 81 71 12 72 44 28 83 15 9 16 52 40 91 14 69 24 13 95 5 6 84 47 93 32 33 4 7 159 51 66 11 58 77 3 29 27 34 116 129 6 47 95 3 44 3 62 48 50 39 85 5 129 99 7 29 42 36 77 53 8 8 1 51 58 104 96 82 4 70 70 80 37 47 51 40 12 57 19 6 77 23 47 61 23 69 7 60 96\\n\",\n \"100 32\\n92 84 26 11 16 91 17 13 58 26 6 7 13 14 72 28 7 14 40 19 70 10 67 21 119 14 40 37 48 93 74 3 21 15 43 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 29 46 15 75 28 37 0 24 21 7 50 62 93 91 13 62 24 6 38 27 46 6 46 3 67 78 90 14 1 29 119 10 46 43 5 76 0 23 5 76 33 16 18\\n\",\n \"100 5\\n2 48 153 26 75 18 48 10 22 70 13 57 55 131 12 72 44 28 83 15 9 16 52 40 91 2 69 24 13 95 4 6 84 47 93 54 33 4 7 159 71 66 11 58 77 3 29 27 34 116 129 6 47 95 3 44 3 62 48 50 39 85 5 129 99 7 29 42 36 77 83 8 8 1 51 58 104 96 82 4 125 70 80 37 47 51 40 12 57 19 6 77 23 47 61 23 69 7 60 96\\n\",\n \"100 32\\n92 135 45 11 16 91 17 13 58 26 6 7 13 14 72 28 0 14 40 19 70 10 67 21 119 14 40 37 48 93 74 3 21 15 43 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 1 22 50 82 51 29 88 15 75 28 37 0 24 21 7 50 62 93 91 13 62 24 6 38 27 46 6 46 3 67 78 11 14 1 29 119 10 46 43 5 76 0 23 5 76 33 16 18\\n\",\n \"100 32\\n92 25 45 11 16 151 2 13 111 26 6 7 13 14 72 6 0 14 34 19 70 11 154 21 119 14 53 37 48 93 74 3 13 29 4 30 16 69 46 13 95 97 37 71 20 9 20 13 94 11 19 7 1 37 1 82 51 29 171 15 75 2 37 0 9 22 7 50 62 93 91 13 19 24 11 38 27 46 6 46 3 67 78 16 14 0 29 119 10 46 43 15 76 0 23 5 59 33 16 18\\n\",\n \"100 32\\n92 25 45 11 16 151 2 13 111 26 6 7 13 14 72 6 0 14 34 27 70 11 154 21 119 14 53 37 47 93 74 3 13 29 1 30 16 69 23 13 95 97 37 71 20 9 20 13 94 11 19 7 1 37 1 82 51 29 171 15 134 2 37 0 15 22 7 50 62 93 91 13 19 24 11 38 27 46 6 46 5 67 78 16 14 1 29 119 10 46 43 29 74 0 23 5 59 33 16 18\\n\",\n \"10 5\\n7 7 9 13 3 6 1 2 3 2\\n\",\n \"100 99\\n11 9 99 37 72 48 71 61 19 75 41 94 71 86 7 35 2 83 77 72 71 60 32 38 5 35 28 61 46 31 70 33 96 70 75 64 44 63 95 71 62 70 83 21 98 55 40 42 59 41 86 13 90 81 78 55 15 78 76 62 68 9 69 23 45 75 2 36 78 16 75 99 40 34 9 32 13 42 73 63 98 83 86 28 72 40 59 81 17 94 43 56 43 13 63 30 88 18 52 86\\n\",\n \"10 3\\n13 5 7 8 7 2 6 6 4 2\\n\",\n \"100 16\\n9 94 97 89 73 97 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 75 7 86 45 1 98 99 25 65 70 94 91 7 24 53 40 53 91 59 32 67 24 25 91 55 46 68 53 2 15 92 3 53 37 76 40 49 94 4 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 68 49 24 64 78 35 18\\n\",\n \"10 7\\n9 6 2 4 4 8 0 12 2 1\\n\",\n \"100 1\\n25 15 25 23 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 10 100 68 92 34 79 76 42 66 17 7 95 87 67 61 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 52 51 47 29 63 92 39 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 22 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 68 44 42 70 38 91 73 33 35 19 53 24 88 84 78 2 92 26 74 18 60 2 6 27 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 8\\n1 29 89 59 94 22 65 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 27 67 54 3 74 72 1 100 17 84 24 46 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 17 52 79 93 31 57 90 64 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"10 2\\n1 10 2 2 10 8 9 5 4 5\\n\",\n \"100 2\\n45 59 71 97 56 73 32 31 9 5 98 44 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 82 53 41 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 21 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 32 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 7 7 95 51 66 11 58 77 3 29 27 34 89 80 60 47 95 79 60 3 32 86 50 39 85 5 58 99 6 29 42 36 77 53 15 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 73 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 14 32 20 13 94 11 46 10 2 22 53 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 72 67 59 90 92 15 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n1 2 6 2 1\\n\",\n \"100 99\\n11 9 99 37 72 48 71 61 19 75 41 94 71 86 7 35 2 83 77 72 71 60 32 38 5 35 28 61 46 31 70 33 96 70 75 64 44 63 95 71 62 68 83 21 98 55 40 42 59 41 86 13 90 81 78 55 15 78 76 62 68 9 69 23 45 75 2 36 78 16 75 99 40 34 9 32 13 42 73 63 98 83 86 28 72 40 59 81 17 94 43 56 43 13 63 30 88 18 52 86\\n\",\n \"10 3\\n13 5 7 8 7 1 6 6 4 2\\n\",\n \"100 16\\n9 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 75 7 86 45 1 98 99 25 65 70 94 91 7 24 53 40 53 91 59 32 67 24 25 91 55 46 68 53 2 15 92 3 53 37 76 40 49 94 4 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 68 49 24 64 78 35 18\\n\",\n \"100 1\\n25 15 25 16 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 10 100 68 92 34 79 76 42 66 17 7 95 87 67 61 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 52 51 47 29 63 92 39 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 22 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 68 44 42 70 38 150 73 33 35 19 53 24 88 84 78 2 92 26 74 18 60 2 6 27 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 8\\n1 29 89 59 94 22 65 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 27 67 54 3 74 72 2 100 17 84 24 46 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 17 52 79 93 31 57 90 64 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"10 2\\n1 10 2 1 10 8 9 5 4 5\\n\",\n \"100 2\\n45 59 71 97 56 73 32 31 9 5 98 44 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 41 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 21 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 32 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 7 7 95 51 66 11 58 77 3 29 27 34 89 80 60 47 95 79 60 3 32 86 50 39 85 5 58 99 6 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 14 32 20 13 94 11 46 10 2 22 53 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 72 67 59 90 92 15 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n1 2 6 2 2\\n\",\n \"10 3\\n13 5 7 8 7 0 6 6 4 2\\n\",\n \"100 16\\n9 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 70 94 91 7 24 53 40 53 91 59 32 67 24 25 91 55 46 68 53 2 15 92 3 53 37 76 40 49 94 4 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 68 49 24 64 78 35 18\\n\",\n \"10 7\\n9 6 2 4 7 10 0 12 2 1\\n\",\n \"100 1\\n25 15 25 16 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 10 100 68 92 34 79 76 42 66 17 7 95 87 67 61 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 52 51 47 29 63 92 36 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 22 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 68 44 42 70 38 150 73 33 35 19 53 24 88 84 78 2 92 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 8\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 27 67 54 3 74 72 2 100 17 84 24 46 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 17 52 79 93 31 57 90 64 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 97 27 73 32 31 9 5 98 44 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 41 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 21 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 32 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 7 7 95 51 66 11 58 77 3 29 27 34 89 80 60 47 95 79 60 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 14 32 20 13 94 11 46 7 2 22 53 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 72 67 59 90 92 15 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n2 2 6 2 2\\n\",\n \"100 99\\n11 9 99 37 72 48 71 61 19 75 41 94 71 86 7 35 2 83 77 72 71 60 32 38 5 35 28 61 89 31 70 33 96 70 75 64 44 85 95 71 62 68 83 21 98 55 40 42 59 41 86 13 90 81 78 55 15 78 76 62 68 9 69 23 45 75 2 36 78 16 75 99 40 34 9 32 13 42 73 63 98 83 86 28 72 40 59 81 17 94 43 56 43 13 63 30 88 18 52 86\\n\",\n \"100 16\\n9 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 70 94 91 7 24 53 40 53 91 59 32 67 24 25 91 55 46 68 53 2 15 92 3 53 37 76 40 49 94 4 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"10 7\\n9 6 2 4 7 10 0 12 4 1\\n\",\n \"100 1\\n25 15 25 16 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 10 100 68 92 34 79 76 42 66 17 7 95 87 67 61 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 52 51 47 47 63 92 36 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 22 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 68 44 42 70 38 150 73 33 35 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 2\\n45 59 71 97 27 73 32 31 9 5 98 25 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 41 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 21 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 32 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 13 7 95 51 66 11 58 77 3 29 27 34 89 80 60 47 95 79 60 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 14 32 20 13 94 11 46 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 72 67 59 90 92 15 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n1 2 6 3 2\\n\",\n \"100 99\\n11 9 99 37 72 48 71 61 19 75 41 94 71 86 7 35 2 83 77 72 71 60 32 38 5 35 28 61 89 31 70 33 96 70 75 64 44 85 95 71 62 68 83 21 98 55 40 42 59 41 86 13 90 81 78 55 15 78 76 62 68 9 69 23 45 75 2 36 78 16 117 99 40 34 9 32 13 42 73 63 98 83 86 28 72 40 59 81 17 94 43 56 43 13 63 30 88 18 52 86\\n\",\n \"100 16\\n9 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 70 94 91 7 24 53 40 53 91 59 32 67 24 25 157 55 46 68 53 2 15 92 3 53 37 76 40 49 94 4 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"100 1\\n25 15 25 16 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 10 100 68 92 34 79 76 42 66 17 7 95 87 67 64 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 52 51 47 47 63 92 36 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 8\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 27 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 17 52 79 93 31 57 90 43 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 97 27 73 32 31 9 5 98 25 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 41 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 30 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 32 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 13 7 95 51 66 11 58 77 3 29 27 34 89 80 6 47 95 79 60 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 14 32 20 13 94 11 46 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 65 67 59 90 92 15 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n2 2 6 3 2\\n\",\n \"100 16\\n9 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 70 94 91 7 24 53 40 53 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"100 1\\n25 15 25 16 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 18 100 68 92 34 79 76 42 66 17 7 95 87 67 64 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 52 51 47 47 63 92 36 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 40 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 106 44 42 70 38 150 73 33 35 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 27 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 17 52 79 93 31 57 90 43 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 97 27 73 32 31 9 5 98 25 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 71 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 30 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 13 7 95 51 66 11 58 77 3 29 27 34 89 80 6 47 95 79 60 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 32 20 13 94 11 46 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 65 67 59 90 92 15 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n2 2 1 3 2\\n\",\n \"100 16\\n9 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 102 94 91 7 24 53 40 53 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 5 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"100 1\\n25 15 25 16 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 18 100 68 92 34 79 76 42 66 17 7 95 87 67 64 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 43 51 47 47 63 92 36 1 15 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 72 62 94 59 93 40 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 106 44 42 70 38 150 73 33 60 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 17 52 79 93 31 57 90 43 91 1 36 87 23 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 97 27 73 32 31 9 4 98 25 63 1 2 41 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 71 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 30 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 32\\n42 84 26 11 37 91 23 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 32 20 13 94 11 46 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n3 2 1 3 2\\n\",\n \"100 16\\n9 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 102 94 91 7 24 53 40 53 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"100 1\\n25 15 25 16 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 18 100 68 92 34 79 76 42 66 17 7 95 87 67 64 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 43 51 47 47 63 92 36 1 4 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 47\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 106 44 42 70 38 150 73 33 60 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 17 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 97 27 73 32 31 9 4 98 25 63 1 2 10 88 15 43 29 16 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 71 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 30 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 13 7 95 51 66 11 58 77 3 29 27 34 89 129 6 47 95 79 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 5 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 32 20 13 94 11 46 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n4 2 1 3 2\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 102 94 91 7 24 53 40 53 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"100 1\\n25 15 25 16 3 4 2 43 54 23 58 5 72 71 91 24 61 61 20 80 67 75 12 99 24 82 18 100 68 92 34 79 76 42 66 17 7 95 87 67 64 18 60 99 99 53 90 3 80 1 31 0 83 26 94 45 35 74 29 25 9 54 88 12 7 18 79 71 55 79 7 43 51 47 47 63 92 36 1 4 14 2 93 70 26 47 28 72 100 51 96 32 11 56 40 99 11 12 42 26\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 60 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 106 44 42 37 38 150 73 33 60 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 24 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 97 27 73 32 31 9 4 98 25 63 1 2 10 88 15 43 29 32 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 71 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 30 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 53 47 93 32 92 13 7 95 51 66 11 58 77 3 29 27 34 89 129 6 47 95 79 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 46 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"5 5\\n4 0 1 3 2\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 67 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 56 24 21 46 57 71 85 54 85 106 44 42 37 38 150 73 33 60 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 95 10 40 39 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 98 27 73 32 31 9 4 98 25 63 1 2 10 88 15 43 29 32 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 71 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 30 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 52 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 92 13 7 95 51 66 11 58 77 3 29 27 34 89 129 6 47 95 79 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 7 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 54 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 71 85 54 85 106 44 42 37 38 150 73 33 60 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 95 10 40 34 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 98 27 73 32 31 9 4 98 25 63 1 2 10 88 15 43 29 32 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 71 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 30 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 5 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 28 13 7 95 51 66 11 58 77 3 29 27 34 89 129 6 47 95 79 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 4 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 89 84 91 13 62 41 10 38 74 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 32 78 71 38 49 24 64 78 35 18\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 14 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 77 10 40 34 51 4 97 67 5 46 20 98 79 77 41 54 73 24 51 65 37 23 17 19 60 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 2\\n45 59 71 98 27 73 32 31 9 4 98 25 63 1 3 10 88 15 43 29 32 61 25 78 81 90 31 53 80 58 60 53 67 78 71 25 37 62 36 111 53 71 45 58 91 36 6 47 94 63 41 52 80 47 86 79 22 99 84 30 30 59 31 94 45 75 56 99 61 13 52 42 66 51 4 93 5 22 50 23 60 58 27 85 69 7 100 18 50 74 34 44 22 17 49 1 28 63 76 63\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 28 13 7 95 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 86 44 57 60 96\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 25 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 48 94 97 76 15 8 10 81 30 99 64 54\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 77 10 40 34 51 4 97 67 5 46 20 98 79 77 41 54 114 24 51 65 37 23 17 19 60 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 28 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 65 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 4 13 14 72 61 51 14 35 19 70 9 67 10 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 8 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 157 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 24 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 48 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 77 10 40 34 51 4 97 67 5 46 20 132 79 77 41 54 114 24 51 65 37 23 17 19 60 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 4\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 28 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 4 13 14 72 61 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 10 81 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 40 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 8 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 11 88 84 78 2 7 26 74 18 60 2 6 9 13 83 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 48 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 38 79 77 10 40 34 51 4 97 67 5 46 20 132 79 77 41 54 114 24 51 65 37 23 17 19 84 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 6\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 28 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 86 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 4 13 14 72 61 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 0 81 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 45 1 98 99 8 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 11 88 84 78 2 7 26 74 18 60 2 6 9 13 156 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 48 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 14\\n1 29 89 59 94 22 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 44 79 77 10 40 34 51 4 97 67 5 46 20 132 79 77 41 54 114 24 51 65 37 23 17 19 84 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 6\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 28 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 4 13 14 72 61 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 23 18\\n\",\n \"100 16\\n14 94 97 89 73 165 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 16\\n80 71 49 27 84 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 11 88 84 78 2 7 26 74 18 60 2 6 9 13 156 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 14\\n1 29 89 59 94 35 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 44 79 77 10 40 34 51 4 97 67 5 46 20 132 79 77 41 54 114 24 51 65 37 23 17 19 84 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 6\\n1 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 4 13 14 72 61 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 92 1 29 82 15 46 43 5 76 24 23 7 48 32 16 18\\n\",\n \"100 16\\n14 94 97 89 48 165 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 65 102 94 91 7 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 14\\n1 29 89 59 94 35 124 60 54 99 51 10 16 16 20 32 7 49 63 6 99 43 93 61 45 67 54 3 74 72 2 100 17 84 24 78 11 3 62 46 42 32 51 84 40 44 79 77 10 40 34 51 4 9 67 5 46 20 132 79 77 41 54 114 24 51 65 37 23 17 19 84 2 20 52 79 93 31 57 90 43 91 1 36 87 14 15 2 48 94 49 31 65 99 12 55 93 63 16 85\\n\",\n \"100 6\\n2 48 78 56 75 22 48 7 28 70 77 57 66 71 40 72 29 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 63 26 6 4 13 14 72 61 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 7 48 32 16 18\\n\",\n \"100 16\\n14 94 97 89 48 165 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 65 102 94 91 1 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 2 15 92 5 53 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 8\\n80 71 49 27 86 46 23 41 140 62 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 11 88 84 78 2 7 26 74 18 60 2 6 9 13 156 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 58 26 6 4 13 14 72 61 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 64 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 7 48 32 16 18\\n\",\n \"100 16\\n14 94 97 89 48 165 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 65 102 94 91 1 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 2 15 92 5 13 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 8\\n80 71 49 27 86 46 23 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 11 88 84 78 2 7 26 74 18 60 2 6 9 13 156 4 84 63 87 3 100 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 78 56 75 22 48 7 28 70 77 57 81 71 40 72 43 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 58 26 6 4 13 14 72 61 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 7 48 32 16 18\\n\",\n \"100 16\\n14 94 97 89 48 165 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 65 102 94 91 1 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 3 15 92 5 13 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 8\\n80 71 49 27 86 46 23 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 53 11 88 84 78 2 7 26 74 18 60 2 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 56 75 22 48 7 28 70 77 57 81 71 40 72 43 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 78 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 24 13 58 26 6 4 13 14 72 28 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 7 48 32 16 18\\n\",\n \"100 16\\n14 94 97 89 48 167 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 65 102 94 91 1 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 3 15 92 5 13 37 76 40 49 94 4 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 8\\n80 71 49 27 86 46 23 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 106 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 2 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 56 75 22 48 7 28 70 77 57 81 71 40 72 43 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 1 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 4 13 14 72 28 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 7 48 32 16 18\\n\",\n \"100 16\\n14 94 97 89 48 167 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 65 102 94 91 1 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 3 15 92 5 13 37 76 40 49 94 2 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 8\\n80 71 49 27 86 46 23 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 2 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 28 70 77 57 81 71 40 72 43 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 12 8 1 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 35 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 7 48 32 16 18\\n\",\n \"100 16\\n14 94 97 89 48 167 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 34 102 94 91 1 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 3 15 92 5 13 37 76 40 49 94 2 8 76 12 50 2 43 86 49 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 8\\n80 71 49 27 86 46 23 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 1 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 28 70 77 57 81 71 40 72 43 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 86 50 39 85 5 58 99 7 29 42 36 77 53 8 8 1 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 40 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 7 48 32 16 18\\n\",\n \"100 16\\n14 94 97 89 48 167 11 78 10 30 54 57 88 57 44 6 33 13 17 26 69 100 92 54 22 59 80 67 17 29 76 69 133 7 86 68 1 98 99 8 34 102 94 91 1 24 53 40 70 91 59 32 67 24 25 83 55 46 68 53 3 15 92 5 13 37 76 40 49 94 2 8 76 12 50 2 43 86 2 95 81 5 34 28 21 47 97 73 96 56 30 78 71 38 49 24 64 78 35 18\\n\",\n \"100 8\\n80 71 49 27 86 46 38 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 37 70 3 87 17 96 92 24 21 46 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 1 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 28 70 77 57 81 71 40 72 43 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 82 50 39 85 5 58 99 7 29 42 36 77 53 8 8 1 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 40 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 84 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 5 48 32 16 18\\n\",\n \"100 8\\n80 71 49 27 86 46 38 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 57 70 3 87 17 96 92 24 21 46 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 1 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 82 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 28 70 77 57 81 71 40 72 44 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 82 50 39 85 5 58 99 7 29 42 36 77 53 8 8 1 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 40 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 93 91 13 62 41 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 5 48 32 16 18\\n\",\n \"100 8\\n80 71 49 27 86 46 38 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 57 70 3 87 17 96 92 24 21 46 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 1 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 158 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 28 70 77 57 81 71 40 72 44 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 48 50 39 85 5 58 99 7 29 42 36 77 53 8 8 1 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 40 19 70 9 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 93 91 13 62 24 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 5 48 32 16 18\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 28 70 77 57 81 71 12 72 44 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 32 48 50 39 85 5 58 99 7 29 42 36 77 53 8 8 1 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 40 19 70 11 67 12 119 10 40 66 48 93 74 6 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 93 91 13 62 24 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 5 48 32 16 18\\n\",\n \"100 8\\n30 71 49 27 86 46 38 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 57 70 3 87 17 9 92 24 21 46 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 1 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 158 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 28 70 77 57 81 71 12 72 44 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 62 48 50 39 85 5 58 99 7 29 42 36 77 53 8 8 1 51 58 104 96 49 47 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 40 19 70 11 67 12 119 10 40 66 48 93 74 3 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 93 91 13 62 24 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 5 48 32 16 18\\n\",\n \"100 8\\n30 71 49 27 86 46 38 41 140 13 94 59 93 40 25 19 52 71 90 48 95 49 2 11 25 57 70 3 87 17 9 92 11 21 46 57 120 85 54 85 144 44 42 37 38 150 73 33 60 19 106 11 88 84 78 2 7 26 74 18 60 1 6 9 13 156 4 84 63 87 3 101 9 6 68 11 94 2 50 89 2 21 53 44 7 61 61 158 19 94 97 76 15 8 10 81 30 99 64 94\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 28 70 77 57 81 71 12 72 44 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 62 48 50 39 85 5 58 99 7 29 42 36 77 53 8 8 1 51 58 104 96 49 4 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\",\n \"100 32\\n42 84 26 11 37 91 17 13 58 26 6 7 13 14 72 28 51 14 40 19 70 11 67 12 119 10 40 37 48 93 74 3 21 15 46 30 46 69 46 13 95 97 37 65 20 9 20 13 94 11 19 7 2 22 50 82 51 84 46 15 75 28 37 0 124 29 7 50 62 93 91 13 62 24 10 38 27 46 6 46 65 67 59 90 14 1 29 82 15 46 43 5 76 24 23 5 48 32 16 18\\n\",\n \"100 6\\n2 48 153 26 75 22 48 7 22 70 77 57 81 71 12 72 44 28 83 15 9 16 52 40 91 14 69 75 13 95 5 6 84 47 93 32 33 13 7 159 51 66 11 58 77 3 29 27 34 89 129 6 47 95 3 44 3 62 48 50 39 85 5 58 99 7 29 42 36 77 53 8 8 1 51 58 104 96 49 4 70 70 80 37 47 51 40 12 57 19 6 77 32 47 68 23 44 57 60 96\\n\"\n ],\n \"output\": [\n \"\\n2\",\n \"\\n3\",\n \"61\",\n \"7\",\n \"69\",\n \"8\",\n \"1\",\n \"4\",\n \"100\",\n \"2\",\n \"68\",\n \"67\",\n \"7\",\n \"9\",\n \"84\",\n \"80\",\n \"47\",\n \"2\",\n \"51\",\n \"60\\n\",\n \"7\\n\",\n \"69\\n\",\n \"8\\n\",\n \"4\\n\",\n \"100\\n\",\n \"68\\n\",\n \"67\\n\",\n \"9\\n\",\n \"84\\n\",\n \"80\\n\",\n \"50\\n\",\n \"2\\n\",\n \"6\\n\",\n \"61\\n\",\n \"72\\n\",\n \"70\\n\",\n \"89\\n\",\n \"46\\n\",\n \"85\\n\",\n \"71\\n\",\n \"76\\n\",\n \"77\\n\",\n \"43\\n\",\n \"95\\n\",\n \"38\\n\",\n \"96\\n\",\n \"37\\n\",\n \"30\\n\",\n \"29\\n\",\n \"7\\n\",\n \"60\\n\",\n \"7\\n\",\n \"69\\n\",\n \"4\\n\",\n \"100\\n\",\n \"68\\n\",\n \"67\\n\",\n \"9\\n\",\n \"84\\n\",\n \"80\\n\",\n \"50\\n\",\n \"2\\n\",\n \"60\\n\",\n \"7\\n\",\n \"69\\n\",\n \"100\\n\",\n \"68\\n\",\n \"67\\n\",\n \"9\\n\",\n \"84\\n\",\n \"80\\n\",\n \"50\\n\",\n \"2\\n\",\n \"7\\n\",\n \"69\\n\",\n \"6\\n\",\n \"100\\n\",\n \"68\\n\",\n \"67\\n\",\n \"84\\n\",\n \"80\\n\",\n \"50\\n\",\n \"2\\n\",\n \"61\\n\",\n \"69\\n\",\n \"6\\n\",\n \"100\\n\",\n \"68\\n\",\n \"84\\n\",\n \"80\\n\",\n \"50\\n\",\n \"2\\n\",\n \"61\\n\",\n \"69\\n\",\n \"100\\n\",\n \"72\\n\",\n \"84\\n\",\n \"80\\n\",\n \"50\\n\",\n \"2\\n\",\n \"69\\n\",\n \"100\\n\",\n \"70\\n\",\n \"61\\n\",\n \"84\\n\",\n \"80\\n\",\n \"50\\n\",\n \"2\\n\",\n \"69\\n\",\n \"100\\n\",\n \"70\\n\",\n \"61\\n\",\n \"84\\n\",\n \"50\\n\",\n \"2\\n\",\n \"69\\n\",\n \"100\\n\",\n \"70\\n\",\n \"61\\n\",\n \"84\\n\",\n \"89\\n\",\n \"50\\n\",\n \"2\\n\",\n \"69\\n\",\n \"100\\n\",\n \"61\\n\",\n \"61\\n\",\n \"84\\n\",\n \"89\\n\",\n \"50\\n\",\n \"2\\n\",\n \"69\\n\",\n \"61\\n\",\n \"61\\n\",\n \"84\\n\",\n \"89\\n\",\n \"50\\n\",\n \"69\\n\",\n \"61\\n\",\n \"61\\n\",\n \"84\\n\",\n \"89\\n\",\n \"50\\n\",\n \"69\\n\",\n \"61\\n\",\n \"61\\n\",\n \"84\\n\",\n \"89\\n\",\n \"69\\n\",\n \"61\\n\",\n \"61\\n\",\n \"89\\n\",\n \"46\\n\",\n \"69\\n\",\n \"61\\n\",\n \"61\\n\",\n \"89\\n\",\n \"46\\n\",\n \"69\\n\",\n \"61\\n\",\n \"61\\n\",\n \"70\\n\",\n \"46\\n\",\n \"69\\n\",\n \"61\\n\",\n \"61\\n\",\n \"70\\n\",\n \"46\\n\",\n \"69\\n\",\n \"61\\n\",\n \"61\\n\",\n \"70\\n\",\n \"46\\n\",\n \"69\\n\",\n \"61\\n\",\n \"70\\n\",\n \"46\\n\",\n \"69\\n\",\n \"85\\n\",\n \"46\\n\",\n \"69\\n\",\n \"85\\n\",\n \"71\\n\",\n \"46\\n\",\n \"69\\n\",\n \"85\\n\",\n \"71\\n\",\n \"46\\n\",\n \"69\\n\",\n \"85\\n\",\n \"71\\n\",\n \"46\\n\",\n \"69\\n\",\n \"85\\n\",\n \"71\\n\",\n \"46\\n\",\n \"69\\n\",\n \"85\\n\",\n \"71\\n\",\n \"46\\n\",\n \"69\\n\",\n \"85\\n\",\n \"71\\n\",\n \"46\\n\",\n \"85\\n\",\n \"71\\n\",\n \"46\\n\",\n \"85\\n\",\n \"71\\n\",\n \"46\\n\",\n \"71\\n\",\n \"46\\n\",\n \"76\\n\",\n \"71\\n\",\n \"46\\n\",\n \"76\\n\",\n \"71\\n\",\n \"46\\n\",\n \"71\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nYou are a given an array a of length n. Find a subarray a[l..r] with length at least k with the largest median.\n\nA median in an array of length n is an element which occupies position number ⌊ (n + 1)/(2) ⌋ after we sort the elements in non-decreasing order. For example: median([1, 2, 3, 4]) = 2, median([3, 2, 1]) = 2, median([2, 1, 2, 1]) = 1.\n\nSubarray a[l..r] is a contiguous part of the array a, i. e. the array a_l,a_{l+1},…,a_r for some 1 ≤ l ≤ r ≤ n, its length is r - l + 1.\n\nInput\n\nThe first line contains two integers n and k (1 ≤ k ≤ n ≤ 2 ⋅ 10^5).\n\nThe second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ n).\n\nOutput\n\nOutput one integer m — the maximum median you can get.\n\nExamples\n\nInput\n\n\n5 3\n1 2 3 2 1\n\n\nOutput\n\n\n2\n\nInput\n\n\n4 2\n1 2 3 4\n\n\nOutput\n\n\n3\n\nNote\n\nIn the first example all the possible subarrays are [1..3], [1..4], [1..5], [2..4], [2..5] and [3..5] and the median for all of them is 2, so the maximum possible median is 2 too.\n\nIn the second example median([3..4]) = 3.\n\n### Input:\n5 3\n1 2 3 2 1\n\n### Output:\n\n2\n\n### Input:\n4 2\n1 2 3 4\n\n### Output:\n\n3\n\n### Code:\nimport collections\n\ndef solveTestCase():\n\tn, k = [int(i) for i in input().split()]\n\ta = [int(i) for i in input().split()]\n\tr = n + 1\n\tl = 1\n\twhile r - l > 1:\n\t\tm = (r+l)//2\n\t\tb = [1 if i >= m else -1 for i in a]\n\t\tfor i in range(1, len(b)):\n\t\t\tb[i] += b[i - 1]\n\t\tans = False\n\t\tif b[k-1] > 0:\n\t\t\tans = True\n\n\t\tmm = 0\n\t\tfor i in range(k, n):\n\t\t\tmm = min(mm, b[i-k])\n\t\t\tif b[i] - mm > 0:\n\t\t\t\tans = True\n\t\t\t\tbreak\n\n\t\tif ans:\n\t\t\tl = m\n\t\telse:\n\t\t\tr = m\n\n\tprint(l)\n\nif __name__ == \"__main__\":\n\tt = 1\n\twhile t > 0:\n\t\tt -= 1\n\t\tsolveTestCase()\n"}}},{"rowIdx":5674,"cells":{"id":{"kind":"string","value":"1510_D. Digits_26778"},"description":{"kind":"string","value":"Diana loves playing with numbers. She's got n cards with positive integer numbers a_i written on them. She spends her free time multiplying the numbers on the cards. She picks a non-empty subset of the cards and multiplies all the numbers a_i written on them.\n\nDiana is happy when the product of the numbers ends with her favorite digit d. Now she is curious what cards she should pick so that the product of the numbers on them is the largest possible and the last decimal digit of the product is d. Please, help her.\n\nInput\n\nThe first line contains the integers n and d (1≤ n≤ 10^5, 0≤ d≤ 9). The second line contains n integers a_i (1≤ a_i≤ 1000). \n\nOutput\n\nOn the first line, print the number of chosen cards k (1≤ k≤ n). On the next line, print the numbers written on the chosen cards in any order. \n\nIf it is impossible to choose a subset of cards with the product that ends with the digit d, print the single line with -1.\n\nExamples\n\nInput\n\n\n6 4\n4 11 8 2 1 13\n\n\nOutput\n\n\n5\n1 2 4 11 13 \n\n\nInput\n\n\n3 1\n2 4 6\n\n\nOutput\n\n\n-1\n\n\nInput\n\n\n5 7\n1 3 1 5 3\n\n\nOutput\n\n\n-1\n\n\nInput\n\n\n6 3\n8 9 4 17 11 5\n\n\nOutput\n\n\n3\n9 11 17 \n\n\nInput\n\n\n5 6\n2 2 2 2 2\n\n\nOutput\n\n\n4\n2 2 2 2 \n\nNote\n\nIn the first example, 1 × 2 × 4 × 11 × 13 = 1144, which is the largest product that ends with the digit 4. The same set of cards without the number 1 is also a valid answer, as well as a set of 8, 11, and 13 with or without 1 that also has the product of 1144.\n\nIn the second example, all the numbers on the cards are even and their product cannot end with an odd digit 1.\n\nIn the third example, the only possible products are 1, 3, 5, 9, 15, and 45, none of which end with the digit 7.\n\nIn the fourth example, 9 × 11 × 17 = 1683, which ends with the digit 3. \n\nIn the fifth example, 2 × 2 × 2 × 2 = 16, which ends with the digit 6."},"code":{"kind":"string","value":"import math;n, d = map(int, input().split());a = [int(_) for _ in input().split()];dp = [[-1e10] * 10 for _ in range(n + 1)]\ncome = [[(0, 0, 0) for i in range(10)] for j in range(n + 1)];dp[0][1] = 0\nfor i in range(n):\n for j in range(10):\n val = dp[i][j] + math.log(a[i])\n if dp[i + 1][(j * a[i]) % 10] <= val: dp[i + 1][(j * a[i]) % 10] = val; come[i + 1][(j * a[i]) % 10] = (i, j, 1)\n val = dp[i][j]\n if dp[i + 1][j] <= val: dp[i + 1][j] = val; come[i + 1][j] = (i, j, 0)\nnow = n;prod = 1;dig = d;soln = []\nwhile now > 0:\n if come[now][dig][2] == 1: soln.append(a[now - 1])\n now, dig = come[now][dig][:2]\nfor i in soln: prod = (prod * i) % 10\nif prod == d and len(soln) > 0: print(len(soln)); print(' '.join(map(str, soln)))\nelse: print(-1)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"5 7\\n1 3 1 5 3\\n\",\n \"6 4\\n4 11 8 2 1 13\\n\",\n \"6 3\\n8 9 4 17 11 5\\n\",\n \"5 6\\n2 2 2 2 2\\n\",\n \"3 1\\n2 4 6\\n\",\n \"10 9\\n6 4 1 6 4 9 2 2 10 5\\n\",\n \"10 7\\n5 10 4 3 8 10 6 1 6 2\\n\",\n \"8 2\\n65 77 69 91 4 5 79 52\\n\",\n \"3 8\\n2 9 108\\n\",\n \"10 2\\n9 4 6 3 10 6 6 4 10 2\\n\",\n \"10 1\\n9 6 8 5 5 2 8 9 2 2\\n\",\n \"1 0\\n847\\n\",\n \"10 5\\n10 7 5 8 8 8 10 5 7 3\\n\",\n \"10 0\\n4 1 6 4 4 7 10 3 10 3\\n\",\n \"5 6\\n3 13 3 23 2\\n\",\n \"6 2\\n32 80 94 67 60 40\\n\",\n \"10 6\\n5 7 2 1 5 3 8 2 3 2\\n\",\n \"10 3\\n6 10 3 2 7 9 10 4 7 6\\n\",\n \"10 8\\n9 10 1 2 7 10 8 7 8 6\\n\",\n \"10 4\\n6 3 1 4 4 4 2 9 9 9\\n\",\n \"8 0\\n65 77 69 91 4 5 79 52\\n\",\n \"10 1\\n9 4 6 3 10 6 6 4 10 2\\n\",\n \"10 1\\n9 6 10 5 5 2 8 9 2 2\\n\",\n \"10 5\\n10 7 5 4 8 8 10 5 7 3\\n\",\n \"10 0\\n4 1 6 4 4 7 10 3 10 6\\n\",\n \"5 6\\n3 8 3 23 2\\n\",\n \"10 3\\n6 14 3 2 7 9 10 4 7 6\\n\",\n \"10 8\\n9 10 1 2 7 10 14 7 8 6\\n\",\n \"10 4\\n6 3 1 6 4 4 2 9 9 9\\n\",\n \"8 0\\n8 77 69 91 4 5 79 52\\n\",\n \"5 6\\n3 8 3 21 2\\n\",\n \"10 8\\n9 10 1 2 7 8 14 7 8 6\\n\",\n \"10 1\\n1 14 3 2 7 9 10 4 7 6\\n\",\n \"10 8\\n9 10 1 2 7 8 14 7 8 9\\n\",\n \"10 8\\n9 10 1 2 7 6 14 7 8 9\\n\",\n \"10 6\\n9 10 1 2 7 6 14 7 8 9\\n\",\n \"10 6\\n14 10 1 2 7 6 14 7 8 9\\n\",\n \"10 6\\n14 10 1 2 12 6 14 7 8 9\\n\",\n \"10 6\\n14 10 1 2 12 6 25 7 8 9\\n\",\n \"10 6\\n14 10 2 2 12 6 25 7 8 9\\n\",\n \"8 2\\n65 77 69 91 4 5 9 52\\n\",\n \"3 6\\n2 9 108\\n\",\n \"10 2\\n9 4 6 5 10 6 6 4 10 2\\n\",\n \"10 0\\n9 6 8 5 5 2 8 9 2 2\\n\",\n \"10 5\\n10 14 5 8 8 8 10 5 7 3\\n\",\n \"5 8\\n3 13 3 23 2\\n\",\n \"10 3\\n6 10 3 2 7 16 10 4 7 6\\n\",\n \"10 8\\n9 10 1 2 7 10 8 7 4 6\\n\",\n \"10 4\\n6 3 1 4 3 4 2 9 9 9\\n\",\n \"6 3\\n10 9 4 17 11 5\\n\",\n \"5 6\\n2 2 2 2 1\\n\",\n \"8 0\\n65 131 69 91 4 5 79 52\\n\",\n \"10 1\\n9 4 6 3 10 11 6 4 10 2\\n\",\n \"10 0\\n4 1 6 4 6 7 10 3 10 6\\n\",\n \"10 4\\n10 3 1 6 4 4 2 9 9 9\\n\",\n \"8 0\\n8 48 69 91 4 5 79 52\\n\",\n \"5 6\\n3 8 3 6 2\\n\",\n \"10 8\\n9 10 1 1 7 8 14 7 8 6\\n\",\n \"8 0\\n8 77 69 25 4 3 79 52\\n\",\n \"8 0\\n8 118 69 91 4 3 79 10\\n\",\n \"8 0\\n8 118 69 5 4 3 79 52\\n\",\n \"10 6\\n14 10 1 2 7 6 14 7 8 3\\n\",\n \"5 7\\n2 7 4 2 2\\n\",\n \"8 2\\n65 77 108 91 4 5 9 52\\n\",\n \"10 0\\n9 6 4 5 5 2 8 9 2 2\\n\",\n \"6 3\\n10 3 4 17 11 5\\n\",\n \"8 0\\n65 131 26 91 4 5 79 52\\n\",\n \"8 0\\n8 48 69 112 4 5 79 52\\n\",\n \"10 8\\n9 10 1 1 7 8 14 7 8 3\\n\",\n \"8 0\\n8 139 69 25 4 3 79 52\\n\",\n \"8 0\\n8 118 69 91 7 3 79 10\\n\",\n \"8 0\\n8 118 69 5 4 3 79 23\\n\",\n \"10 6\\n14 10 1 2 7 6 14 7 13 3\\n\",\n \"10 6\\n14 20 1 2 12 6 21 7 8 9\\n\",\n \"10 6\\n14 10 2 1 12 6 25 7 8 13\\n\",\n \"8 2\\n65 77 108 91 4 5 15 52\\n\",\n \"10 0\\n9 6 4 5 5 2 15 9 2 2\\n\",\n \"5 8\\n5 20 3 23 2\\n\",\n \"5 8\\n2 3 1 4 3\\n\",\n \"6 3\\n10 3 4 17 11 9\\n\",\n \"8 0\\n69 131 26 91 4 5 79 52\\n\",\n \"6 4\\n8 17 4 17 22 6\\n\",\n \"8 0\\n2 48 69 112 4 5 79 52\\n\",\n \"10 8\\n9 10 1 1 7 8 14 7 6 3\\n\",\n \"8 0\\n8 139 69 25 4 5 79 52\\n\",\n \"8 0\\n8 169 69 91 7 3 79 10\\n\",\n \"8 0\\n8 118 69 5 4 3 78 23\\n\",\n \"10 6\\n14 20 1 2 12 5 21 7 8 9\\n\",\n \"10 6\\n14 10 2 1 12 6 25 13 8 13\\n\",\n \"10 0\\n9 4 4 5 5 2 15 9 2 2\\n\",\n \"5 8\\n2 4 1 4 3\\n\",\n \"8 0\\n1 48 69 112 4 5 79 52\\n\",\n \"8 0\\n16 139 69 25 4 5 79 52\\n\",\n \"8 0\\n8 169 69 91 7 6 79 10\\n\",\n \"8 0\\n8 118 69 5 4 3 78 7\\n\",\n \"10 6\\n14 21 1 2 12 5 21 7 8 9\\n\",\n \"10 6\\n1 10 2 1 12 6 25 13 8 13\\n\",\n \"10 0\\n9 4 4 5 2 2 15 9 2 2\\n\",\n \"8 0\\n1 48 69 112 4 5 149 52\\n\",\n \"10 8\\n9 5 1 1 3 8 14 7 6 3\\n\",\n \"8 0\\n8 12 69 25 4 5 79 52\\n\",\n \"8 1\\n8 169 69 91 7 6 79 10\\n\",\n \"8 0\\n8 118 107 5 4 3 78 7\\n\",\n \"10 6\\n14 8 1 2 12 5 21 7 8 9\\n\",\n \"10 6\\n1 10 2 1 12 6 25 13 8 11\\n\",\n \"10 0\\n9 4 4 5 2 2 15 3 2 2\\n\",\n \"8 0\\n1 48 69 112 4 5 97 52\\n\",\n \"5 7\\n1 3 9 4 4\\n\",\n \"8 0\\n8 12 69 25 4 5 79 85\\n\",\n \"8 1\\n8 118 107 5 4 3 78 7\\n\",\n \"10 6\\n14 8 1 2 12 5 40 7 8 9\\n\",\n \"10 2\\n9 4 6 3 10 20 8 4 10 2\\n\",\n \"8 0\\n1 48 69 112 6 5 97 52\\n\",\n \"8 0\\n8 12 69 37 4 5 79 85\\n\",\n \"10 6\\n2 10 2 1 12 6 25 13 9 11\\n\",\n \"8 1\\n8 12 69 37 4 5 79 85\\n\",\n \"10 7\\n2 10 2 1 12 6 25 13 9 11\\n\",\n \"10 2\\n9 4 6 3 10 20 8 4 5 3\\n\",\n \"10 2\\n9 2 6 3 10 20 8 4 5 3\\n\",\n \"8 1\\n1 4 69 36 4 5 79 101\\n\",\n \"10 9\\n6 4 1 6 5 9 2 2 10 5\\n\",\n \"3 8\\n2 13 108\\n\",\n \"10 5\\n10 7 5 8 11 8 10 5 7 3\\n\",\n \"10 0\\n4 1 6 4 4 7 10 3 1 3\\n\",\n \"5 6\\n3 24 3 23 2\\n\",\n \"6 2\\n32 73 94 67 60 40\\n\",\n \"6 4\\n4 11 12 2 1 13\\n\",\n \"8 0\\n65 78 69 91 4 5 79 52\\n\",\n \"10 5\\n10 7 5 4 3 8 10 5 7 3\\n\",\n \"10 0\\n4 1 6 4 4 7 10 6 10 6\\n\",\n \"5 6\\n3 8 3 32 2\\n\",\n \"10 8\\n9 10 1 3 7 10 14 7 8 6\\n\",\n \"10 8\\n12 10 1 2 7 8 14 7 8 6\\n\",\n \"8 0\\n8 90 69 91 4 3 79 52\\n\",\n \"10 1\\n1 14 3 2 7 9 10 4 4 6\\n\",\n \"10 8\\n9 10 1 2 7 8 13 7 8 9\\n\",\n \"10 9\\n9 10 1 2 7 6 14 7 8 9\\n\",\n \"10 4\\n14 10 1 2 7 6 14 7 8 9\\n\",\n \"10 6\\n14 10 1 2 4 6 14 7 8 9\\n\",\n \"10 6\\n14 10 2 2 17 6 25 7 8 9\\n\",\n \"5 7\\n1 1 1 5 3\\n\",\n \"6 3\\n8 17 4 17 11 5\\n\",\n \"5 7\\n2 2 2 2 2\\n\",\n \"3 1\\n3 4 6\\n\",\n \"10 1\\n9 6 10 5 5 2 8 9 2 4\\n\",\n \"10 3\\n1 14 3 2 7 9 10 4 7 6\\n\",\n \"6 3\\n8 17 4 17 14 5\\n\",\n \"5 7\\n2 3 2 2 2\\n\",\n \"8 0\\n8 77 69 91 4 3 79 52\\n\",\n \"10 1\\n9 6 10 5 5 2 8 16 2 4\\n\",\n \"2 3\\n8 17 4 17 14 5\\n\",\n \"5 7\\n2 1 2 2 2\\n\",\n \"8 0\\n8 118 69 91 4 3 79 52\\n\",\n \"10 1\\n9 6 10 5 5 4 8 16 2 4\\n\",\n \"5 7\\n2 4 2 2 2\\n\",\n \"8 0\\n8 118 69 8 4 3 79 52\\n\",\n \"5 7\\n2 4 4 2 2\\n\",\n \"8 0\\n8 118 69 9 4 3 79 52\\n\",\n \"5 7\\n2 5 4 2 2\\n\",\n \"10 7\\n5 10 4 4 8 10 6 1 6 2\\n\",\n \"5 7\\n1 3 1 4 3\\n\",\n \"10 1\\n9 6 5 5 5 2 8 9 2 2\\n\",\n \"10 5\\n10 2 5 4 8 8 10 5 7 3\\n\",\n \"5 3\\n1 1 1 5 3\\n\",\n \"6 3\\n8 17 4 17 22 5\\n\",\n \"5 7\\n2 2 2 1 2\\n\",\n \"3 1\\n3 4 2\\n\",\n \"10 1\\n9 6 2 5 5 2 8 9 2 4\\n\",\n \"10 3\\n1 14 3 2 7 9 8 4 7 6\\n\",\n \"6 3\\n8 17 8 17 14 5\\n\",\n \"5 7\\n2 3 3 2 2\\n\",\n \"2 1\\n9 6 10 5 5 2 8 16 2 4\\n\",\n \"10 1\\n1 14 3 2 7 9 10 4 7 10\\n\",\n \"5 7\\n1 4 2 2 2\\n\",\n \"5 0\\n8 118 69 8 4 3 79 52\\n\",\n \"5 7\\n2 4 4 2 4\\n\",\n \"10 6\\n14 20 1 2 12 6 25 7 8 9\\n\",\n \"10 6\\n14 10 2 1 12 6 25 7 8 9\\n\",\n \"3 6\\n2 18 108\\n\",\n \"5 8\\n5 13 3 23 2\\n\",\n \"10 0\\n6 3 1 4 3 4 2 9 9 9\\n\",\n \"5 7\\n2 3 1 4 3\\n\",\n \"10 1\\n9 4 6 3 10 11 4 4 10 2\\n\",\n \"10 1\\n9 6 5 5 5 3 8 9 2 2\\n\",\n \"5 3\\n1 1 2 5 3\\n\",\n \"6 3\\n8 17 4 17 22 6\\n\",\n \"5 7\\n3 2 2 1 2\\n\",\n \"3 1\\n4 4 2\\n\",\n \"10 1\\n9 6 3 5 5 2 8 9 2 4\\n\",\n \"5 5\\n3 8 3 6 2\\n\",\n \"10 3\\n1 14 3 2 7 9 8 4 7 3\\n\",\n \"6 3\\n8 17 8 17 14 4\\n\",\n \"5 7\\n2 3 3 4 2\\n\",\n \"2 1\\n15 6 10 5 5 2 8 16 2 4\\n\",\n \"10 1\\n2 14 3 2 7 9 10 4 7 10\\n\",\n \"5 7\\n1 4 2 1 2\\n\",\n \"5 0\\n8 118 69 8 4 3 102 52\\n\",\n \"5 7\\n2 4 8 2 4\\n\",\n \"5 7\\n4 7 4 2 2\\n\",\n \"3 6\\n2 1 108\\n\",\n \"10 1\\n9 4 6 3 15 11 4 4 10 2\\n\",\n \"5 7\\n4 2 2 1 2\\n\",\n \"5 5\\n3 8 3 11 2\\n\",\n \"10 3\\n1 14 3 1 7 9 8 4 7 3\\n\",\n \"6 3\\n8 17 8 17 14 1\\n\",\n \"5 7\\n2 3 5 4 2\\n\",\n \"5 0\\n8 118 69 8 4 3 102 51\\n\",\n \"5 7\\n2 4 8 4 4\\n\",\n \"5 7\\n4 7 4 2 3\\n\",\n \"8 2\\n65 77 108 91 4 3 15 52\\n\",\n \"10 1\\n9 4 6 3 15 11 8 4 10 2\\n\",\n \"5 5\\n2 8 3 11 2\\n\",\n \"10 8\\n9 5 1 1 7 8 14 7 6 3\\n\",\n \"6 3\\n8 17 8 17 18 1\\n\",\n \"5 7\\n2 3 5 4 4\\n\",\n \"5 7\\n2 8 8 4 4\\n\",\n \"5 7\\n1 7 4 2 3\\n\",\n \"8 2\\n65 77 108 91 4 10 15 52\\n\",\n \"10 1\\n9 4 6 3 10 11 8 4 10 2\\n\",\n \"6 3\\n8 17 8 31 18 1\\n\"\n ],\n \"output\": [\n \"\\n-1\\n\",\n \"\\n5\\n1 2 4 11 13 \\n\",\n \"\\n3\\n9 11 17 \\n\",\n \"\\n4\\n2 2 2 2 \\n\",\n \"\\n-1\\n\",\n \"2\\n1 9 \\n\",\n \"-1\\n\",\n \"4\\n52 69 79 91 \\n\",\n \"1\\n108 \\n\",\n \"7\\n3 4 4 6 6 6 9 \\n\",\n \"2\\n9 9 \\n\",\n \"-1\\n\",\n \"5\\n3 5 5 7 7 \\n\",\n \"10\\n1 3 3 4 4 4 6 7 10 10 \\n\",\n \"2\\n2 23 \\n\",\n \"1\\n32 \\n\",\n \"7\\n1 2 2 3 3 7 8 \\n\",\n \"4\\n3 7 7 9 \\n\",\n \"8\\n1 2 6 7 7 8 8 9 \\n\",\n \"9\\n1 2 3 4 4 6 9 9 9 \\n\",\n \"8\\n52 79 5 4 91 69 77 65\\n\",\n \"-1\\n\",\n \"2\\n9 9\\n\",\n \"5\\n3 7 5 5 7\\n\",\n \"9\\n6 10 3 10 7 4 4 6 4\\n\",\n \"4\\n23 3 8 3\\n\",\n \"4\\n7 9 7 3\\n\",\n \"6\\n6 7 14 7 2 9\\n\",\n \"9\\n9 9 9 2 4 4 6 3 6\\n\",\n \"8\\n52 79 5 4 91 69 77 8\\n\",\n \"3\\n2 21 8\\n\",\n \"7\\n6 8 7 14 8 7 2\\n\",\n \"3\\n7 9 7\\n\",\n \"8\\n9 8 7 14 8 7 2 9\\n\",\n \"7\\n9 8 7 14 6 7 9\\n\",\n \"8\\n9 8 7 14 6 7 2 9\\n\",\n \"8\\n9 8 7 14 6 7 2 14\\n\",\n \"8\\n9 8 7 14 6 12 2 14\\n\",\n \"6\\n8 7 6 12 2 14\\n\",\n \"7\\n9 7 6 12 2 2 14\\n\",\n \"4\\n52 9 91 69\\n\",\n \"2\\n108 2\\n\",\n \"6\\n2 6 6 6 4 9\\n\",\n \"10\\n2 2 9 8 2 5 5 8 6 9\\n\",\n \"4\\n3 7 5 5\\n\",\n \"3\\n2 23 13\\n\",\n \"1\\n3\\n\",\n \"5\\n6 7 8 7 9\\n\",\n \"8\\n9 9 9 2 4 4 3 6\\n\",\n \"3\\n11 17 9\\n\",\n \"4\\n2 2 2 2\\n\",\n \"8\\n52 79 5 4 91 69 131 65\\n\",\n \"1\\n11\\n\",\n \"9\\n6 10 3 10 7 6 4 6 4\\n\",\n \"8\\n9 9 9 2 4 4 6 3\\n\",\n \"8\\n52 79 5 4 91 69 48 8\\n\",\n \"3\\n2 6 8\\n\",\n \"6\\n6 8 14 8 7 9\\n\",\n \"8\\n52 79 3 4 25 69 77 8\\n\",\n \"8\\n10 79 3 4 91 69 118 8\\n\",\n \"8\\n52 79 3 4 5 69 118 8\\n\",\n \"7\\n3 8 7 14 6 7 14\\n\",\n \"1\\n7\\n\",\n \"6\\n52 9 4 91 108 77\\n\",\n \"10\\n2 2 9 8 2 5 5 4 6 9\\n\",\n \"2\\n11 3\\n\",\n \"8\\n52 79 5 4 91 26 131 65\\n\",\n \"8\\n52 79 5 4 112 69 48 8\\n\",\n \"7\\n3 8 7 14 8 7 9\\n\",\n \"8\\n52 79 3 4 25 69 139 8\\n\",\n \"8\\n10 79 3 7 91 69 118 8\\n\",\n \"8\\n23 79 3 4 5 69 118 8\\n\",\n \"7\\n3 13 7 14 6 7 14\\n\",\n \"7\\n8 7 21 6 12 2 14\\n\",\n \"6\\n13 7 6 12 2 14\\n\",\n \"4\\n52 91 108 77\\n\",\n \"10\\n2 2 9 15 2 5 5 4 6 9\\n\",\n \"3\\n2 23 3\\n\",\n \"3\\n3 3 2\\n\",\n \"3\\n9 11 17\\n\",\n \"8\\n52 79 5 4 91 26 131 69\\n\",\n \"5\\n6 22 17 17 8\\n\",\n \"8\\n52 79 5 4 112 69 48 2\\n\",\n \"6\\n3 6 14 8 7 9\\n\",\n \"8\\n52 79 5 4 25 69 139 8\\n\",\n \"8\\n10 79 3 7 91 69 169 8\\n\",\n \"8\\n23 78 3 4 5 69 118 8\\n\",\n \"6\\n8 7 21 12 2 14\\n\",\n \"6\\n13 8 13 6 12 14\\n\",\n \"10\\n2 2 9 15 2 5 5 4 4 9\\n\",\n \"3\\n3 4 4\\n\",\n \"7\\n52 79 5 4 112 69 48\\n\",\n \"8\\n52 79 5 4 25 69 139 16\\n\",\n \"8\\n10 79 6 7 91 69 169 8\\n\",\n \"8\\n7 78 3 4 5 69 118 8\\n\",\n \"7\\n8 7 21 12 2 21 14\\n\",\n \"5\\n13 13 6 12 2\\n\",\n \"10\\n2 2 9 15 2 2 5 4 4 9\\n\",\n \"7\\n52 149 5 4 112 69 48\\n\",\n \"6\\n6 7 14 8 3 9\\n\",\n \"8\\n52 79 5 4 25 69 12 8\\n\",\n \"3\\n79 91 169\\n\",\n \"8\\n7 78 3 4 5 107 118 8\\n\",\n \"7\\n9 8 7 21 12 8 14\\n\",\n \"6\\n11 8 13 6 12 2\\n\",\n \"10\\n2 2 3 15 2 2 5 4 4 9\\n\",\n \"7\\n52 97 5 4 112 69 48\\n\",\n \"2\\n9 3\\n\",\n \"8\\n85 79 5 4 25 69 12 8\\n\",\n \"2\\n3 107\\n\",\n \"6\\n9 8 7 12 8 14\\n\",\n \"7\\n2 4 8 3 6 4 9\\n\",\n \"7\\n52 97 5 6 112 69 48\\n\",\n \"8\\n85 79 5 4 37 69 12 8\\n\",\n \"7\\n11 9 13 6 12 2 2\\n\",\n \"2\\n79 69\\n\",\n \"3\\n11 9 13\\n\",\n \"6\\n3 8 3 6 4 9\\n\",\n \"6\\n3 4 8 3 6 9\\n\",\n \"3\\n101 79 69\\n\",\n \"1\\n9\\n\",\n \"3\\n108 13 2\\n\",\n \"6\\n3 7 5 11 5 7\\n\",\n \"8\\n3 3 10 7 4 4 6 4\\n\",\n \"5\\n2 23 3 24 3\\n\",\n \"3\\n67 73 32\\n\",\n \"4\\n13 12 11 4\\n\",\n \"8\\n52 79 5 4 91 69 78 65\\n\",\n \"6\\n3 7 5 3 5 7\\n\",\n \"9\\n6 10 6 10 7 4 4 6 4\\n\",\n \"4\\n2 32 8 3\\n\",\n \"6\\n6 8 14 7 3 9\\n\",\n \"7\\n6 8 7 14 8 7 12\\n\",\n \"8\\n52 79 3 4 91 69 90 8\\n\",\n \"2\\n7 3\\n\",\n \"7\\n9 8 7 13 8 7 9\\n\",\n \"4\\n9 7 7 9\\n\",\n \"7\\n8 7 14 6 7 2 14\\n\",\n \"7\\n9 8 7 14 6 4 14\\n\",\n \"7\\n9 7 6 17 2 2 14\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"2\\n9 9\\n\",\n \"4\\n7 9 7 3\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"2\\n9 9\\n\",\n \"4\\n3 7 5 5\\n\",\n \"1\\n3\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"2\\n9 9\\n\",\n \"4\\n7 9 7 3\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"3\\n7 9 7\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"6\\n8 7 6 12 2 14\\n\",\n \"6\\n8 7 6 12 2 14\\n\",\n \"2\\n108 2\\n\",\n \"3\\n2 23 13\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"1\\n11\\n\",\n \"2\\n9 9\\n\",\n \"1\\n3\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"2\\n9 9\\n\",\n \"-1\\n\",\n \"4\\n7 9 7 3\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"3\\n7 9 7\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"1\\n7\\n\",\n \"2\\n108 2\\n\",\n \"1\\n11\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"4\\n7 9 7 3\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"1\\n7\\n\",\n \"4\\n52 91 108 77\\n\",\n \"1\\n11\\n\",\n \"-1\\n\",\n \"6\\n3 6 14 8 7 9\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"1\\n7\\n\",\n \"4\\n52 91 108 77\\n\",\n \"1\\n11\\n\",\n \"-1\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nDiana loves playing with numbers. She's got n cards with positive integer numbers a_i written on them. She spends her free time multiplying the numbers on the cards. She picks a non-empty subset of the cards and multiplies all the numbers a_i written on them.\n\nDiana is happy when the product of the numbers ends with her favorite digit d. Now she is curious what cards she should pick so that the product of the numbers on them is the largest possible and the last decimal digit of the product is d. Please, help her.\n\nInput\n\nThe first line contains the integers n and d (1≤ n≤ 10^5, 0≤ d≤ 9). The second line contains n integers a_i (1≤ a_i≤ 1000). \n\nOutput\n\nOn the first line, print the number of chosen cards k (1≤ k≤ n). On the next line, print the numbers written on the chosen cards in any order. \n\nIf it is impossible to choose a subset of cards with the product that ends with the digit d, print the single line with -1.\n\nExamples\n\nInput\n\n\n6 4\n4 11 8 2 1 13\n\n\nOutput\n\n\n5\n1 2 4 11 13 \n\n\nInput\n\n\n3 1\n2 4 6\n\n\nOutput\n\n\n-1\n\n\nInput\n\n\n5 7\n1 3 1 5 3\n\n\nOutput\n\n\n-1\n\n\nInput\n\n\n6 3\n8 9 4 17 11 5\n\n\nOutput\n\n\n3\n9 11 17 \n\n\nInput\n\n\n5 6\n2 2 2 2 2\n\n\nOutput\n\n\n4\n2 2 2 2 \n\nNote\n\nIn the first example, 1 × 2 × 4 × 11 × 13 = 1144, which is the largest product that ends with the digit 4. The same set of cards without the number 1 is also a valid answer, as well as a set of 8, 11, and 13 with or without 1 that also has the product of 1144.\n\nIn the second example, all the numbers on the cards are even and their product cannot end with an odd digit 1.\n\nIn the third example, the only possible products are 1, 3, 5, 9, 15, and 45, none of which end with the digit 7.\n\nIn the fourth example, 9 × 11 × 17 = 1683, which ends with the digit 3. \n\nIn the fifth example, 2 × 2 × 2 × 2 = 16, which ends with the digit 6.\n\n### Input:\n5 7\n1 3 1 5 3\n\n### Output:\n\n-1\n\n\n### Input:\n6 4\n4 11 8 2 1 13\n\n### Output:\n\n5\n1 2 4 11 13 \n\n\n### Code:\nimport math;n, d = map(int, input().split());a = [int(_) for _ in input().split()];dp = [[-1e10] * 10 for _ in range(n + 1)]\ncome = [[(0, 0, 0) for i in range(10)] for j in range(n + 1)];dp[0][1] = 0\nfor i in range(n):\n for j in range(10):\n val = dp[i][j] + math.log(a[i])\n if dp[i + 1][(j * a[i]) % 10] <= val: dp[i + 1][(j * a[i]) % 10] = val; come[i + 1][(j * a[i]) % 10] = (i, j, 1)\n val = dp[i][j]\n if dp[i + 1][j] <= val: dp[i + 1][j] = val; come[i + 1][j] = (i, j, 0)\nnow = n;prod = 1;dig = d;soln = []\nwhile now > 0:\n if come[now][dig][2] == 1: soln.append(a[now - 1])\n now, dig = come[now][dig][:2]\nfor i in soln: prod = (prod * i) % 10\nif prod == d and len(soln) > 0: print(len(soln)); print(' '.join(map(str, soln)))\nelse: print(-1)"}}},{"rowIdx":5675,"cells":{"id":{"kind":"string","value":"1536_F. Omkar and Akmar_26781"},"description":{"kind":"string","value":"Omkar and Akmar are playing a game on a circular board with n (2 ≤ n ≤ 10^6) cells. The cells are numbered from 1 to n so that for each i (1 ≤ i ≤ n-1) cell i is adjacent to cell i+1 and cell 1 is adjacent to cell n. Initially, each cell is empty.\n\nOmkar and Akmar take turns placing either an A or a B on the board, with Akmar going first. The letter must be placed on an empty cell. In addition, the letter cannot be placed adjacent to a cell containing the same letter. \n\nA player loses when it is their turn and there are no more valid moves.\n\nOutput the number of possible distinct games where both players play optimally modulo 10^9+7. Note that we only consider games where some player has lost and there are no more valid moves.\n\nTwo games are considered distinct if the number of turns is different or for some turn, the letter or cell number that the letter is placed on were different.\n\nA move is considered optimal if the move maximizes the player's chance of winning, assuming the other player plays optimally as well. More formally, if the player who has to move has a winning strategy, they have to make a move after which they will still have a winning strategy. If they do not, they can make any move.\n\nInput\n\nThe only line will contain an integer n (2 ≤ n ≤ 10^6) — the number of cells on the board.\n\nOutput\n\nOutput a single integer — the number of possible distinct games where both players play optimally modulo 10^9+7.\n\nExamples\n\nInput\n\n\n2\n\n\nOutput\n\n\n4\n\n\nInput\n\n\n69420\n\n\nOutput\n\n\n629909355\n\n\nInput\n\n\n42069\n\n\nOutput\n\n\n675837193\n\nNote\n\nFor the first sample case, the first player has 4 possible moves. No matter what the first player plays, the second player only has 1 possible move, so there are 4 possible games."},"code":{"kind":"string","value":"import sys\ninput = sys.stdin.readline\n\nn = int(input())\nmod = 10 ** 9 + 7\nF = [0] * (n + 1)\nF[0] = 1\nfor i in range(1, n + 1):\n F[i] = i * F[i - 1] % mod\niF = [0] * (n + 1)\niF[-1] = pow(F[-1], mod - 2, mod)\nfor i in range(n - 1, -1, -1):\n iF[i] = iF[i + 1] * (i + 1) % mod\n\ndef C(n, k):\n if k > n: return 0\n return F[n] * iF[n - k] * iF[k] % mod\n\nans = 0\nfor x in range((n + 1) // 2, n + 1):\n if x % 2: continue\n if x < n: cur = (C(x, n - x) + C(x - 1, n - x - 1)) % mod\n else: cur = 1\n cur = (cur * 2 * F[x]) % mod\n ans = (ans + cur) % mod\nprint(ans)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"69420\\n\",\n \"42069\\n\",\n \"2\\n\",\n \"24\\n\",\n \"38\\n\",\n \"999993\\n\",\n \"31\\n\",\n \"999989\\n\",\n \"27\\n\",\n \"46\\n\",\n \"999972\\n\",\n \"5\\n\",\n \"41\\n\",\n \"999996\\n\",\n \"999994\\n\",\n \"19\\n\",\n \"999975\\n\",\n \"35\\n\",\n \"4\\n\",\n \"33\\n\",\n \"23\\n\",\n \"45\\n\",\n \"37\\n\",\n \"18\\n\",\n \"32\\n\",\n \"999985\\n\",\n \"43\\n\",\n \"42\\n\",\n \"999978\\n\",\n \"34\\n\",\n \"999991\\n\",\n \"999981\\n\",\n \"999999\\n\",\n \"7\\n\",\n \"999983\\n\",\n \"1000000\\n\",\n \"999980\\n\",\n \"50\\n\",\n \"48\\n\",\n \"999970\\n\",\n \"9\\n\",\n \"30\\n\",\n \"17\\n\",\n \"11\\n\",\n \"16\\n\",\n \"999979\\n\",\n \"999998\\n\",\n \"999977\\n\",\n \"999995\\n\",\n \"999987\\n\",\n \"25\\n\",\n \"26\\n\",\n \"999973\\n\",\n \"49\\n\",\n \"999974\\n\",\n \"21\\n\",\n \"3\\n\",\n \"2641\\n\",\n \"77383\\n\",\n \"999976\\n\",\n \"743\\n\",\n \"999990\\n\",\n \"22\\n\",\n \"36\\n\",\n \"14\\n\",\n \"6\\n\",\n \"12\\n\",\n \"999992\\n\",\n \"20\\n\",\n \"40\\n\",\n \"10\\n\",\n \"999971\\n\",\n \"15\\n\",\n \"999986\\n\",\n \"999988\\n\",\n \"999982\\n\",\n \"29\\n\",\n \"999984\\n\",\n \"44\\n\",\n \"39\\n\",\n \"230085\\n\",\n \"13\\n\",\n \"8\\n\",\n \"28\\n\",\n \"47\\n\",\n \"999997\\n\",\n \"247484\\n\",\n \"68\\n\",\n \"86\\n\",\n \"55\\n\",\n \"72\\n\",\n \"52\\n\",\n \"65\\n\",\n \"114\\n\",\n \"73\\n\",\n \"61\\n\",\n \"59\\n\",\n \"824703\\n\",\n \"75\\n\",\n \"67\\n\",\n \"58\\n\",\n \"56\\n\",\n \"57\\n\",\n \"656209\\n\",\n \"331789\\n\",\n \"94\\n\",\n \"376628\\n\",\n \"104\\n\",\n \"79\\n\",\n \"3253\\n\",\n \"100061\\n\",\n \"779\\n\",\n \"402894\\n\",\n \"51\\n\",\n \"53\\n\",\n \"92\\n\",\n \"706441\\n\",\n \"122\\n\",\n \"424813\\n\",\n \"49725\\n\",\n \"91\\n\",\n \"406902\\n\",\n \"116\\n\",\n \"343651\\n\",\n \"89\\n\",\n \"13639\\n\",\n \"46825\\n\",\n \"70\\n\",\n \"368075\\n\",\n \"54\\n\",\n \"109\\n\",\n \"82\\n\",\n \"83\\n\",\n \"71\\n\",\n \"219\\n\",\n \"133\\n\",\n \"62284\\n\",\n \"110\\n\",\n \"90\\n\",\n \"62\\n\",\n \"81\\n\",\n \"389336\\n\",\n \"180\\n\",\n \"141475\\n\",\n \"112\\n\",\n \"139\\n\",\n \"412\\n\",\n \"110787\\n\",\n \"121\\n\",\n \"800879\\n\",\n \"63\\n\",\n \"87\\n\",\n \"95499\\n\",\n \"432\\n\",\n \"18356\\n\",\n \"78536\\n\",\n \"66\\n\",\n \"628052\\n\",\n \"97\\n\",\n \"200013\\n\",\n \"17419\\n\",\n \"16046\\n\",\n \"423895\\n\",\n \"80\\n\",\n \"113\\n\",\n \"126\\n\",\n \"154\\n\",\n \"266\\n\",\n \"37333\\n\",\n \"100\\n\",\n \"134\\n\",\n \"101\\n\",\n \"84\\n\",\n \"574159\\n\",\n \"238\\n\",\n \"41642\\n\",\n \"76\\n\",\n \"220\\n\",\n \"728\\n\",\n \"19034\\n\",\n \"189\\n\",\n \"478564\\n\",\n \"223\\n\",\n \"98\\n\",\n \"13051\\n\",\n \"407\\n\",\n \"526\\n\",\n \"42636\\n\",\n \"131\\n\",\n \"676203\\n\",\n \"2278\\n\",\n \"25840\\n\",\n \"3783\\n\",\n \"142843\\n\",\n \"147\\n\",\n \"192\\n\",\n \"159\\n\",\n \"213\\n\",\n \"77\\n\",\n \"70485\\n\",\n \"111\\n\",\n \"74\\n\",\n \"869536\\n\",\n \"198\\n\",\n \"13319\\n\",\n \"144\\n\",\n \"117\\n\",\n \"685\\n\",\n \"2387\\n\",\n \"312\\n\",\n \"447283\\n\",\n \"132\\n\",\n \"151\\n\",\n \"9016\\n\",\n \"64\\n\",\n \"463\\n\",\n \"83218\\n\",\n \"195\\n\",\n \"849960\\n\",\n \"4111\\n\",\n \"38195\\n\",\n \"4062\\n\",\n \"28304\\n\",\n \"99\\n\",\n \"177\\n\",\n \"197\\n\",\n \"99243\\n\",\n \"246\\n\",\n \"24276\\n\",\n \"96\\n\",\n \"4028\\n\",\n \"382\\n\",\n \"442962\\n\",\n \"8181\\n\",\n \"88\\n\",\n \"92002\\n\",\n \"193\\n\",\n \"272027\\n\",\n \"7090\\n\",\n \"48762\\n\",\n \"5146\\n\",\n \"15307\\n\",\n \"296\\n\",\n \"334\\n\",\n \"10737\\n\",\n \"240\\n\",\n \"1975\\n\",\n \"175\\n\",\n \"4311\\n\",\n \"169\\n\",\n \"635544\\n\",\n \"6495\\n\",\n \"150\\n\",\n \"79477\\n\",\n \"360\\n\",\n \"498476\\n\",\n \"13838\\n\",\n \"11805\\n\",\n \"5006\\n\",\n \"23458\\n\",\n \"226\\n\",\n \"349\\n\",\n \"17387\\n\",\n \"251\\n\",\n \"1898\\n\",\n \"7237\\n\",\n \"164671\\n\",\n \"490968\\n\",\n \"345688\\n\",\n \"78\\n\",\n \"16905\\n\",\n \"81889\\n\",\n \"903905\\n\",\n \"927714\\n\",\n \"19290\\n\",\n \"828862\\n\",\n \"934407\\n\",\n \"12936\\n\",\n \"330939\\n\",\n \"105\\n\",\n \"3834\\n\",\n \"12430\\n\",\n \"532\\n\",\n \"67785\\n\",\n \"85\\n\",\n \"93\\n\"\n ],\n \"output\": [\n \"\\n629909355\\n\",\n \"\\n675837193\\n\",\n \"\\n4\\n\",\n \"12946230\\n\",\n \"892756833\\n\",\n \"111654003\\n\",\n \"106978067\\n\",\n \"612908369\\n\",\n \"279383374\\n\",\n \"716816138\\n\",\n \"305611803\\n\",\n \"240\\n\",\n \"139735074\\n\",\n \"864247083\\n\",\n \"529477162\\n\",\n \"775844941\\n\",\n \"224922893\\n\",\n \"3683532\\n\",\n \"56\\n\",\n \"472134860\\n\",\n \"132914806\\n\",\n \"666129974\\n\",\n \"414301576\\n\",\n \"852308225\\n\",\n \"745085284\\n\",\n \"881852047\\n\",\n \"869089865\\n\",\n \"739858643\\n\",\n \"412436207\\n\",\n \"778099123\\n\",\n \"107776898\\n\",\n \"833874506\\n\",\n \"791711076\\n\",\n \"10416\\n\",\n \"557546394\\n\",\n \"948343669\\n\",\n \"337827492\\n\",\n \"805117239\\n\",\n \"170828572\\n\",\n \"697909883\\n\",\n \"768960\\n\",\n \"143214023\\n\",\n \"820226988\\n\",\n \"86058720\\n\",\n \"384748189\\n\",\n \"971572849\\n\",\n \"964678024\\n\",\n \"807608635\\n\",\n \"647990990\\n\",\n \"982073496\\n\",\n \"326058859\\n\",\n \"197638215\\n\",\n \"1828565\\n\",\n \"463987191\\n\",\n \"434598597\\n\",\n \"208615006\\n\",\n \"12\\n\",\n \"550295469\\n\",\n \"378161062\\n\",\n \"160072832\\n\",\n \"154603384\\n\",\n \"714599400\\n\",\n \"299907026\\n\",\n \"866363296\\n\",\n \"260512810\\n\",\n \"1872\\n\",\n \"358383673\\n\",\n \"708722528\\n\",\n \"426941700\\n\",\n \"587462880\\n\",\n \"10116000\\n\",\n \"553569031\\n\",\n \"544178233\\n\",\n \"196772380\\n\",\n \"933281278\\n\",\n \"3913501\\n\",\n \"510213586\\n\",\n \"996328150\\n\",\n \"241155923\\n\",\n \"453222669\\n\",\n \"358634501\\n\",\n \"593565349\\n\",\n \"109536\\n\",\n \"323485765\\n\",\n \"415961880\\n\",\n \"88425329\\n\",\n \"231015474\",\n \"352985665\",\n \"318418270\",\n \"166801565\",\n \"553927222\",\n \"673232645\",\n \"686251137\",\n \"916498769\",\n \"498145542\",\n \"485917613\",\n \"503831978\",\n \"89954065\",\n \"729566194\",\n \"622247305\",\n \"570993165\",\n \"460343168\",\n \"781248005\",\n \"259116564\",\n \"420466657\",\n \"693446168\",\n \"912026825\",\n \"202102451\",\n \"577101856\",\n \"772986593\",\n \"138588610\",\n \"637884983\",\n \"810395936\",\n \"411938193\",\n \"690336368\",\n \"720282232\",\n \"269309986\",\n \"439071769\",\n \"951859937\",\n \"705849829\",\n \"303968648\",\n \"908656747\",\n \"791749818\",\n \"195812207\",\n \"926544315\",\n \"798014587\",\n \"25964193\",\n \"550438432\",\n \"824813969\",\n \"332334008\",\n \"129906070\",\n \"510978518\",\n \"51804994\",\n \"561400326\",\n \"202765806\",\n \"559319537\",\n \"65328358\",\n \"813091147\",\n \"573536414\",\n \"574258920\",\n \"999399831\",\n \"567861959\",\n \"443236917\",\n \"991339259\",\n \"311853688\",\n \"614578578\",\n \"498165368\",\n \"219656654\",\n \"202352204\",\n \"257746582\",\n \"11526466\",\n \"757258949\",\n \"734201249\",\n \"571817656\",\n \"549845778\",\n \"701812246\",\n \"878690353\",\n \"303574946\",\n \"688989860\",\n \"816295656\",\n \"770064874\",\n \"456620163\",\n \"351249114\",\n \"474375493\",\n \"173883104\",\n \"741221040\",\n \"972967474\",\n \"224163798\",\n \"224043503\",\n \"418894687\",\n \"996162887\",\n \"295974697\",\n \"212040546\",\n \"579178103\",\n \"745367274\",\n \"921158175\",\n \"150032582\",\n \"807155810\",\n \"350459236\",\n \"520135633\",\n \"407047056\",\n \"155317882\",\n \"656403957\",\n \"903648319\",\n \"273393604\",\n \"263025440\",\n \"289640354\",\n \"263120197\",\n \"342447211\",\n \"28167388\",\n \"202206247\",\n \"291446144\",\n \"703995550\",\n \"111758561\",\n \"165494499\",\n \"943139522\",\n \"446956699\",\n \"119035220\",\n \"199528015\",\n \"669732361\",\n \"440119032\",\n \"205683386\",\n \"154631842\",\n \"123225468\",\n \"198148699\",\n \"88633517\",\n \"466640580\",\n \"857738132\",\n \"196581619\",\n \"134104898\",\n \"988323\",\n \"646899985\",\n \"491011279\",\n \"646669810\",\n \"630476053\",\n \"22482809\",\n \"551967231\",\n \"865013214\",\n \"551292878\",\n \"228095575\",\n \"267720332\",\n \"891441872\",\n \"312417361\",\n \"873219845\",\n \"517394637\",\n \"826974456\",\n \"69254027\",\n \"769019175\",\n \"332701627\",\n \"284820723\",\n \"608342155\",\n \"894022967\",\n \"310948659\",\n \"389156923\",\n \"757128930\",\n \"344593544\",\n \"912036328\",\n \"909916088\",\n \"570255065\",\n \"412555521\",\n \"562948036\",\n \"771915535\",\n \"384058618\",\n \"889048253\",\n \"814856283\",\n \"751156407\",\n \"174594542\",\n \"736389798\",\n \"339540336\",\n \"875891199\",\n \"941288245\",\n \"113931958\",\n \"406548620\",\n \"636857895\",\n \"274225127\",\n \"32253511\",\n \"244311432\",\n \"853140072\",\n \"759832969\",\n \"80767628\",\n \"40918811\",\n \"108717057\",\n \"424558021\",\n \"989217254\",\n \"475245802\",\n \"95094398\",\n \"833954564\",\n \"254351413\",\n \"612884887\",\n \"665414064\",\n \"230962117\",\n \"341377606\",\n \"456029962\",\n \"110047982\",\n \"158331520\",\n \"210679570\",\n \"702681529\",\n \"974490611\",\n \"536875919\",\n \"954457210\",\n \"296632886\",\n \"229149675\",\n \"740660297\",\n \"718711892\",\n \"839048650\",\n \"573222091\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nOmkar and Akmar are playing a game on a circular board with n (2 ≤ n ≤ 10^6) cells. The cells are numbered from 1 to n so that for each i (1 ≤ i ≤ n-1) cell i is adjacent to cell i+1 and cell 1 is adjacent to cell n. Initially, each cell is empty.\n\nOmkar and Akmar take turns placing either an A or a B on the board, with Akmar going first. The letter must be placed on an empty cell. In addition, the letter cannot be placed adjacent to a cell containing the same letter. \n\nA player loses when it is their turn and there are no more valid moves.\n\nOutput the number of possible distinct games where both players play optimally modulo 10^9+7. Note that we only consider games where some player has lost and there are no more valid moves.\n\nTwo games are considered distinct if the number of turns is different or for some turn, the letter or cell number that the letter is placed on were different.\n\nA move is considered optimal if the move maximizes the player's chance of winning, assuming the other player plays optimally as well. More formally, if the player who has to move has a winning strategy, they have to make a move after which they will still have a winning strategy. If they do not, they can make any move.\n\nInput\n\nThe only line will contain an integer n (2 ≤ n ≤ 10^6) — the number of cells on the board.\n\nOutput\n\nOutput a single integer — the number of possible distinct games where both players play optimally modulo 10^9+7.\n\nExamples\n\nInput\n\n\n2\n\n\nOutput\n\n\n4\n\n\nInput\n\n\n69420\n\n\nOutput\n\n\n629909355\n\n\nInput\n\n\n42069\n\n\nOutput\n\n\n675837193\n\nNote\n\nFor the first sample case, the first player has 4 possible moves. No matter what the first player plays, the second player only has 1 possible move, so there are 4 possible games.\n\n### Input:\n69420\n\n### Output:\n\n629909355\n\n\n### Input:\n42069\n\n### Output:\n\n675837193\n\n\n### Code:\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\nmod = 10 ** 9 + 7\nF = [0] * (n + 1)\nF[0] = 1\nfor i in range(1, n + 1):\n F[i] = i * F[i - 1] % mod\niF = [0] * (n + 1)\niF[-1] = pow(F[-1], mod - 2, mod)\nfor i in range(n - 1, -1, -1):\n iF[i] = iF[i + 1] * (i + 1) % mod\n\ndef C(n, k):\n if k > n: return 0\n return F[n] * iF[n - k] * iF[k] % mod\n\nans = 0\nfor x in range((n + 1) // 2, n + 1):\n if x % 2: continue\n if x < n: cur = (C(x, n - x) + C(x - 1, n - x - 1)) % mod\n else: cur = 1\n cur = (cur * 2 * F[x]) % mod\n ans = (ans + cur) % mod\nprint(ans)"}}},{"rowIdx":5676,"cells":{"id":{"kind":"string","value":"185_A. Plant_26787"},"description":{"kind":"string","value":"Dwarfs have planted a very interesting plant, which is a triangle directed \"upwards\". This plant has an amusing feature. After one year a triangle plant directed \"upwards\" divides into four triangle plants: three of them will point \"upwards\" and one will point \"downwards\". After another year, each triangle plant divides into four triangle plants: three of them will be directed in the same direction as the parent plant, and one of them will be directed in the opposite direction. Then each year the process repeats. The figure below illustrates this process.\n\n<image>\n\nHelp the dwarfs find out how many triangle plants that point \"upwards\" will be in n years.\n\nInput\n\nThe first line contains a single integer n (0 ≤ n ≤ 1018) — the number of full years when the plant grew.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.\n\nOutput\n\nPrint a single integer — the remainder of dividing the number of plants that will point \"upwards\" in n years by 1000000007 (109 + 7).\n\nExamples\n\nInput\n\n1\n\n\nOutput\n\n3\n\n\nInput\n\n2\n\n\nOutput\n\n10\n\nNote\n\nThe first test sample corresponds to the second triangle on the figure in the statement. The second test sample corresponds to the third one."},"code":{"kind":"string","value":"n=int(input())\n\ne=10**9+7\n\nprint(1if n==0else(pow(2,n-1,e)+pow(2,n*2-1,e))%e)\n\n\n\n# Made By Mostafa_Khaled"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"1\\n\",\n \"2\\n\",\n \"7\\n\",\n \"84324827171274022\\n\",\n \"74859961358140080\\n\",\n \"10\\n\",\n \"5\\n\",\n \"148049062285906746\\n\",\n \"615812227854199662\\n\",\n \"585335721566249104\\n\",\n \"791809296233191092\\n\",\n \"522842183413115087\\n\",\n \"819875140559301751\\n\",\n \"16\\n\",\n \"931356501703211379\\n\",\n \"14\\n\",\n \"782916801\\n\",\n \"919845424847912644\\n\",\n \"0\\n\",\n \"252509053898415171\\n\",\n \"12\\n\",\n \"711066335916901717\\n\",\n \"349993003033420740\\n\",\n \"856674609788912527\\n\",\n \"376367012\\n\",\n \"13\\n\",\n \"354979172034763159\\n\",\n \"269587448053313253\\n\",\n \"11\\n\",\n \"645762257531682045\\n\",\n \"9\\n\",\n \"529357306\\n\",\n \"3\\n\",\n \"520974001002628386\\n\",\n \"891351282398722856\\n\",\n \"1312148742261680\\n\",\n \"385599124\\n\",\n \"4\\n\",\n \"563324730406715801\\n\",\n \"234122431978145893\\n\",\n \"6265\\n\",\n \"8\\n\",\n \"6\\n\",\n \"989464295\\n\",\n \"760713016078377938\\n\",\n \"1000000000000000000\\n\",\n \"15\\n\",\n \"666729339260489789\\n\",\n \"17\\n\",\n \"106475485271243676\\n\",\n \"89566194496255493\\n\",\n \"21\\n\",\n \"198773027874887895\\n\",\n \"609722676245827920\\n\",\n \"22690488574628295\\n\",\n \"64987321975467866\\n\",\n \"26\\n\",\n \"1402687899\\n\",\n \"142418786823622111\\n\",\n \"422686560849941597\\n\",\n \"318965338536735554\\n\",\n \"371075616918389397\\n\",\n \"247276517\\n\",\n \"28\\n\",\n \"575242803915154474\\n\",\n \"282929065659066862\\n\",\n \"18\\n\",\n \"536298972310291778\\n\",\n \"98655842\\n\",\n \"366011215184074177\\n\",\n \"456327298351885125\\n\",\n \"80378800557879\\n\",\n \"597723331\\n\",\n \"374652109117883018\\n\",\n \"218092454210832918\\n\",\n \"241\\n\",\n \"1592050194\\n\",\n \"1108324798827204895\\n\",\n \"1000000001000000000\\n\",\n \"136427632538445312\\n\",\n \"23\\n\",\n \"25837142808712247\\n\",\n \"148033410136588415\\n\",\n \"42\\n\",\n \"19957242471270751\\n\",\n \"147657443158202969\\n\",\n \"32021836991900864\\n\",\n \"103415954290115226\\n\",\n \"25\\n\",\n \"1713167485\\n\",\n \"19790577454990483\\n\",\n \"613224504968572908\\n\",\n \"349250044152584525\\n\",\n \"463223720126330983\\n\",\n \"324826711\\n\",\n \"56\\n\",\n \"342397658981403351\\n\",\n \"152035977932017496\\n\",\n \"848973816950952646\\n\",\n \"97781173\\n\",\n \"549698499811443472\\n\",\n \"249197210882102642\\n\",\n \"152636686191888\\n\",\n \"376792463\\n\",\n \"138628133569270127\\n\",\n \"180133974818199619\\n\",\n \"432\\n\",\n \"95863330\\n\",\n \"904815930188122007\\n\",\n \"1000000001100000000\\n\",\n \"26993104928293870\\n\",\n \"19\\n\",\n \"13006914435428265\\n\",\n \"119878906331429988\\n\",\n \"13661351061014243\\n\",\n \"247736804641485584\\n\",\n \"62187086497267119\\n\",\n \"123894325135340160\\n\",\n \"38\\n\",\n \"392936585\\n\",\n \"39501539255790049\\n\",\n \"834241621276393924\\n\",\n \"588818393678456505\\n\",\n \"626635318377677135\\n\",\n \"394806921\\n\",\n \"22\\n\",\n \"476148462316674762\\n\",\n \"91572372072404864\\n\",\n \"22718556\\n\",\n \"745307012850736010\\n\",\n \"332392062685643771\\n\",\n \"75420008259877\\n\",\n \"39975440\\n\",\n \"191319794877126408\\n\",\n \"43846574623332337\\n\",\n \"379\\n\",\n \"58302516\\n\",\n \"539155249818829998\\n\",\n \"1010000001000000000\\n\",\n \"33509686359959435\\n\",\n \"20698776553822269\\n\"\n ],\n \"output\": [\n \"3\\n\",\n \"10\\n\",\n \"8256\\n\",\n \"462535280\\n\",\n \"478768275\\n\",\n \"524800\\n\",\n \"528\\n\",\n \"913927498\\n\",\n \"357939938\\n\",\n \"301383716\\n\",\n \"369199735\\n\",\n \"556012763\\n\",\n \"968653685\\n\",\n \"147516402\\n\",\n \"239824013\\n\",\n \"134225920\\n\",\n \"51174574\\n\",\n \"388845650\\n\",\n \"1\\n\",\n \"886314547\\n\",\n \"8390656\\n\",\n \"15590358\\n\",\n \"709392758\\n\",\n \"720540265\\n\",\n \"523204186\\n\",\n \"33558528\\n\",\n \"239287993\\n\",\n \"536645997\\n\",\n \"2098176\\n\",\n \"543988614\\n\",\n \"131328\\n\",\n \"142578489\\n\",\n \"36\\n\",\n \"164118419\\n\",\n \"70758467\\n\",\n \"799725655\\n\",\n \"493875375\\n\",\n \"136\\n\",\n \"353494903\\n\",\n \"905163056\\n\",\n \"980996097\\n\",\n \"32896\\n\",\n \"2080\\n\",\n \"31966163\\n\",\n \"79611270\\n\",\n \"899770636\\n\",\n \"536887296\\n\",\n \"784700006\\n\",\n \"590000072\",\n \"308646157\",\n \"126383288\",\n \"24288735\",\n \"813341253\",\n \"361145698\",\n \"15686508\",\n \"583931246\",\n \"831477087\",\n \"398589945\",\n \"203655973\",\n \"344800670\",\n \"139949572\",\n \"62703272\",\n \"659231957\",\n \"900980124\",\n \"993562487\",\n \"626001272\",\n \"359869202\",\n \"816438082\",\n \"845143239\",\n \"448408300\",\n \"234270295\",\n \"684571361\",\n \"90466536\",\n \"644639502\",\n \"142431460\",\n \"809108231\",\n \"868761510\",\n \"507984394\",\n \"805069164\",\n \"605060578\",\n \"376036848\",\n \"395574854\",\n \"432150849\",\n \"996369258\",\n \"646967267\",\n \"165951140\",\n \"493174482\",\n \"550197138\",\n \"966257885\",\n \"773633596\",\n \"640156668\",\n \"608820450\",\n \"369981060\",\n \"844947832\",\n \"586445883\",\n \"375140076\",\n \"431233401\",\n \"57381330\",\n \"85924556\",\n \"627048830\",\n \"691366682\",\n \"45882224\",\n \"596522425\",\n \"604451189\",\n \"116633478\",\n \"595080543\",\n \"717830664\",\n \"860916807\",\n \"175608606\",\n \"46385378\",\n \"889387422\",\n \"439214657\",\n \"44448317\",\n \"883766194\",\n \"759036404\",\n \"779539868\",\n \"918744289\",\n \"125133707\",\n \"79472546\",\n \"103044505\",\n \"44724551\",\n \"45516889\",\n \"66471237\",\n \"833494016\",\n \"475012179\",\n \"95057788\",\n \"882909778\",\n \"486526790\",\n \"875588108\",\n \"882804716\",\n \"226627113\",\n \"793244720\",\n \"184286076\",\n \"401259137\",\n \"578553364\",\n \"514498227\",\n \"928863377\",\n \"695508717\",\n \"630885850\",\n \"877841435\",\n \"664122673\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nDwarfs have planted a very interesting plant, which is a triangle directed \"upwards\". This plant has an amusing feature. After one year a triangle plant directed \"upwards\" divides into four triangle plants: three of them will point \"upwards\" and one will point \"downwards\". After another year, each triangle plant divides into four triangle plants: three of them will be directed in the same direction as the parent plant, and one of them will be directed in the opposite direction. Then each year the process repeats. The figure below illustrates this process.\n\n<image>\n\nHelp the dwarfs find out how many triangle plants that point \"upwards\" will be in n years.\n\nInput\n\nThe first line contains a single integer n (0 ≤ n ≤ 1018) — the number of full years when the plant grew.\n\nPlease do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.\n\nOutput\n\nPrint a single integer — the remainder of dividing the number of plants that will point \"upwards\" in n years by 1000000007 (109 + 7).\n\nExamples\n\nInput\n\n1\n\n\nOutput\n\n3\n\n\nInput\n\n2\n\n\nOutput\n\n10\n\nNote\n\nThe first test sample corresponds to the second triangle on the figure in the statement. The second test sample corresponds to the third one.\n\n### Input:\n1\n\n### Output:\n3\n\n\n### Input:\n2\n\n### Output:\n10\n\n\n### Code:\nn=int(input())\n\ne=10**9+7\n\nprint(1if n==0else(pow(2,n-1,e)+pow(2,n*2-1,e))%e)\n\n\n\n# Made By Mostafa_Khaled"}}},{"rowIdx":5677,"cells":{"id":{"kind":"string","value":"231_B. Magic, Wizardry and Wonders_26793"},"description":{"kind":"string","value":"Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. That's why Vasya adores math and spends a lot of time turning some numbers into some other ones.\n\nThis morning he has n cards with integers lined up in front of him. Each integer is not less than 1, but not greater than l. When Vasya waves his magic wand, two rightmost cards vanish from the line and a new card magically appears in their place. It contains the difference between the left and the right numbers on the two vanished cards. Vasya was very interested to know what would happen next, and so he waved with his magic wand on and on, until the table had a single card left.\n\nSuppose that Vasya originally had the following cards: 4, 1, 1, 3 (listed from left to right). Then after the first wave the line would be: 4, 1, -2, and after the second one: 4, 3, and after the third one the table would have a single card with number 1.\n\nPlease note that in spite of the fact that initially all the numbers on the cards were not less than 1 and not greater than l, the numbers on the appearing cards can be anything, no restrictions are imposed on them.\n\nIt is now evening. Vasya is very tired and wants to return everything back, but does not remember which cards he had in the morning. He only remembers that there were n cards, they contained integers from 1 to l, and after all magical actions he was left with a single card containing number d.\n\nHelp Vasya to recover the initial set of cards with numbers.\n\nInput\n\nThe single line contains three space-separated integers: n (2 ≤ n ≤ 100) — the initial number of cards on the table, d (|d| ≤ 104) — the number on the card that was left on the table after all the magical actions, and l (1 ≤ l ≤ 100) — the limits for the initial integers.\n\nOutput\n\nIf Vasya is mistaken, that is, if there doesn't exist a set that meets the requirements given in the statement, then print a single number -1, otherwise print the sought set containing n integers from 1 to l. Separate the integers by spaces. Print the integers in the order, in which they were written on the cards from left to right. If there are several suitable sets of numbers, you can print any of them.\n\nExamples\n\nInput\n\n3 3 2\n\n\nOutput\n\n2 1 2 \n\nInput\n\n5 -4 3\n\n\nOutput\n\n-1\n\n\nInput\n\n5 -4 4\n\n\nOutput\n\n2 4 1 4 1 "},"code":{"kind":"string","value":"n, d, L = map(int, input().split())\nsp = []\nfor _ in range(n - 1):\n if d <= 0:\n sp.append(1)\n d = 1 - d\n else:\n sp.append(L)\n d = L - d\nif 1 <= d <= L:\n sp.append(d)\n print(*sp)\nelse:\n print(-1)\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"3 3 2\\n\",\n \"5 -4 4\\n\",\n \"5 -4 3\\n\",\n \"100 -1000 100\\n\",\n \"20 97 13\\n\",\n \"100 1000 3\\n\",\n \"100 -1000 100\\n\",\n \"50 231 39\\n\",\n \"60 -728 29\\n\",\n \"5 2 2\\n\",\n \"2 1 1\\n\",\n \"100 -1000 1\\n\",\n \"100 1000 100\\n\",\n \"100 -1000 3\\n\",\n \"100 -10000 100\\n\",\n \"70 2335 100\\n\",\n \"100 -4900 100\\n\",\n \"25 19 49\\n\",\n \"100 -1167 100\\n\",\n \"25 1 1\\n\",\n \"70 1980 84\\n\",\n \"100 -4104 84\\n\",\n \"60 -2772 94\\n\",\n \"100 -4999 100\\n\",\n \"100 -1000 2\\n\",\n \"7 -24 10\\n\",\n \"20 -179 29\\n\",\n \"100 10000 100\\n\",\n \"40 -1600 85\\n\",\n \"100 -1167 100\\n\",\n \"100 -4900 100\\n\",\n \"40 -1039 73\\n\",\n \"40 336 83\\n\",\n \"15 -639 100\\n\",\n \"15 852 100\\n\",\n \"10 5 3\\n\",\n \"40 -118 32\\n\",\n \"50 -357 68\\n\",\n \"100 1000 100\\n\",\n \"3 0 2\\n\",\n \"2 0 10\\n\",\n \"10 -39 10\\n\",\n \"7 -35 10\\n\",\n \"80 3693 98\\n\",\n \"100 -5000 100\\n\",\n \"100 1000 2\\n\",\n \"100 -39 2\\n\",\n \"100 -1000 101\\n\",\n \"20 97 19\\n\",\n \"50 231 13\\n\",\n \"60 -1369 29\\n\",\n \"5 4 2\\n\",\n \"70 2335 101\\n\",\n \"25 19 56\\n\",\n \"100 -1167 110\\n\",\n \"70 1980 120\\n\",\n \"100 -4104 161\\n\",\n \"60 -2772 130\\n\",\n \"20 -179 40\\n\",\n \"40 -576 85\\n\",\n \"100 -893 100\\n\",\n \"100 -4900 110\\n\",\n \"40 506 83\\n\",\n \"15 -639 101\\n\",\n \"22 852 100\\n\",\n \"10 0 3\\n\",\n \"56 -118 32\\n\",\n \"50 -367 68\\n\",\n \"100 1000 101\\n\",\n \"3 1 2\\n\",\n \"100 -4486 100\\n\",\n \"100 -25 2\\n\",\n \"4 0 2\\n\",\n \"100 -1723 101\\n\",\n \"17 97 19\\n\",\n \"70 761 120\\n\",\n \"20 -353 40\\n\",\n \"40 -789 85\\n\",\n \"100 -140 100\\n\",\n \"100 -250 110\\n\",\n \"40 506 151\\n\",\n \"19 852 100\\n\",\n \"10 1 3\\n\",\n \"56 -135 32\\n\",\n \"50 -367 67\\n\",\n \"100 0000 101\\n\",\n \"100 -4504 100\\n\",\n \"100 -45 2\\n\",\n \"4 1 2\\n\",\n \"17 97 17\\n\",\n \"1 1 2\\n\",\n \"66 761 120\\n\",\n \"2 2 1\\n\",\n \"100 -1000 0\\n\",\n \"100 -6492 100\\n\",\n \"34 1 1\\n\",\n \"100 -4999 000\\n\",\n \"100 10000 101\\n\",\n \"16 -1039 73\\n\",\n \"7 -35 3\\n\",\n \"80 4576 98\\n\",\n \"100 1100 2\\n\",\n \"50 449 13\\n\",\n \"4 4 2\\n\",\n \"2 2 2\\n\",\n \"101 -1000 0\\n\",\n \"100 -6492 000\\n\",\n \"38 2335 101\\n\",\n \"25 19 86\\n\",\n \"100 -1167 010\\n\",\n \"34 1 0\\n\",\n \"13 -2772 130\\n\",\n \"28 -1039 73\\n\",\n \"4 -639 101\\n\",\n \"3 1 3\\n\",\n \"7 -26 3\\n\",\n \"26 4576 98\\n\",\n \"100 1100 0\\n\",\n \"50 449 3\\n\",\n \"3 2 1\\n\",\n \"101 -18 0\\n\",\n \"38 2335 001\\n\",\n \"25 19 158\\n\",\n \"100 -1575 010\\n\",\n \"34 1 -1\\n\"\n ],\n \"output\": [\n \"2 1 2 \\n\",\n \"1 4 1 3 1 \\n\",\n \"-1\\n\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 2 1 1 1\",\n \"-1\\n\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"39 1 39 1 39 1 39 1 39 1 39 1 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 29 1 1 1 1 1 1 1 1\",\n \"2 1 1 1 1 \\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"-1\\n\",\n \"-1\\n\",\n \"100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 59 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 50\",\n \"19 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 79 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \\n\",\n \"84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 72 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 84 1 38\",\n \"1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 94 1 76\",\n \"-1\\n\",\n \"-1\\n\",\n \"1 10 1 10 1 8 1\",\n \"1 29 1 29 1 29 1 29 1 29 1 29 1 12 1 1 1 1 1 1\",\n \"-1\\n\",\n \"1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 5\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 79 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 50\",\n \"1 73 1 73 1 73 1 73 1 73 1 73 1 73 1 73 1 73 1 73 1 73 1 73 1 73 1 73 1 32 1 1 1 1 1 1 1 1 1 1\",\n \"83 1 83 1 83 1 83 1 9 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 47 1\",\n \"-1\\n\",\n \"3 1 3 1 2 1 1 1 1 1\",\n \"1 32 1 32 1 32 1 26 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 68 1 68 1 68 1 68 1 68 1 23 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\",\n \"1 2 1 \\n\",\n \"1 1 \\n\",\n \"1 10 1 10 1 10 1 10 1 4\",\n \"-1\\n\",\n \"98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 98 1 8 1 1 1\",\n \"-1\\n\",\n \"-1\\n\",\n \"1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \\n\",\n \"1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"19 1 19 1 19 1 19 1 19 1 8 1 1 1 1 1 1 1 1 1\\n\",\n \"13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 13 1 4 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"-1\\n\",\n \"2 1 2 1 2\\n\",\n \"101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 36 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"19 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 78 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 120 1 77 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 161 1 105 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 130 1 64 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 40 1 40 1 40 1 40 1 24 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 85 1 85 1 85 1 85 1 85 1 85 1 73 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 110 1 105 1 1 1 1 1 1 1 1 1 1\\n\",\n \"83 1 83 1 83 1 83 1 83 1 83 1 15 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 101 1 101 1 101 1 101 1 101 1 101 1 41 1\\n\",\n \"100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 61 1 1 1 1 1\\n\",\n \"1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 32 1 32 1 32 1 26 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 68 1 68 1 68 1 68 1 68 1 33 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 1 1\\n\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 32 1 1 1 1 1 1 1 1\\n\",\n \"1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 1 1 1\\n\",\n \"1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 101 1 24 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"19 1 19 1 19 1 19 1 19 1 7 1 1 1 1 1 1\\n\",\n \"120 1 120 1 120 1 120 1 120 1 120 1 48 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 40 1 40 1 40 1 40 1 40 1 40 1 40 1 40 1 40 1 3\\n\",\n \"1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 85 1 34 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 100 1 42 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 110 1 110 1 33 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"151 1 151 1 151 1 57 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 60 1 1\\n\",\n \"2 1 1 1 1 1 1 1 1 1\\n\",\n \"1 32 1 32 1 32 1 32 1 12 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 67 1 67 1 67 1 67 1 67 1 38 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 100 1 50 1 1 1 1 1 1 1 1\\n\",\n \"1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 1 1 1 1 1 1 1 1 1\\n\",\n \"2 1 1 1\\n\",\n \"17 1 17 1 17 1 17 1 17 1 17 1 1 1 1 1 1\\n\",\n \"1\\n\",\n \"120 1 120 1 120 1 120 1 120 1 120 1 48 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"19 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"1 1 1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"19 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"-1\\n\",\n \"-1\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nVasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. That's why Vasya adores math and spends a lot of time turning some numbers into some other ones.\n\nThis morning he has n cards with integers lined up in front of him. Each integer is not less than 1, but not greater than l. When Vasya waves his magic wand, two rightmost cards vanish from the line and a new card magically appears in their place. It contains the difference between the left and the right numbers on the two vanished cards. Vasya was very interested to know what would happen next, and so he waved with his magic wand on and on, until the table had a single card left.\n\nSuppose that Vasya originally had the following cards: 4, 1, 1, 3 (listed from left to right). Then after the first wave the line would be: 4, 1, -2, and after the second one: 4, 3, and after the third one the table would have a single card with number 1.\n\nPlease note that in spite of the fact that initially all the numbers on the cards were not less than 1 and not greater than l, the numbers on the appearing cards can be anything, no restrictions are imposed on them.\n\nIt is now evening. Vasya is very tired and wants to return everything back, but does not remember which cards he had in the morning. He only remembers that there were n cards, they contained integers from 1 to l, and after all magical actions he was left with a single card containing number d.\n\nHelp Vasya to recover the initial set of cards with numbers.\n\nInput\n\nThe single line contains three space-separated integers: n (2 ≤ n ≤ 100) — the initial number of cards on the table, d (|d| ≤ 104) — the number on the card that was left on the table after all the magical actions, and l (1 ≤ l ≤ 100) — the limits for the initial integers.\n\nOutput\n\nIf Vasya is mistaken, that is, if there doesn't exist a set that meets the requirements given in the statement, then print a single number -1, otherwise print the sought set containing n integers from 1 to l. Separate the integers by spaces. Print the integers in the order, in which they were written on the cards from left to right. If there are several suitable sets of numbers, you can print any of them.\n\nExamples\n\nInput\n\n3 3 2\n\n\nOutput\n\n2 1 2 \n\nInput\n\n5 -4 3\n\n\nOutput\n\n-1\n\n\nInput\n\n5 -4 4\n\n\nOutput\n\n2 4 1 4 1 \n\n### Input:\n3 3 2\n\n### Output:\n2 1 2 \n\n\n### Input:\n5 -4 4\n\n### Output:\n1 4 1 3 1 \n\n\n### Code:\nn, d, L = map(int, input().split())\nsp = []\nfor _ in range(n - 1):\n if d <= 0:\n sp.append(1)\n d = 1 - d\n else:\n sp.append(L)\n d = L - d\nif 1 <= d <= L:\n sp.append(d)\n print(*sp)\nelse:\n print(-1)\n"}}},{"rowIdx":5678,"cells":{"id":{"kind":"string","value":"257_A. Sockets_26797"},"description":{"kind":"string","value":"Vasya has got many devices that work on electricity. He's got n supply-line filters to plug the devices, the i-th supply-line filter has ai sockets.\n\nOverall Vasya has got m devices and k electrical sockets in his flat, he can plug the devices or supply-line filters directly. Of course, he can plug the supply-line filter to any other supply-line filter. The device (or the supply-line filter) is considered plugged to electricity if it is either plugged to one of k electrical sockets, or if it is plugged to some supply-line filter that is in turn plugged to electricity. \n\nWhat minimum number of supply-line filters from the given set will Vasya need to plug all the devices he has to electricity? Note that all devices and supply-line filters take one socket for plugging and that he can use one socket to plug either one device or one supply-line filter.\n\nInput\n\nThe first line contains three integers n, m, k (1 ≤ n, m, k ≤ 50) — the number of supply-line filters, the number of devices and the number of sockets that he can plug to directly, correspondingly. The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 50) — number ai stands for the number of sockets on the i-th supply-line filter.\n\nOutput\n\nPrint a single number — the minimum number of supply-line filters that is needed to plug all the devices to electricity. If it is impossible to plug all the devices even using all the supply-line filters, print -1.\n\nExamples\n\nInput\n\n3 5 3\n3 1 2\n\n\nOutput\n\n1\n\n\nInput\n\n4 7 2\n3 3 2 4\n\n\nOutput\n\n2\n\n\nInput\n\n5 5 1\n1 3 1 2 1\n\n\nOutput\n\n-1\n\nNote\n\nIn the first test case he can plug the first supply-line filter directly to electricity. After he plug it, he get 5 (3 on the supply-line filter and 2 remaining sockets for direct plugging) available sockets to plug. Thus, one filter is enough to plug 5 devices.\n\nOne of the optimal ways in the second test sample is to plug the second supply-line filter directly and plug the fourth supply-line filter to one of the sockets in the second supply-line filter. Thus, he gets exactly 7 sockets, available to plug: one to plug to the electricity directly, 2 on the second supply-line filter, 4 on the fourth supply-line filter. There's no way he can plug 7 devices if he use one supply-line filter."},"code":{"kind":"string","value":"n,m,k=map(int,input().split(\" \"))\nli=list(map(int,input().split(\" \",n)[:n]))\nli.sort(reverse=True)\nfl=0\na,s=0,0\nif m<=k:\n print(0)\nelse:\n while fl==0 and a<n:\n s+=li[a]\n a+=1\n if a!=1:\n s-=1\n if s+k-1>=m and a!=0:\n fl=1\n break\n if fl!=1:\n print(-1)\n else:\n print(a)\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"4 7 2\\n3 3 2 4\\n\",\n \"3 5 3\\n3 1 2\\n\",\n \"5 5 1\\n1 3 1 2 1\\n\",\n \"10 49 11\\n5 18 1 19 11 11 16 5 6 6\\n\",\n \"1 1 1\\n1\\n\",\n \"13 20 9\\n2 9 2 2 5 11 10 10 13 4 6 11 14\\n\",\n \"15 26 4\\n3 6 7 1 5 2 4 4 7 3 8 7 2 4 8\\n\",\n \"5 50 6\\n2 1 3 1 3\\n\",\n \"50 50 2\\n2 2 4 5 2 1 5 4 5 4 5 2 1 2 3 3 5 1 2 2 1 3 4 5 5 4 3 2 2 1 3 2 3 2 4 4 1 3 5 4 3 2 4 3 4 4 4 4 3 4\\n\",\n \"49 19 2\\n3 2 3 2 3 3 2 3 3 1 2 1 2 3 2 3 1 3 1 3 1 3 2 2 2 2 3 3 1 1 2 3 2 3 1 2 3 3 1 1 3 1 1 3 1 1 1 2 3\\n\",\n \"4 5 8\\n3 2 4 3\\n\",\n \"20 20 3\\n6 6 5 1 7 8 8 6 10 7 8 5 6 8 1 7 10 6 2 7\\n\",\n \"49 49 3\\n8 8 8 7 5 6 6 8 1 3 1 8 8 3 2 1 2 2 5 4 4 7 8 7 6 4 2 5 7 3 4 2 3 2 3 4 5 7 3 3 4 5 5 8 2 5 1 1 7\\n\",\n \"9 30 8\\n3 6 10 8 1 5 3 9 3\\n\",\n \"50 23 2\\n2 1 2 2 3 2 1 2 3 3 3 1 3 1 3 2 1 3 2 2 1 1 3 2 2 1 1 3 2 1 2 3 2 2 2 2 1 3 1 2 2 3 3 1 3 3 3 1 2 3\\n\",\n \"5 10 1\\n4 3 4 2 4\\n\",\n \"20 30 1\\n12 19 16 2 11 19 1 15 13 13 3 10 1 18 7 5 6 8 9 1\\n\",\n \"4 50 1\\n3 11 5 5\\n\",\n \"7 17 5\\n1 6 2 1 1 4 3\\n\",\n \"47 7 4\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"50 50 2\\n1 2 3 2 1 2 4 2 3 4 3 1 3 2 2 3 1 4 2 1 4 4 2 2 2 3 2 3 1 1 4 4 1 1 2 3 4 2 2 3 4 3 4 3 3 3 2 3 1 1\\n\",\n \"50 5 1\\n1 1 1 1 1 1 1 2 1 1 2 2 2 2 1 2 1 2 1 2 2 1 1 1 2 2 2 1 2 1 2 2 2 2 2 1 2 2 2 2 1 2 1 1 2 1 1 2 1 2\\n\",\n \"3 6 3\\n2 2 2\\n\",\n \"15 38 3\\n3 5 5 5 4 1 3 1 5 4 2 4 3 1 1\\n\",\n \"33 49 16\\n40 16 48 49 30 28 8 6 48 39 48 6 24 28 30 35 12 23 49 29 31 8 40 18 16 34 43 15 12 33 14 24 13\\n\",\n \"20 50 10\\n5 4 3 6 3 7 2 3 7 8 6 3 8 3 3 5 1 9 6 2\\n\",\n \"40 40 3\\n2 1 4 2 4 2 3 3 3 3 1 2 3 2 2 3 4 2 3 1 2 4 1 4 1 4 3 3 1 1 3 1 3 4 4 3 1 1 2 4\\n\",\n \"7 13 2\\n5 3 4 1 2 1 2\\n\",\n \"10 50 5\\n23 18 15 23 26 23 4 29 15 25\\n\",\n \"10 25 7\\n5 7 4 8 3 3 5 4 5 5\\n\",\n \"50 30 1\\n2 1 2 1 2 3 3 1 2 2 3 2 1 3 1 3 1 2 2 3 2 1 3 1 1 2 3 2 2 1 1 3 3 2 2 2 3 2 3 3 3 3 1 1 3 1 1 3 1 3\\n\",\n \"10 30 5\\n4 5 3 3 4 4 4 3 5 1\\n\",\n \"10 8 4\\n1 1 2 1 3 1 3 1 4 2\\n\",\n \"1 7 4\\n1\\n\",\n \"10 49 11\\n5 18 1 19 11 11 16 0 6 6\\n\",\n \"1 0 1\\n1\\n\",\n \"13 20 9\\n2 9 2 2 5 11 9 10 13 4 6 11 14\\n\",\n \"5 50 6\\n2 1 2 1 3\\n\",\n \"50 50 2\\n2 2 4 5 2 1 5 4 5 4 5 2 1 2 3 3 5 1 2 2 1 3 4 5 5 4 3 2 2 1 3 2 3 2 4 4 1 3 5 4 3 2 4 6 4 4 4 4 3 4\\n\",\n \"49 19 2\\n3 2 3 2 3 3 2 3 3 1 2 1 2 3 2 3 1 3 1 3 1 3 2 2 2 2 3 3 1 1 2 3 2 3 1 2 3 3 1 1 3 1 1 3 1 1 1 0 3\\n\",\n \"20 20 3\\n6 6 5 1 7 12 8 6 10 7 8 5 6 8 1 7 10 6 2 7\\n\",\n \"49 49 3\\n8 8 8 7 5 6 6 8 1 3 1 8 8 3 2 1 2 2 5 4 4 7 8 7 6 4 2 5 7 3 4 2 3 2 3 4 5 7 3 3 4 5 5 8 2 5 1 2 7\\n\",\n \"50 23 2\\n2 1 3 2 3 2 1 2 3 3 3 1 3 1 3 2 1 3 2 2 1 1 3 2 2 1 1 3 2 1 2 3 2 2 2 2 1 3 1 2 2 3 3 1 3 3 3 1 2 3\\n\",\n \"7 17 5\\n1 6 2 1 1 4 4\\n\",\n \"10 25 3\\n5 7 4 8 3 3 5 4 5 5\\n\",\n \"50 30 1\\n2 1 2 1 2 3 3 1 2 2 3 2 1 3 1 3 1 2 2 3 2 1 3 1 1 2 3 2 2 1 1 3 3 1 2 2 3 2 3 3 3 3 1 1 3 1 1 3 1 3\\n\",\n \"50 30 1\\n2 1 2 1 2 3 3 1 2 2 3 2 1 3 1 3 1 2 2 3 2 1 3 1 1 2 3 2 2 1 1 3 3 1 2 2 3 2 3 3 3 3 1 1 3 1 1 3 1 4\\n\",\n \"49 19 2\\n3 2 3 2 5 3 2 3 3 1 2 1 2 3 2 3 1 3 1 3 1 3 1 2 2 2 3 3 1 1 2 3 2 3 1 2 3 3 1 1 3 1 1 3 1 1 1 0 3\\n\",\n \"49 49 5\\n8 8 15 7 5 6 6 8 1 3 1 8 8 3 2 1 2 2 5 4 4 7 8 7 6 4 2 5 7 3 4 2 3 2 3 4 5 7 3 3 4 5 5 8 2 5 1 2 7\\n\",\n \"40 40 3\\n2 1 4 2 2 2 3 6 3 3 1 2 3 2 2 3 4 2 3 1 2 4 1 4 1 4 6 3 1 1 3 1 3 4 4 3 1 1 2 4\\n\",\n \"15 26 4\\n3 6 7 1 5 2 4 4 7 3 8 14 2 4 8\\n\",\n \"4 5 8\\n3 2 4 1\\n\",\n \"9 30 8\\n3 6 10 8 1 1 3 9 3\\n\",\n \"5 10 2\\n4 3 4 2 4\\n\",\n \"20 30 1\\n12 19 16 2 11 19 1 15 9 13 3 10 1 18 7 5 6 8 9 1\\n\",\n \"4 50 2\\n3 11 5 5\\n\",\n \"47 7 4\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"50 79 2\\n1 2 3 2 1 2 4 2 3 4 3 1 3 2 2 3 1 4 2 1 4 4 2 2 2 3 2 3 1 1 4 4 1 1 2 3 4 2 2 3 4 3 4 3 3 3 2 3 1 1\\n\",\n \"50 5 1\\n1 1 1 1 1 2 1 2 1 1 2 2 2 2 1 2 1 2 1 2 2 1 1 1 2 2 2 1 2 1 2 2 2 2 2 1 2 2 2 2 1 2 1 1 2 1 1 2 1 2\\n\",\n \"3 6 3\\n4 2 2\\n\",\n \"15 38 3\\n4 5 5 5 4 1 3 1 5 4 2 4 3 1 1\\n\",\n \"33 49 16\\n40 16 48 49 30 28 8 6 48 39 48 6 24 28 30 35 12 23 49 29 31 10 40 18 16 34 43 15 12 33 14 24 13\\n\",\n \"20 50 10\\n5 4 3 6 3 7 4 3 7 8 6 3 8 3 3 5 1 9 6 2\\n\",\n \"40 40 3\\n2 1 4 2 4 2 3 3 3 3 1 2 3 2 2 3 4 2 3 1 2 4 1 4 1 4 6 3 1 1 3 1 3 4 4 3 1 1 2 4\\n\",\n \"10 50 5\\n23 18 15 23 43 23 4 29 15 25\\n\",\n \"10 30 5\\n3 5 3 3 4 4 4 3 5 1\\n\",\n \"10 8 4\\n1 1 1 1 3 1 3 1 4 2\\n\",\n \"1 9 4\\n1\\n\",\n \"4 7 2\\n3 6 2 4\\n\",\n \"5 5 1\\n1 6 1 2 1\\n\",\n \"10 49 11\\n5 18 1 19 11 11 18 0 6 6\\n\",\n \"1 -1 1\\n1\\n\",\n \"13 20 9\\n2 9 2 2 5 11 9 10 13 4 6 14 14\\n\",\n \"15 26 4\\n0 6 7 1 5 2 4 4 7 3 8 14 2 4 8\\n\",\n \"5 50 6\\n2 1 2 1 1\\n\",\n \"50 50 2\\n2 2 4 5 2 1 5 4 5 4 5 2 2 2 3 3 5 1 2 2 1 3 4 5 5 4 3 2 2 1 3 2 3 2 4 4 1 3 5 4 3 2 4 6 4 4 4 4 3 4\\n\",\n \"49 19 2\\n3 2 3 2 3 3 2 3 3 1 2 1 2 3 2 3 1 3 1 3 1 3 1 2 2 2 3 3 1 1 2 3 2 3 1 2 3 3 1 1 3 1 1 3 1 1 1 0 3\\n\",\n \"4 6 8\\n3 2 4 1\\n\",\n \"20 20 3\\n6 6 5 1 7 12 9 6 10 7 8 5 6 8 1 7 10 6 2 7\\n\",\n \"49 49 5\\n8 8 8 7 5 6 6 8 1 3 1 8 8 3 2 1 2 2 5 4 4 7 8 7 6 4 2 5 7 3 4 2 3 2 3 4 5 7 3 3 4 5 5 8 2 5 1 2 7\\n\",\n \"9 30 8\\n3 6 10 8 1 1 3 9 5\\n\",\n \"20 30 1\\n12 19 16 2 11 19 1 2 9 13 3 10 1 18 7 5 6 8 9 1\\n\",\n \"4 50 2\\n2 11 5 5\\n\",\n \"7 17 1\\n1 6 2 1 1 4 4\\n\",\n \"47 7 4\\n1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\\n\",\n \"50 79 2\\n1 2 3 2 1 2 4 2 3 4 3 1 3 2 2 6 1 4 2 1 4 4 2 2 2 3 2 3 1 1 4 4 1 1 2 3 4 2 2 3 4 3 4 3 3 3 2 3 1 1\\n\",\n \"50 5 1\\n1 1 1 1 1 2 1 2 1 1 2 2 2 2 1 2 1 2 1 2 2 1 1 1 2 2 2 2 2 1 2 2 2 2 2 1 2 2 2 2 1 2 1 1 2 1 1 2 1 2\\n\",\n \"3 6 3\\n1 2 2\\n\",\n \"15 38 3\\n4 5 5 5 4 0 3 1 5 4 2 4 3 1 1\\n\",\n \"33 49 16\\n40 16 48 49 30 28 8 2 48 39 48 6 24 28 30 35 12 23 49 29 31 10 40 18 16 34 43 15 12 33 14 24 13\\n\",\n \"40 40 3\\n2 1 4 2 2 2 3 3 3 3 1 2 3 2 2 3 4 2 3 1 2 4 1 4 1 4 6 3 1 1 3 1 3 4 4 3 1 1 2 4\\n\",\n \"10 50 5\\n23 18 15 7 43 23 4 29 15 25\\n\",\n \"10 25 3\\n5 7 0 8 3 3 5 4 5 5\\n\",\n \"10 30 5\\n3 5 3 2 4 4 4 3 5 1\\n\",\n \"10 8 4\\n1 1 1 1 3 0 3 1 4 2\\n\",\n \"1 9 4\\n2\\n\",\n \"4 0 2\\n3 6 2 4\\n\",\n \"5 5 1\\n0 6 1 2 1\\n\",\n \"10 49 11\\n5 18 1 19 11 11 18 -1 6 6\\n\",\n \"1 -1 2\\n1\\n\",\n \"13 20 9\\n2 3 2 2 5 11 9 10 13 4 6 14 14\\n\",\n \"15 26 4\\n0 6 7 1 5 2 4 4 7 3 8 14 4 4 8\\n\",\n \"5 50 6\\n2 0 2 1 1\\n\",\n \"50 50 2\\n2 2 4 5 2 1 5 4 5 4 5 2 2 2 3 3 5 1 2 2 1 3 4 5 5 4 3 2 2 1 3 2 3 2 4 4 1 3 5 1 3 2 4 6 4 4 4 4 3 4\\n\",\n \"4 6 8\\n3 2 3 1\\n\",\n \"20 20 3\\n6 6 5 1 7 12 0 6 10 7 8 5 6 8 1 7 10 6 2 7\\n\",\n \"9 30 8\\n3 6 10 1 1 1 3 9 5\\n\",\n \"20 30 1\\n12 19 25 2 11 19 1 2 9 13 3 10 1 18 7 5 6 8 9 1\\n\",\n \"4 50 2\\n2 11 5 6\\n\",\n \"7 17 1\\n1 1 2 1 1 4 4\\n\",\n \"47 7 4\\n1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1\\n\",\n \"50 79 2\\n1 2 3 2 1 2 4 2 3 4 3 1 3 2 2 6 1 4 2 1 4 4 2 2 2 3 2 3 0 1 4 4 1 1 2 3 4 2 2 3 4 3 4 3 3 3 2 3 1 1\\n\",\n \"50 5 1\\n1 1 1 1 1 2 1 2 1 1 2 2 2 2 1 2 1 2 1 2 2 1 1 1 2 2 2 2 2 1 2 2 2 2 2 1 2 2 2 2 1 4 1 1 2 1 1 2 1 2\\n\",\n \"15 38 3\\n4 5 5 5 4 0 3 1 5 4 1 4 3 1 1\\n\",\n \"33 49 6\\n40 16 48 49 30 28 8 2 48 39 48 6 24 28 30 35 12 23 49 29 31 10 40 18 16 34 43 15 12 33 14 24 13\\n\",\n \"10 50 5\\n23 32 15 7 43 23 4 29 15 25\\n\",\n \"10 25 3\\n5 7 0 8 3 3 5 6 5 5\\n\",\n \"50 30 1\\n2 1 2 2 2 3 3 1 2 2 3 2 1 3 1 3 1 2 2 3 2 1 3 1 1 2 3 2 2 1 1 3 3 1 2 2 3 2 3 3 3 3 1 1 3 1 1 3 1 4\\n\",\n \"10 30 5\\n3 5 3 2 4 4 4 1 5 1\\n\",\n \"10 8 4\\n1 1 1 1 3 0 6 1 4 2\\n\",\n \"1 9 4\\n3\\n\",\n \"4 0 2\\n3 6 3 4\\n\",\n \"5 5 1\\n0 6 1 1 1\\n\",\n \"10 49 11\\n5 18 1 19 11 11 30 -1 6 6\\n\",\n \"1 0 2\\n1\\n\",\n \"13 20 9\\n2 3 2 2 5 11 9 10 13 2 6 14 14\\n\",\n \"15 26 2\\n0 6 7 1 5 2 4 4 7 3 8 14 4 4 8\\n\",\n \"50 50 2\\n2 3 4 5 2 1 5 4 5 4 5 2 2 2 3 3 5 1 2 2 1 3 4 5 5 4 3 2 2 1 3 2 3 2 4 4 1 3 5 1 3 2 4 6 4 4 4 4 3 4\\n\",\n \"49 19 2\\n3 2 3 2 5 3 2 3 3 1 2 1 2 3 2 2 1 3 1 3 1 3 1 2 2 2 3 3 1 1 2 3 2 3 1 2 3 3 1 1 3 1 1 3 1 1 1 0 3\\n\",\n \"4 6 8\\n3 2 0 1\\n\",\n \"20 20 3\\n6 6 5 1 7 12 0 6 10 7 8 5 6 8 2 7 10 6 2 7\\n\",\n \"49 49 5\\n8 8 15 7 5 6 6 8 1 3 1 8 8 3 2 1 2 2 5 4 4 7 8 7 6 4 2 5 7 3 4 2 3 2 3 4 5 7 3 3 4 5 5 8 2 5 2 2 7\\n\",\n \"20 30 1\\n12 19 25 2 11 19 1 2 18 13 3 10 1 18 7 5 6 8 9 1\\n\",\n \"4 33 2\\n2 11 5 6\\n\"\n ],\n \"output\": [\n \"2\\n\",\n \"1\\n\",\n \"-1\\n\",\n \"3\\n\",\n \"0\\n\",\n \"1\\n\",\n \"4\\n\",\n \"-1\\n\",\n \"14\\n\",\n \"9\\n\",\n \"0\\n\",\n \"2\\n\",\n \"7\\n\",\n \"3\\n\",\n \"11\\n\",\n \"3\\n\",\n \"2\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"19\\n\",\n \"4\\n\",\n \"3\\n\",\n \"-1\\n\",\n \"1\\n\",\n \"7\\n\",\n \"14\\n\",\n \"5\\n\",\n \"2\\n\",\n \"4\\n\",\n \"15\\n\",\n \"9\\n\",\n \"2\\n\",\n \"-1\\n\",\n \"3\\n\",\n \"0\\n\",\n \"1\\n\",\n \"-1\\n\",\n \"13\\n\",\n \"9\\n\",\n \"2\\n\",\n \"7\\n\",\n \"11\\n\",\n \"4\\n\",\n \"5\\n\",\n \"15\\n\",\n \"14\\n\",\n \"8\\n\",\n \"6\\n\",\n \"12\\n\",\n \"3\\n\",\n \"0\\n\",\n \"3\\n\",\n \"3\\n\",\n \"2\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"4\\n\",\n \"1\\n\",\n \"-1\\n\",\n \"1\\n\",\n \"7\\n\",\n \"13\\n\",\n \"2\\n\",\n \"9\\n\",\n \"2\\n\",\n \"-1\\n\",\n \"1\\n\",\n \"1\\n\",\n \"3\\n\",\n \"0\\n\",\n \"1\\n\",\n \"3\\n\",\n \"-1\\n\",\n \"13\\n\",\n \"9\\n\",\n \"0\\n\",\n \"2\\n\",\n \"7\\n\",\n \"3\\n\",\n \"2\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"4\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"1\\n\",\n \"13\\n\",\n \"2\\n\",\n \"5\\n\",\n \"-1\\n\",\n \"2\\n\",\n \"-1\\n\",\n \"0\\n\",\n \"1\\n\",\n \"3\\n\",\n \"0\\n\",\n \"1\\n\",\n \"3\\n\",\n \"-1\\n\",\n \"13\\n\",\n \"0\\n\",\n \"2\\n\",\n \"3\\n\",\n \"2\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"2\\n\",\n \"-1\\n\",\n \"1\\n\",\n \"2\\n\",\n \"4\\n\",\n \"14\\n\",\n \"-1\\n\",\n \"1\\n\",\n \"-1\\n\",\n \"0\\n\",\n \"1\\n\",\n \"2\\n\",\n \"0\\n\",\n \"1\\n\",\n \"3\\n\",\n \"13\\n\",\n \"8\\n\",\n \"0\\n\",\n \"2\\n\",\n \"6\\n\",\n \"2\\n\",\n \"-1\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nVasya has got many devices that work on electricity. He's got n supply-line filters to plug the devices, the i-th supply-line filter has ai sockets.\n\nOverall Vasya has got m devices and k electrical sockets in his flat, he can plug the devices or supply-line filters directly. Of course, he can plug the supply-line filter to any other supply-line filter. The device (or the supply-line filter) is considered plugged to electricity if it is either plugged to one of k electrical sockets, or if it is plugged to some supply-line filter that is in turn plugged to electricity. \n\nWhat minimum number of supply-line filters from the given set will Vasya need to plug all the devices he has to electricity? Note that all devices and supply-line filters take one socket for plugging and that he can use one socket to plug either one device or one supply-line filter.\n\nInput\n\nThe first line contains three integers n, m, k (1 ≤ n, m, k ≤ 50) — the number of supply-line filters, the number of devices and the number of sockets that he can plug to directly, correspondingly. The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 50) — number ai stands for the number of sockets on the i-th supply-line filter.\n\nOutput\n\nPrint a single number — the minimum number of supply-line filters that is needed to plug all the devices to electricity. If it is impossible to plug all the devices even using all the supply-line filters, print -1.\n\nExamples\n\nInput\n\n3 5 3\n3 1 2\n\n\nOutput\n\n1\n\n\nInput\n\n4 7 2\n3 3 2 4\n\n\nOutput\n\n2\n\n\nInput\n\n5 5 1\n1 3 1 2 1\n\n\nOutput\n\n-1\n\nNote\n\nIn the first test case he can plug the first supply-line filter directly to electricity. After he plug it, he get 5 (3 on the supply-line filter and 2 remaining sockets for direct plugging) available sockets to plug. Thus, one filter is enough to plug 5 devices.\n\nOne of the optimal ways in the second test sample is to plug the second supply-line filter directly and plug the fourth supply-line filter to one of the sockets in the second supply-line filter. Thus, he gets exactly 7 sockets, available to plug: one to plug to the electricity directly, 2 on the second supply-line filter, 4 on the fourth supply-line filter. There's no way he can plug 7 devices if he use one supply-line filter.\n\n### Input:\n4 7 2\n3 3 2 4\n\n### Output:\n2\n\n\n### Input:\n3 5 3\n3 1 2\n\n### Output:\n1\n\n\n### Code:\nn,m,k=map(int,input().split(\" \"))\nli=list(map(int,input().split(\" \",n)[:n]))\nli.sort(reverse=True)\nfl=0\na,s=0,0\nif m<=k:\n print(0)\nelse:\n while fl==0 and a<n:\n s+=li[a]\n a+=1\n if a!=1:\n s-=1\n if s+k-1>=m and a!=0:\n fl=1\n break\n if fl!=1:\n print(-1)\n else:\n print(a)\n"}}},{"rowIdx":5679,"cells":{"id":{"kind":"string","value":"280_A. Rectangle Puzzle_26801"},"description":{"kind":"string","value":"You are given two rectangles on a plane. The centers of both rectangles are located in the origin of coordinates (meaning the center of the rectangle's symmetry). The first rectangle's sides are parallel to the coordinate axes: the length of the side that is parallel to the Ox axis, equals w, the length of the side that is parallel to the Oy axis, equals h. The second rectangle can be obtained by rotating the first rectangle relative to the origin of coordinates by angle α.\n\n<image>\n\nYour task is to find the area of the region which belongs to both given rectangles. This region is shaded in the picture.\n\nInput\n\nThe first line contains three integers w, h, α (1 ≤ w, h ≤ 106; 0 ≤ α ≤ 180). Angle α is given in degrees.\n\nOutput\n\nIn a single line print a real number — the area of the region which belongs to both given rectangles.\n\nThe answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.\n\nExamples\n\nInput\n\n1 1 45\n\n\nOutput\n\n0.828427125\n\n\nInput\n\n6 4 30\n\n\nOutput\n\n19.668384925\n\nNote\n\nThe second sample has been drawn on the picture above."},"code":{"kind":"string","value":"from math import radians, cos, sin, atan2\n\ndef rotate(point, alpha):\n x = point[0]\n y = point[1]\n return (x * cos(alpha) - y * sin(alpha), x * sin(alpha) + y * cos(alpha))\n\ndef crs(a, b):\n return a[0] * b[1] - a[1] * b[0]\n\ndef m(end, start):\n return (end[0] - start[0], end[1] - start[1])\n\ndef area(poly):\n ret = 0\n n = len(poly)\n\n for i in range(n):\n j = (i + 1) % n\n ret += crs(poly[i], poly[j])\n\n return abs(ret) / 2.0\n\ndef intersect(a, b, c, d):\n r = crs(m(c, d), m(a, d)) * crs(m(c, d), m(b, d)) <= 0\n r &= crs(m(b, a), m(c, a)) * crs(m(b, a), m(d, a)) <= 0\n if not r:\n return None\n\n x1 = a[0]\n y1 = a[1]\n\n x2 = c[0]\n y2 = c[1]\n\n dx1 = b[0] - a[0]\n dx2 = d[0] - c[0]\n\n dy1 = b[1] - a[1]\n dy2 = d[1] - c[1]\n\n if dx2 * dy1 == dx1 * dy2:\n return None\n\n t = ((x1 - x2) * dy2 + (y2 - y1) * dx2) / (dx2 * dy1 - dx1 * dy2)\n return (x1 + t * dx1, y1 + t * dy1)\n\n\nw, h, alpha = map(int, input().split())\n\nif alpha == 0 or alpha == 180:\n print(w * h)\nelse:\n alpha = radians(alpha) \n pnt = []\n\n pnt.append((w / 2, h / 2))\n pnt.append((-w / 2, h / 2))\n pnt.append((-w / 2, -h / 2))\n pnt.append((w / 2, -h / 2))\n\n\n pnt2 = []\n for p in pnt:\n pnt2.append(rotate(p, alpha))\n\n pnt2.append(pnt2[0])\n pnt.append(pnt[0])\n\n points_total = []\n\n for st in range(4):\n for en in range(4):\n t = intersect(pnt[st], pnt[st + 1], pnt2[en], pnt2[en + 1])\n\n if t != None:\n points_total.append(t)\n\n points_total = sorted(points_total, key=lambda x: atan2(x[1], x[0]))\n\n print(area(points_total))\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"6 4 30\\n\",\n \"1 1 45\\n\",\n \"938133 287232 156\\n\",\n \"143003 283714 102\\n\",\n \"2 100 90\\n\",\n \"129842 930245 115\\n\",\n \"646084 979010 45\\n\",\n \"659245 591935 32\\n\",\n \"991245 527535 69\\n\",\n \"100 100 30\\n\",\n \"44247 849307 176\\n\",\n \"34989 23482 180\\n\",\n \"606243 819219 106\\n\",\n \"90002 994645 176\\n\",\n \"100 10 80\\n\",\n \"872657 1807 27\\n\",\n \"925659 774524 134\\n\",\n \"175486 640701 60\\n\",\n \"228598 881004 56\\n\",\n \"520648 189225 167\\n\",\n \"100 100 0\\n\",\n \"135646 480909 0\\n\",\n \"217708 823289 162\\n\",\n \"507487 609004 180\\n\",\n \"314304 429528 163\\n\",\n \"560489 381720 91\\n\",\n \"787062 371814 73\\n\",\n \"76730 689942 119\\n\",\n \"852428 738707 49\\n\",\n \"991024 917226 95\\n\",\n \"36890 754342 82\\n\",\n \"23141 2132 180\\n\",\n \"89781 351632 35\\n\",\n \"303304 904227 3\\n\",\n \"143003 283714 64\\n\",\n \"2 101 90\\n\",\n \"129842 930245 41\\n\",\n \"646084 979010 12\\n\",\n \"659245 317422 32\\n\",\n \"1503946 527535 69\\n\",\n \"100 000 30\\n\",\n \"69805 849307 176\\n\",\n \"34989 29467 180\\n\",\n \"988480 819219 106\\n\",\n \"90002 1890497 176\\n\",\n \"100 10 11\\n\",\n \"872657 1807 18\\n\",\n \"925659 219748 134\\n\",\n \"175486 21911 60\\n\",\n \"228598 870870 56\\n\",\n \"863736 189225 167\\n\",\n \"100 101 0\\n\",\n \"301039 823289 162\\n\",\n \"507487 609004 5\\n\",\n \"314304 429528 77\\n\",\n \"976814 381720 91\\n\",\n \"1321026 371814 73\\n\",\n \"126396 689942 119\\n\",\n \"18980 738707 49\\n\",\n \"991024 917226 96\\n\",\n \"36890 754342 114\\n\",\n \"23141 2132 74\\n\",\n \"89781 572086 35\\n\",\n \"278845 904227 3\\n\",\n \"6 5 30\\n\",\n \"1 1 52\\n\",\n \"2 101 141\\n\",\n \"129842 259356 41\\n\",\n \"646084 979010 19\\n\",\n \"659245 317422 55\\n\",\n \"100 100 47\\n\",\n \"79737 849307 176\\n\",\n \"988480 1151420 106\\n\",\n \"90002 1734667 176\\n\",\n \"100 9 11\\n\",\n \"175486 36912 60\\n\",\n \"228598 365996 56\\n\",\n \"440170 189225 167\\n\",\n \"110 101 0\\n\",\n \"301039 823289 14\\n\",\n \"347743 609004 5\\n\",\n \"314304 429528 76\\n\",\n \"393200 371814 73\\n\",\n \"18437 689942 119\\n\",\n \"13164 738707 49\\n\",\n \"991024 917226 117\\n\",\n \"44154 754342 114\\n\",\n \"278845 266993 3\\n\",\n \"6 5 54\\n\",\n \"58650 503117 64\\n\",\n \"143003 503117 64\\n\",\n \"2837668 527535 69\\n\",\n \"1345189 1807 18\\n\",\n \"1808845 219748 134\\n\",\n \"710834 381720 91\\n\",\n \"41392 2132 74\\n\",\n \"89781 532091 35\\n\",\n \"0 1 52\\n\",\n \"129842 352443 41\\n\"\n ],\n \"output\": [\n \"19.668384968\\n\",\n \"0.828427125\\n\",\n \"182978083107.739746093750\\n\",\n \"20906720001.826442719\\n\",\n \"4.000000000\\n\",\n \"18601787610.281501770\\n\",\n \"491534756284.3750610352\\n\",\n \"327438873731.782958984375\\n\",\n \"298092342476.756225586\\n\",\n \"8452.994616207\\n\",\n \"25011463322.593559265\\n\",\n \"821611698.000000000\\n\",\n \"382341849885.364929199\\n\",\n \"72280791543.455017090\\n\",\n \"101.542661615\\n\",\n \"7192328.918497672\\n\",\n \"587010971679.470336914\\n\",\n \"35559391285.091255188\\n\",\n \"63033386343.331901550\\n\",\n \"83168927181.77613831\\n\",\n \"10000.000000000\\n\",\n \"65233382214.000000000\\n\",\n \"128074702873.298324585\\n\",\n \"309061612948.000000000\\n\",\n \"119035307824.125411987\\n\",\n \"145732354143.406555176\\n\",\n \"144562337198.439788818\\n\",\n \"6731488956.790281296\\n\",\n \"517909750353.869018555\\n\",\n \"843996470740.05212402\\n\",\n \"1374246169.251310825\\n\",\n \"49336612.000000000\\n\",\n \"14053275989.299276352\\n\",\n \"262706079399.496887207\\n\",\n \"22752551703.25548414327204227\",\n \"4.00000000000000000\",\n \"25697298899.98044319637119770\",\n \"572732601908.72655785083770752\",\n \"156244395014.38340976834297180\",\n \"298092342476.75622430443763733\",\n \"0.00000000000000000\",\n \"46720036630.45153352245688438\",\n \"1031020863.00000000000000000\",\n \"684860009476.82913672924041748\",\n \"107866786873.19252748787403107\",\n \"523.35582720730591827\",\n \"10566567.72746321120484936\",\n \"67129864747.18400994315743446\",\n \"554362399.65022910619154572\",\n \"63033386343.33190864324569702\",\n \"122027964864.77463196218013763\",\n \"10100.00000000000000000\",\n \"196611321371.95857562124729156\",\n \"296470874376.06422385573387146\",\n \"101385508428.74471594393253326\",\n \"145732354143.40654824674129486\",\n \"144562337198.43978200852870941\",\n \"18266166066.90955058857798576\",\n \"477323210.72917315439553931\",\n \"842642820483.01312959194183350\",\n \"1489659971.06670872075483203\",\n \"4728602.02295178691883848\",\n \"14053275989.29927553888410330\",\n \"240745923395.37484034895896912\",\n \"25.20428331024320269\",\n \"0.83206020185552666\",\n \"6.35606291626299798\",\n \"23782492176.62202960625290871\",\n \"547213569049.97714525461196899\",\n \"123001250850.14577712118625641\",\n \"8287.22850575875980894\",\n \"55149955556.85151089727878571\",\n \"981327901099.81217265129089355\",\n \"103695147139.84781697392463684\",\n \"424.50828819759576521\",\n \"1573274569.13623890327289701\",\n \"61090037965.96539381891489029\",\n \"72060795940.19206856936216354\",\n \"11110.00000000000000000\",\n \"206809601837.30387058854103088\",\n \"201808352241.26617082953453064\",\n \"101811233153.77817100286483765\",\n \"129450847307.95464035868644714\",\n \"388652309.36972645658534020\",\n \"229612688.82905756618129089\",\n \"771585891128.03490811586380005\",\n \"2134076306.42800152790732682\",\n \"72597783619.00412237644195557\",\n \"24.59992613633168169\",\n \"3827153188.39021566347219050\",\n \"22752551703.25548414327204227\",\n \"298092342476.75622430443763733\",\n \"10566567.72746321120484936\",\n \"67129864747.18400994315743446\",\n \"145732354143.40654824674129486\",\n \"4728602.02295178691883848\",\n \"14053275989.29927553888410330\",\n \"0.00000000000000000\",\n \"25697298899.98044319637119770\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nYou are given two rectangles on a plane. The centers of both rectangles are located in the origin of coordinates (meaning the center of the rectangle's symmetry). The first rectangle's sides are parallel to the coordinate axes: the length of the side that is parallel to the Ox axis, equals w, the length of the side that is parallel to the Oy axis, equals h. The second rectangle can be obtained by rotating the first rectangle relative to the origin of coordinates by angle α.\n\n<image>\n\nYour task is to find the area of the region which belongs to both given rectangles. This region is shaded in the picture.\n\nInput\n\nThe first line contains three integers w, h, α (1 ≤ w, h ≤ 106; 0 ≤ α ≤ 180). Angle α is given in degrees.\n\nOutput\n\nIn a single line print a real number — the area of the region which belongs to both given rectangles.\n\nThe answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.\n\nExamples\n\nInput\n\n1 1 45\n\n\nOutput\n\n0.828427125\n\n\nInput\n\n6 4 30\n\n\nOutput\n\n19.668384925\n\nNote\n\nThe second sample has been drawn on the picture above.\n\n### Input:\n6 4 30\n\n### Output:\n19.668384968\n\n\n### Input:\n1 1 45\n\n### Output:\n0.828427125\n\n\n### Code:\nfrom math import radians, cos, sin, atan2\n\ndef rotate(point, alpha):\n x = point[0]\n y = point[1]\n return (x * cos(alpha) - y * sin(alpha), x * sin(alpha) + y * cos(alpha))\n\ndef crs(a, b):\n return a[0] * b[1] - a[1] * b[0]\n\ndef m(end, start):\n return (end[0] - start[0], end[1] - start[1])\n\ndef area(poly):\n ret = 0\n n = len(poly)\n\n for i in range(n):\n j = (i + 1) % n\n ret += crs(poly[i], poly[j])\n\n return abs(ret) / 2.0\n\ndef intersect(a, b, c, d):\n r = crs(m(c, d), m(a, d)) * crs(m(c, d), m(b, d)) <= 0\n r &= crs(m(b, a), m(c, a)) * crs(m(b, a), m(d, a)) <= 0\n if not r:\n return None\n\n x1 = a[0]\n y1 = a[1]\n\n x2 = c[0]\n y2 = c[1]\n\n dx1 = b[0] - a[0]\n dx2 = d[0] - c[0]\n\n dy1 = b[1] - a[1]\n dy2 = d[1] - c[1]\n\n if dx2 * dy1 == dx1 * dy2:\n return None\n\n t = ((x1 - x2) * dy2 + (y2 - y1) * dx2) / (dx2 * dy1 - dx1 * dy2)\n return (x1 + t * dx1, y1 + t * dy1)\n\n\nw, h, alpha = map(int, input().split())\n\nif alpha == 0 or alpha == 180:\n print(w * h)\nelse:\n alpha = radians(alpha) \n pnt = []\n\n pnt.append((w / 2, h / 2))\n pnt.append((-w / 2, h / 2))\n pnt.append((-w / 2, -h / 2))\n pnt.append((w / 2, -h / 2))\n\n\n pnt2 = []\n for p in pnt:\n pnt2.append(rotate(p, alpha))\n\n pnt2.append(pnt2[0])\n pnt.append(pnt[0])\n\n points_total = []\n\n for st in range(4):\n for en in range(4):\n t = intersect(pnt[st], pnt[st + 1], pnt2[en], pnt2[en + 1])\n\n if t != None:\n points_total.append(t)\n\n points_total = sorted(points_total, key=lambda x: atan2(x[1], x[0]))\n\n print(area(points_total))\n"}}},{"rowIdx":5680,"cells":{"id":{"kind":"string","value":"32_A. Reconnaissance_26808"},"description":{"kind":"string","value":"According to the regulations of Berland's army, a reconnaissance unit should consist of exactly two soldiers. Since these two soldiers shouldn't differ much, their heights can differ by at most d centimeters. Captain Bob has n soldiers in his detachment. Their heights are a1, a2, ..., an centimeters. Some soldiers are of the same height. Bob wants to know, how many ways exist to form a reconnaissance unit of two soldiers from his detachment.\n\nWays (1, 2) and (2, 1) should be regarded as different.\n\nInput\n\nThe first line contains two integers n and d (1 ≤ n ≤ 1000, 1 ≤ d ≤ 109) — amount of soldiers in Bob's detachment and the maximum allowed height difference respectively. The second line contains n space-separated integers — heights of all the soldiers in Bob's detachment. These numbers don't exceed 109.\n\nOutput\n\nOutput one number — amount of ways to form a reconnaissance unit of two soldiers, whose height difference doesn't exceed d.\n\nExamples\n\nInput\n\n5 10\n10 20 50 60 65\n\n\nOutput\n\n6\n\n\nInput\n\n5 1\n55 30 29 31 55\n\n\nOutput\n\n6"},"code":{"kind":"string","value":"n, d = [int(i) for i in input().split()]\nS = sorted([int(i) for i in input().split()])\nk = 0\nfor i in range(n):\n for j in range(i+1, n):\n if(S[j]-S[i]<=d):\n k += 1\n else:\n break\nprint(k*2)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"5 1\\n55 30 29 31 55\\n\",\n \"5 10\\n10 20 50 60 65\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 412 372 5 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 822 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 337 18 189 570 177 29 54 855 171 205 291 299 935 620 180 114 358 88 292 118 400 218 537 369 60 683 192 13 537 59 824 264 191 3 300\\n\",\n \"10 4\\n11 6 76 49 28 20 57 152 5 32\\n\",\n \"7 100\\n19 1694 261 162 1 234 513\\n\",\n \"8 42\\n37 53 74 187 568 22 5 65\\n\",\n \"6 10\\n4 6 4 1 9 3\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 412 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 822 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 337 18 189 570 177 29 54 855 171 205 291 299 935 620 180 114 358 88 292 118 400 218 537 369 60 683 192 13 537 59 824 264 191 3 300\\n\",\n \"10 4\\n11 6 113 49 28 20 57 152 5 32\\n\",\n \"7 100\\n19 1694 238 162 1 234 513\\n\",\n \"8 57\\n37 53 74 187 568 22 5 65\\n\",\n \"6 10\\n4 3 4 1 9 3\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 412 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 822 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 205 291 299 935 620 180 114 358 88 292 118 400 218 537 369 60 683 192 13 537 59 824 264 191 3 300\\n\",\n \"10 4\\n11 6 113 49 28 25 57 152 5 32\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 412 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 822 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 289 291 299 935 620 180 114 358 88 292 118 400 218 537 369 60 683 192 13 537 59 824 264 191 3 300\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 412 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 289 291 299 935 620 180 114 358 88 292 118 400 218 537 369 60 683 192 13 537 59 824 264 191 3 300\\n\",\n \"5 1\\n24 30 17 31 76\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 289 291 299 935 620 180 114 358 88 292 118 400 218 537 369 54 683 192 13 537 59 824 264 191 3 300\\n\",\n \"10 4\\n11 8 81 49 28 25 57 37 7 32\\n\",\n \"5 1\\n24 30 18 9 76\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 289 291 299 935 620 180 114 358 88 292 118 400 218 537 369 54 683 192 13 537 59 824 264 191 3 300\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 289 291 563 935 620 180 114 358 88 292 118 400 218 537 369 54 683 192 13 537 59 824 264 191 3 300\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 118 400 218 537 369 54 683 192 13 537 59 824 264 191 3 300\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 118 400 218 537 369 101 683 192 13 537 59 824 264 191 3 300\\n\",\n \"7 110\\n8 3453 193 271 1 276 198\\n\",\n \"7 110\\n8 3453 309 271 1 276 198\\n\",\n \"100 100\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 118 400 218 537 369 101 683 192 13 0 59 824 264 191 4 300\\n\",\n \"100 100\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 13 0 59 824 264 191 4 300\\n\",\n \"100 100\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 13 0 59 824 264 191 4 300\\n\",\n \"100 100\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 129 663 326 254 78 1486 274 160 481 132 156 589 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 129 663 326 254 78 1486 274 160 481 132 156 589 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 129 663 326 254 78 1486 274 160 481 132 156 151 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 129 663 326 254 78 1486 400 160 481 132 156 151 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 129 663 326 254 92 1486 400 160 481 132 156 151 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 400 160 481 132 156 151 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 400 160 481 132 156 151 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 156 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 156 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 229 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 156 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 229 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 156 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 140 992 854 10 229 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 156 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 140 12 854 10 229 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 156 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 564 43 231 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 564 43 231 39 107 40 23 103 1281 171 310 382 770 288 18 39 570 177 29 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 564 43 231 39 107 40 23 103 1281 171 310 382 770 288 18 39 570 177 56 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 564 43 231 8 107 40 23 103 1281 171 310 382 770 288 18 39 570 177 56 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 564 43 231 8 107 40 23 25 1281 171 310 382 770 288 18 39 570 177 56 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 564 43 231 8 107 40 23 25 1281 73 310 382 770 288 18 39 570 177 56 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 569 584 43 231 8 107 40 23 25 1281 73 310 382 770 288 18 39 570 177 56 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 412 372 5 80 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 822 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 337 18 189 570 177 29 54 855 171 205 291 299 935 620 180 114 358 88 292 118 400 218 537 369 60 683 192 13 537 59 824 264 191 3 300\\n\",\n \"8 42\\n37 51 74 187 568 22 5 65\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 412 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 822 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 337 18 189 570 177 29 54 855 171 205 291 299 935 620 153 114 358 88 292 118 400 218 537 369 60 683 192 13 537 59 824 264 191 3 300\\n\",\n \"8 57\\n37 53 74 187 1051 22 5 104\\n\",\n \"5 1\\n55 30 29 31 76\\n\",\n \"5 10\\n10 37 50 60 65\\n\",\n \"7 100\\n19 1694 238 162 2 234 513\\n\",\n \"8 57\\n37 53 74 187 1051 22 5 65\\n\",\n \"6 10\\n4 3 4 2 9 3\\n\",\n \"5 1\\n17 30 29 31 76\\n\",\n \"5 10\\n0 37 50 60 65\\n\",\n \"10 4\\n11 6 113 49 28 25 57 152 7 32\\n\",\n \"7 100\\n19 3307 238 162 2 234 513\\n\",\n \"6 10\\n4 3 2 2 9 3\\n\",\n \"5 1\\n24 30 29 31 76\\n\",\n \"5 10\\n0 37 50 60 38\\n\",\n \"10 4\\n11 6 113 49 28 25 57 37 7 32\\n\",\n \"7 100\\n19 3307 238 271 2 234 513\\n\",\n \"6 10\\n4 3 0 2 9 3\\n\",\n \"5 10\\n-1 37 50 60 38\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 289 291 299 935 620 180 114 358 88 292 118 400 218 537 369 60 683 192 13 537 59 824 264 191 3 300\\n\",\n \"10 4\\n11 6 81 49 28 25 57 37 7 32\\n\",\n \"7 100\\n19 3307 193 271 2 234 513\\n\",\n \"5 1\\n24 30 18 31 76\\n\",\n \"5 10\\n-1 37 66 60 38\\n\",\n \"7 110\\n19 3307 193 271 2 234 513\\n\",\n \"10 4\\n11 8 115 49 28 25 57 37 7 32\\n\",\n \"7 110\\n19 3453 193 271 2 234 513\\n\",\n \"5 1\\n24 28 18 9 76\\n\",\n \"10 4\\n11 8 115 49 28 25 96 37 7 32\\n\",\n \"7 110\\n19 3453 193 271 2 276 513\\n\",\n \"5 1\\n24 28 18 7 76\\n\",\n \"10 4\\n11 8 115 49 23 25 96 37 7 32\\n\",\n \"7 110\\n19 3453 193 271 1 276 513\\n\",\n \"5 1\\n24 28 12 7 76\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 118 400 218 537 369 101 683 192 13 537 59 824 264 191 3 300\\n\",\n \"10 4\\n11 8 115 49 23 25 96 70 7 32\\n\",\n \"7 110\\n8 3453 193 271 1 276 513\\n\",\n \"5 1\\n24 28 12 14 76\\n\",\n \"5 1\\n24 28 17 14 76\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 118 400 218 537 369 101 683 192 13 0 59 824 264 191 3 300\\n\",\n \"5 1\\n24 28 2 14 76\\n\",\n \"100 100\\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 539 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 79 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 118 400 218 537 369 101 683 192 13 0 59 824 264 191 4 300\\n\",\n \"7 110\\n8 3453 443 271 1 276 198\\n\",\n \"100 100\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 7 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 100\\n6 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 589 372 3 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 643 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 563 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 14 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 400 160 481 132 156 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 634 118 436 140 992 854 10 163 134 103 940 30 409 1003 564 43 555 39 107 40 23 103 1281 171 310 382 770 288 18 189 570 177 29 54 855 171 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 436 14 12 854 10 229 134 103 940 30 409 1003 584 43 231 8 107 40 23 25 1281 73 310 382 770 288 18 39 570 177 56 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"100 110\\n6 93 101 960 2 477 213 95 663 326 254 92 1486 597 160 481 132 64 256 372 6 57 210 298 1771 7 359 468 254 406 202 929 221 366 552 97 27 29 634 118 419 14 12 854 10 229 134 103 940 30 409 569 584 43 231 8 107 40 23 25 1281 73 310 382 770 288 18 39 570 177 56 54 855 144 451 291 1056 935 620 180 114 358 88 292 18 400 218 537 369 101 683 192 27 0 59 824 264 191 4 300\\n\",\n \"10 4\\n11 6 76 49 28 20 57 152 5 49\\n\",\n \"7 000\\n19 1694 261 162 1 234 513\\n\",\n \"6 10\\n5 6 4 1 9 3\\n\",\n \"5 1\\n55 30 29 31 4\\n\"\n ],\n \"output\": [\n \"6\\n\",\n \"6\\n\",\n \"2404\\n\",\n \"4\\n\",\n \"8\\n\",\n \"20\\n\",\n \"30\\n\",\n \"2404\\n\",\n \"4\\n\",\n \"8\\n\",\n \"26\\n\",\n \"30\\n\",\n \"2410\\n\",\n \"6\\n\",\n \"2392\\n\",\n \"2406\\n\",\n \"2\\n\",\n \"2400\\n\",\n \"10\\n\",\n \"0\\n\",\n \"2398\\n\",\n \"2388\\n\",\n \"2372\\n\",\n \"2386\\n\",\n \"14\\n\",\n \"12\\n\",\n \"2384\\n\",\n \"2364\\n\",\n \"2350\\n\",\n \"2352\\n\",\n \"2554\\n\",\n \"2530\\n\",\n \"2532\\n\",\n \"2558\\n\",\n \"2538\\n\",\n \"2588\\n\",\n \"2572\\n\",\n \"2580\\n\",\n \"2592\\n\",\n \"2596\\n\",\n \"2560\\n\",\n \"2544\\n\",\n \"2552\\n\",\n \"2594\\n\",\n \"2648\\n\",\n \"2644\\n\",\n \"2654\\n\",\n \"2684\\n\",\n \"2690\\n\",\n \"2694\\n\",\n \"2688\\n\",\n \"2668\\n\",\n \"2692\\n\",\n \"2704\\n\",\n \"2416\\n\",\n \"20\\n\",\n \"2408\\n\",\n \"22\\n\",\n \"4\\n\",\n \"4\\n\",\n \"8\\n\",\n \"26\\n\",\n \"30\\n\",\n \"4\\n\",\n \"4\\n\",\n \"8\\n\",\n \"8\\n\",\n \"30\\n\",\n \"4\\n\",\n \"4\\n\",\n \"8\\n\",\n \"8\\n\",\n \"30\\n\",\n \"4\\n\",\n \"2404\\n\",\n \"8\\n\",\n \"8\\n\",\n \"2\\n\",\n \"4\\n\",\n \"8\\n\",\n \"10\\n\",\n \"8\\n\",\n \"0\\n\",\n \"10\\n\",\n \"8\\n\",\n \"0\\n\",\n \"8\\n\",\n \"8\\n\",\n \"0\\n\",\n \"2392\\n\",\n \"8\\n\",\n \"8\\n\",\n \"0\\n\",\n \"0\\n\",\n \"2400\\n\",\n \"0\\n\",\n \"2400\\n\",\n \"8\\n\",\n \"2350\\n\",\n \"2350\\n\",\n \"2580\\n\",\n \"2692\\n\",\n \"2704\\n\",\n \"4\\n\",\n \"0\\n\",\n \"30\\n\",\n \"4\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nAccording to the regulations of Berland's army, a reconnaissance unit should consist of exactly two soldiers. Since these two soldiers shouldn't differ much, their heights can differ by at most d centimeters. Captain Bob has n soldiers in his detachment. Their heights are a1, a2, ..., an centimeters. Some soldiers are of the same height. Bob wants to know, how many ways exist to form a reconnaissance unit of two soldiers from his detachment.\n\nWays (1, 2) and (2, 1) should be regarded as different.\n\nInput\n\nThe first line contains two integers n and d (1 ≤ n ≤ 1000, 1 ≤ d ≤ 109) — amount of soldiers in Bob's detachment and the maximum allowed height difference respectively. The second line contains n space-separated integers — heights of all the soldiers in Bob's detachment. These numbers don't exceed 109.\n\nOutput\n\nOutput one number — amount of ways to form a reconnaissance unit of two soldiers, whose height difference doesn't exceed d.\n\nExamples\n\nInput\n\n5 10\n10 20 50 60 65\n\n\nOutput\n\n6\n\n\nInput\n\n5 1\n55 30 29 31 55\n\n\nOutput\n\n6\n\n### Input:\n5 1\n55 30 29 31 55\n\n### Output:\n6\n\n\n### Input:\n5 10\n10 20 50 60 65\n\n### Output:\n6\n\n\n### Code:\nn, d = [int(i) for i in input().split()]\nS = sorted([int(i) for i in input().split()])\nk = 0\nfor i in range(n):\n for j in range(i+1, n):\n if(S[j]-S[i]<=d):\n k += 1\n else:\n break\nprint(k*2)"}}},{"rowIdx":5681,"cells":{"id":{"kind":"string","value":"397_B. On Corruption and Numbers_26816"},"description":{"kind":"string","value":"Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants to get. At school, he had bad grades in all subjects, and it's only thanks to wealthy parents that he was able to obtain the graduation certificate.\n\nThe situation is complicated by the fact that each high education institution has the determined amount of voluntary donations, paid by the new students for admission — ni berubleys. He cannot pay more than ni, because then the difference between the paid amount and ni can be regarded as a bribe!\n\nEach rector is wearing the distinctive uniform of his university. Therefore, the uniform's pockets cannot contain coins of denomination more than ri. The rector also does not carry coins of denomination less than li in his pocket — because if everyone pays him with so small coins, they gather a lot of weight and the pocket tears. Therefore, a donation can be paid only by coins of denomination x berubleys, where li ≤ x ≤ ri (Berland uses coins of any positive integer denomination). Alexey can use the coins of different denominations and he can use the coins of the same denomination any number of times. When Alexey was first confronted with such orders, he was puzzled because it turned out that not all universities can accept him! Alexey is very afraid of going into the army (even though he had long wanted to get the green uniform, but his dad says that the army bullies will beat his son and he cannot pay to ensure the boy's safety). So, Alexey wants to know for sure which universities he can enter so that he could quickly choose his alma mater.\n\nThanks to the parents, Alexey is not limited in money and we can assume that he has an unlimited number of coins of each type.\n\nIn other words, you are given t requests, each of them contains numbers ni, li, ri. For each query you need to answer, whether it is possible to gather the sum of exactly ni berubleys using only coins with an integer denomination from li to ri berubleys. You can use coins of different denominations. Coins of each denomination can be used any number of times.\n\nInput\n\nThe first line contains the number of universities t, (1 ≤ t ≤ 1000) Each of the next t lines contain three space-separated integers: ni, li, ri (1 ≤ ni, li, ri ≤ 109; li ≤ ri).\n\nOutput\n\nFor each query print on a single line: either \"Yes\", if Alexey can enter the university, or \"No\" otherwise.\n\nExamples\n\nInput\n\n2\n5 2 3\n6 4 5\n\n\nOutput\n\nYes\nNo\n\nNote\n\nYou can pay the donation to the first university with two coins: one of denomination 2 and one of denomination 3 berubleys. The donation to the second university cannot be paid."},"code":{"kind":"string","value":"t = int(input())\nfor _ in range(t):\n n, l, r = map(int, input().split())\n print(\"No\" if n // l * r < n else \"Yes\")"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"2\\n5 2 3\\n6 4 5\\n\",\n \"50\\n69 6 6\\n22 1 1\\n23 3 3\\n60 13 13\\n13 3 3\\n7 4 7\\n6 1 1\\n49 7 9\\n68 8 8\\n20 2 2\\n34 1 1\\n79 5 5\\n22 1 1\\n77 58 65\\n10 3 3\\n72 5 5\\n47 1 1\\n82 3 3\\n92 8 8\\n34 1 1\\n42 9 10\\n63 14 14\\n10 3 3\\n38 2 2\\n80 6 6\\n79 5 5\\n53 5 5\\n44 7 7\\n85 2 2\\n24 2 2\\n57 3 3\\n95 29 81\\n77 6 6\\n24 1 1\\n33 4 4\\n93 6 6\\n55 22 28\\n91 14 14\\n7 1 1\\n16 1 1\\n20 3 3\\n43 3 3\\n53 3 3\\n49 3 3\\n52 5 5\\n2 1 1\\n60 5 5\\n76 57 68\\n67 3 3\\n61 52 61\\n\",\n \"2\\n5 2 3\\n6 4 10\\n\",\n \"50\\n69 6 6\\n22 1 1\\n23 3 3\\n60 13 13\\n13 3 3\\n7 4 7\\n6 1 1\\n49 7 9\\n68 8 8\\n20 2 2\\n34 1 1\\n79 5 5\\n22 1 1\\n77 58 65\\n10 3 3\\n72 5 5\\n47 1 1\\n82 3 3\\n92 8 8\\n34 1 1\\n42 9 10\\n63 14 14\\n10 3 3\\n38 2 2\\n80 6 6\\n79 5 5\\n53 5 5\\n44 7 7\\n85 2 2\\n24 2 2\\n57 3 3\\n95 29 145\\n77 6 6\\n24 1 1\\n33 4 4\\n93 6 6\\n55 22 28\\n91 14 14\\n7 1 1\\n16 1 1\\n20 3 3\\n43 3 3\\n53 3 3\\n49 3 3\\n52 5 5\\n2 1 1\\n60 5 5\\n76 57 68\\n67 3 3\\n61 52 61\\n\",\n \"2\\n5 3 3\\n6 4 10\\n\",\n \"2\\n5 2 3\\n6 7 10\\n\",\n \"2\\n5 3 4\\n9 4 4\\n\",\n \"50\\n69 6 6\\n22 1 1\\n23 3 3\\n60 13 13\\n13 3 3\\n7 4 7\\n6 1 1\\n49 7 9\\n68 8 8\\n20 2 2\\n34 1 1\\n79 5 5\\n22 1 1\\n77 58 65\\n10 3 3\\n72 5 5\\n47 1 1\\n82 3 3\\n92 8 8\\n34 1 1\\n42 9 10\\n63 14 14\\n10 3 3\\n38 2 2\\n113 6 6\\n79 5 5\\n53 5 5\\n44 7 7\\n85 2 2\\n24 2 2\\n57 3 3\\n95 29 81\\n13 6 6\\n24 1 1\\n33 4 4\\n93 6 6\\n58 22 28\\n91 14 14\\n7 1 1\\n16 1 1\\n20 3 3\\n43 3 3\\n53 3 3\\n49 3 3\\n52 5 5\\n2 1 1\\n60 5 5\\n76 57 68\\n67 3 3\\n61 52 61\\n\",\n \"50\\n69 6 6\\n22 1 1\\n23 3 3\\n60 13 13\\n13 3 3\\n7 4 7\\n6 1 1\\n49 7 9\\n68 8 8\\n20 2 2\\n34 1 1\\n79 5 5\\n22 1 1\\n77 58 65\\n10 3 3\\n72 5 5\\n47 1 1\\n82 3 3\\n92 2 8\\n34 1 1\\n42 9 10\\n63 14 14\\n10 3 3\\n38 2 2\\n113 6 6\\n79 5 5\\n53 5 5\\n44 7 7\\n85 2 2\\n24 2 2\\n57 3 3\\n95 29 81\\n13 6 6\\n24 1 1\\n33 4 4\\n93 6 6\\n58 22 28\\n91 14 14\\n7 1 1\\n16 1 1\\n20 3 3\\n43 3 3\\n53 3 3\\n49 3 3\\n52 5 5\\n2 1 1\\n60 5 5\\n76 57 68\\n67 3 3\\n61 52 61\\n\",\n \"2\\n5 2 3\\n9 4 10\\n\",\n \"2\\n5 2 3\\n9 4 7\\n\",\n \"2\\n5 2 3\\n9 4 13\\n\",\n \"2\\n5 2 4\\n9 4 10\\n\",\n \"2\\n5 2 3\\n1 4 7\\n\",\n \"2\\n5 2 3\\n9 3 13\\n\",\n \"2\\n5 2 3\\n6 3 10\\n\",\n \"2\\n5 2 4\\n9 4 4\\n\",\n \"2\\n5 2 4\\n1 4 7\\n\",\n \"2\\n5 2 3\\n7 3 13\\n\",\n \"2\\n5 4 4\\n1 4 7\\n\",\n \"2\\n5 2 3\\n7 4 13\\n\",\n \"2\\n5 3 4\\n9 4 5\\n\",\n \"2\\n5 4 6\\n1 4 7\\n\",\n \"2\\n5 2 3\\n7 6 13\\n\",\n \"2\\n5 3 4\\n9 1 5\\n\",\n \"2\\n2 2 3\\n7 6 13\\n\",\n \"2\\n2 2 2\\n7 6 13\\n\",\n \"50\\n69 6 6\\n22 1 1\\n23 3 3\\n60 13 13\\n13 3 3\\n7 4 7\\n6 1 1\\n49 7 9\\n68 8 8\\n20 2 2\\n34 1 1\\n79 5 5\\n22 1 1\\n77 58 65\\n10 3 3\\n72 5 5\\n47 1 1\\n82 3 3\\n92 8 8\\n34 1 1\\n42 9 10\\n63 14 14\\n10 3 3\\n38 2 2\\n113 6 6\\n79 5 5\\n53 5 5\\n44 7 7\\n85 2 2\\n24 2 2\\n57 3 3\\n95 29 81\\n77 6 6\\n24 1 1\\n33 4 4\\n93 6 6\\n55 22 28\\n91 14 14\\n7 1 1\\n16 1 1\\n20 3 3\\n43 3 3\\n53 3 3\\n49 3 3\\n52 5 5\\n2 1 1\\n60 5 5\\n76 57 68\\n67 3 3\\n61 52 61\\n\",\n \"2\\n5 2 5\\n6 4 5\\n\",\n \"2\\n3 2 3\\n9 4 10\\n\",\n \"2\\n5 2 3\\n10 4 13\\n\",\n \"50\\n69 6 6\\n22 1 1\\n23 3 3\\n60 13 13\\n13 3 3\\n7 4 7\\n6 1 1\\n49 7 9\\n68 8 8\\n20 2 2\\n34 1 1\\n143 5 5\\n22 1 1\\n77 58 65\\n10 3 3\\n72 5 5\\n47 1 1\\n82 3 3\\n92 8 8\\n34 1 1\\n42 9 10\\n63 14 14\\n10 3 3\\n38 2 2\\n80 6 6\\n79 5 5\\n53 5 5\\n44 7 7\\n85 2 2\\n24 2 2\\n57 3 3\\n95 29 145\\n77 6 6\\n24 1 1\\n33 4 4\\n93 6 6\\n55 22 28\\n91 14 14\\n7 1 1\\n16 1 1\\n20 3 3\\n43 3 3\\n53 3 3\\n49 3 3\\n52 5 5\\n2 1 1\\n60 5 5\\n76 57 68\\n67 3 3\\n61 52 61\\n\",\n \"2\\n5 2 5\\n6 7 10\\n\",\n \"2\\n5 2 4\\n9 4 6\\n\",\n \"2\\n5 2 3\\n11 3 13\\n\",\n \"2\\n5 2 3\\n6 3 3\\n\",\n \"2\\n4 2 4\\n9 4 4\\n\",\n \"2\\n5 2 3\\n7 3 15\\n\",\n \"2\\n5 3 3\\n9 4 4\\n\",\n \"2\\n5 4 4\\n2 4 7\\n\",\n \"2\\n5 2 3\\n7 8 13\\n\",\n \"2\\n5 4 6\\n1 4 8\\n\",\n \"2\\n9 2 3\\n7 6 13\\n\",\n \"2\\n5 3 4\\n9 2 5\\n\",\n \"2\\n3 2 3\\n7 6 13\\n\",\n \"2\\n2 2 4\\n7 6 13\\n\",\n \"50\\n69 6 6\\n22 1 1\\n23 3 3\\n60 13 13\\n13 3 3\\n7 4 7\\n6 1 1\\n49 7 9\\n68 8 8\\n20 2 2\\n34 1 1\\n79 5 5\\n22 1 1\\n77 58 65\\n10 3 3\\n72 5 5\\n47 1 1\\n82 3 3\\n92 8 8\\n34 1 1\\n42 9 10\\n63 14 14\\n10 3 3\\n38 2 2\\n113 6 6\\n79 5 5\\n53 5 5\\n44 7 7\\n85 2 2\\n24 2 2\\n57 3 3\\n95 29 81\\n13 6 6\\n24 1 1\\n33 4 4\\n93 6 6\\n55 22 28\\n91 14 14\\n7 1 1\\n16 1 1\\n20 3 3\\n43 3 3\\n53 3 3\\n49 3 3\\n52 5 5\\n2 1 1\\n60 5 5\\n76 57 68\\n67 3 3\\n61 52 61\\n\",\n \"2\\n5 2 5\\n6 4 9\\n\",\n \"2\\n5 2 3\\n19 4 13\\n\",\n \"2\\n5 1 5\\n6 7 10\\n\",\n \"2\\n5 2 4\\n9 4 11\\n\",\n \"2\\n7 2 3\\n11 3 13\\n\",\n \"2\\n4 2 4\\n2 4 4\\n\",\n \"2\\n5 2 3\\n7 3 18\\n\",\n \"2\\n5 3 3\\n4 4 4\\n\",\n \"2\\n5 4 6\\n2 4 7\\n\",\n \"2\\n5 4 6\\n1 4 16\\n\",\n \"2\\n9 2 3\\n7 6 10\\n\",\n \"2\\n5 3 4\\n9 2 10\\n\",\n \"2\\n2 2 4\\n7 6 9\\n\",\n \"2\\n10 2 5\\n6 4 9\\n\",\n \"2\\n5 2 3\\n23 4 13\\n\",\n \"2\\n5 1 4\\n6 7 10\\n\",\n \"2\\n8 2 4\\n9 4 11\\n\",\n \"2\\n4 2 4\\n2 4 5\\n\",\n \"2\\n5 2 3\\n4 3 18\\n\",\n \"2\\n9 2 3\\n7 7 10\\n\",\n \"2\\n5 3 4\\n9 1 10\\n\",\n \"2\\n2 4 4\\n7 6 9\\n\"\n ],\n \"output\": [\n \"Yes\\nNo\\n\",\n \"No\\nYes\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nYes\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nYes\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nYes\\n\",\n \"No\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"No\\nNo\\n\",\n \"No\\nYes\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nYes\\n\",\n \"No\\nYes\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nYes\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nYes\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nYes\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nNo\\n\",\n \"No\\nNo\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nYes\\nNo\\nYes\\nNo\\nNo\\nYes\\nNo\\nYes\\nYes\\nNo\\nNo\\nNo\\nNo\\nNo\\nYes\\nYes\\nNo\\nNo\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nNo\\n\",\n \"Yes\\nYes\\n\",\n \"Yes\\nYes\\n\",\n \"No\\nYes\\n\",\n \"No\\nYes\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nAlexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants to get. At school, he had bad grades in all subjects, and it's only thanks to wealthy parents that he was able to obtain the graduation certificate.\n\nThe situation is complicated by the fact that each high education institution has the determined amount of voluntary donations, paid by the new students for admission — ni berubleys. He cannot pay more than ni, because then the difference between the paid amount and ni can be regarded as a bribe!\n\nEach rector is wearing the distinctive uniform of his university. Therefore, the uniform's pockets cannot contain coins of denomination more than ri. The rector also does not carry coins of denomination less than li in his pocket — because if everyone pays him with so small coins, they gather a lot of weight and the pocket tears. Therefore, a donation can be paid only by coins of denomination x berubleys, where li ≤ x ≤ ri (Berland uses coins of any positive integer denomination). Alexey can use the coins of different denominations and he can use the coins of the same denomination any number of times. When Alexey was first confronted with such orders, he was puzzled because it turned out that not all universities can accept him! Alexey is very afraid of going into the army (even though he had long wanted to get the green uniform, but his dad says that the army bullies will beat his son and he cannot pay to ensure the boy's safety). So, Alexey wants to know for sure which universities he can enter so that he could quickly choose his alma mater.\n\nThanks to the parents, Alexey is not limited in money and we can assume that he has an unlimited number of coins of each type.\n\nIn other words, you are given t requests, each of them contains numbers ni, li, ri. For each query you need to answer, whether it is possible to gather the sum of exactly ni berubleys using only coins with an integer denomination from li to ri berubleys. You can use coins of different denominations. Coins of each denomination can be used any number of times.\n\nInput\n\nThe first line contains the number of universities t, (1 ≤ t ≤ 1000) Each of the next t lines contain three space-separated integers: ni, li, ri (1 ≤ ni, li, ri ≤ 109; li ≤ ri).\n\nOutput\n\nFor each query print on a single line: either \"Yes\", if Alexey can enter the university, or \"No\" otherwise.\n\nExamples\n\nInput\n\n2\n5 2 3\n6 4 5\n\n\nOutput\n\nYes\nNo\n\nNote\n\nYou can pay the donation to the first university with two coins: one of denomination 2 and one of denomination 3 berubleys. The donation to the second university cannot be paid.\n\n### Input:\n2\n5 2 3\n6 4 5\n\n### Output:\nYes\nNo\n\n\n### Input:\n50\n69 6 6\n22 1 1\n23 3 3\n60 13 13\n13 3 3\n7 4 7\n6 1 1\n49 7 9\n68 8 8\n20 2 2\n34 1 1\n79 5 5\n22 1 1\n77 58 65\n10 3 3\n72 5 5\n47 1 1\n82 3 3\n92 8 8\n34 1 1\n42 9 10\n63 14 14\n10 3 3\n38 2 2\n80 6 6\n79 5 5\n53 5 5\n44 7 7\n85 2 2\n24 2 2\n57 3 3\n95 29 81\n77 6 6\n24 1 1\n33 4 4\n93 6 6\n55 22 28\n91 14 14\n7 1 1\n16 1 1\n20 3 3\n43 3 3\n53 3 3\n49 3 3\n52 5 5\n2 1 1\n60 5 5\n76 57 68\n67 3 3\n61 52 61\n\n### Output:\nNo\nYes\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\nNo\nYes\nNo\nNo\nYes\nNo\nNo\nNo\nYes\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nYes\nNo\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nNo\nNo\nNo\nYes\nYes\nNo\nNo\nYes\n\n\n### Code:\nt = int(input())\nfor _ in range(t):\n n, l, r = map(int, input().split())\n print(\"No\" if n // l * r < n else \"Yes\")"}}},{"rowIdx":5682,"cells":{"id":{"kind":"string","value":"41_C. Email address_26820"},"description":{"kind":"string","value":"Sometimes one has to spell email addresses over the phone. Then one usually pronounces a dot as dot, an at sign as at. As a result, we get something like vasyaatgmaildotcom. Your task is to transform it into a proper email address (vasya@gmail.com). \n\nIt is known that a proper email address contains only such symbols as . @ and lower-case Latin letters, doesn't start with and doesn't end with a dot. Also, a proper email address doesn't start with and doesn't end with an at sign. Moreover, an email address contains exactly one such symbol as @, yet may contain any number (possible, zero) of dots. \n\nYou have to carry out a series of replacements so that the length of the result was as short as possible and it was a proper email address. If the lengths are equal, you should print the lexicographically minimal result. \n\nOverall, two variants of replacement are possible: dot can be replaced by a dot, at can be replaced by an at. \n\nInput\n\nThe first line contains the email address description. It is guaranteed that that is a proper email address with all the dots replaced by dot an the at signs replaced by at. The line is not empty and its length does not exceed 100 symbols.\n\nOutput\n\nPrint the shortest email address, from which the given line could be made by the described above replacements. If there are several solutions to that problem, print the lexicographically minimal one (the lexicographical comparison of the lines are implemented with an operator < in modern programming languages).\n\nIn the ASCII table the symbols go in this order: . @ ab...z\n\nExamples\n\nInput\n\nvasyaatgmaildotcom\n\n\nOutput\n\nvasya@gmail.com\n\n\nInput\n\ndotdotdotatdotdotat\n\n\nOutput\n\ndot..@..at\n\n\nInput\n\naatt\n\n\nOutput\n\na@t"},"code":{"kind":"string","value":"a = input()\nb = ''\nif a[0] + a[1] + a[2] == 'dot':\n b += 'dot'\n i = 3\nelif a[0] + a[1] == 'at':\n b += 'at'\n i = 2\nelse:\n i = 0\nat = 0\nwhile i < len(a) - 3:\n if a[i] == 'd' and a[i + 1] == 'o' and a[i + 2] == 't':\n b += '.'\n i += 3\n elif a[i] == 'a' and a[i + 1] == 't' and at == 0:\n b += '@'\n at = 1\n i += 2\n else:\n b += a[i]\n i += 1\nif a[i] + a[-1] == 'at' and at == 0:\n b += '@'\n b += a[i + 2]\nelse:\n for j in range(i, len(a)):\n b += a[j]\nprint(b)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"vasyaatgmaildotcom\\n\",\n \"aatt\\n\",\n \"dotdotdotatdotdotat\\n\",\n \"dotdotdotdotdotdotdotdotdotdotdotdoatdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdot\\n\",\n \"zdotdotatdotz\\n\",\n \"hatatatdotcatqatdotwhvdotatdotsatattatatcdotddotdotvasatdottxdotatatdotatmdotvvatkatdotxatcdotdotzsx\\n\",\n \"dotatdotat\\n\",\n \"dotdotatat\\n\",\n \"edotdotdotsatoatedotatpdotatatfatpmdotdotdotatyatdotzjdoteuldotdottatdotatmtidotdotdotadotratqisat\\n\",\n \"attdotdotatdotzsedotdotatcyatdotpndotdotdotatuwatatatatatwdotdotqsatatrqatatsatqndotjcdotatnatxatoq\\n\",\n \"dotdotdotdotdatotdotdotdotatdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdot\\n\",\n \"atatatdot\\n\",\n \"atdotatdot\\n\",\n \"zdotatdotatatatiatdotrdotatatcatatatdotatmaatdottatatcmdotdotatdotatdotdottnuatdotfatatdotnathdota\\n\",\n \"dotdotdotdotdotdotdotdotdotdotdotdotdotatdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdot\\n\",\n \"atatat\\n\",\n \"dotatatdot\\n\",\n \"dotatatat\\n\",\n \"jdotypatdotatqatdothdotdqatadotkdotodotdotatdotdotdotdotdottdotdotatatatdotzndotodotdotkdotfdotatat\\n\",\n \"xatvdotrjatatatdotatatdotdotdotdotndothidotatdotdotdotqyxdotdotatdotdotdotdotdotdotduatgdotdotaatdot\\n\",\n \"atatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatat\\n\",\n \"sdfuiopguoidfbhuihsregftuioheguodpsfhgvuherasuihfsduphguatwruheruopsghuiofhbvjudfbdpiuthrupwrkgfhdat\\n\",\n \"atdotatat\\n\",\n \"dotdotdotdotatdotatatatdotdotdot\\n\",\n \"batatatgldotatatpatsatrdotatjdotatdotatfndotdotatzatuatrdotxiwatvhdatdatsyatatatratatxdothdotadotaty\\n\",\n \"dotatat\\n\",\n \"hmatcxatxatdotatlyucjatdothatdotcatatatdotqatatdotdotdotdotatjddotdotdotqdotdotattdotdotatddotatatat\\n\",\n \"atodotdotatdotatdotvpndotatdotatdotadotatdotattnysatqdotatdotdotsdotcmdotdotdotdotywateatdotatgsdot\\n\",\n \"dotatjdotqcratqatidotatdotudotqulatdotdotdotatatdotdotdotdotdotatatdotdotatdotdotdotymdotdotwvdotat\\n\",\n \"xqbdotatuatatdotatatatidotdotdotbatpdotdotatatatdotatbptatdotatigdotdotdotdotatatatatatdotdotdotdotl\\n\",\n \"doatdt\\n\",\n \"dotkatudotatdotatatwlatiwatatdotwdotatcdotatdotatatatdotdotidotdotbatldotoxdotatdotdotudotdotvatatat\\n\",\n \"sdfuiopguoidfbhuihsregftuioheguoatsfhgvuherasuihfsduphguphewruheruopsghuiofhbvjudfbdpiuthrupwrkgfhda\\n\",\n \"dotatdotatvdotjatatjsdotdotdotatsdotatatcdotatldottrdotoctvhatdotdotxeatdotfatdotratdotatfatatatdot\\n\",\n \"atdotatsatatiatatnatudotdotdotatdotdotddotdotdotwatxdotdotdotdotdoteatatfattatatdotatatdotidotzkvnat\\n\",\n \"dotatatcdotxdotatgatatatkqdotrspatdotatodotqdotbdotdotnndotatatgatatudotdotatlatatdotatbjdotdotatdot\\n\",\n \"dotatdot\\n\",\n \"dotdotdotdotatdotatdoteatdotatatatatatneatatdotmdotdotatsatdotdotdotndotatjatdotatdotdotatatdotdotgp\\n\",\n \"atatdotat\\n\",\n \"atdotpgatgnatatatdotfoatdotatwatdotatmdotdotdotjnhatatdotatatdotatpdotatadotatatdotdotdotatdotdotdot\\n\",\n \"atatdot\\n\",\n \"dotdotatdot\\n\",\n \"atatatat\\n\",\n \"atcatiatdotncbdotatedotatoiataatydotoatihzatdotdotcatkdotdotudotodotxatatatatdotatdotnhdotdotatatat\\n\",\n \"taatta\\n\",\n \"dotdotatlatnatdotjatxdotdotdotudotcdotdotatdotgdotatdotatdotatdotsatatcdatzhatdotatkdotbmidotdotudot\\n\",\n \"atatdotdot\\n\",\n \"dotatdotdot\\n\",\n \"atdotdotatatdottatdotatatatatdotdotdotatdotdotatucrdotdotatatdotdatatatusgdatatdotatdotdotpdotatdot\\n\",\n \"dotxcdotdottdotdotatdotybdotqdotatdotatdotatatpndotljethatdotdotlrdotdotdottgdotgkdotkatatdotdotzat\\n\",\n \"catdotdotdotatatdotdotdotnatjdotatdotdotdoteatatoatatatoatatatdotdotatdotdotwxrdotatfatgfdotuatata\\n\",\n \"fatdotatdotydotatdotdotatdotdotdottatatdotdotatdotatatdotatadotdotqdotatatatidotdotatkecdotdotatdot\\n\",\n \"ztodtatodtodz\\n\",\n \"hatatatdotcatqatdotwhvdotatdotsatattatatcdotddotdotvasatdottxdotatatdotatmdosvvatkatdotxatcdotdotztx\\n\",\n \"douatdotat\\n\",\n \"cotdotatat\\n\",\n \"edotdotdotsatoatedotatpdotatatfatpmdotdotdotatyatdotzjdoteuldstdottatdotatmtidotdotdotadotratqioat\\n\",\n \"attdotdotatdotzsedotdotatcyatdotpndotdotdotatuwatatatatatwdotdotqsatatrqatatsatqmdotjcdotatnatxatoq\\n\",\n \"todtatata\\n\",\n \"atcotatdot\\n\",\n \"ztotatdotatatatiatdotrdotatatcatatatdotatmaaddottatatcmdotdotatdotatdotdottnuatdotfatatdotnathdota\\n\",\n \"dotdotdotdotdotdotdotdoddotdotdotdotdotatdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdottot\\n\",\n \"cotatatdot\\n\",\n \"douatatat\\n\",\n \"jdotypatdotatqatdothdotdqataeotkdotodotdotatdotdotdotdotdottdotdotatatatdotzndotodotdotkdotfdotatat\\n\",\n \"xbtvdotrjatatatdotatatdotdotdotdotndothidotatdotdotdotqyxdotdotatdotdotdotdotdotdotduatgdotdotaatdot\\n\",\n \"sdfuiopguoidfbhuihsregituioheguodpsfhgvuherasuihfsduphguatwruheruopsghuiofhbvjudfbdpfuthrupwrkgfhdat\\n\",\n \"dotdotdotdotasdotatatatdotdotdot\\n\",\n \"ytatodatodhtodxtatartatataystadtadhvtawixtodrtautaztatodtodnftatodtatodjtatodrtastaptatatodlgtatatab\\n\",\n \"hmatcxatxatdotatlyucjatdothatdotcatatatdotqatatdotdotdotdotatjddotdotdotqdotdotattdotdntatddotatatat\\n\",\n \"dotaajdotqcratqatidotatdotudotqulatdotdotdotatatdotdotdotdotdotatttdotdotatdotdotdotymdotdotwvdotat\\n\",\n \"xqbdotatuatatdotatatatidotdotdotbatpdotdotatatatdotatbptatdptatigdotdotdotdotatatatatatdotdotdotdotl\\n\",\n \"eoatdt\\n\",\n \"sdfuiopguoidfbhuihsrdgftuioheguoatsfhgvuherasuihfsduphguphewruheruopsghuiofhbvjudfbdpiuthrupwrkgfhda\\n\",\n \"dotatdotatvdotjatatjsdotdotdotatsdotatatcdotatldoturdotoctvhatdotdotxeatdotfatdotratdotatfatatatdot\\n\",\n \"dotatatcdotxdotatgatatatkqdotrspatdotatodotqdotbdotdotnndotatatgatatudotdotatlatatdotatbjdntdotatdot\\n\",\n \"dotatdou\\n\",\n \"dotdotdotdotatdotatdoteatdotatatatatatneatatdotmdotdotatsatdotdotdotndotatjatdouatdotdotatatdotdotgp\\n\",\n \"tatodtata\\n\",\n \"atdotpgatgnatatatdotfoatdotatwatdotatmdotdotdotjnhatatdotatatdotaupdotatadotatatdotdotdotatdotdotdot\\n\",\n \"atasatat\\n\",\n \"tatatatodtodhntodtatodtatatataxtodotodutodtodktactodtodtazhitaotodytaataiotatodetatodbcntodtaitacta\\n\",\n \"taatua\\n\",\n \"dotdotatlatnatdotjatxdotdotdotudptcdotdotatdotgdotatdotatdotatdotsatatcdatzhatdotatkdotbmidotdotudot\\n\",\n \"dotatdodtot\\n\",\n \"atdotdotatatdottatdotatatatatdotdntdotatdotdotatucrdotdotatatdotdatatatusgdatatdotatdotdotpdotatdot\\n\",\n \"dotxcdotdottdotdotatdotybdotqdotatdotatdotatatpndotljethatdotdotlrdotdotdottgaotgkdotkdtatdotdotzat\\n\",\n \"catdotdotdotatatdotdotdotnatjeotatdotdotdoteatatoatatatoatatatdotdotatdotdotwxrdotatfatgfdotuatata\\n\",\n \"todtatodtodcektatodtoditatatatodqtodtodatatodtatatodtatodtodtatattodtodtodtatodtodtatodytodtatodtaf\\n\",\n \"dotdotdotatdotdotas\\n\",\n \"hatatatdotcatqatdotwhvdotatdotsatattatatcdotddotdottasatdottxdotatatdotatmdosvvatkatdotxavcdotdotztx\\n\",\n \"totdotatac\\n\",\n \"edotdotdotsatoatedotatpdotatatfatpmdotdoudotatyatdotzjdoteuldstdottatdotatmtidotdotdotadotratqioat\\n\",\n \"qotaxtantatodcjtodmqtastataqrtatasqtodtodwtatatatatawutatodtodtodnptodtayctatodtodesztodtatodtodtta\\n\",\n \"tndtatata\\n\",\n \"adcotattot\\n\",\n \"ztotatdotatatatiatdotrdotatatcatatatdotatmaaddottatatcmdotcotatdotatdotdottnuatdotfatatdotnathdota\\n\",\n \"todtatatoc\\n\",\n \"jdotypatdotatqatdothdotdqasaeotkdotodotdotatdotdotdotdotdottdotdotatatatdotzndotodotdotkdotfdotatat\\n\",\n \"xbtvdotrjatatatdotatatdotdotdotdotndothidotatdotdotdoxqytdotdotatdotdotdotdotdotdotduatgdotdotaatdot\\n\",\n \"sdfuiopguoidfbhuihsregituioheguodpsfhgvuherasuihfsduphguatwruheruopsghuiofhbvjudfbdpfuthruparkgfhdwt\\n\",\n \"ytatodatodhtodxtatartatataystadtadhvtawixtodrtautaztatodtodnftatodtatodjtatodrtastaptatatodlgtauatab\\n\",\n \"hmatcxatxatdotatlyucjatdothatdotcatatatdotqatatdotdotdotdotaajddotdotdotqdotdotattdotdntatddotatttat\\n\",\n \"xqbdotatuatatdotatatatidotdotdotbatpdotdotatatatdntatbptatdptatigdotdotdotdotatatatatatdotdotdotdotl\\n\",\n \"epatdt\\n\",\n \"sdfuiopguoidfbhuihsrdgftuioheguoatsfhgvuherasuihfsduphguphewruieruopsghuiofhbvjudfbdpiuthrupwrkgfhda\\n\",\n \"dotatdotaovdotjatatjsdttdotdotatsdotatatcdotatldoturdotoctvhatdotdotxeatdotfatdotratdotatfatatatdot\\n\",\n \"dotatatcdotxdotatgatatatkqdotrspatdotatodotqdotbdotdotnndotatatgatatudotdotatlatatdotatbjdntdntatdot\\n\",\n \"dotdotdotdotatdodatdoteatdotatatatatatneatatdotmdotdotatsatdotdotdotndotatjatdouatdottotatatdotdotgp\\n\",\n \"datottata\\n\",\n \"atdotpgatgnatatatdotfoatdotttwatdotatmdotdotdotjnhatatdoaatatdotaupdotatadotatatdotdotdotatdotdotdot\\n\",\n \"auasatat\\n\",\n \"tatasatodtodhntodtatodtatatataxtodotodutodtodktactodtodtazhitaotodytaataiotatodetatodbcntodtaitacta\\n\",\n \"tbatua\\n\",\n \"dotatdoduot\\n\",\n \"todtatodptodtodtatodtatadgsutatatadtodtatatodtodrcutatodtodtatodtndtodtatatatatodtattodtatatodtodta\\n\",\n \"dotxcdotdottdotdotatdotyadotqdotatdotatdotatatpndotljethatdotdotlrdotdotdottgaotgkdotkdtatdotdotzat\\n\",\n \"atatautodfgtaftatodrxwtodtodtatodtodtatataotatataotataetodtodtodtatoejtantodtodtodtatatodtodtodtac\\n\",\n \"todtatodtodcektatodtoditatatatodqtodtodatatodtatatodtatodtndtatattodtodtodtatodtodtatodytodtatodtaf\\n\",\n \"dotdoddotattotdotas\\n\",\n \"hatatatdotcatqatdotwhvdozatdotsatattatatcdotddotdottasatdottxdotatatdotatmdosvvatkatdotxavcdotdotttx\\n\",\n \"edotdotdotsatoatedotatpdotatatfatpmdotdoudotatyateotzjdoteuldstdottatdotatmtidotdotdotadotratqioat\\n\",\n \"qotaxtantatodcjtodmqtastataqrtatasqtodtodwtatatatatawutatoctodtodnptodtayctatodtodesztodtatodtodtta\\n\",\n \"sndtatata\\n\",\n \"tottatocda\\n\",\n \"ztotatdotttatatiatdotrdotatatcatatatdotatmaaddotaatatcmdotcotatdotatdotdottnuatdotfatatdotnathdota\\n\",\n \"tndtatatoc\\n\",\n \"jdotypatdotatqatdothdotdqasaeotkdotodotdotatdotdotdotdosdottdotdotatatatdotzndotodotdotkdotfdotatat\\n\",\n \"xbtvdotrjatatatdotatatdotdotdotdotndothidotatdotdotdoxdytdotdotatdotdotdotdotdotqotduatgdotdotaatdot\\n\",\n \"ytatodatodhtodxtatattatataystadtadhvtawixtodrtautaztarodtodnftatodtatodjtatodrtastaptatatodlgtauatab\\n\",\n \"xqbcotatuatatdotatatatidotdotdotbatpdotdotatatatdntatbptatdptatigdotdotdotdotatatatatatdotdotdotdotl\\n\",\n \"sdfuiopguoidfbhuihsrdgftuioheguoatsfhgvuherasuihfsduphguphewruidruopsghuiofhbvjudfbdpiuthrupwrkgfhda\\n\",\n \"dttatatcdotxdotatgatatatkqdotrspatdotatodotqdotbdotdotnndotatatgatatudotdotatlatatdooatbjdntdntatdot\\n\"\n ],\n \"output\": [\n \"vasya@gmail.com\\n\",\n \"a@t\\n\",\n \"dot..@..at\\n\",\n \"dot..........do@....................dot\\n\",\n \"z..@.z\\n\",\n \"h@atat.catqat.whv.at.satattatatc.d..vasat.tx.atat.atm.vvatkat.xatc..zsx\\n\",\n \"dot@.at\\n\",\n \"dot.@at\\n\",\n \"e...s@oate.atp.atatfatpm...atyat.zj.eul..tat.atmti...a.ratqisat\\n\",\n \"att..@.zse..atcyat.pn...atuwatatatatatw..qsatatrqatatsatqn.jc.atnatxatoq\\n\",\n \"dot...d@ot...at...............dot\\n\",\n \"at@atdot\\n\",\n \"at.@dot\\n\",\n \"z.@.atatatiat.r.atatcatatat.atmaat.tatatcm..at.at..tnuat.fatat.nath.a\\n\",\n \"dot............@..................dot\\n\",\n \"at@at\\n\",\n \"dot@atdot\\n\",\n \"dot@atat\\n\",\n \"j.yp@.atqat.h.dqata.k.o..at.....t..atatat.zn.o..k.f.atat\\n\",\n \"x@v.rjatatat.atat....n.hi.at...qyx..at......duatg..aatdot\\n\",\n \"at@atatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatatat\\n\",\n \"sdfuiopguoidfbhuihsregftuioheguodpsfhgvuherasuihfsduphgu@wruheruopsghuiofhbvjudfbdpiuthrupwrkgfhdat\\n\",\n \"at.@at\\n\",\n \"dot...@.atatat..dot\\n\",\n \"b@atatgl.atatpatsatr.atj.at.atfn..atzatuatr.xiwatvhdatdatsyatatatratatx.h.a.aty\\n\",\n \"dot@at\\n\",\n \"hm@cxatxat.atlyucjat.hat.catatat.qatat....atjd...q..att..atd.atatat\\n\",\n \"ato..@.at.vpn.at.at.a.at.attnysatq.at..s.cm....ywateat.atgsdot\\n\",\n \"dot@j.qcratqati.at.u.qulat...atat.....atat..at...ym..wv.at\\n\",\n \"xqb.@uatat.atatati...batp..atatat.atbptat.atig....atatatatat....l\\n\",\n \"do@dt\\n\",\n \"dotk@u.at.atatwlatiwatat.w.atc.at.atatat..i..batl.ox.at..u..vatatat\\n\",\n \"sdfuiopguoidfbhuihsregftuioheguo@sfhgvuherasuihfsduphguphewruheruopsghuiofhbvjudfbdpiuthrupwrkgfhda\\n\",\n \"dot@.atv.jatatjs...ats.atatc.atl.tr.octvhat..xeat.fat.rat.atfatatatdot\\n\",\n \"at.@satatiatatnatu...at..d...watx.....eatatfattatat.atat.i.zkvnat\\n\",\n \"dot@atc.x.atgatatatkq.rspat.ato.q.b..nn.atatgatatu..atlatat.atbj..atdot\\n\",\n \"dot@dot\\n\",\n \"dot...@.at.eat.atatatatatneatat.m..atsat...n.atjat.at..atat..gp\\n\",\n \"at@.at\\n\",\n \"at.pg@gnatatat.foat.atwat.atm...jnhatat.atat.atp.ata.atat...at..dot\\n\",\n \"at@dot\\n\",\n \"dot.@dot\\n\",\n \"at@atat\\n\",\n \"atc@iat.ncb.ate.atoiataaty.oatihzat..catk..u.o.xatatatat.at.nh..atatat\\n\",\n \"ta@ta\\n\",\n \"dot.@latnat.jatx...u.c..at.g.at.at.at.satatcdatzhat.atk.bmi..udot\\n\",\n \"at@.dot\\n\",\n \"dot@.dot\\n\",\n \"at..@at.tat.atatatat...at..atucr..atat.datatatusgdatat.at..p.atdot\\n\",\n \"dotxc..t..@.yb.q.at.at.atatpn.ljethat..lr...tg.gk.katat..zat\\n\",\n \"c@...atat...natj.at...eatatoatatatoatatat..at..wxr.atfatgf.uatata\\n\",\n \"f@.at.y.at..at...tatat..at.atat.ata..q.atatati..atkec..atdot\\n\",\n \"ztodt@odtodz\\n\",\n \"h@atat.catqat.whv.at.satattatatc.d..vasat.tx.atat.atmdosvvatkat.xatc..ztx\\n\",\n \"dou@.at\\n\",\n \"cot.@at\\n\",\n \"e...s@oate.atp.atatfatpm...atyat.zj.euldst.tat.atmti...a.ratqioat\\n\",\n \"att..@.zse..atcyat.pn...atuwatatatatatw..qsatatrqatatsatqm.jc.atnatxatoq\\n\",\n \"todt@ata\\n\",\n \"atcot@dot\\n\",\n \"ztot@.atatatiat.r.atatcatatat.atmaad.tatatcm..at.at..tnuat.fatat.nath.a\\n\",\n \"dot......dod.....@..................tot\\n\",\n \"cot@atdot\\n\",\n \"dou@atat\\n\",\n \"j.yp@.atqat.h.dqataeotk.o..at.....t..atatat.zn.o..k.f.atat\\n\",\n \"xbtv.rj@atat.atat....n.hi.at...qyx..at......duatg..aatdot\\n\",\n \"sdfuiopguoidfbhuihsregituioheguodpsfhgvuherasuihfsduphgu@wruheruopsghuiofhbvjudfbdpfuthrupwrkgfhdat\\n\",\n \"dot...as.@atat..dot\\n\",\n \"yt@odatodhtodxtatartatataystadtadhvtawixtodrtautaztatodtodnftatodtatodjtatodrtastaptatatodlgtatatab\\n\",\n \"hm@cxatxat.atlyucjat.hat.catatat.qatat....atjd...q..att.dntatd.atatat\\n\",\n \"dotaaj.qcr@qati.at.u.qulat...atat.....attt..at...ym..wv.at\\n\",\n \"xqb.@uatat.atatati...batp..atatat.atbptatdptatig....atatatatat....l\\n\",\n \"eo@dt\\n\",\n \"sdfuiopguoidfbhuihsrdgftuioheguo@sfhgvuherasuihfsduphguphewruheruopsghuiofhbvjudfbdpiuthrupwrkgfhda\\n\",\n \"dot@.atv.jatatjs...ats.atatc.atl.ur.octvhat..xeat.fat.rat.atfatatatdot\\n\",\n \"dot@atc.x.atgatatatkq.rspat.ato.q.b..nn.atatgatatu..atlatat.atbjdnt.atdot\\n\",\n \"dot@dou\\n\",\n \"dot...@.at.eat.atatatatatneatat.m..atsat...n.atjatdouat..atat..gp\\n\",\n \"t@odtata\\n\",\n \"at.pg@gnatatat.foat.atwat.atm...jnhatat.atat.aup.ata.atat...at..dot\\n\",\n \"atas@at\\n\",\n \"t@atatodtodhntodtatodtatatataxto.odutodtodktactodtodtazhitaotodytaataiotatodetatodbcntodtaitacta\\n\",\n \"ta@ua\\n\",\n \"dot.@latnat.jatx...udptc..at.g.at.at.at.satatcdatzhat.atk.bmi..udot\\n\",\n \"dot@dodtot\\n\",\n \"at..@at.tat.atatatat.dnt.at..atucr..atat.datatatusgdatat.at..p.atdot\\n\",\n \"dotxc..t..@.yb.q.at.at.atatpn.ljethat..lr...tgaotgk.kdtat..zat\\n\",\n \"c@...atat...natjeotat...eatatoatatatoatatat..at..wxr.atfatgf.uatata\\n\",\n \"todt@odtodcektatodtoditatatatodqtodtodatatodtatatodtatodtodtatattodtodtodtatodtodtatodytodtatodtaf\\n\",\n \"dot..@..as\\n\",\n \"h@atat.catqat.whv.at.satattatatc.d..tasat.tx.atat.atmdosvvatkat.xavc..ztx\\n\",\n \"tot.@ac\\n\",\n \"e...s@oate.atp.atatfatpm.dou.atyat.zj.euldst.tat.atmti...a.ratqioat\\n\",\n \"qotaxtant@odcjtodmqtastataqrtatasqtodtodwtatatatatawutatodtodtodnptodtayctatodtodesztodtatodtodtta\\n\",\n \"tndt@ata\\n\",\n \"adcot@tot\\n\",\n \"ztot@.atatatiat.r.atatcatatat.atmaad.tatatcm.cotat.at..tnuat.fatat.nath.a\\n\",\n \"todt@atoc\\n\",\n \"j.yp@.atqat.h.dqasaeotk.o..at.....t..atatat.zn.o..k.f.atat\\n\",\n \"xbtv.rj@atat.atat....n.hi.at..doxqyt..at......duatg..aatdot\\n\",\n \"sdfuiopguoidfbhuihsregituioheguodpsfhgvuherasuihfsduphgu@wruheruopsghuiofhbvjudfbdpfuthruparkgfhdwt\\n\",\n \"yt@odatodhtodxtatartatataystadtadhvtawixtodrtautaztatodtodnftatodtatodjtatodrtastaptatatodlgtauatab\\n\",\n \"hm@cxatxat.atlyucjat.hat.catatat.qatat....aajd...q..att.dntatd.atttat\\n\",\n \"xqb.@uatat.atatati...batp..atatatdntatbptatdptatig....atatatatat....l\\n\",\n \"ep@dt\\n\",\n \"sdfuiopguoidfbhuihsrdgftuioheguo@sfhgvuherasuihfsduphguphewruieruopsghuiofhbvjudfbdpiuthrupwrkgfhda\\n\",\n \"dot@.aov.jatatjsdtt..ats.atatc.atl.ur.octvhat..xeat.fat.rat.atfatatatdot\\n\",\n \"dot@atc.x.atgatatatkq.rspat.ato.q.b..nn.atatgatatu..atlatat.atbjdntdntatdot\\n\",\n \"dot...@dodat.eat.atatatatatneatat.m..atsat...n.atjatdouat.totatat..gp\\n\",\n \"d@ottata\\n\",\n \"at.pg@gnatatat.foat.ttwat.atm...jnhatatdoaatat.aup.ata.atat...at..dot\\n\",\n \"auas@at\\n\",\n \"t@asatodtodhntodtatodtatatataxto.odutodtodktactodtodtazhitaotodytaataiotatodetatodbcntodtaitacta\\n\",\n \"tb@ua\\n\",\n \"dot@doduot\\n\",\n \"todt@odptodtodtatodtatadgsutatatadtodtatatodtodrcutatodtodtatodtndtodtatatatatodtattodtatatodtodta\\n\",\n \"dotxc..t..@.ya.q.at.at.atatpn.ljethat..lr...tgaotgk.kdtat..zat\\n\",\n \"at@autodfgtaftatodrxwtodtodtatodtodtatataotatataotataetodtodtodtatoejtantodtodtodtatatodtodtodtac\\n\",\n \"todt@odtodcektatodtoditatatatodqtodtodatatodtatatodtatodtndtatattodtodtodtatodtodtatodytodtatodtaf\\n\",\n \"dotdod.@tot.as\\n\",\n \"h@atat.catqat.whvdozat.satattatatc.d..tasat.tx.atat.atmdosvvatkat.xavc..ttx\\n\",\n \"e...s@oate.atp.atatfatpm.dou.atyateotzj.euldst.tat.atmti...a.ratqioat\\n\",\n \"qotaxtant@odcjtodmqtastataqrtatasqtodtodwtatatatatawutatoctodtodnptodtayctatodtodesztodtatodtodtta\\n\",\n \"sndt@ata\\n\",\n \"tott@ocda\\n\",\n \"ztot@.ttatatiat.r.atatcatatat.atmaad.aatatcm.cotat.at..tnuat.fatat.nath.a\\n\",\n \"tndt@atoc\\n\",\n \"j.yp@.atqat.h.dqasaeotk.o..at...dos.t..atatat.zn.o..k.f.atat\\n\",\n \"xbtv.rj@atat.atat....n.hi.at..doxdyt..at.....qotduatg..aatdot\\n\",\n \"yt@odatodhtodxtatattatataystadtadhvtawixtodrtautaztarodtodnftatodtatodjtatodrtastaptatatodlgtauatab\\n\",\n \"xqbcot@uatat.atatati...batp..atatatdntatbptatdptatig....atatatatat....l\\n\",\n \"sdfuiopguoidfbhuihsrdgftuioheguo@sfhgvuherasuihfsduphguphewruidruopsghuiofhbvjudfbdpiuthrupwrkgfhda\\n\",\n \"dtt@atc.x.atgatatatkq.rspat.ato.q.b..nn.atatgatatu..atlatatdooatbjdntdntatdot\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nSometimes one has to spell email addresses over the phone. Then one usually pronounces a dot as dot, an at sign as at. As a result, we get something like vasyaatgmaildotcom. Your task is to transform it into a proper email address (vasya@gmail.com). \n\nIt is known that a proper email address contains only such symbols as . @ and lower-case Latin letters, doesn't start with and doesn't end with a dot. Also, a proper email address doesn't start with and doesn't end with an at sign. Moreover, an email address contains exactly one such symbol as @, yet may contain any number (possible, zero) of dots. \n\nYou have to carry out a series of replacements so that the length of the result was as short as possible and it was a proper email address. If the lengths are equal, you should print the lexicographically minimal result. \n\nOverall, two variants of replacement are possible: dot can be replaced by a dot, at can be replaced by an at. \n\nInput\n\nThe first line contains the email address description. It is guaranteed that that is a proper email address with all the dots replaced by dot an the at signs replaced by at. The line is not empty and its length does not exceed 100 symbols.\n\nOutput\n\nPrint the shortest email address, from which the given line could be made by the described above replacements. If there are several solutions to that problem, print the lexicographically minimal one (the lexicographical comparison of the lines are implemented with an operator < in modern programming languages).\n\nIn the ASCII table the symbols go in this order: . @ ab...z\n\nExamples\n\nInput\n\nvasyaatgmaildotcom\n\n\nOutput\n\nvasya@gmail.com\n\n\nInput\n\ndotdotdotatdotdotat\n\n\nOutput\n\ndot..@..at\n\n\nInput\n\naatt\n\n\nOutput\n\na@t\n\n### Input:\nvasyaatgmaildotcom\n\n### Output:\nvasya@gmail.com\n\n\n### Input:\naatt\n\n### Output:\na@t\n\n\n### Code:\na = input()\nb = ''\nif a[0] + a[1] + a[2] == 'dot':\n b += 'dot'\n i = 3\nelif a[0] + a[1] == 'at':\n b += 'at'\n i = 2\nelse:\n i = 0\nat = 0\nwhile i < len(a) - 3:\n if a[i] == 'd' and a[i + 1] == 'o' and a[i + 2] == 't':\n b += '.'\n i += 3\n elif a[i] == 'a' and a[i + 1] == 't' and at == 0:\n b += '@'\n at = 1\n i += 2\n else:\n b += a[i]\n i += 1\nif a[i] + a[-1] == 'at' and at == 0:\n b += '@'\n b += a[i + 2]\nelse:\n for j in range(i, len(a)):\n b += a[j]\nprint(b)"}}},{"rowIdx":5683,"cells":{"id":{"kind":"string","value":"446_A. DZY Loves Sequences_26824"},"description":{"kind":"string","value":"DZY has a sequence a, consisting of n integers.\n\nWe'll call a sequence ai, ai + 1, ..., aj (1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of the subsegment.\n\nYour task is to find the longest subsegment of a, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.\n\nYou only need to output the length of the subsegment you find.\n\nInput\n\nThe first line contains integer n (1 ≤ n ≤ 105). The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).\n\nOutput\n\nIn a single line print the answer to the problem — the maximum length of the required subsegment.\n\nExamples\n\nInput\n\n6\n7 2 3 1 5 6\n\n\nOutput\n\n5\n\nNote\n\nYou can choose subsegment a2, a3, a4, a5, a6 and change its 3rd element (that is a4) to 4."},"code":{"kind":"string","value":"def ii(): return int(input())\ndef si(): return input()\ndef mi(): return map(int,input().split())\ndef msi(): return map(str,input().split())\ndef li(): return list(mi())\n\n\nn=ii()\na=li()\npre,suf = [1]*n,[1]*n\n\nfor i in range(1,n):\n if a[i]>a[i-1]:\n pre[i]+=pre[i-1]\n \nfor i in range(n-2,-1,-1):\n if a[i]<a[i+1]:\n suf[i]+=suf[i+1]\n \nans=max(pre)\nif ans<n:\n ans+=1\n\nfor i in range(1,n-1):\n if a[i+1]>a[i-1]+1:\n ans=max(ans,pre[i-1]+suf[i+1]+1)\n \nprint(ans)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"6\\n7 2 3 1 5 6\\n\",\n \"5\\n2 3 7 5 6\\n\",\n \"5\\n1 3 3 4 5\\n\",\n \"3\\n81 33 64\\n\",\n \"5\\n1 2 3 4 1\\n\",\n \"3\\n5 1 2\\n\",\n \"3\\n20 1 9\\n\",\n \"4\\n1 5 3 4\\n\",\n \"10\\n1 1 5 3 2 9 9 7 7 6\\n\",\n \"5\\n2 4 7 6 8\\n\",\n \"10\\n1 2 3 4 5 10 10 11 12 13\\n\",\n \"1\\n1\\n\",\n \"5\\n1 2 5 3 4\\n\",\n \"2\\n1 1\\n\",\n \"4\\n1 4 3 4\\n\",\n \"5\\n1 2 3 3 4\\n\",\n \"20\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6\\n\",\n \"5\\n1 2 3 1 6\\n\",\n \"6\\n2 2 2 3 4 5\\n\",\n \"5\\n1 3 2 3 4\\n\",\n \"6\\n4 2 8 1 2 5\\n\",\n \"4\\n4 3 1 2\\n\",\n \"10\\n17 99 23 72 78 36 5 43 95 9\\n\",\n \"4\\n2 2 2 3\\n\",\n \"4\\n3 3 3 4\\n\",\n \"3\\n4 3 5\\n\",\n \"5\\n1 1 1 1 1\\n\",\n \"3\\n1000 1 2\\n\",\n \"5\\n5 2 3 4 5\\n\",\n \"3\\n100 5 10\\n\",\n \"3\\n5 1 3\\n\",\n \"3\\n1 1 2\\n\",\n \"6\\n7 2 12 4 5 6\\n\",\n \"6\\n1 2 2 3 4 5\\n\",\n \"2\\n1000000000 1000000000\\n\",\n \"10\\n1 2 3 4 5 5 6 7 8 9\\n\",\n \"1\\n42\\n\",\n \"4\\n5 1 2 3\\n\",\n \"5\\n1 1 2 3 4\\n\",\n \"5\\n1 2 3 4 5\\n\",\n \"5\\n1 2 42 3 4\\n\",\n \"9\\n1 2 3 4 5 42 7 8 9\\n\",\n \"7\\n11 2 1 2 13 4 14\\n\",\n \"5\\n1 2 4 4 5\\n\",\n \"10\\n1 2 3 4 100 6 7 8 9 10\\n\",\n \"6\\n1 2 3 100000 100 101\\n\",\n \"4\\n1 2 1 3\\n\",\n \"6\\n1 5 4 3 4 5\\n\",\n \"5\\n4 1 2 3 4\\n\",\n \"10\\n424238336 649760493 681692778 714636916 719885387 804289384 846930887 957747794 596516650 189641422\\n\",\n \"8\\n1 2 3 4 1 5 6 7\\n\",\n \"3\\n25 1 6\\n\",\n \"2\\n1 2\\n\",\n \"5\\n1 3 1 2 3\\n\",\n \"4\\n1 1 1 2\\n\",\n \"6\\n1 2 1 2 4 5\\n\",\n \"5\\n9 1 2 3 4\\n\",\n \"5\\n100 100 7 8 9\\n\",\n \"3\\n5 3 5\\n\",\n \"5\\n1 5 9 6 10\\n\",\n \"5\\n1 3 2 4 5\\n\",\n \"6\\n7 2 3 1 4 5\\n\",\n \"3\\n2 1 3\\n\",\n \"6\\n7 4 5 6 7 8\\n\",\n \"3\\n3 1 2\\n\",\n \"6\\n7 2 3 1 4 6\\n\",\n \"1\\n3\\n\",\n \"9\\n3 4 1 6 3 4 5 6 7\\n\",\n \"6\\n2 3 5 5 6 7\\n\",\n \"7\\n21 16 22 21 11 13 19\\n\",\n \"50\\n804289384 846930887 681692778 714636916 957747794 424238336 719885387 649760493 596516650 189641422 25202363 350490028 783368691 102520060 44897764 967513927 365180541 540383427 304089173 303455737 35005212 521595369 294702568 726956430 336465783 861021531 59961394 89018457 101513930 125898168 131176230 145174068 233665124 278722863 315634023 369133070 468703136 628175012 635723059 653377374 656478043 801979803 859484422 914544920 608413785 756898538 734575199 973594325 149798316 38664371\\n\",\n \"7\\n14 3 3 19 13 19 15\\n\",\n \"5\\n2 3 10 5 6\\n\",\n \"5\\n1 3 3 4 1\\n\",\n \"3\\n81 33 16\\n\",\n \"3\\n5 1 4\\n\",\n \"10\\n1 2 3 4 5 4 10 11 12 13\\n\",\n \"1\\n2\\n\",\n \"20\\n1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 2 3 4 5 6\\n\",\n \"9\\n1 2 3 5 5 42 7 8 9\\n\",\n \"10\\n1 2 3 4 100 6 7 9 9 10\\n\",\n \"50\\n804289384 846930887 681692778 714636916 957747794 424238336 719885387 649760493 596516650 189641422 25202363 350490028 783368691 102520060 44897764 967513927 365180541 540383427 304089173 303455737 6379420 521595369 294702568 726956430 336465783 861021531 59961394 89018457 101513930 125898168 131176230 145174068 233665124 278722863 315634023 369133070 468703136 628175012 635723059 653377374 656478043 801979803 859484422 914544920 608413785 756898538 734575199 973594325 149798316 38664371\\n\",\n \"5\\n1 2 1 4 1\\n\",\n \"4\\n1 5 0 4\\n\",\n \"10\\n1 1 5 3 2 9 8 7 7 6\\n\",\n \"5\\n2 4 7 6 13\\n\",\n \"5\\n1 2 5 3 6\\n\",\n \"2\\n2 2\\n\",\n \"4\\n1 4 2 4\\n\",\n \"5\\n2 2 3 3 4\\n\",\n \"5\\n1 2 3 1 10\\n\",\n \"6\\n2 2 2 6 4 5\\n\",\n \"5\\n1 5 2 3 4\\n\",\n \"4\\n4 3 1 1\\n\",\n \"10\\n17 99 23 72 78 36 9 43 95 9\\n\",\n \"4\\n2 1 2 3\\n\",\n \"4\\n3 3 2 4\\n\",\n \"3\\n7 3 5\\n\",\n \"5\\n1 1 2 1 1\\n\",\n \"5\\n5 2 3 1 5\\n\",\n \"3\\n100 2 10\\n\",\n \"3\\n5 1 1\\n\",\n \"3\\n1 1 0\\n\",\n \"6\\n7 2 13 4 5 6\\n\",\n \"10\\n1 2 3 4 5 5 8 7 8 9\\n\",\n \"1\\n51\\n\",\n \"5\\n1 1 2 3 2\\n\",\n \"5\\n1 2 3 2 5\\n\",\n \"5\\n1 2 42 4 4\\n\",\n \"7\\n11 2 1 0 13 4 14\\n\",\n \"5\\n1 2 5 4 5\\n\",\n \"6\\n1 2 3 100000 110 101\\n\",\n \"4\\n1 2 1 1\\n\",\n \"6\\n1 2 4 3 4 5\\n\",\n \"5\\n4 1 4 3 4\\n\",\n \"10\\n424238336 649760493 681692778 714636916 719885387 804289384 1387372535 957747794 596516650 189641422\\n\",\n \"8\\n1 2 3 4 1 5 6 2\\n\",\n \"3\\n25 1 9\\n\",\n \"2\\n1 4\\n\",\n \"5\\n2 3 1 2 3\\n\",\n \"4\\n1 1 2 2\\n\",\n \"5\\n110 100 7 8 9\\n\",\n \"5\\n1 5 9 6 13\\n\",\n \"5\\n1 1 2 4 5\\n\",\n \"6\\n7 4 3 1 4 5\\n\",\n \"3\\n2 2 3\\n\",\n \"1\\n5\\n\",\n \"9\\n3 4 1 6 3 4 1 6 7\\n\",\n \"6\\n2 3 5 5 6 10\\n\",\n \"7\\n21 16 22 16 11 13 19\\n\",\n \"7\\n14 3 3 25 13 19 15\\n\",\n \"6\\n7 2 3 1 5 5\\n\",\n \"5\\n2 3 5 5 6\\n\",\n \"5\\n1 3 3 4 0\\n\",\n \"3\\n109 33 16\\n\",\n \"5\\n2 2 1 4 1\\n\",\n \"4\\n2 5 0 4\\n\",\n \"10\\n1 1 5 3 2 9 8 7 1 6\\n\",\n \"5\\n2 5 7 6 13\\n\",\n \"10\\n1 2 3 4 5 4 15 11 12 13\\n\",\n \"1\\n4\\n\",\n \"5\\n1 2 5 3 10\\n\",\n \"4\\n1 4 2 0\\n\",\n \"5\\n2 2 3 3 5\\n\",\n \"20\\n1 1 1 1 1 1 1 1 2 2 1 1 1 1 1 2 3 4 5 6\\n\",\n \"5\\n1 2 3 1 4\\n\",\n \"4\\n4 3 2 1\\n\",\n \"10\\n20 99 23 72 78 36 9 43 95 9\\n\",\n \"3\\n9 3 5\\n\",\n \"5\\n1 2 2 1 1\\n\",\n \"5\\n9 2 3 1 5\\n\",\n \"3\\n110 2 10\\n\",\n \"3\\n9 1 2\\n\",\n \"3\\n2 1 0\\n\",\n \"10\\n1 2 3 4 5 5 8 13 8 9\\n\",\n \"1\\n43\\n\",\n \"5\\n1 1 3 2 5\\n\",\n \"9\\n1 2 3 9 5 42 7 8 9\\n\",\n \"7\\n11 0 1 0 13 4 14\\n\",\n \"5\\n1 0 5 4 5\\n\"\n ],\n \"output\": [\n \"5\\n\",\n \"5\\n\",\n \"5\\n\",\n \"3\\n\",\n \"5\\n\",\n \"3\\n\",\n \"3\\n\",\n \"4\\n\",\n \"3\\n\",\n \"5\\n\",\n \"10\\n\",\n \"1\\n\",\n \"4\\n\",\n \"2\\n\",\n \"4\\n\",\n \"4\\n\",\n \"7\\n\",\n \"5\\n\",\n \"5\\n\",\n \"4\\n\",\n \"4\\n\",\n \"3\\n\",\n \"5\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"2\\n\",\n \"3\\n\",\n \"5\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"5\\n\",\n \"5\\n\",\n \"2\\n\",\n \"6\\n\",\n \"1\\n\",\n \"4\\n\",\n \"5\\n\",\n \"5\\n\",\n \"4\\n\",\n \"9\\n\",\n \"5\\n\",\n \"5\\n\",\n \"10\\n\",\n \"6\\n\",\n \"3\\n\",\n \"4\\n\",\n \"5\\n\",\n \"9\\n\",\n \"5\\n\",\n \"3\\n\",\n \"2\\n\",\n \"4\\n\",\n \"3\\n\",\n \"5\\n\",\n \"5\\n\",\n \"4\\n\",\n \"3\\n\",\n \"4\\n\",\n \"4\\n\",\n \"4\\n\",\n \"3\\n\",\n \"6\\n\",\n \"3\\n\",\n \"4\\n\",\n \"1\\n\",\n \"7\\n\",\n \"6\\n\",\n \"4\\n\",\n \"19\\n\",\n \"4\\n\",\n \"5\\n\",\n \"4\\n\",\n \"2\\n\",\n \"3\\n\",\n \"10\\n\",\n \"1\\n\",\n \"7\\n\",\n \"6\\n\",\n \"8\\n\",\n \"19\\n\",\n \"4\\n\",\n \"3\\n\",\n \"3\\n\",\n \"5\\n\",\n \"4\\n\",\n \"2\\n\",\n \"3\\n\",\n \"3\\n\",\n \"5\\n\",\n \"4\\n\",\n \"4\\n\",\n \"2\\n\",\n \"5\\n\",\n \"4\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"4\\n\",\n \"3\\n\",\n \"2\\n\",\n \"2\\n\",\n \"5\\n\",\n \"7\\n\",\n \"1\\n\",\n \"4\\n\",\n \"5\\n\",\n \"4\\n\",\n \"4\\n\",\n \"5\\n\",\n \"5\\n\",\n \"3\\n\",\n \"4\\n\",\n \"4\\n\",\n \"8\\n\",\n \"5\\n\",\n \"3\\n\",\n \"2\\n\",\n \"4\\n\",\n \"3\\n\",\n \"4\\n\",\n \"5\\n\",\n \"5\\n\",\n \"4\\n\",\n \"3\\n\",\n \"1\\n\",\n \"5\\n\",\n \"6\\n\",\n \"4\\n\",\n \"4\\n\",\n \"4\\n\",\n \"5\\n\",\n \"4\\n\",\n \"2\\n\",\n \"3\\n\",\n \"3\\n\",\n \"3\\n\",\n \"5\\n\",\n \"7\\n\",\n \"1\\n\",\n \"5\\n\",\n \"3\\n\",\n \"4\\n\",\n \"7\\n\",\n \"4\\n\",\n \"2\\n\",\n \"5\\n\",\n \"3\\n\",\n \"3\\n\",\n \"4\\n\",\n \"3\\n\",\n \"3\\n\",\n \"2\\n\",\n \"8\\n\",\n \"1\\n\",\n \"4\\n\",\n \"6\\n\",\n \"4\\n\",\n \"4\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nDZY has a sequence a, consisting of n integers.\n\nWe'll call a sequence ai, ai + 1, ..., aj (1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of the subsegment.\n\nYour task is to find the longest subsegment of a, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.\n\nYou only need to output the length of the subsegment you find.\n\nInput\n\nThe first line contains integer n (1 ≤ n ≤ 105). The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).\n\nOutput\n\nIn a single line print the answer to the problem — the maximum length of the required subsegment.\n\nExamples\n\nInput\n\n6\n7 2 3 1 5 6\n\n\nOutput\n\n5\n\nNote\n\nYou can choose subsegment a2, a3, a4, a5, a6 and change its 3rd element (that is a4) to 4.\n\n### Input:\n6\n7 2 3 1 5 6\n\n### Output:\n5\n\n\n### Input:\n5\n2 3 7 5 6\n\n### Output:\n5\n\n\n### Code:\ndef ii(): return int(input())\ndef si(): return input()\ndef mi(): return map(int,input().split())\ndef msi(): return map(str,input().split())\ndef li(): return list(mi())\n\n\nn=ii()\na=li()\npre,suf = [1]*n,[1]*n\n\nfor i in range(1,n):\n if a[i]>a[i-1]:\n pre[i]+=pre[i-1]\n \nfor i in range(n-2,-1,-1):\n if a[i]<a[i+1]:\n suf[i]+=suf[i+1]\n \nans=max(pre)\nif ans<n:\n ans+=1\n\nfor i in range(1,n-1):\n if a[i+1]>a[i-1]+1:\n ans=max(ans,pre[i-1]+suf[i+1]+1)\n \nprint(ans)"}}},{"rowIdx":5684,"cells":{"id":{"kind":"string","value":"468_B. Two Sets_26828"},"description":{"kind":"string","value":"Little X has n distinct integers: p1, p2, ..., pn. He wants to divide all of them into two sets A and B. The following two conditions must be satisfied:\n\n * If number x belongs to set A, then number a - x must also belong to set A. \n * If number x belongs to set B, then number b - x must also belong to set B. \n\n\n\nHelp Little X divide the numbers into two sets or determine that it's impossible.\n\nInput\n\nThe first line contains three space-separated integers n, a, b (1 ≤ n ≤ 105; 1 ≤ a, b ≤ 109). The next line contains n space-separated distinct integers p1, p2, ..., pn (1 ≤ pi ≤ 109).\n\nOutput\n\nIf there is a way to divide the numbers into two sets, then print \"YES\" in the first line. Then print n integers: b1, b2, ..., bn (bi equals either 0, or 1), describing the division. If bi equals to 0, then pi belongs to set A, otherwise it belongs to set B.\n\nIf it's impossible, print \"NO\" (without the quotes).\n\nExamples\n\nInput\n\n4 5 9\n2 3 4 5\n\n\nOutput\n\nYES\n0 0 1 1\n\n\nInput\n\n3 3 4\n1 2 4\n\n\nOutput\n\nNO\n\nNote\n\nIt's OK if all the numbers are in the same set, and the other one is empty."},"code":{"kind":"string","value":"import sys\nimport queue\nsys.setrecursionlimit(100000)\n\n# global constant\nINF = int(1e7+1)\nMAX = 100005\n\n# For testing\n#sys.stdin = open(\"INP.txt\", 'r')\n#sys.stdout = open(\"OUT.txt\", 'w')\n\n# global variables\nparents = []\nranks = []\nsize = []\nn = 0\n\n# classes\n\n\nclass Pair:\n def __init__(self, a, b):\n self.first = a\n self.second = b\n\n\n# functions\ndef init():\n global parents, ranks, size\n parents = [i for i in range(n+2)]\n ranks = [0 for i in range(n+2)]\n size = [1 for i in range(n+2)]\n\n\ndef findSet(u):\n if(parents[u] != u):\n parents[u] = findSet(parents[u])\n return parents[u]\n\n\ndef unionSet(u, v):\n up = findSet(u)\n vp = findSet(v)\n if up == vp:\n return\n if ranks[up] < ranks[vp]:\n parents[up] = vp\n elif ranks[vp] < ranks[up]:\n parents[vp] = up\n else:\n ranks[vp] += 1\n parents[up] = vp\n\n\n# main function\ndef main():\n global n\n n, a, b = map(int, input().split())\n init()\n M = {}\n l = list(map(int, input().split()))\n Max = -1\n l.insert(0, -1)\n l.append(-1)\n for i in range(1, n+1):\n M[l[i]] = i\n parents[i] = i\n Max = max(Max, l[i])\n if Max >= a and Max >= b:\n print(\"NO\")\n return\n\n for i in range(1, n+1):\n # print(l[i], a-l[i], b-l[i], (a-l[i] in M), (b-l[i]) in M)\n if (a-l[i]) in M:\n unionSet(M[a - l[i]], i)\n else:\n unionSet(i, n+1)\n if(b-l[i]) in M:\n unionSet(M[b-l[i]], i)\n else:\n unionSet(i, 0)\n A = findSet(0)\n B = findSet(n+1)\n \"\"\" for parent in parents:\n print(parent, end = ' ')\n print()\n print(A, B) \"\"\"\n if(A == B):\n print(\"NO\")\n return\n print(\"YES\")\n for i in range(1, n+1):\n # print(l[i], findSet(l[i]))\n if (findSet(i) == A):\n print(\"%d\" % (0), end=' ')\n else:\n print(\"%d\" % (1), end=' ')\n\n\nmain()\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"3 3 4\\n1 2 4\\n\",\n \"4 5 9\\n2 3 4 5\\n\",\n \"4 10 9\\n6 5 4 3\\n\",\n \"1 1 1\\n1\\n\",\n \"2 2 3\\n1 2\\n\",\n \"70 416035 416023\\n70034 70322 345689 345965 345701 70046 345737 345713 70166 345821 70010 345749 345677 345725 69962 345869 70178 70310 345785 69998 70070 69974 70058 346001 70106 345953 70226 70154 345929 69950 70298 346049 70346 345989 70286 69986 345893 70082 70238 345797 70250 345833 70334 345845 70094 70118 70202 345977 70262 70274 70190 345941 346025 345761 345773 70142 70022 70130 345881 345917 70358 345905 345665 346013 346061 345809 345857 346037 346073 70214\\n\",\n \"8 12 13\\n2 10 3 9 4 8 5 7\\n\",\n \"100 8883 915\\n1599 4666 663 3646 754 2113 2200 3884 4082 1640 3795 2564 2711 2766 1122 4525 1779 2678 2816 2182 1028 2337 4918 1273 4141 217 2682 1756 309 4744 915 1351 3302 1367 3046 4032 4503 711 2860 890 2443 4819 4169 4721 3472 2900 239 3551 1977 2420 3361 3035 956 2539 1056 1837 477 1894 1762 1835 3577 2730 950 2960 1004 3293 2401 1271 2388 3950 1908 2804 2011 4952 3075 2507 2992 1883 1591 1095 959 1611 4749 3717 2245 207 814 4862 3525 2371 3277 817 701 574 2964 1278 705 1397 415 2892\\n\",\n \"1 2 3\\n1\\n\",\n \"4 7 9\\n2 4 5 7\\n\",\n \"1 527802320 589732288\\n418859112\\n\",\n \"1 2 2\\n1\\n\",\n \"53 7311 233\\n163 70 172 6330 5670 33 59 7 3432 199 197 3879 145 226 117 26 116 98 981 6054 114 48 36 135 174 185 7249 192 150 11 65 83 62 61 88 7291 222 41 1257 20 6551 119 34 7246 6830 200 760 207 1641 97 118 115 481\\n\",\n \"3 6 8\\n3 5 1\\n\",\n \"1 1 2\\n1\\n\",\n \"70 416035 416023\\n70034 70322 345689 345965 345701 70046 345737 345713 70166 345821 70010 345749 140951 345725 69962 345869 70178 70310 345785 69998 70070 69974 70058 346001 70106 345953 70226 70154 345929 69950 70298 346049 70346 345989 70286 69986 345893 70082 70238 345797 70250 345833 70334 345845 70094 70118 70202 345977 70262 70274 70190 345941 346025 345761 345773 70142 70022 70130 345881 345917 70358 345905 345665 346013 346061 345809 345857 346037 346073 70214\\n\",\n \"1 4 2\\n2\\n\",\n \"3 6 11\\n3 5 1\\n\",\n \"100 8883 915\\n1599 4666 663 3646 754 2113 2200 3884 4082 1640 3795 2564 2711 2766 1122 4525 1779 2678 2816 2182 1028 2337 4918 1273 4141 217 2682 1756 309 4744 915 1351 3302 1367 3046 4032 4503 711 2860 890 2443 4819 4169 4721 3472 2900 239 3551 1977 2420 3361 3035 956 2539 1056 1837 477 1894 1762 1835 3577 2730 950 2960 1004 3293 2401 1271 3887 3950 1908 2804 2011 4952 3075 2507 2992 1883 1591 1095 959 1611 4749 3717 2245 207 814 4862 3525 2371 3277 817 701 574 2964 1278 705 1397 415 2892\\n\",\n \"1 2 2\\n2\\n\",\n \"4 7 9\\n2 4 5 11\\n\",\n \"1 753483081 589732288\\n418859112\\n\",\n \"1 4 2\\n1\\n\",\n \"53 7311 233\\n163 70 172 6330 1766 33 59 7 3432 199 197 3879 145 226 117 26 116 98 981 6054 114 48 36 135 174 185 7249 192 150 11 65 83 62 61 88 7291 222 41 1257 20 6551 119 34 7246 6830 200 760 207 1641 97 118 115 481\\n\",\n \"3 6 8\\n3 5 2\\n\",\n \"3 3 3\\n1 2 4\\n\",\n \"4 10 9\\n2 3 4 5\\n\",\n \"1 1 2\\n2\\n\",\n \"70 416035 416023\\n70034 70322 345689 345965 345701 70046 345737 345713 70166 345821 70010 345749 140951 345725 69962 345869 70178 70310 345785 69998 70070 69974 70058 346001 70106 345953 70226 70154 345929 69950 70298 346049 70346 345989 70286 69986 345893 70082 70238 345797 70250 345833 70334 345845 70094 70118 22368 345977 70262 70274 70190 345941 346025 345761 345773 70142 70022 70130 345881 345917 70358 345905 345665 346013 346061 345809 345857 346037 346073 70214\\n\",\n \"100 8883 915\\n1599 4666 663 3646 754 2113 2200 3884 4082 1640 3795 2564 2711 2766 1122 4525 1779 2678 2816 2182 1028 2337 4918 1273 4141 217 2682 1756 309 4744 1025 1351 3302 1367 3046 4032 4503 711 2860 890 2443 4819 4169 4721 3472 2900 239 3551 1977 2420 3361 3035 956 2539 1056 1837 477 1894 1762 1835 3577 2730 950 2960 1004 3293 2401 1271 3887 3950 1908 2804 2011 4952 3075 2507 2992 1883 1591 1095 959 1611 4749 3717 2245 207 814 4862 3525 2371 3277 817 701 574 2964 1278 705 1397 415 2892\\n\",\n \"1 2 2\\n0\\n\",\n \"4 7 9\\n2 0 5 11\\n\",\n \"1 582726104 589732288\\n418859112\\n\",\n \"53 7311 325\\n163 70 172 6330 1766 33 59 7 3432 199 197 3879 145 226 117 26 116 98 981 6054 114 48 36 135 174 185 7249 192 150 11 65 83 62 61 88 7291 222 41 1257 20 6551 119 34 7246 6830 200 760 207 1641 97 118 115 481\\n\",\n \"3 6 11\\n3 5 2\\n\",\n \"3 3 3\\n1 2 7\\n\",\n \"4 10 9\\n2 3 3 5\\n\",\n \"1 1 3\\n2\\n\",\n \"70 416035 416023\\n70034 70322 345689 345965 345701 70046 345737 345713 70166 345821 70010 345749 140951 345725 69962 345869 70178 70310 345785 69998 70070 69974 70058 346001 70106 345953 70226 70154 345929 69950 65443 346049 70346 345989 70286 69986 345893 70082 70238 345797 70250 345833 70334 345845 70094 70118 22368 345977 70262 70274 70190 345941 346025 345761 345773 70142 70022 70130 345881 345917 70358 345905 345665 346013 346061 345809 345857 346037 346073 70214\\n\",\n \"100 8883 915\\n1599 4666 663 3646 754 2113 2200 3884 4082 1640 3795 2564 2711 2766 1122 4525 1779 2678 2816 2182 1028 2337 4918 1273 4141 217 2682 1756 309 4744 1025 1351 3302 1367 3046 4032 4503 711 2860 890 3696 4819 4169 4721 3472 2900 239 3551 1977 2420 3361 3035 956 2539 1056 1837 477 1894 1762 1835 3577 2730 950 2960 1004 3293 2401 1271 3887 3950 1908 2804 2011 4952 3075 2507 2992 1883 1591 1095 959 1611 4749 3717 2245 207 814 4862 3525 2371 3277 817 701 574 2964 1278 705 1397 415 2892\\n\",\n \"1 2 0\\n0\\n\",\n \"4 7 9\\n2 0 10 11\\n\",\n \"1 582726104 831677791\\n418859112\\n\",\n \"1 8 2\\n2\\n\",\n \"53 7311 325\\n163 70 172 6330 1766 33 59 7 3432 199 197 3879 145 226 117 26 116 98 981 6054 114 48 36 135 174 185 7249 192 150 11 65 83 62 61 88 7291 222 41 1257 20 6551 119 34 7246 6830 200 760 207 2025 97 118 115 481\\n\",\n \"3 6 11\\n3 5 0\\n\",\n \"4 10 9\\n2 4 3 5\\n\",\n \"1 1 1\\n2\\n\",\n \"70 416035 416023\\n70034 70322 345689 345965 345701 70046 345737 345713 70166 345821 70010 345749 140951 345725 69962 345869 70178 70310 345785 69998 70070 69974 70058 346001 70106 345953 70226 70154 345929 69950 65443 346049 70346 507763 70286 69986 345893 70082 70238 345797 70250 345833 70334 345845 70094 70118 22368 345977 70262 70274 70190 345941 346025 345761 345773 70142 70022 70130 345881 345917 70358 345905 345665 346013 346061 345809 345857 346037 346073 70214\\n\",\n \"100 8883 915\\n1050 4666 663 3646 754 2113 2200 3884 4082 1640 3795 2564 2711 2766 1122 4525 1779 2678 2816 2182 1028 2337 4918 1273 4141 217 2682 1756 309 4744 1025 1351 3302 1367 3046 4032 4503 711 2860 890 3696 4819 4169 4721 3472 2900 239 3551 1977 2420 3361 3035 956 2539 1056 1837 477 1894 1762 1835 3577 2730 950 2960 1004 3293 2401 1271 3887 3950 1908 2804 2011 4952 3075 2507 2992 1883 1591 1095 959 1611 4749 3717 2245 207 814 4862 3525 2371 3277 817 701 574 2964 1278 705 1397 415 2892\\n\",\n \"4 7 13\\n2 0 10 11\\n\",\n \"1 582726104 831677791\\n191577973\\n\",\n \"53 7311 325\\n163 70 172 6330 1766 33 59 7 3432 199 197 3879 145 226 117 26 116 98 981 6054 114 48 36 135 174 185 7249 192 61 11 65 83 62 61 88 7291 222 41 1257 20 6551 119 34 7246 6830 200 760 207 2025 97 118 115 481\\n\",\n \"4 10 9\\n3 4 3 5\\n\",\n \"1 2 1\\n2\\n\",\n \"70 416035 416023\\n70034 70322 345689 345965 345701 70046 345737 345713 70166 345821 58649 345749 140951 345725 69962 345869 70178 70310 345785 69998 70070 69974 70058 346001 70106 345953 70226 70154 345929 69950 65443 346049 70346 507763 70286 69986 345893 70082 70238 345797 70250 345833 70334 345845 70094 70118 22368 345977 70262 70274 70190 345941 346025 345761 345773 70142 70022 70130 345881 345917 70358 345905 345665 346013 346061 345809 345857 346037 346073 70214\\n\",\n \"100 8883 915\\n1050 4666 663 3646 754 2113 2200 3884 4082 1640 3795 2564 2711 2766 1122 4525 1779 2678 2816 2182 1028 2337 4918 1273 4141 217 2682 1756 309 4744 1025 1351 3302 1367 3046 4032 4503 711 2860 890 3696 4819 4169 4721 3472 2900 239 3551 1977 2420 3361 3035 956 2539 1056 1837 477 1894 1762 1835 3577 2730 950 2960 1004 3293 2401 1271 3887 3950 1908 2804 2011 4952 4054 2507 2992 1883 1591 1095 959 1611 4749 3717 2245 207 814 4862 3525 2371 3277 817 701 574 2964 1278 705 1397 415 2892\\n\",\n \"4 7 13\\n2 0 10 17\\n\",\n \"1 582726104 831677791\\n38952240\\n\",\n \"53 7311 325\\n163 70 172 6330 1766 33 59 7 3432 199 197 3879 145 226 117 26 116 98 981 6054 114 48 36 135 174 185 7249 192 61 11 65 83 62 61 88 7291 222 41 1257 20 6551 119 34 7246 9279 200 760 207 2025 97 118 115 481\\n\",\n \"3 1 11\\n3 5 1\\n\",\n \"1 2 2\\n4\\n\",\n \"70 416035 416023\\n70034 70322 345689 345965 345701 70046 345737 345713 70166 345821 58649 345749 140951 345725 69962 345869 70178 70310 345785 69998 70070 69974 70058 346001 70106 345953 70226 70154 345929 69950 65443 346049 70346 507763 70286 69986 345893 70082 70238 345797 28585 345833 70334 345845 70094 70118 22368 345977 70262 70274 70190 345941 346025 345761 345773 70142 70022 70130 345881 345917 70358 345905 345665 346013 346061 345809 345857 346037 346073 70214\\n\",\n \"100 8883 915\\n1050 4666 663 3646 754 2113 2200 3884 4082 1640 3795 2564 2711 2766 1122 4525 1779 2678 2816 2182 1028 2337 4918 1273 4141 217 2682 1756 309 4744 1025 1351 3302 1367 3046 4032 4503 711 2860 890 3696 4819 4169 4721 3472 2900 239 3551 1977 2420 3361 3035 956 2539 1056 1837 477 1894 1762 1835 3577 2730 950 2960 1004 3293 2401 1271 3887 3950 2092 2804 2011 4952 4054 2507 2992 1883 1591 1095 959 1611 4749 3717 2245 207 814 4862 3525 2371 3277 817 701 574 2964 1278 705 1397 415 2892\\n\",\n \"4 7 13\\n2 0 0 17\\n\"\n ],\n \"output\": [\n \"NO\\n\",\n \"YES\\n0 0 1 1 \",\n \"YES\\n1 1 1 1 \",\n \"NO\\n\",\n \"YES\\n1 1 \",\n \"YES\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \",\n \"YES\\n0 0 0 0 0 0 0 0 \",\n \"NO\\n\",\n \"YES\\n0 \",\n \"YES\\n1 1 1 1 \",\n \"NO\\n\",\n \"YES\\n0 \",\n \"NO\\n\",\n \"YES\\n0 0 0 \",\n \"YES\\n1\\n\",\n \"NO\\n\",\n \"YES\\n0\\n\",\n \"YES\\n0 0 0\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n1\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n1\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nLittle X has n distinct integers: p1, p2, ..., pn. He wants to divide all of them into two sets A and B. The following two conditions must be satisfied:\n\n * If number x belongs to set A, then number a - x must also belong to set A. \n * If number x belongs to set B, then number b - x must also belong to set B. \n\n\n\nHelp Little X divide the numbers into two sets or determine that it's impossible.\n\nInput\n\nThe first line contains three space-separated integers n, a, b (1 ≤ n ≤ 105; 1 ≤ a, b ≤ 109). The next line contains n space-separated distinct integers p1, p2, ..., pn (1 ≤ pi ≤ 109).\n\nOutput\n\nIf there is a way to divide the numbers into two sets, then print \"YES\" in the first line. Then print n integers: b1, b2, ..., bn (bi equals either 0, or 1), describing the division. If bi equals to 0, then pi belongs to set A, otherwise it belongs to set B.\n\nIf it's impossible, print \"NO\" (without the quotes).\n\nExamples\n\nInput\n\n4 5 9\n2 3 4 5\n\n\nOutput\n\nYES\n0 0 1 1\n\n\nInput\n\n3 3 4\n1 2 4\n\n\nOutput\n\nNO\n\nNote\n\nIt's OK if all the numbers are in the same set, and the other one is empty.\n\n### Input:\n3 3 4\n1 2 4\n\n### Output:\nNO\n\n\n### Input:\n4 5 9\n2 3 4 5\n\n### Output:\nYES\n0 0 1 1 \n\n### Code:\nimport sys\nimport queue\nsys.setrecursionlimit(100000)\n\n# global constant\nINF = int(1e7+1)\nMAX = 100005\n\n# For testing\n#sys.stdin = open(\"INP.txt\", 'r')\n#sys.stdout = open(\"OUT.txt\", 'w')\n\n# global variables\nparents = []\nranks = []\nsize = []\nn = 0\n\n# classes\n\n\nclass Pair:\n def __init__(self, a, b):\n self.first = a\n self.second = b\n\n\n# functions\ndef init():\n global parents, ranks, size\n parents = [i for i in range(n+2)]\n ranks = [0 for i in range(n+2)]\n size = [1 for i in range(n+2)]\n\n\ndef findSet(u):\n if(parents[u] != u):\n parents[u] = findSet(parents[u])\n return parents[u]\n\n\ndef unionSet(u, v):\n up = findSet(u)\n vp = findSet(v)\n if up == vp:\n return\n if ranks[up] < ranks[vp]:\n parents[up] = vp\n elif ranks[vp] < ranks[up]:\n parents[vp] = up\n else:\n ranks[vp] += 1\n parents[up] = vp\n\n\n# main function\ndef main():\n global n\n n, a, b = map(int, input().split())\n init()\n M = {}\n l = list(map(int, input().split()))\n Max = -1\n l.insert(0, -1)\n l.append(-1)\n for i in range(1, n+1):\n M[l[i]] = i\n parents[i] = i\n Max = max(Max, l[i])\n if Max >= a and Max >= b:\n print(\"NO\")\n return\n\n for i in range(1, n+1):\n # print(l[i], a-l[i], b-l[i], (a-l[i] in M), (b-l[i]) in M)\n if (a-l[i]) in M:\n unionSet(M[a - l[i]], i)\n else:\n unionSet(i, n+1)\n if(b-l[i]) in M:\n unionSet(M[b-l[i]], i)\n else:\n unionSet(i, 0)\n A = findSet(0)\n B = findSet(n+1)\n \"\"\" for parent in parents:\n print(parent, end = ' ')\n print()\n print(A, B) \"\"\"\n if(A == B):\n print(\"NO\")\n return\n print(\"YES\")\n for i in range(1, n+1):\n # print(l[i], findSet(l[i]))\n if (findSet(i) == A):\n print(\"%d\" % (0), end=' ')\n else:\n print(\"%d\" % (1), end=' ')\n\n\nmain()\n"}}},{"rowIdx":5685,"cells":{"id":{"kind":"string","value":"490_B. Queue_26832"},"description":{"kind":"string","value":"During the lunch break all n Berland State University students lined up in the food court. However, it turned out that the food court, too, has a lunch break and it temporarily stopped working.\n\nStanding in a queue that isn't being served is so boring! So, each of the students wrote down the number of the student ID of the student that stands in line directly in front of him, and the student that stands in line directly behind him. If no one stands before or after a student (that is, he is the first one or the last one), then he writes down number 0 instead (in Berland State University student IDs are numerated from 1).\n\nAfter that, all the students went about their business. When they returned, they found out that restoring the queue is not such an easy task.\n\nHelp the students to restore the state of the queue by the numbers of the student ID's of their neighbors in the queue.\n\nInput\n\nThe first line contains integer n (2 ≤ n ≤ 2·105) — the number of students in the queue. \n\nThen n lines follow, i-th line contains the pair of integers ai, bi (0 ≤ ai, bi ≤ 106), where ai is the ID number of a person in front of a student and bi is the ID number of a person behind a student. The lines are given in the arbitrary order. Value 0 is given instead of a neighbor's ID number if the neighbor doesn't exist.\n\nThe ID numbers of all students are distinct. It is guaranteed that the records correspond too the queue where all the students stand in some order.\n\nOutput\n\nPrint a sequence of n integers x1, x2, ..., xn — the sequence of ID numbers of all the students in the order they go in the queue from the first student to the last one.\n\nExamples\n\nInput\n\n4\n92 31\n0 7\n31 0\n7 141\n\n\nOutput\n\n92 7 31 141 \n\nNote\n\nThe picture illustrates the queue for the first sample.\n\n<image>"},"code":{"kind":"string","value":"import math\nfrom collections import deque\n\nclass Empty(Exception):\n pass\nclass _DoublyLinkedBase:\n \"\"\"A base class providing a doubly linked list representation.\"\"\"\n\n #-------------------------- nested _Node class --------------------------\n # nested _Node class\n class _Node:\n \"\"\"Lightweight, nonpublic class for storing a doubly linked node.\"\"\"\n __slots__ = '_element', '_prev', '_next' # streamline memory\n\n def __init__(self, element, prev, next): # initialize node's fields\n self._element = element # user's element\n self._prev = prev # previous node reference\n self._next = next # next node reference\n\n #-------------------------- list constructor --------------------------\n\n def __init__(self):\n \"\"\"Create an empty list.\"\"\"\n self._header = self._Node(None, None, None)\n self._trailer = self._Node(None, None, None)\n self._header._next = self._trailer # trailer is after header\n self._trailer._prev = self._header # header is before trailer\n self._size = 0 # number of elements\n\n #-------------------------- public accessors --------------------------\n\n def __len__(self):\n \"\"\"Return the number of elements in the list.\"\"\"\n return self._size\n\n def is_empty(self):\n \"\"\"Return True if list is empty.\"\"\"\n return self._size == 0\n\n #-------------------------- nonpublic utilities --------------------------\n\n def _insert_between(self, e, predecessor, successor):\n \"\"\"Add element e between two existing nodes and return new node.\"\"\"\n newest = self._Node(e, predecessor, successor) # linked to neighbors\n predecessor._next = newest\n successor._prev = newest\n self._size += 1\n return newest\n\n def _delete_node(self, node):\n \"\"\"Delete nonsentinel node from the list and return its element.\"\"\"\n predecessor = node._prev\n successor = node._next\n predecessor._next = successor\n successor._prev = predecessor\n self._size -= 1\n element = node._element # record deleted element\n node._prev = node._next = node._element = None # deprecate node\n return element # return deleted element\nclass LinkedDeque(_DoublyLinkedBase): # note the use of inheritance\n \"\"\"Double-ended queue implementation based on a doubly linked list.\"\"\"\n\n def first(self):\n \"\"\"Return (but do not remove) the element at the front of the deque.\n\n Raise Empty exception if the deque is empty.\n \"\"\"\n if self.is_empty():\n raise Empty(\"Deque is empty\")\n return self._header._next._element # real item just after header\n\n def last(self):\n \"\"\"Return (but do not remove) the element at the back of the deque.\n\n Raise Empty exception if the deque is empty.\n \"\"\"\n if self.is_empty():\n raise Empty(\"Deque is empty\")\n return self._trailer._prev._element # real item just before trailer\n\n def insert_first(self, e):\n \"\"\"Add an element to the front of the deque.\"\"\"\n self._insert_between(e, self._header, self._header._next) # after header\n\n def insert_last(self, e):\n \"\"\"Add an element to the back of the deque.\"\"\"\n self._insert_between(e, self._trailer._prev, self._trailer) # before trailer\n\n def delete_first(self):\n \"\"\"Remove and return the element from the front of the deque.\n\n Raise Empty exception if the deque is empty.\n \"\"\"\n if self.is_empty():\n raise Empty(\"Deque is empty\")\n return self._delete_node(self._header._next) # use inherited method\n\n def delete_last(self):\n \"\"\"Remove and return the element from the back of the deque.\n\n Raise Empty exception if the deque is empty.\n \"\"\"\n if self.is_empty():\n raise Empty(\"Deque is empty\")\n return self._delete_node(self._trailer._prev) # use inherited method\nclass PositionalList(_DoublyLinkedBase):\n \"\"\"A sequential container of elements allowing positional access.\"\"\"\n\n #-------------------------- nested Position class --------------------------\n class Position:\n \"\"\"An abstraction representing the location of a single element.\n\n Note that two position instaces may represent the same inherent\n location in the list. Therefore, users should always rely on\n syntax 'p == q' rather than 'p is q' when testing equivalence of\n positions.\n \"\"\"\n\n def __init__(self, container, node):\n \"\"\"Constructor should not be invoked by user.\"\"\"\n self._container = container\n self._node = node\n\n def element(self):\n \"\"\"Return the element stored at this Position.\"\"\"\n return self._node._element\n\n def __eq__(self, other):\n \"\"\"Return True if other is a Position representing the same location.\"\"\"\n return type(other) is type(self) and other._node is self._node\n\n def __ne__(self, other):\n \"\"\"Return True if other does not represent the same location.\"\"\"\n return not (self == other) # opposite of __eq__\n\n #------------------------------- utility methods -------------------------------\n def _validate(self, p):\n \"\"\"Return position's node, or raise appropriate error if invalid.\"\"\"\n if not isinstance(p, self.Position):\n raise TypeError('p must be proper Position type')\n if p._container is not self:\n raise ValueError('p does not belong to this container')\n if p._node._next is None: # convention for deprecated nodes\n raise ValueError('p is no longer valid')\n return p._node\n\n def _make_position(self, node):\n \"\"\"Return Position instance for given node (or None if sentinel).\"\"\"\n if node is self._header or node is self._trailer:\n return None # boundary violation\n else:\n return self.Position(self, node) # legitimate position\n\n #------------------------------- accessors -------------------------------\n def first(self):\n \"\"\"Return the first Position in the list (or None if list is empty).\"\"\"\n return self._make_position(self._header._next)\n\n def last(self):\n \"\"\"Return the last Position in the list (or None if list is empty).\"\"\"\n return self._make_position(self._trailer._prev)\n\n def before(self, p):\n \"\"\"Return the Position just before Position p (or None if p is first).\"\"\"\n node = self._validate(p)\n return self._make_position(node._prev)\n\n def after(self, p):\n \"\"\"Return the Position just after Position p (or None if p is last).\"\"\"\n node = self._validate(p)\n return self._make_position(node._next)\n\n def __iter__(self):\n \"\"\"Generate a forward iteration of the elements of the list.\"\"\"\n cursor = self.first()\n while cursor is not None:\n yield cursor.element()\n cursor = self.after(cursor)\n\n #------------------------------- mutators -------------------------------\n # override inherited version to return Position, rather than Node\n def _insert_between(self, e, predecessor, successor):\n \"\"\"Add element between existing nodes and return new Position.\"\"\"\n node = super()._insert_between(e, predecessor, successor)\n return self._make_position(node)\n\n def add_first(self, e):\n \"\"\"Insert element e at the front of the list and return new Position.\"\"\"\n return self._insert_between(e, self._header, self._header._next)\n\n def add_last(self, e):\n \"\"\"Insert element e at the back of the list and return new Position.\"\"\"\n return self._insert_between(e, self._trailer._prev, self._trailer)\n\n def add_before(self, p, e):\n \"\"\"Insert element e into list before Position p and return new Position.\"\"\"\n original = self._validate(p)\n return self._insert_between(e, original._prev, original)\n\n def add_after(self, p, e):\n \"\"\"Insert element e into list after Position p and return new Position.\"\"\"\n original = self._validate(p)\n return self._insert_between(e, original, original._next)\n\n def delete(self, p):\n \"\"\"Remove and return the element at Position p.\"\"\"\n original = self._validate(p)\n return self._delete_node(original) # inherited method returns element\n\n def replace(self, p, e):\n \"\"\"Replace the element at Position p with e.\n\n Return the element formerly at Position p.\n \"\"\"\n original = self._validate(p)\n old_value = original._element # temporarily store old element\n original._element = e # replace with new element\n return old_value # return the old element value\n\nL1=LinkedDeque()\nL2=LinkedDeque()\ndic={}\ndic2={}\nn=int(input())\nfor i in range(n):\n a,b=(int(i) for i in input().split())\n dic[a]=b\n dic2[b]=a\n\nforw=0\nwhile (forw in dic) :\n L1.insert_last(dic[forw])\n t=dic[forw]\n dic.pop(forw)\n forw=t\nif L1.last()==0 :\n L1.delete_last()\nif n%2==0 :\n backw=0\n while (backw in dic2) :\n L2.insert_first(dic2[backw])\n t=dic2[backw]\n dic2.pop(backw)\n backw=t\nelse:\n tk,tv=0,0\n for (k, v) in dic.items():\n tk=k\n tv=v\n forw=tk\n while (forw in dic) :\n L2.insert_last(dic[forw])\n t=dic[forw]\n dic.pop(forw)\n forw=t\n backw=tv\n while (backw in dic2) :\n L2.insert_first(dic2[backw])\n t=dic2[backw]\n dic2.pop(backw)\n backw=t\noutList=[]\nwhile L1.is_empty()==False :\n outList.append(str(L2.first()))\n outList.append(str(L1.first()))\n L1.delete_first()\n L2.delete_first()\nif L2.is_empty()==False :\n outList.append(str(L2.first()))\n pass\nprint(\" \".join(outList))"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"4\\n92 31\\n0 7\\n31 0\\n7 141\\n\",\n \"6\\n10001 0\\n0 10005\\n10003 10001\\n10002 10000\\n10005 10002\\n10004 10003\\n\",\n \"3\\n0 2\\n1 3\\n2 0\\n\",\n \"9\\n308992 348750\\n0 6496\\n487447 676506\\n874677 985199\\n260782 487447\\n985199 260782\\n348750 0\\n570981 308992\\n6496 570981\\n\",\n \"6\\n341637 51795\\n0 809471\\n51795 0\\n244669 341637\\n852537 508622\\n809471 852537\\n\",\n \"8\\n611412 115521\\n114290 712424\\n115521 242491\\n242491 0\\n0 114290\\n712424 282922\\n282922 589147\\n359823 611412\\n\",\n \"7\\n111283 0\\n496010 510417\\n423431 921854\\n510417 111283\\n0 496010\\n758535 423431\\n921854 59208\\n\",\n \"4\\n263750 0\\n513707 263750\\n0 718595\\n718595 148112\\n\",\n \"5\\n645873 145459\\n638930 82975\\n0 645873\\n82975 389665\\n145459 0\\n\",\n \"10\\n189071 852255\\n227133 652124\\n329720 4848\\n652124 329720\\n0 72517\\n943168 0\\n72517 544697\\n4848 943168\\n538963 189071\\n544697 538963\\n\",\n \"2\\n0 1\\n2 0\\n\",\n \"4\\n101 0\\n0 102\\n102 100\\n103 101\\n\",\n \"10\\n419946 201769\\n245945 0\\n842799 113073\\n836998 245945\\n0 794376\\n692107 836998\\n113073 904403\\n904403 987165\\n201769 692107\\n794376 842799\\n\",\n \"2\\n0 300000\\n1000000 0\\n\",\n \"5\\n0 1\\n1 4\\n4 0\\n3 2\\n5 3\\n\",\n \"3\\n0 743259\\n72866 70294\\n743259 0\\n\",\n \"6\\n10001 0\\n0 10005\\n10003 10001\\n10002 10000\\n10005 10002\\n5132 10003\\n\",\n \"6\\n341637 51795\\n0 809471\\n51795 0\\n318136 341637\\n852537 508622\\n809471 852537\\n\",\n \"4\\n263750 0\\n217705 263750\\n0 718595\\n718595 148112\\n\",\n \"2\\n0 377972\\n1000000 0\\n\",\n \"6\\n341637 51795\\n0 809471\\n51795 0\\n546403 341637\\n852537 508622\\n809471 852537\\n\",\n \"8\\n611412 115521\\n114290 712424\\n115521 242491\\n242491 0\\n0 114290\\n712424 282922\\n282922 589147\\n12871 611412\\n\",\n \"10\\n189071 103078\\n227133 652124\\n329720 4848\\n652124 329720\\n0 72517\\n943168 0\\n72517 544697\\n4848 943168\\n538963 189071\\n544697 538963\\n\",\n \"2\\n0 349035\\n1000000 0\\n\",\n \"4\\n92 31\\n0 7\\n31 0\\n7 45\\n\",\n \"2\\n0 433362\\n1000000 0\\n\",\n \"10\\n189071 103078\\n80162 652124\\n329720 4848\\n652124 329720\\n0 72517\\n943168 0\\n72517 544697\\n4848 943168\\n538963 189071\\n544697 538963\\n\",\n \"4\\n13 31\\n0 7\\n31 0\\n7 45\\n\",\n \"2\\n0 519887\\n1000000 0\\n\",\n \"4\\n13 31\\n0 7\\n31 0\\n7 2\\n\",\n \"2\\n0 114997\\n1000000 0\\n\",\n \"6\\n341637 51795\\n0 809471\\n51795 0\\n546403 341637\\n852537 179335\\n809471 852537\\n\",\n \"4\\n134 31\\n0 7\\n31 0\\n7 45\\n\",\n \"4\\n13 31\\n0 7\\n31 0\\n7 1\\n\",\n \"5\\n645873 145459\\n638930 82975\\n0 645873\\n82975 647733\\n145459 0\\n\",\n \"2\\n0 109481\\n1000000 0\\n\",\n \"4\\n263750 0\\n217705 263750\\n0 718595\\n718595 228960\\n\",\n \"10\\n189071 176627\\n227133 652124\\n329720 4848\\n652124 329720\\n0 72517\\n943168 0\\n72517 544697\\n4848 943168\\n538963 189071\\n544697 538963\\n\",\n \"4\\n111 31\\n0 7\\n31 0\\n7 45\\n\",\n \"2\\n0 550379\\n1000000 0\\n\",\n \"4\\n263750 0\\n217705 263750\\n0 718595\\n718595 4365\\n\",\n \"7\\n111283 0\\n496010 510417\\n423431 921854\\n510417 111283\\n0 496010\\n813995 423431\\n921854 59208\\n\",\n \"6\\n10001 0\\n0 10005\\n10003 10001\\n10002 10000\\n10005 10002\\n6350 10003\\n\",\n \"2\\n0 101506\\n1000000 0\\n\",\n \"4\\n263750 0\\n270136 263750\\n0 718595\\n718595 4365\\n\",\n \"6\\n341637 51795\\n0 809471\\n51795 0\\n222761 341637\\n852537 508622\\n809471 852537\\n\",\n \"5\\n645873 145459\\n638930 82975\\n0 645873\\n82975 774574\\n145459 0\\n\",\n \"2\\n0 1\\n4 0\\n\",\n \"2\\n0 20814\\n1000000 0\\n\",\n \"3\\n0 743259\\n72866 116169\\n743259 0\\n\",\n \"4\\n263750 0\\n217705 263750\\n0 718595\\n718595 164369\\n\",\n \"2\\n0 506761\\n1000000 0\\n\",\n \"2\\n0 170994\\n1000000 0\\n\",\n \"6\\n341637 51795\\n0 809471\\n51795 0\\n713644 341637\\n852537 179335\\n809471 852537\\n\",\n \"4\\n164 31\\n0 7\\n31 0\\n7 45\\n\",\n \"2\\n0 146631\\n1000000 0\\n\",\n \"2\\n0 105742\\n1000000 0\\n\",\n \"4\\n263750 0\\n270136 263750\\n0 718595\\n718595 7212\\n\",\n \"2\\n0 41147\\n1000000 0\\n\",\n \"4\\n263750 0\\n228744 263750\\n0 718595\\n718595 164369\\n\",\n \"2\\n0 318507\\n1000000 0\\n\",\n \"4\\n307 31\\n0 7\\n31 0\\n7 45\\n\",\n \"2\\n0 625143\\n1000000 0\\n\",\n \"7\\n111283 0\\n496010 510417\\n423431 921854\\n510417 111283\\n0 496010\\n741039 423431\\n921854 59208\\n\",\n \"4\\n101 0\\n0 102\\n102 010\\n103 101\\n\",\n \"3\\n0 743259\\n84695 70294\\n743259 0\\n\",\n \"8\\n611412 115521\\n114290 712424\\n115521 242491\\n242491 0\\n0 114290\\n712424 282922\\n282922 589147\\n20372 611412\\n\",\n \"2\\n0 355244\\n1000000 0\\n\",\n \"2\\n0 822567\\n1000000 0\\n\",\n \"4\\n23 31\\n0 7\\n31 0\\n7 45\\n\",\n \"2\\n0 105581\\n1000000 0\\n\",\n \"2\\n0 530286\\n1000000 0\\n\",\n \"4\\n263750 0\\n533444 263750\\n0 718595\\n718595 4365\\n\",\n \"5\\n645873 145459\\n378463 82975\\n0 645873\\n82975 774574\\n145459 0\\n\",\n \"3\\n0 743259\\n72866 105330\\n743259 0\\n\",\n \"4\\n164 31\\n0 7\\n31 0\\n7 40\\n\",\n \"4\\n263750 0\\n228744 263750\\n0 718595\\n718595 67310\\n\",\n \"7\\n111283 0\\n496010 510417\\n423431 921854\\n510417 111283\\n0 496010\\n59805 423431\\n921854 59208\\n\",\n \"4\\n101 0\\n0 102\\n102 011\\n103 101\\n\",\n \"8\\n611412 115521\\n114290 712424\\n115521 242491\\n242491 0\\n0 114290\\n712424 282922\\n282922 589147\\n14840 611412\\n\",\n \"2\\n0 188019\\n1000000 0\\n\",\n \"2\\n0 645966\\n1000000 0\\n\",\n \"2\\n0 177107\\n1000000 0\\n\",\n \"5\\n645873 145459\\n148926 82975\\n0 645873\\n82975 774574\\n145459 0\\n\",\n \"6\\n10001 0\\n0 10005\\n10003 10001\\n10002 10000\\n10005 10002\\n9889 10003\\n\",\n \"6\\n341637 51795\\n0 809471\\n51795 0\\n244669 341637\\n852537 452955\\n809471 852537\\n\",\n \"4\\n263750 0\\n513707 263750\\n0 718595\\n718595 154097\\n\",\n \"2\\n0 1\\n5 0\\n\"\n ],\n \"output\": [\n \"92 7 31 141\\n\",\n \"10004 10005 10003 10002 10001 10000\\n\",\n \"1 2 3\\n\",\n \"874677 6496 985199 570981 260782 308992 487447 348750 676506\\n\",\n \"244669 809471 341637 852537 51795 508622\\n\",\n \"359823 114290 611412 712424 115521 282922 242491 589147\\n\",\n \"758535 496010 423431 510417 921854 111283 59208\\n\",\n \"513707 718595 263750 148112\\n\",\n \"638930 645873 82975 145459 389665\\n\",\n \"227133 72517 652124 544697 329720 538963 4848 189071 943168 852255\\n\",\n \"2 1\\n\",\n \"103 102 101 100\\n\",\n \"419946 794376 201769 842799 692107 113073 836998 904403 245945 987165\\n\",\n \"1000000 300000\\n\",\n \"5 1 3 4 2\\n\",\n \"72866 743259 70294\\n\",\n \"5132 10005 10003 10002 10001 10000\\n\",\n \"318136 809471 341637 852537 51795 508622\\n\",\n \"217705 718595 263750 148112\\n\",\n \"1000000 377972\\n\",\n \"546403 809471 341637 852537 51795 508622\\n\",\n \"12871 114290 611412 712424 115521 282922 242491 589147\\n\",\n \"227133 72517 652124 544697 329720 538963 4848 189071 943168 103078\\n\",\n \"1000000 349035\\n\",\n \"92 7 31 45\\n\",\n \"1000000 433362\\n\",\n \"80162 72517 652124 544697 329720 538963 4848 189071 943168 103078\\n\",\n \"13 7 31 45\\n\",\n \"1000000 519887\\n\",\n \"13 7 31 2\\n\",\n \"1000000 114997\\n\",\n \"546403 809471 341637 852537 51795 179335\\n\",\n \"134 7 31 45\\n\",\n \"13 7 31 1\\n\",\n \"638930 645873 82975 145459 647733\\n\",\n \"1000000 109481\\n\",\n \"217705 718595 263750 228960\\n\",\n \"227133 72517 652124 544697 329720 538963 4848 189071 943168 176627\\n\",\n \"111 7 31 45\\n\",\n \"1000000 550379\\n\",\n \"217705 718595 263750 4365\\n\",\n \"813995 496010 423431 510417 921854 111283 59208\\n\",\n \"6350 10005 10003 10002 10001 10000\\n\",\n \"1000000 101506\\n\",\n \"270136 718595 263750 4365\\n\",\n \"222761 809471 341637 852537 51795 508622\\n\",\n \"638930 645873 82975 145459 774574\\n\",\n \"4 1\\n\",\n \"1000000 20814\\n\",\n \"72866 743259 116169\\n\",\n \"217705 718595 263750 164369\\n\",\n \"1000000 506761\\n\",\n \"1000000 170994\\n\",\n \"713644 809471 341637 852537 51795 179335\\n\",\n \"164 7 31 45\\n\",\n \"1000000 146631\\n\",\n \"1000000 105742\\n\",\n \"270136 718595 263750 7212\\n\",\n \"1000000 41147\\n\",\n \"228744 718595 263750 164369\\n\",\n \"1000000 318507\\n\",\n \"307 7 31 45\\n\",\n \"1000000 625143\\n\",\n \"741039 496010 423431 510417 921854 111283 59208\\n\",\n \"103 102 101 010\\n\",\n \"84695 743259 70294\\n\",\n \"20372 114290 611412 712424 115521 282922 242491 589147\\n\",\n \"1000000 355244\\n\",\n \"1000000 822567\\n\",\n \"23 7 31 45\\n\",\n \"1000000 105581\\n\",\n \"1000000 530286\\n\",\n \"533444 718595 263750 4365\\n\",\n \"378463 645873 82975 145459 774574\\n\",\n \"72866 743259 105330\\n\",\n \"164 7 31 40\\n\",\n \"228744 718595 263750 67310\\n\",\n \"59805 496010 423431 510417 921854 111283 59208\\n\",\n \"103 102 101 011\\n\",\n \"14840 114290 611412 712424 115521 282922 242491 589147\\n\",\n \"1000000 188019\\n\",\n \"1000000 645966\\n\",\n \"1000000 177107\\n\",\n \"148926 645873 82975 145459 774574\\n\",\n \"9889 10005 10003 10002 10001 10000\\n\",\n \"244669 809471 341637 852537 51795 452955\\n\",\n \"513707 718595 263750 154097\\n\",\n \"5 1\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nDuring the lunch break all n Berland State University students lined up in the food court. However, it turned out that the food court, too, has a lunch break and it temporarily stopped working.\n\nStanding in a queue that isn't being served is so boring! So, each of the students wrote down the number of the student ID of the student that stands in line directly in front of him, and the student that stands in line directly behind him. If no one stands before or after a student (that is, he is the first one or the last one), then he writes down number 0 instead (in Berland State University student IDs are numerated from 1).\n\nAfter that, all the students went about their business. When they returned, they found out that restoring the queue is not such an easy task.\n\nHelp the students to restore the state of the queue by the numbers of the student ID's of their neighbors in the queue.\n\nInput\n\nThe first line contains integer n (2 ≤ n ≤ 2·105) — the number of students in the queue. \n\nThen n lines follow, i-th line contains the pair of integers ai, bi (0 ≤ ai, bi ≤ 106), where ai is the ID number of a person in front of a student and bi is the ID number of a person behind a student. The lines are given in the arbitrary order. Value 0 is given instead of a neighbor's ID number if the neighbor doesn't exist.\n\nThe ID numbers of all students are distinct. It is guaranteed that the records correspond too the queue where all the students stand in some order.\n\nOutput\n\nPrint a sequence of n integers x1, x2, ..., xn — the sequence of ID numbers of all the students in the order they go in the queue from the first student to the last one.\n\nExamples\n\nInput\n\n4\n92 31\n0 7\n31 0\n7 141\n\n\nOutput\n\n92 7 31 141 \n\nNote\n\nThe picture illustrates the queue for the first sample.\n\n<image>\n\n### Input:\n4\n92 31\n0 7\n31 0\n7 141\n\n### Output:\n92 7 31 141\n\n\n### Input:\n6\n10001 0\n0 10005\n10003 10001\n10002 10000\n10005 10002\n10004 10003\n\n### Output:\n10004 10005 10003 10002 10001 10000\n\n\n### Code:\nimport math\nfrom collections import deque\n\nclass Empty(Exception):\n pass\nclass _DoublyLinkedBase:\n \"\"\"A base class providing a doubly linked list representation.\"\"\"\n\n #-------------------------- nested _Node class --------------------------\n # nested _Node class\n class _Node:\n \"\"\"Lightweight, nonpublic class for storing a doubly linked node.\"\"\"\n __slots__ = '_element', '_prev', '_next' # streamline memory\n\n def __init__(self, element, prev, next): # initialize node's fields\n self._element = element # user's element\n self._prev = prev # previous node reference\n self._next = next # next node reference\n\n #-------------------------- list constructor --------------------------\n\n def __init__(self):\n \"\"\"Create an empty list.\"\"\"\n self._header = self._Node(None, None, None)\n self._trailer = self._Node(None, None, None)\n self._header._next = self._trailer # trailer is after header\n self._trailer._prev = self._header # header is before trailer\n self._size = 0 # number of elements\n\n #-------------------------- public accessors --------------------------\n\n def __len__(self):\n \"\"\"Return the number of elements in the list.\"\"\"\n return self._size\n\n def is_empty(self):\n \"\"\"Return True if list is empty.\"\"\"\n return self._size == 0\n\n #-------------------------- nonpublic utilities --------------------------\n\n def _insert_between(self, e, predecessor, successor):\n \"\"\"Add element e between two existing nodes and return new node.\"\"\"\n newest = self._Node(e, predecessor, successor) # linked to neighbors\n predecessor._next = newest\n successor._prev = newest\n self._size += 1\n return newest\n\n def _delete_node(self, node):\n \"\"\"Delete nonsentinel node from the list and return its element.\"\"\"\n predecessor = node._prev\n successor = node._next\n predecessor._next = successor\n successor._prev = predecessor\n self._size -= 1\n element = node._element # record deleted element\n node._prev = node._next = node._element = None # deprecate node\n return element # return deleted element\nclass LinkedDeque(_DoublyLinkedBase): # note the use of inheritance\n \"\"\"Double-ended queue implementation based on a doubly linked list.\"\"\"\n\n def first(self):\n \"\"\"Return (but do not remove) the element at the front of the deque.\n\n Raise Empty exception if the deque is empty.\n \"\"\"\n if self.is_empty():\n raise Empty(\"Deque is empty\")\n return self._header._next._element # real item just after header\n\n def last(self):\n \"\"\"Return (but do not remove) the element at the back of the deque.\n\n Raise Empty exception if the deque is empty.\n \"\"\"\n if self.is_empty():\n raise Empty(\"Deque is empty\")\n return self._trailer._prev._element # real item just before trailer\n\n def insert_first(self, e):\n \"\"\"Add an element to the front of the deque.\"\"\"\n self._insert_between(e, self._header, self._header._next) # after header\n\n def insert_last(self, e):\n \"\"\"Add an element to the back of the deque.\"\"\"\n self._insert_between(e, self._trailer._prev, self._trailer) # before trailer\n\n def delete_first(self):\n \"\"\"Remove and return the element from the front of the deque.\n\n Raise Empty exception if the deque is empty.\n \"\"\"\n if self.is_empty():\n raise Empty(\"Deque is empty\")\n return self._delete_node(self._header._next) # use inherited method\n\n def delete_last(self):\n \"\"\"Remove and return the element from the back of the deque.\n\n Raise Empty exception if the deque is empty.\n \"\"\"\n if self.is_empty():\n raise Empty(\"Deque is empty\")\n return self._delete_node(self._trailer._prev) # use inherited method\nclass PositionalList(_DoublyLinkedBase):\n \"\"\"A sequential container of elements allowing positional access.\"\"\"\n\n #-------------------------- nested Position class --------------------------\n class Position:\n \"\"\"An abstraction representing the location of a single element.\n\n Note that two position instaces may represent the same inherent\n location in the list. Therefore, users should always rely on\n syntax 'p == q' rather than 'p is q' when testing equivalence of\n positions.\n \"\"\"\n\n def __init__(self, container, node):\n \"\"\"Constructor should not be invoked by user.\"\"\"\n self._container = container\n self._node = node\n\n def element(self):\n \"\"\"Return the element stored at this Position.\"\"\"\n return self._node._element\n\n def __eq__(self, other):\n \"\"\"Return True if other is a Position representing the same location.\"\"\"\n return type(other) is type(self) and other._node is self._node\n\n def __ne__(self, other):\n \"\"\"Return True if other does not represent the same location.\"\"\"\n return not (self == other) # opposite of __eq__\n\n #------------------------------- utility methods -------------------------------\n def _validate(self, p):\n \"\"\"Return position's node, or raise appropriate error if invalid.\"\"\"\n if not isinstance(p, self.Position):\n raise TypeError('p must be proper Position type')\n if p._container is not self:\n raise ValueError('p does not belong to this container')\n if p._node._next is None: # convention for deprecated nodes\n raise ValueError('p is no longer valid')\n return p._node\n\n def _make_position(self, node):\n \"\"\"Return Position instance for given node (or None if sentinel).\"\"\"\n if node is self._header or node is self._trailer:\n return None # boundary violation\n else:\n return self.Position(self, node) # legitimate position\n\n #------------------------------- accessors -------------------------------\n def first(self):\n \"\"\"Return the first Position in the list (or None if list is empty).\"\"\"\n return self._make_position(self._header._next)\n\n def last(self):\n \"\"\"Return the last Position in the list (or None if list is empty).\"\"\"\n return self._make_position(self._trailer._prev)\n\n def before(self, p):\n \"\"\"Return the Position just before Position p (or None if p is first).\"\"\"\n node = self._validate(p)\n return self._make_position(node._prev)\n\n def after(self, p):\n \"\"\"Return the Position just after Position p (or None if p is last).\"\"\"\n node = self._validate(p)\n return self._make_position(node._next)\n\n def __iter__(self):\n \"\"\"Generate a forward iteration of the elements of the list.\"\"\"\n cursor = self.first()\n while cursor is not None:\n yield cursor.element()\n cursor = self.after(cursor)\n\n #------------------------------- mutators -------------------------------\n # override inherited version to return Position, rather than Node\n def _insert_between(self, e, predecessor, successor):\n \"\"\"Add element between existing nodes and return new Position.\"\"\"\n node = super()._insert_between(e, predecessor, successor)\n return self._make_position(node)\n\n def add_first(self, e):\n \"\"\"Insert element e at the front of the list and return new Position.\"\"\"\n return self._insert_between(e, self._header, self._header._next)\n\n def add_last(self, e):\n \"\"\"Insert element e at the back of the list and return new Position.\"\"\"\n return self._insert_between(e, self._trailer._prev, self._trailer)\n\n def add_before(self, p, e):\n \"\"\"Insert element e into list before Position p and return new Position.\"\"\"\n original = self._validate(p)\n return self._insert_between(e, original._prev, original)\n\n def add_after(self, p, e):\n \"\"\"Insert element e into list after Position p and return new Position.\"\"\"\n original = self._validate(p)\n return self._insert_between(e, original, original._next)\n\n def delete(self, p):\n \"\"\"Remove and return the element at Position p.\"\"\"\n original = self._validate(p)\n return self._delete_node(original) # inherited method returns element\n\n def replace(self, p, e):\n \"\"\"Replace the element at Position p with e.\n\n Return the element formerly at Position p.\n \"\"\"\n original = self._validate(p)\n old_value = original._element # temporarily store old element\n original._element = e # replace with new element\n return old_value # return the old element value\n\nL1=LinkedDeque()\nL2=LinkedDeque()\ndic={}\ndic2={}\nn=int(input())\nfor i in range(n):\n a,b=(int(i) for i in input().split())\n dic[a]=b\n dic2[b]=a\n\nforw=0\nwhile (forw in dic) :\n L1.insert_last(dic[forw])\n t=dic[forw]\n dic.pop(forw)\n forw=t\nif L1.last()==0 :\n L1.delete_last()\nif n%2==0 :\n backw=0\n while (backw in dic2) :\n L2.insert_first(dic2[backw])\n t=dic2[backw]\n dic2.pop(backw)\n backw=t\nelse:\n tk,tv=0,0\n for (k, v) in dic.items():\n tk=k\n tv=v\n forw=tk\n while (forw in dic) :\n L2.insert_last(dic[forw])\n t=dic[forw]\n dic.pop(forw)\n forw=t\n backw=tv\n while (backw in dic2) :\n L2.insert_first(dic2[backw])\n t=dic2[backw]\n dic2.pop(backw)\n backw=t\noutList=[]\nwhile L1.is_empty()==False :\n outList.append(str(L2.first()))\n outList.append(str(L1.first()))\n L1.delete_first()\n L2.delete_first()\nif L2.is_empty()==False :\n outList.append(str(L2.first()))\n pass\nprint(\" \".join(outList))"}}},{"rowIdx":5686,"cells":{"id":{"kind":"string","value":"514_B. Han Solo and Lazer Gun_26836"},"description":{"kind":"string","value":"There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x0, y0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x0, y0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location. \n\nInput\n\nThe first line contains three integers n, x0 и y0 (1 ≤ n ≤ 1000, - 104 ≤ x0, y0 ≤ 104) — the number of stormtroopers on the battle field and the coordinates of your gun.\n\nNext n lines contain two integers each xi, yi ( - 104 ≤ xi, yi ≤ 104) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.\n\nOutput\n\nPrint a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers. \n\nExamples\n\nInput\n\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\n\nOutput\n\n2\n\n\nInput\n\n2 1 2\n1 1\n1 0\n\n\nOutput\n\n1\n\nNote\n\nExplanation to the first and second samples from the statement, respectively: \n\n<image>"},"code":{"kind":"string","value":"n, x0, y0 = map(int, input().split())\nslopes = {} # key: (num, den), val: count\n\nfor i in range(n):\n x, y = map(int, input().split())\n num = y - y0\n den = x - x0\n # print(num, den)\n if den == 0 and \"inf\" in slopes:\n slopes[\"inf\"] += 1\n elif den == 0:\n slopes[\"inf\"] = 1\n else:\n found = False\n for s in slopes:\n # print(isinstance(s, tuple))\n if isinstance(s, tuple) and num * s[1] == den * s[0]:\n slopes[s] += 1\n found = True\n if found == False:\n slopes[(num, den)] = 1\n \nprint(slopes.__len__())\n "},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"2 1 2\\n1 1\\n1 0\\n\",\n \"4 0 0\\n1 1\\n2 2\\n2 0\\n-1 -1\\n\",\n \"2 -10000 -10000\\n9998 9999\\n9999 10000\\n\",\n \"10 -4 -4\\n2 -4\\n2 0\\n-4 2\\n5 -4\\n-3 -5\\n1 4\\n-4 2\\n-3 5\\n0 -3\\n2 4\\n\",\n \"2 -10000 -10000\\n10000 10000\\n10000 9999\\n\",\n \"2 0 0\\n10000 -10000\\n10000 10000\\n\",\n \"2 0 0\\n0 2\\n1 90\\n\",\n \"2 0 0\\n0 10\\n1 2000\\n\",\n \"2 0 -1\\n0 1\\n1 10000\\n\",\n \"2 0 0\\n0 1337\\n3 9000\\n\",\n \"1 1 1\\n0 0\\n\",\n \"2 0 0\\n1001 0\\n1001 1\\n\",\n \"10 -3 3\\n3 -5\\n4 3\\n0 -2\\n0 0\\n3 -3\\n3 5\\n4 1\\n5 5\\n4 -5\\n4 -4\\n\",\n \"10 5 -3\\n1 1\\n2 -1\\n2 2\\n1 -2\\n4 -5\\n1 4\\n0 1\\n1 -4\\n-2 0\\n-4 -5\\n\",\n \"2 0 0\\n10000 -10000\\n-10000 10000\\n\",\n \"2 -10000 -10000\\n9998 9999\\n7267 10000\\n\",\n \"10 -4 -4\\n1 -4\\n2 0\\n-4 2\\n5 -4\\n-3 -5\\n1 4\\n-4 2\\n-3 5\\n0 -3\\n2 4\\n\",\n \"1 1 2\\n0 0\\n\",\n \"10 -3 3\\n3 -5\\n4 3\\n0 -2\\n-1 0\\n3 -3\\n3 5\\n4 1\\n5 5\\n4 -5\\n4 -4\\n\",\n \"10 5 -3\\n1 1\\n2 -1\\n2 2\\n1 -2\\n4 -5\\n1 4\\n0 1\\n1 -4\\n-2 0\\n-5 -5\\n\",\n \"4 0 0\\n1 2\\n2 2\\n2 0\\n-1 -1\\n\",\n \"4 0 0\\n1 2\\n2 3\\n2 0\\n-1 -1\\n\",\n \"2 -10000 -10000\\n10000 11000\\n10000 9999\\n\",\n \"2 1 0\\n10000 -10000\\n10000 10000\\n\",\n \"2 0 0\\n0 3\\n1 90\\n\",\n \"2 0 0\\n0 3\\n1 2000\\n\",\n \"2 0 -1\\n0 1\\n2 10000\\n\",\n \"2 0 0\\n0 911\\n3 9000\\n\",\n \"2 0 0\\n1001 0\\n1001 0\\n\",\n \"2 0 0\\n10000 -10000\\n-19336 10000\\n\",\n \"2 2 2\\n1 1\\n1 0\\n\",\n \"2 -10000 -10000\\n9998 9999\\n7267 10001\\n\",\n \"10 -4 -4\\n1 -4\\n2 0\\n-4 2\\n5 -4\\n-3 -5\\n1 4\\n-4 2\\n-3 2\\n0 -3\\n2 4\\n\",\n \"2 -10000 -162\\n10000 11000\\n10000 9999\\n\",\n \"2 1 0\\n10000 -10000\\n10100 10000\\n\",\n \"2 0 0\\n0 3\\n2 90\\n\",\n \"2 0 -1\\n0 1\\n4 10000\\n\",\n \"2 0 0\\n0 911\\n3 15795\\n\",\n \"1 1 0\\n0 0\\n\",\n \"2 0 0\\n1001 1\\n1001 0\\n\",\n \"10 5 -3\\n1 1\\n2 -1\\n2 2\\n2 -2\\n4 -5\\n1 4\\n0 1\\n1 -4\\n-2 0\\n-5 -5\\n\",\n \"2 0 0\\n10000 -10000\\n-37763 10000\\n\",\n \"2 2 2\\n1 1\\n2 0\\n\",\n \"2 -10000 -10000\\n9998 19262\\n7267 10001\\n\",\n \"10 -4 -4\\n1 -4\\n2 0\\n-4 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-3 2\\n0 -3\\n2 4\\n\",\n \"2 -10000 -162\\n10000 11010\\n10000 9999\\n\",\n \"2 1 -1\\n10000 -10000\\n10100 10000\\n\",\n \"2 0 -2\\n0 1\\n4 10000\\n\",\n \"1 1 0\\n0 -1\\n\",\n \"2 -1 0\\n1001 0\\n1001 0\\n\",\n \"10 5 -5\\n1 1\\n2 -1\\n2 2\\n2 -2\\n4 -5\\n1 4\\n0 1\\n1 -4\\n-2 0\\n-5 -5\\n\",\n \"2 0 0\\n10000 -6148\\n-37763 10000\\n\",\n \"2 4 2\\n1 1\\n2 0\\n\",\n \"4 1 0\\n1 2\\n2 3\\n2 0\\n-1 -1\\n\",\n \"2 -10000 -10000\\n9998 27807\\n7267 10001\\n\",\n \"10 -4 -4\\n1 -4\\n2 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-3 2\\n0 -3\\n2 4\\n\",\n \"2 -10000 -162\\n10000 11010\\n10000 12464\\n\",\n \"2 1 -1\\n10000 -16841\\n10100 10000\\n\",\n \"2 0 -2\\n0 2\\n4 10000\\n\",\n \"1 0 0\\n0 -1\\n\",\n \"2 -1 0\\n1001 0\\n1000 0\\n\",\n \"10 5 -7\\n1 1\\n2 -1\\n2 2\\n2 -2\\n4 -5\\n1 4\\n0 1\\n1 -4\\n-2 0\\n-5 -5\\n\",\n \"2 -1 0\\n10000 -6148\\n-37763 10000\\n\",\n \"2 4 2\\n1 0\\n2 0\\n\",\n \"4 1 0\\n1 2\\n2 3\\n2 1\\n-1 -1\\n\",\n \"2 -10000 -10000\\n9998 27807\\n7267 10011\\n\",\n \"10 -4 -4\\n1 -4\\n2 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-6 2\\n0 -3\\n2 4\\n\",\n \"2 -10000 -162\\n10000 11010\\n00000 12464\\n\",\n \"1 0 1\\n0 -1\\n\",\n \"2 -1 0\\n1001 -1\\n1000 0\\n\",\n \"10 5 -7\\n1 1\\n2 -1\\n2 2\\n2 -3\\n4 -5\\n1 4\\n0 1\\n1 -4\\n-2 0\\n-5 -5\\n\",\n \"2 -10000 -10000\\n9998 27807\\n7267 10010\\n\",\n \"10 -4 -4\\n1 -4\\n2 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-6 2\\n1 -3\\n2 4\\n\",\n \"2 -10000 -162\\n10000 11010\\n00000 18233\\n\",\n \"1 0 0\\n1 -1\\n\",\n \"2 -1 0\\n1001 -1\\n1000 1\\n\",\n \"10 5 -7\\n1 1\\n2 -1\\n2 2\\n2 -3\\n4 -5\\n1 4\\n0 1\\n1 -4\\n-2 0\\n-5 0\\n\",\n \"2 -10000 -10000\\n9998 27807\\n3100 10010\\n\",\n \"10 -4 -4\\n1 -4\\n3 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-6 2\\n1 -3\\n2 4\\n\",\n \"2 -10000 -162\\n10010 11010\\n00000 18233\\n\",\n \"2 -1 0\\n1001 -2\\n1000 1\\n\",\n \"10 5 -7\\n1 1\\n2 -1\\n2 2\\n2 -3\\n4 -5\\n0 4\\n0 1\\n1 -4\\n-2 0\\n-5 0\\n\",\n \"10 -4 -6\\n1 -4\\n3 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-6 2\\n1 -3\\n2 4\\n\",\n \"2 -9104 -162\\n10010 11010\\n00000 18233\\n\",\n \"2 -1 0\\n1001 -2\\n1100 1\\n\",\n \"10 -4 -6\\n1 -4\\n0 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-6 2\\n1 -3\\n2 4\\n\",\n \"2 -9104 -162\\n10010 11010\\n00010 18233\\n\",\n \"2 -1 -1\\n1001 -2\\n1100 1\\n\",\n \"10 -4 -6\\n1 -4\\n0 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-6 2\\n1 -3\\n0 4\\n\",\n \"2 -9104 -162\\n10000 11010\\n00010 18233\\n\",\n \"10 -4 -6\\n1 -4\\n0 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-6 2\\n1 -6\\n0 4\\n\",\n \"2 -9104 -238\\n10000 11010\\n00010 18233\\n\",\n \"10 -4 -6\\n1 -4\\n0 0\\n0 2\\n5 -4\\n-3 -5\\n1 1\\n-4 2\\n-6 2\\n2 -6\\n0 4\\n\",\n \"2 -8053 -238\\n10000 11010\\n00010 18233\\n\",\n \"10 -4 -6\\n1 -4\\n0 0\\n0 2\\n5 -4\\n-3 -1\\n1 1\\n-4 2\\n-6 2\\n2 -6\\n0 4\\n\",\n \"2 -14604 -238\\n10000 11010\\n00010 18233\\n\",\n \"10 -4 -6\\n0 -4\\n0 0\\n0 2\\n5 -4\\n-3 -1\\n1 1\\n-4 2\\n-6 2\\n2 -6\\n0 4\\n\",\n \"2 -14604 -238\\n10000 11110\\n00010 18233\\n\",\n \"10 -4 -6\\n0 -4\\n0 0\\n0 2\\n5 -1\\n-3 -1\\n1 1\\n-4 2\\n-6 2\\n2 -6\\n0 4\\n\",\n \"2 -14604 -238\\n10000 11110\\n00000 18233\\n\",\n \"10 -4 -6\\n0 -4\\n0 0\\n0 2\\n5 -1\\n-3 -1\\n1 1\\n-1 2\\n-6 2\\n2 -6\\n0 4\\n\",\n \"2 -14604 -238\\n10001 11110\\n00000 18233\\n\",\n \"10 -4 -6\\n0 -4\\n0 0\\n0 4\\n5 -1\\n-3 -1\\n1 1\\n-1 2\\n-6 2\\n2 -6\\n0 4\\n\",\n \"10 -4 -6\\n0 -1\\n0 0\\n0 4\\n5 -1\\n-3 -1\\n1 1\\n-1 2\\n-6 2\\n2 -6\\n0 4\\n\",\n \"10 -4 -6\\n0 -1\\n0 0\\n0 4\\n5 -1\\n-3 -1\\n1 1\\n-1 2\\n-3 2\\n2 -6\\n0 4\\n\",\n \"10 -4 -6\\n0 -1\\n0 0\\n0 4\\n5 -2\\n-3 -1\\n1 1\\n-1 2\\n-3 2\\n2 -6\\n0 4\\n\",\n \"10 -4 -6\\n-1 -1\\n0 0\\n0 4\\n5 -2\\n-3 -1\\n1 1\\n-1 2\\n-3 2\\n2 -6\\n0 4\\n\"\n ],\n \"output\": [\n \"1\\n\",\n \"2\\n\",\n \"2\\n\",\n \"8\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"1\\n\",\n \"2\\n\",\n \"8\\n\",\n \"10\\n\",\n \"1\\n\",\n \"2\\n\",\n \"8\\n\",\n \"1\\n\",\n \"9\\n\",\n \"10\\n\",\n \"3\\n\",\n \"4\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"1\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"8\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"1\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"8\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"1\\n\",\n \"1\\n\",\n \"9\\n\",\n \"2\\n\",\n \"2\\n\",\n \"4\\n\",\n \"2\\n\",\n \"9\\n\",\n \"2\\n\",\n \"2\\n\",\n \"2\\n\",\n \"1\\n\",\n \"1\\n\",\n \"8\\n\",\n \"2\\n\",\n \"2\\n\",\n \"4\\n\",\n \"2\\n\",\n \"9\\n\",\n \"2\\n\",\n \"1\\n\",\n \"2\\n\",\n \"8\\n\",\n \"2\\n\",\n \"9\\n\",\n \"2\\n\",\n \"1\\n\",\n \"2\\n\",\n \"8\\n\",\n \"2\\n\",\n \"9\\n\",\n \"2\\n\",\n \"2\\n\",\n \"8\\n\",\n \"10\\n\",\n \"2\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"10\\n\",\n \"2\\n\",\n \"9\\n\",\n \"9\\n\",\n \"9\\n\",\n \"9\\n\",\n \"9\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nThere are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane. \n\nHan Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x0, y0). In one shot it can can destroy all the stormtroopers, situated on some line that crosses point (x0, y0).\n\nYour task is to determine what minimum number of shots Han Solo needs to defeat all the stormtroopers.\n\nThe gun is the newest invention, it shoots very quickly and even after a very large number of shots the stormtroopers don't have enough time to realize what's happening and change their location. \n\nInput\n\nThe first line contains three integers n, x0 и y0 (1 ≤ n ≤ 1000, - 104 ≤ x0, y0 ≤ 104) — the number of stormtroopers on the battle field and the coordinates of your gun.\n\nNext n lines contain two integers each xi, yi ( - 104 ≤ xi, yi ≤ 104) — the coordinates of the stormtroopers on the battlefield. It is guaranteed that no stormtrooper stands at the same point with the gun. Multiple stormtroopers can stand at the same point.\n\nOutput\n\nPrint a single integer — the minimum number of shots Han Solo needs to destroy all the stormtroopers. \n\nExamples\n\nInput\n\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\n\nOutput\n\n2\n\n\nInput\n\n2 1 2\n1 1\n1 0\n\n\nOutput\n\n1\n\nNote\n\nExplanation to the first and second samples from the statement, respectively: \n\n<image>\n\n### Input:\n2 1 2\n1 1\n1 0\n\n### Output:\n1\n\n\n### Input:\n4 0 0\n1 1\n2 2\n2 0\n-1 -1\n\n### Output:\n2\n\n\n### Code:\nn, x0, y0 = map(int, input().split())\nslopes = {} # key: (num, den), val: count\n\nfor i in range(n):\n x, y = map(int, input().split())\n num = y - y0\n den = x - x0\n # print(num, den)\n if den == 0 and \"inf\" in slopes:\n slopes[\"inf\"] += 1\n elif den == 0:\n slopes[\"inf\"] = 1\n else:\n found = False\n for s in slopes:\n # print(isinstance(s, tuple))\n if isinstance(s, tuple) and num * s[1] == den * s[0]:\n slopes[s] += 1\n found = True\n if found == False:\n slopes[(num, den)] = 1\n \nprint(slopes.__len__())\n "}}},{"rowIdx":5687,"cells":{"id":{"kind":"string","value":"540_C. Ice Cave_26840"},"description":{"kind":"string","value":"You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through the ice.\n\nThe level of the cave where you are is a rectangular square grid of n rows and m columns. Each cell consists either from intact or from cracked ice. From each cell you can move to cells that are side-adjacent with yours (due to some limitations of the game engine you cannot make jumps on the same place, i.e. jump from a cell to itself). If you move to the cell with cracked ice, then your character falls down through it and if you move to the cell with intact ice, then the ice on this cell becomes cracked.\n\nLet's number the rows with integers from 1 to n from top to bottom and the columns with integers from 1 to m from left to right. Let's denote a cell on the intersection of the r-th row and the c-th column as (r, c). \n\nYou are staying in the cell (r1, c1) and this cell is cracked because you've just fallen here from a higher level. You need to fall down through the cell (r2, c2) since the exit to the next level is there. Can you do this?\n\nInput\n\nThe first line contains two integers, n and m (1 ≤ n, m ≤ 500) — the number of rows and columns in the cave description.\n\nEach of the next n lines describes the initial state of the level of the cave, each line consists of m characters \".\" (that is, intact ice) and \"X\" (cracked ice).\n\nThe next line contains two integers, r1 and c1 (1 ≤ r1 ≤ n, 1 ≤ c1 ≤ m) — your initial coordinates. It is guaranteed that the description of the cave contains character 'X' in cell (r1, c1), that is, the ice on the starting cell is initially cracked.\n\nThe next line contains two integers r2 and c2 (1 ≤ r2 ≤ n, 1 ≤ c2 ≤ m) — the coordinates of the cell through which you need to fall. The final cell may coincide with the starting one.\n\nOutput\n\nIf you can reach the destination, print 'YES', otherwise print 'NO'.\n\nExamples\n\nInput\n\n4 6\nX...XX\n...XX.\n.X..X.\n......\n1 6\n2 2\n\n\nOutput\n\nYES\n\n\nInput\n\n5 4\n.X..\n...X\nX.X.\n....\n.XX.\n5 3\n1 1\n\n\nOutput\n\nNO\n\n\nInput\n\n4 7\n..X.XX.\n.XX..X.\nX...X..\nX......\n2 2\n1 6\n\n\nOutput\n\nYES\n\nNote\n\nIn the first sample test one possible path is:\n\n<image>\n\nAfter the first visit of cell (2, 2) the ice on it cracks and when you step there for the second time, your character falls through the ice as intended."},"code":{"kind":"string","value":"import queue\nMAX = 500\ndr = [0,0,1,-1]\ndc = [1,-1,0,0]\ndef isValid(r, c):\n return r in range(m) and c in range(n)\n \ndef BFS(sr, sc, fr, fc):\n q = [0] * (MAX * MAX)\n left = right = 0\n q[0] = (sr, sc)\n while left <= right:\n ur, uc = q[left]\n left += 1\n for i in range(4):\n vr = ur + dr[i]\n vc = uc + dc[i]\n if isValid(vr, vc):\n if maze[vr][vc] == '.':\n maze[vr][vc] = 'X'\n right += 1\n q[right] = (vr, vc)\n else:\n if(vr == fr) and (vc==fc):\n return True\n return False\n \nif __name__ == '__main__':\n \n maze = []\n m, n = map(int, input().split())\n \n for i in range(m):\n temp = list(input())\n maze.append(temp)\n start, start2 = map(int, input().split())\n# s1 = Cell(start-1,start2-1)\n end1, end2 = map(int, input().split())\n# e = Cell(end1-1,end2-1)\n if(BFS(start - 1, start2 - 1, end1 - 1, end2 - 1)):\n print('YES')\n else:\n print('NO')"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"5 4\\n.X..\\n...X\\nX.X.\\n....\\n.XX.\\n5 3\\n1 1\\n\",\n \"4 7\\n..X.XX.\\n.XX..X.\\nX...X..\\nX......\\n2 2\\n1 6\\n\",\n \"4 6\\nX...XX\\n...XX.\\n.X..X.\\n......\\n1 6\\n2 2\\n\",\n \"1 2\\nX.\\n1 1\\n1 2\\n\",\n \"2 1\\nX\\nX\\n2 1\\n2 1\\n\",\n \"4 3\\n..X\\n..X\\n.XX\\n.XX\\n4 2\\n2 2\\n\",\n \"2 2\\n..\\nXX\\n2 1\\n1 1\\n\",\n \"2 2\\nX.\\n..\\n1 1\\n2 2\\n\",\n \"6 4\\nX..X\\n..X.\\n.X..\\n..X.\\n.X..\\nX..X\\n1 1\\n6 4\\n\",\n \"7 1\\nX\\n.\\n.\\n.\\nX\\n.\\n.\\n5 1\\n3 1\\n\",\n \"2 1\\nX\\nX\\n2 1\\n1 1\\n\",\n \"3 4\\nX..X\\n..XX\\n.X..\\n2 3\\n3 1\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX....\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX.....X........\\n...XX......X.........\\n.....X...XX...X......\\n..X.X....XX..XX.X....\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"1 2\\n.X\\n1 2\\n1 2\\n\",\n \"2 2\\nXX\\nX.\\n1 1\\n2 2\\n\",\n \"5 4\\nX...\\n..X.\\n.X..\\nX..X\\n....\\n4 4\\n3 1\\n\",\n \"3 4\\n.X..\\n..XX\\n..X.\\n1 2\\n3 4\\n\",\n \"2 1\\nX\\n.\\n1 1\\n2 1\\n\",\n \"1 2\\nX.\\n1 1\\n1 1\\n\",\n \"5 4\\nXXXX\\nX..X\\nX..X\\nXXXX\\nXXXX\\n4 2\\n3 3\\n\",\n \"2 2\\n..\\n.X\\n2 2\\n1 1\\n\",\n \"2 1\\n.\\nX\\n2 1\\n1 1\\n\",\n \"1 2\\nXX\\n1 2\\n1 2\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\nX..........X........\\n......X........X....\\n....................\\n...................X\\n......X.............\\n..............X.....\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n....................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n5 20\\n\",\n \"2 1\\nX\\nX\\n1 1\\n1 1\\n\",\n \"3 4\\nXX.X\\nX...\\n.X.X\\n1 2\\n1 1\\n\",\n \"2 2\\nXX\\nXX\\n1 1\\n2 2\\n\",\n \"1 2\\nXX\\n1 1\\n1 2\\n\",\n \"2 2\\n.X\\n.X\\n1 2\\n2 2\\n\",\n \"3 2\\n..\\nX.\\n.X\\n3 2\\n3 1\\n\",\n \"1 2\\nXX\\n1 1\\n1 1\\n\",\n \"2 2\\n..\\nX.\\n2 1\\n1 1\\n\",\n \"1 2\\nXX\\n1 2\\n1 1\\n\",\n \"3 5\\n.X.XX\\nX...X\\nX.X..\\n2 1\\n1 5\\n\",\n \"1 2\\n.X\\n1 2\\n1 1\\n\",\n \"2 1\\n.\\nX\\n2 1\\n2 1\\n\",\n \"2 4\\nX.XX\\n.X..\\n2 2\\n2 3\\n\",\n \"4 2\\nX.\\n.X\\n.X\\nXX\\n2 2\\n3 1\\n\",\n \"5 3\\n.XX\\n...\\n.X.\\n.X.\\n...\\n1 3\\n4 1\\n\",\n \"3 3\\nXXX\\nX..\\nXXX\\n2 1\\n2 2\\n\",\n \"2 1\\nX\\n.\\n1 1\\n1 1\\n\",\n \"2 1\\nX\\nX\\n1 1\\n2 1\\n\",\n \"1 1\\nX\\n1 1\\n1 1\\n\",\n \"1 6\\n.X...X\\n1 2\\n1 5\\n\",\n \"6 4\\nX..X\\n..X.\\n.X..\\n..X.\\nX...\\nX..X\\n1 1\\n6 4\\n\",\n \"3 4\\n.Y..\\n..XX\\n..X.\\n1 2\\n3 4\\n\",\n \"3 4\\nX..X\\n..XX\\n.X..\\n2 3\\n2 1\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX.....X........\\n...XX......X.........\\n.....X...XX...X......\\n..X.X....XX..XX.X....\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"2 2\\n..\\nX.\\n2 2\\n1 1\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\nX..........X........\\n......X........X....\\n....................\\n...................X\\n......X..-..........\\n..............X.....\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n....................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n5 20\\n\",\n \"3 4\\nXX.X\\nX...\\n.X.X\\n1 2\\n1 2\\n\",\n \"2 4\\nX.XX\\n-X..\\n2 2\\n2 3\\n\",\n \"5 4\\n.X..\\n...X\\nX.X.\\n....\\n.XX.\\n3 3\\n1 1\\n\",\n \"4 7\\nX.X..X.\\n.XX..X.\\nX...X..\\nX......\\n2 2\\n1 6\\n\",\n \"4 6\\nX...XX\\n...XX.\\n.X..X.\\n......\\n1 1\\n2 2\\n\",\n \"6 4\\nX..X\\n..X.\\n.X..\\n..X.\\nX...\\nX..X\\n1 1\\n6 3\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n.....X...XX...X......\\n..X.X....XX..XX.X....\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\nX.......-..X........\\n......X........X....\\n....................\\n...................X\\n......X..-..........\\n..............X.....\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n....................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n5 20\\n\",\n \"2 4\\n.XXX\\n-X..\\n2 2\\n2 3\\n\",\n \"5 4\\n.X..\\n../X\\nX.X.\\n....\\n.XX.\\n3 3\\n1 1\\n\",\n \"4 7\\nX.X..X.\\n.XX..X.\\nX...X..\\nX......\\n2 3\\n1 6\\n\",\n \"4 6\\nX...XX\\n...XX.\\n.X..X.\\n/.....\\n1 1\\n2 2\\n\",\n \"6 4\\n..XX\\n..X.\\n.X..\\n..X.\\nX...\\nX..X\\n1 1\\n6 3\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n.....X...XX...X......\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\nX.......-..X........\\n......X........X....\\n....................\\n...................X\\n......X..-..........\\n.....X..............\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n....................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n5 20\\n\",\n \"2 4\\nXX.X\\n-X..\\n2 2\\n2 3\\n\",\n \"5 4\\n.X..\\n../Y\\nX.X.\\n....\\n.XX.\\n3 3\\n1 1\\n\",\n \"4 7\\nX.X..X.\\n.XX..X.\\nX...X..\\nX......\\n1 3\\n1 6\\n\",\n \"4 6\\nX...XX\\n...XX.\\n.X..X.\\n/.....\\n2 1\\n2 2\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n.....X...XX...X......\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"2 4\\nX.XX\\n-X..\\n1 2\\n2 3\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX...X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX...X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.XXX...XX....X...X...\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.XXX...XX....X...X...\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X/.....\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.XXX...XX....X...X...\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXY.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X/.....\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.XXX...XX....X...X...\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXY.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X/.....\\n20 1\\n21 5\\n\",\n \"4 3\\n..X\\nX..\\n.XX\\n.XX\\n4 2\\n2 2\\n\",\n \"2 2\\nX.\\n..\\n1 2\\n2 2\\n\",\n \"6 4\\nX..X\\n..X.\\n.X..\\n..X.\\n.X..\\nX..X\\n1 1\\n6 2\\n\",\n \"3 4\\nX..W\\n..XX\\n.X..\\n2 3\\n3 1\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X.X.X....XX...XX..\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX....\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX.....X........\\n...XX......X.........\\n.....X...XX...X......\\n..X.X....XX..XX.X....\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"2 2\\nXX\\nX.\\n1 1\\n2 1\\n\",\n \"5 4\\nX...\\n..X.\\n.X..\\n..XX\\n....\\n4 4\\n3 1\\n\",\n \"3 4\\n.X..\\n..XX\\n.X..\\n1 2\\n3 4\\n\",\n \"2 2\\n..\\n.X\\n2 1\\n1 1\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\nX..........X........\\n......X........X....\\n....................\\n...................X\\n......X.............\\n..............X.....\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n....................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n6 20\\n\",\n \"3 2\\n..\\nX.\\nX.\\n3 2\\n3 1\\n\",\n \"3 3\\nXXX\\nX..\\nXXX\\n1 1\\n2 2\\n\",\n \"5 4\\n.X..\\n...X\\nX.W.\\n....\\n.XX.\\n5 3\\n1 1\\n\",\n \"6 4\\nX..X\\n..X.\\n..X.\\n..X.\\nX...\\nX..X\\n1 1\\n6 4\\n\",\n \"3 4\\nX..X\\nXX..\\n.X..\\n2 3\\n2 1\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n.....-X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX.....X........\\n...XX......X.........\\n.....X...XX...X......\\n..X.X....XX..XX.X....\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"3 4\\n.Y..\\n..XX\\n..X.\\n2 2\\n3 4\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\nX..........X........\\n......X........X....\\n....................\\n...................X\\n......X..-..........\\n..............X.....\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n.../................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n5 20\\n\",\n \"3 4\\nXX/X\\nX...\\n.X.X\\n1 2\\n1 2\\n\",\n \"5 4\\nX...\\n...X\\nX.X.\\n....\\n.XX.\\n3 3\\n1 1\\n\",\n \"4 7\\nX.X..X.\\n.XX..X.\\nX...X..\\nX......\\n2 2\\n1 1\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n.....X...XX...X......\\n..X.X....XX..XX.X....\\nX........X.X..XX..X..\\n....X.X...X......X..X\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\nX.......-..X........\\n......X........X....\\n....................\\n...................X\\n......X..-..........\\n........./....X.....\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n....................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n5 20\\n\",\n \"2 4\\n.XXX\\n,X..\\n2 2\\n2 3\\n\",\n \"5 4\\n.X..\\n../X\\nW.X.\\n....\\n.XX.\\n3 3\\n1 1\\n\",\n \"4 6\\nX...XX\\n.X..X.\\n.X..X.\\n/.....\\n1 1\\n2 2\\n\",\n \"6 4\\n..XX\\n.X..\\n.X..\\n..X.\\nX...\\nX..X\\n1 1\\n6 3\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX...-..X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n.....X...XX...X......\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\n........X..-.......X\\n......X........X....\\n....................\\n...................X\\n......X..-..........\\n.....X..............\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n....................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n5 20\\n\",\n \"5 4\\n.X..\\n../Y\\nX.X.\\n....\\n.XX.\\n3 1\\n1 1\\n\",\n \"4 7\\nX.X..X.\\n.XX..X.\\nX...X..\\nX...../\\n1 3\\n1 6\\n\",\n \"4 6\\nX...XX\\n...XX.\\n.X..Y.\\n/.....\\n2 1\\n2 2\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX/...\\n.X..X.XXX..X.......X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n.....X...XX...X......\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n...X...X....XX...XXX.\\n.X............X......\\n......Y.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX...X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.-.X...X....XX...XXX.\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.XXX...XX....X...X...\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X...../...\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.XXX...XX....X...X...\\n.W............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X/.....\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X.........X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.XXX...XX....X...X...\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXY.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n.....X.-.XX...X......\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X/.....\\n20 4\\n21 5\\n\",\n \"21 21\\n.....X./.X..-......X.\\n...X...XX......X.....\\n..X........X.X...XX..\\n.........X....X...X..\\nX...X...........XX...\\n.XXX...XX....X...X...\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n.-....XX......X.X....\\n....X.......X.XXX/...\\n.X.......X..XXY.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX...-.X........\\n...XX......X.........\\n......X...XX.-.X.....\\n....X.XX..XX....X.X..\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X/.....\\n20 1\\n21 5\\n\",\n \"4 3\\n..X\\nX..\\n.XX\\nXX.\\n4 2\\n2 2\\n\",\n \"21 21\\n.....X...X.........X.\\n...X...XX......X.....\\n..X..........X...XX.X\\n.........X....X...X..\\nX...X...........XX...\\n...X.X.X....XX...XX..\\n.X............X......\\n......X.X............\\n.X...X.........X.X...\\n......XX......X.X....\\n....X.......X.XXX....\\n.X.......X..XXX.X..X.\\n..X........X....X...X\\n.........X..........X\\n.....XX.....X........\\n...XX......X.........\\n.....X...XX...X......\\n..X.X....XX..XX.X....\\nX........X.X..XX..X..\\nX..X......X...X.X....\\nX.....X.....X.X......\\n20 4\\n21 5\\n\",\n \"2 2\\nXX\\nX.\\n2 1\\n2 1\\n\",\n \"5 4\\n..X.\\n..X.\\n.X..\\n..XX\\n....\\n4 4\\n3 1\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X.....\\n....X.....X.........\\nX..........X........\\n......X........X....\\n....................\\n...................X\\n......X.............\\n..............X.....\\n...........X.X......\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n....................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n6 20\\n\",\n \"5 4\\n..X.\\n...X\\nX.W.\\n....\\n.XX.\\n5 3\\n1 1\\n\",\n \"6 4\\nX..X\\n..X.\\n..X.\\n.X..\\nX...\\nX..X\\n1 1\\n6 4\\n\",\n \"20 20\\n....................\\n.......X...........X\\n............X......X\\n.X...XX..X....X..-..\\n....X.....X.........\\nX..........X........\\n......X........X....\\n....................\\n...................X\\n......X..-..........\\n..............X.....\\n......X.X...........\\n.X.........X.X......\\n.........X......X..X\\n..................X.\\n...X........X.......\\n....................\\n.../................\\n..X.....X...........\\n........X......X.X..\\n20 16\\n5 20\\n\",\n \"3 4\\nXX/X\\nX...\\n.X.X\\n1 3\\n1 2\\n\"\n ],\n \"output\": [\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"YES\\n\",\n \"NO\\n\",\n \"YES\\n\",\n \"YES\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nYou play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through the ice.\n\nThe level of the cave where you are is a rectangular square grid of n rows and m columns. Each cell consists either from intact or from cracked ice. From each cell you can move to cells that are side-adjacent with yours (due to some limitations of the game engine you cannot make jumps on the same place, i.e. jump from a cell to itself). If you move to the cell with cracked ice, then your character falls down through it and if you move to the cell with intact ice, then the ice on this cell becomes cracked.\n\nLet's number the rows with integers from 1 to n from top to bottom and the columns with integers from 1 to m from left to right. Let's denote a cell on the intersection of the r-th row and the c-th column as (r, c). \n\nYou are staying in the cell (r1, c1) and this cell is cracked because you've just fallen here from a higher level. You need to fall down through the cell (r2, c2) since the exit to the next level is there. Can you do this?\n\nInput\n\nThe first line contains two integers, n and m (1 ≤ n, m ≤ 500) — the number of rows and columns in the cave description.\n\nEach of the next n lines describes the initial state of the level of the cave, each line consists of m characters \".\" (that is, intact ice) and \"X\" (cracked ice).\n\nThe next line contains two integers, r1 and c1 (1 ≤ r1 ≤ n, 1 ≤ c1 ≤ m) — your initial coordinates. It is guaranteed that the description of the cave contains character 'X' in cell (r1, c1), that is, the ice on the starting cell is initially cracked.\n\nThe next line contains two integers r2 and c2 (1 ≤ r2 ≤ n, 1 ≤ c2 ≤ m) — the coordinates of the cell through which you need to fall. The final cell may coincide with the starting one.\n\nOutput\n\nIf you can reach the destination, print 'YES', otherwise print 'NO'.\n\nExamples\n\nInput\n\n4 6\nX...XX\n...XX.\n.X..X.\n......\n1 6\n2 2\n\n\nOutput\n\nYES\n\n\nInput\n\n5 4\n.X..\n...X\nX.X.\n....\n.XX.\n5 3\n1 1\n\n\nOutput\n\nNO\n\n\nInput\n\n4 7\n..X.XX.\n.XX..X.\nX...X..\nX......\n2 2\n1 6\n\n\nOutput\n\nYES\n\nNote\n\nIn the first sample test one possible path is:\n\n<image>\n\nAfter the first visit of cell (2, 2) the ice on it cracks and when you step there for the second time, your character falls through the ice as intended.\n\n### Input:\n5 4\n.X..\n...X\nX.X.\n....\n.XX.\n5 3\n1 1\n\n### Output:\nNO\n\n\n### Input:\n4 7\n..X.XX.\n.XX..X.\nX...X..\nX......\n2 2\n1 6\n\n### Output:\nYES\n\n\n### Code:\nimport queue\nMAX = 500\ndr = [0,0,1,-1]\ndc = [1,-1,0,0]\ndef isValid(r, c):\n return r in range(m) and c in range(n)\n \ndef BFS(sr, sc, fr, fc):\n q = [0] * (MAX * MAX)\n left = right = 0\n q[0] = (sr, sc)\n while left <= right:\n ur, uc = q[left]\n left += 1\n for i in range(4):\n vr = ur + dr[i]\n vc = uc + dc[i]\n if isValid(vr, vc):\n if maze[vr][vc] == '.':\n maze[vr][vc] = 'X'\n right += 1\n q[right] = (vr, vc)\n else:\n if(vr == fr) and (vc==fc):\n return True\n return False\n \nif __name__ == '__main__':\n \n maze = []\n m, n = map(int, input().split())\n \n for i in range(m):\n temp = list(input())\n maze.append(temp)\n start, start2 = map(int, input().split())\n# s1 = Cell(start-1,start2-1)\n end1, end2 = map(int, input().split())\n# e = Cell(end1-1,end2-1)\n if(BFS(start - 1, start2 - 1, end1 - 1, end2 - 1)):\n print('YES')\n else:\n print('NO')"}}},{"rowIdx":5688,"cells":{"id":{"kind":"string","value":"58_B. Coins_26847"},"description":{"kind":"string","value":"In Berland a money reform is being prepared. New coins are being introduced. After long economic calculations was decided that the most expensive coin should possess the denomination of exactly n Berland dollars. Also the following restriction has been introduced for comfort: the denomination of each coin should be divisible by the denomination of any cheaper coin. It is known that among all the possible variants the variant with the largest number of new coins will be chosen. Find this variant. Print in the order of decreasing of the coins' denominations.\n\nInput\n\nThe first and only line contains an integer n (1 ≤ n ≤ 106) which represents the denomination of the most expensive coin. \n\nOutput\n\nPrint the denominations of all the coins in the order of decreasing. The number of coins must be the largest possible (with the given denomination n of the most expensive coin). Also, the denomination of every coin must be divisible by the denomination of any cheaper coin. Naturally, the denominations of all the coins should be different. If there are several solutins to that problem, print any of them.\n\nExamples\n\nInput\n\n10\n\n\nOutput\n\n10 5 1\n\n\nInput\n\n4\n\n\nOutput\n\n4 2 1\n\n\nInput\n\n3\n\n\nOutput\n\n3 1"},"code":{"kind":"string","value":"def O(x):\n l=[]\n if x==1:\n return 1\n for i in range(1,x//2+1):\n if x%i==0:\n l.append(i)\n print(x)\n return O(l[len(l)-1])\nx=int(input())\nO(x)\nprint(1)\n\n\n \t \t \t \t\t \t\t\t\t\t\t \t \t \t"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"3\\n\",\n \"4\\n\",\n \"10\\n\",\n \"473273\\n\",\n \"784653\\n\",\n \"8\\n\",\n \"1000000\\n\",\n \"20\\n\",\n \"10000\\n\",\n \"25\\n\",\n \"627251\\n\",\n \"7\\n\",\n \"2430\\n\",\n \"12\\n\",\n \"733035\\n\",\n \"893193\\n\",\n \"1331\\n\",\n \"648\\n\",\n \"600\\n\",\n \"21\\n\",\n \"999999\\n\",\n \"36\\n\",\n \"1000\\n\",\n \"9\\n\",\n \"6\\n\",\n \"572877\\n\",\n \"509149\\n\",\n \"152956\\n\",\n \"537000\\n\",\n \"100000\\n\",\n \"1\\n\",\n \"120\\n\",\n \"121\\n\",\n \"119070\\n\",\n \"117079\\n\",\n \"15\\n\",\n \"2\\n\",\n \"100\\n\",\n \"720\\n\",\n \"999983\\n\",\n \"313114\\n\",\n \"5\\n\",\n \"524287\\n\",\n \"892780\\n\",\n \"429533\\n\",\n \"23\\n\",\n \"10001\\n\",\n \"666908\\n\",\n \"11\\n\",\n \"336\\n\",\n \"17\\n\",\n \"835118\\n\",\n \"685248\\n\",\n \"1073\\n\",\n \"985\\n\",\n \"1040\\n\",\n \"28\\n\",\n \"30\\n\",\n \"1100\\n\",\n \"14\\n\",\n \"854692\\n\",\n \"525569\\n\",\n \"268519\\n\",\n \"948036\\n\",\n \"22\\n\",\n \"195\\n\",\n \"39077\\n\",\n \"102241\\n\",\n \"863\\n\",\n \"256525\\n\",\n \"72800\\n\",\n \"13\\n\",\n \"405538\\n\",\n \"41\\n\",\n \"436831\\n\",\n \"35\\n\",\n \"10011\\n\",\n \"397564\\n\",\n \"26\\n\",\n \"466\\n\",\n \"49146\\n\",\n \"99130\\n\",\n \"1028\\n\",\n \"1694\\n\",\n \"759\\n\",\n \"31\\n\",\n \"55\\n\",\n \"0100\\n\",\n \"34\\n\",\n \"806830\\n\",\n \"494711\\n\",\n \"380673\\n\",\n \"400418\\n\",\n \"18\\n\",\n \"342\\n\",\n \"9163\\n\",\n \"80171\\n\",\n \"534\\n\",\n \"273788\\n\",\n \"38489\\n\",\n \"46\\n\",\n \"62006\\n\",\n \"71\\n\",\n \"862173\\n\",\n \"29\\n\",\n \"587809\\n\",\n \"579\\n\",\n \"10989\\n\",\n \"163847\\n\",\n \"603\\n\",\n \"226\\n\",\n \"356\\n\",\n \"54\\n\",\n \"16\\n\",\n \"39\\n\",\n \"777431\\n\",\n \"771017\\n\",\n \"383273\\n\",\n \"386781\\n\",\n \"19\\n\",\n \"178\\n\",\n \"14846\\n\",\n \"38780\\n\",\n \"886\\n\",\n \"121895\\n\",\n \"69530\\n\",\n \"43673\\n\",\n \"98\\n\",\n \"669655\\n\",\n \"51\\n\",\n \"00111\\n\",\n \"935570\\n\",\n \"516\\n\",\n \"18121\\n\",\n \"324908\\n\",\n \"609\\n\",\n \"264\\n\",\n \"00011\\n\"\n ],\n \"output\": [\n \"3 1\\n\",\n \"4 2 1\\n\",\n \"10 5 1\\n\",\n \"473273 2243 1\\n\",\n \"784653 261551 9019 311 1\\n\",\n \"8 4 2 1\\n\",\n \"1000000 500000 250000 125000 62500 31250 15625 3125 625 125 25 5 1\\n\",\n \"20 10 5 1\\n\",\n \"10000 5000 2500 1250 625 125 25 5 1\\n\",\n \"25 5 1\\n\",\n \"627251 1\\n\",\n \"7 1\\n\",\n \"2430 1215 405 135 45 15 5 1\\n\",\n \"12 6 3 1\\n\",\n \"733035 244345 48869 1\\n\",\n \"893193 297731 42533 1\\n\",\n \"1331 121 11 1\\n\",\n \"648 324 162 81 27 9 3 1\\n\",\n \"600 300 150 75 25 5 1\\n\",\n \"21 7 1\\n\",\n \"999999 333333 111111 37037 5291 481 37 1\\n\",\n \"36 18 9 3 1\\n\",\n \"1000 500 250 125 25 5 1\\n\",\n \"9 3 1\\n\",\n \"6 3 1\\n\",\n \"572877 190959 63653 1201 1\\n\",\n \"509149 1\\n\",\n \"152956 76478 38239 1\\n\",\n \"537000 268500 134250 67125 22375 4475 895 179 1\\n\",\n \"100000 50000 25000 12500 6250 3125 625 125 25 5 1\\n\",\n \"1\\n\",\n \"120 60 30 15 5 1\\n\",\n \"121 11 1\\n\",\n \"119070 59535 19845 6615 2205 735 245 49 7 1\\n\",\n \"117079 6887 97 1\\n\",\n \"15 5 1\\n\",\n \"2 1\\n\",\n \"100 50 25 5 1\\n\",\n \"720 360 180 90 45 15 5 1\\n\",\n \"999983 1\\n\",\n \"313114 156557 3331 1\\n\",\n \"5 1\\n\",\n \"524287 1\\n\",\n \"892780 446390 223195 44639 6377 911 1 \",\n \"429533 33041 1739 47 1 \",\n \"23 1 \",\n \"10001 137 1 \",\n \"666908 333454 166727 15157 659 1 \",\n \"11 1 \",\n \"336 168 84 42 21 7 1 \",\n \"17 1 \",\n \"835118 417559 1 \",\n \"685248 342624 171312 85656 42828 21414 10707 3569 83 1 \",\n \"1073 37 1 \",\n \"985 197 1 \",\n \"1040 520 260 130 65 13 1 \",\n \"28 14 7 1 \",\n \"30 15 5 1 \",\n \"1100 550 275 55 11 1 \",\n \"14 7 1 \",\n \"854692 427346 213673 12569 1 \",\n \"525569 47779 1 \",\n \"268519 1 \",\n \"948036 474018 237009 79003 397 1 \",\n \"22 11 1 \",\n \"195 65 13 1 \",\n \"39077 1699 1 \",\n \"102241 1 \",\n \"863 1 \",\n \"256525 51305 10261 331 1 \",\n \"72800 36400 18200 9100 4550 2275 455 91 13 1 \",\n \"13 1 \",\n \"405538 202769 28967 349 1 \",\n \"41 1 \",\n \"436831 1 \",\n \"35 7 1 \",\n \"10011 3337 71 1 \",\n \"397564 198782 99391 1 \",\n \"26 13 1 \",\n \"466 233 1 \",\n \"49146 24573 8191 1 \",\n \"99130 49565 9913 431 1 \",\n \"1028 514 257 1 \",\n \"1694 847 121 11 1 \",\n \"759 253 23 1 \",\n \"31 1 \",\n \"55 11 1 \",\n \"100 50 25 5 1 \",\n \"34 17 1 \",\n \"806830 403415 80683 1 \",\n \"494711 70673 2437 1 \",\n \"380673 126891 42297 14099 613 1 \",\n \"400418 200209 11777 1 \",\n \"18 9 3 1 \",\n \"342 171 57 19 1 \",\n \"9163 1309 187 17 1 \",\n \"80171 11453 881 1 \",\n \"534 267 89 1 \",\n \"273788 136894 68447 1 \",\n \"38489 3499 1 \",\n \"46 23 1 \",\n \"62006 31003 4429 103 1 \",\n \"71 1 \",\n \"862173 287391 95797 7369 1 \",\n \"29 1 \",\n \"587809 34577 487 1 \",\n \"579 193 1 \",\n \"10989 3663 1221 407 37 1 \",\n \"163847 1 \",\n \"603 201 67 1 \",\n \"226 113 1 \",\n \"356 178 89 1 \",\n \"54 27 9 3 1 \",\n \"16 8 4 2 1 \",\n \"39 13 1 \",\n \"777431 1 \",\n \"771017 59309 467 1 \",\n \"383273 34843 1 \",\n \"386781 128927 563 1 \",\n \"19 1 \",\n \"178 89 1 \",\n \"14846 7423 571 1 \",\n \"38780 19390 9695 1939 277 1 \",\n \"886 443 1 \",\n \"121895 24379 1 \",\n \"69530 34765 6953 409 1 \",\n \"43673 6239 367 1 \",\n \"98 49 7 1 \",\n \"669655 133931 19133 1007 53 1 \",\n \"51 17 1 \",\n \"111 37 1 \",\n \"935570 467785 93557 1 \",\n \"516 258 129 43 1 \",\n \"18121 1 \",\n \"324908 162454 81227 1889 1 \",\n \"609 203 29 1 \",\n \"264 132 66 33 11 1 \",\n \"11 1 \"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nIn Berland a money reform is being prepared. New coins are being introduced. After long economic calculations was decided that the most expensive coin should possess the denomination of exactly n Berland dollars. Also the following restriction has been introduced for comfort: the denomination of each coin should be divisible by the denomination of any cheaper coin. It is known that among all the possible variants the variant with the largest number of new coins will be chosen. Find this variant. Print in the order of decreasing of the coins' denominations.\n\nInput\n\nThe first and only line contains an integer n (1 ≤ n ≤ 106) which represents the denomination of the most expensive coin. \n\nOutput\n\nPrint the denominations of all the coins in the order of decreasing. The number of coins must be the largest possible (with the given denomination n of the most expensive coin). Also, the denomination of every coin must be divisible by the denomination of any cheaper coin. Naturally, the denominations of all the coins should be different. If there are several solutins to that problem, print any of them.\n\nExamples\n\nInput\n\n10\n\n\nOutput\n\n10 5 1\n\n\nInput\n\n4\n\n\nOutput\n\n4 2 1\n\n\nInput\n\n3\n\n\nOutput\n\n3 1\n\n### Input:\n3\n\n### Output:\n3 1\n\n\n### Input:\n4\n\n### Output:\n4 2 1\n\n\n### Code:\ndef O(x):\n l=[]\n if x==1:\n return 1\n for i in range(1,x//2+1):\n if x%i==0:\n l.append(i)\n print(x)\n return O(l[len(l)-1])\nx=int(input())\nO(x)\nprint(1)\n\n\n \t \t \t \t\t \t\t\t\t\t\t \t \t \t"}}},{"rowIdx":5689,"cells":{"id":{"kind":"string","value":"631_A. Interview_26854"},"description":{"kind":"string","value":"Blake is a CEO of a large company called \"Blake Technologies\". He loves his company very much and he thinks that his company should be the best. That is why every candidate needs to pass through the interview that consists of the following problem.\n\nWe define function f(x, l, r) as a bitwise OR of integers xl, xl + 1, ..., xr, where xi is the i-th element of the array x. You are given two arrays a and b of length n. You need to determine the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.\n\n<image>\n\nInput\n\nThe first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the length of the arrays.\n\nThe second line contains n integers ai (0 ≤ ai ≤ 109).\n\nThe third line contains n integers bi (0 ≤ bi ≤ 109).\n\nOutput\n\nPrint a single integer — the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.\n\nExamples\n\nInput\n\n5\n1 2 4 3 2\n2 3 3 12 1\n\n\nOutput\n\n22\n\nInput\n\n10\n13 2 7 11 8 4 9 8 5 1\n5 7 18 9 2 3 0 11 8 6\n\n\nOutput\n\n46\n\nNote\n\nBitwise OR of two non-negative integers a and b is the number c = a OR b, such that each of its digits in binary notation is 1 if and only if at least one of a or b have 1 in the corresponding position in binary notation.\n\nIn the first sample, one of the optimal answers is l = 2 and r = 4, because f(a, 2, 4) + f(b, 2, 4) = (2 OR 4 OR 3) + (3 OR 3 OR 12) = 7 + 15 = 22. Other ways to get maximum value is to choose l = 1 and r = 4, l = 1 and r = 5, l = 2 and r = 4, l = 2 and r = 5, l = 3 and r = 4, or l = 3 and r = 5.\n\nIn the second sample, the maximum value is obtained for l = 1 and r = 9."},"code":{"kind":"string","value":"read = lambda: map(int, input().split())\nn = int(input())\na = list(read())\nb = list(read())\nf1 = f2 = 0\nfor i in a: f1 |= i\nfor i in b: f2 |= i\nprint(f1 + f2)\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"10\\n13 2 7 11 8 4 9 8 5 1\\n5 7 18 9 2 3 0 11 8 6\\n\",\n \"5\\n1 2 4 3 2\\n2 3 3 12 1\\n\",\n \"25\\n12 30 38 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 118 35\\n25 64 95 13 12 6 111 80 85 16 61 119 23 65 73 65 20 95 124 18 28 79 125 106 116\\n\",\n \"1\\n0\\n0\\n\",\n \"8\\n1 2 4 8 16 32 64 128\\n1 2 4 8 16 32 64 128\\n\",\n \"1\\n2\\n3\\n\",\n \"2\\n7 16\\n16 7\\n\",\n \"4\\n6 0 0 0\\n0 0 0 1\\n\",\n \"1\\n1\\n1\\n\",\n \"1\\n1000000000\\n1000000000\\n\",\n \"1\\n4\\n3\\n\",\n \"20\\n64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64\\n64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64\\n\",\n \"25\\n12 30 38 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 95 13 12 6 111 80 85 16 61 119 23 65 73 65 20 95 124 18 28 79 125 106 116\\n\",\n \"8\\n1 2 4 8 16 32 64 128\\n1 2 6 8 16 32 64 128\\n\",\n \"1\\n2\\n6\\n\",\n \"2\\n7 16\\n16 8\\n\",\n \"1\\n1\\n0\\n\",\n \"1\\n1000000000\\n1000000100\\n\",\n \"1\\n1\\n3\\n\",\n \"20\\n64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64 64\\n64 64 64 64 64 64 64 50 64 64 64 64 64 64 64 64 64 64 64 64\\n\",\n \"10\\n13 2 7 11 8 4 9 8 5 0\\n5 7 18 9 2 3 0 11 8 6\\n\",\n \"5\\n1 2 4 3 2\\n2 3 0 12 1\\n\",\n \"8\\n1 2 4 8 9 32 64 128\\n1 2 6 8 16 32 64 128\\n\",\n \"2\\n7 16\\n16 6\\n\",\n \"1\\n1000100000\\n1000000000\\n\",\n \"1\\n8\\n3\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 64 64 64 64 64\\n64 64 64 64 64 64 64 50 64 64 64 64 64 64 64 64 64 64 64 64\\n\",\n \"8\\n1 2 4 8 9 32 64 128\\n1 2 6 0 16 32 64 128\\n\",\n \"1\\n2\\n1\\n\",\n \"2\\n7 2\\n16 6\\n\",\n \"1\\n1000100000\\n1000001000\\n\",\n \"1\\n8\\n6\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 64 64 64 64 64\\n64 64 64 64 64 67 64 50 64 64 64 64 64 64 64 64 64 64 64 64\\n\",\n \"5\\n1 2 8 3 1\\n2 3 0 12 1\\n\",\n \"8\\n1 2 4 8 9 32 64 128\\n1 2 0 0 16 32 64 128\\n\",\n \"2\\n7 2\\n8 6\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 64 64 64 64 64\\n64 64 64 64 7 67 64 50 64 64 64 64 64 64 64 64 64 64 64 64\\n\",\n \"10\\n13 2 7 11 8 4 9 8 5 0\\n5 7 1 9 0 2 0 11 8 6\\n\",\n \"1\\n3\\n2\\n\",\n \"1\\n13\\n0\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 64 64 64 7 67 64 50 64 64 64 64 64 64 64 64 64 64 64 64\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 64 64 64 7 67 64 50 64 64 64 64 64 64 64 104 64 64 64 64\\n\",\n \"5\\n1 2 8 3 1\\n2 3 1 4 1\\n\",\n \"2\\n7 2\\n18 10\\n\",\n \"1\\n26\\n1\\n\",\n \"1\\n5\\n1\\n\",\n \"2\\n7 2\\n18 14\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 128 64 64 7 67 64 50 64 82 64 64 64 89 64 104 64 64 64 64\\n\",\n \"2\\n9 4\\n18 14\\n\",\n \"1\\n49\\n2\\n\",\n \"2\\n9 0\\n18 14\\n\",\n \"1\\n39\\n2\\n\",\n \"2\\n9 0\\n18 17\\n\",\n \"2\\n13 0\\n18 17\\n\",\n \"1\\n17\\n0\\n\",\n \"1\\n19\\n0\\n\",\n \"25\\n12 30 47 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 95 13 12 6 111 80 85 16 61 119 23 65 73 65 20 95 124 18 28 79 125 106 116\\n\",\n \"1\\n2\\n2\\n\",\n \"10\\n13 2 7 11 8 4 9 8 5 0\\n5 7 18 9 2 2 0 11 8 6\\n\",\n \"5\\n1 2 4 3 1\\n2 3 0 12 1\\n\",\n \"25\\n12 30 47 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 61 119 23 65 73 65 20 95 124 18 28 79 125 106 116\\n\",\n \"10\\n13 2 7 11 8 4 9 8 5 0\\n5 7 18 9 0 2 0 11 8 6\\n\",\n \"25\\n12 30 47 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 61 162 23 65 73 65 20 95 124 18 28 79 125 106 116\\n\",\n \"1\\n3\\n1\\n\",\n \"1\\n8\\n0\\n\",\n \"5\\n1 2 8 3 1\\n2 3 1 12 1\\n\",\n \"25\\n11 30 47 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 61 162 23 65 73 65 20 95 124 18 28 79 125 106 116\\n\",\n \"2\\n7 2\\n12 6\\n\",\n \"10\\n13 2 7 11 8 4 9 8 5 0\\n5 7 1 9 0 2 0 11 0 6\\n\",\n \"5\\n0 2 8 3 1\\n2 3 1 12 1\\n\",\n \"25\\n11 30 47 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 6 162 23 65 73 65 20 95 124 18 28 79 125 106 116\\n\",\n \"1\\n4\\n1\\n\",\n \"2\\n7 2\\n12 10\\n\",\n \"1\\n26\\n0\\n\",\n \"10\\n13 2 7 11 8 3 9 8 5 0\\n5 7 1 9 0 2 0 11 0 6\\n\",\n \"25\\n11 30 47 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 6 162 23 65 73 65 20 95 124 36 28 79 125 106 116\\n\",\n \"1\\n4\\n0\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 64 64 64 7 67 64 50 64 64 64 64 64 89 64 104 64 64 64 64\\n\",\n \"10\\n13 2 7 11 13 3 9 8 5 0\\n5 7 1 9 0 2 0 11 0 6\\n\",\n \"5\\n1 2 8 3 1\\n2 3 1 6 1\\n\",\n \"25\\n11 30 47 109 59 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 6 162 23 65 73 65 20 95 124 36 28 79 125 106 116\\n\",\n \"1\\n45\\n1\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 64 64 64 7 67 64 50 64 82 64 64 64 89 64 104 64 64 64 64\\n\",\n \"10\\n13 2 7 11 13 3 9 8 5 0\\n5 7 1 9 1 2 0 11 0 6\\n\",\n \"5\\n1 2 8 3 2\\n2 3 1 6 1\\n\",\n \"25\\n11 30 47 109 59 124 80 33 19 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 6 162 23 65 73 65 20 95 124 36 28 79 125 106 116\\n\",\n \"1\\n5\\n0\\n\",\n \"2\\n7 4\\n18 14\\n\",\n \"1\\n45\\n2\\n\",\n \"10\\n13 2 7 9 13 3 9 8 5 0\\n5 7 1 9 1 2 0 11 0 6\\n\",\n \"5\\n2 2 8 3 2\\n2 3 1 6 1\\n\",\n \"25\\n11 30 47 65 59 124 80 33 19 48 29 78 96 48 96 27 80 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 6 162 23 65 73 65 20 95 124 36 28 79 125 106 116\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 128 64 64 7 67 64 50 64 82 64 64 64 89 64 104 64 64 46 64\\n\",\n \"10\\n13 3 7 11 13 3 9 8 5 0\\n5 7 1 9 1 2 0 11 0 6\\n\",\n \"5\\n2 1 8 3 2\\n2 3 1 6 1\\n\",\n \"25\\n11 30 47 65 59 124 80 33 19 48 29 78 96 48 96 27 101 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 6 162 23 65 73 65 20 95 124 36 28 79 125 106 116\\n\",\n \"20\\n64 64 64 64 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 128 64 64 7 67 64 50 64 82 64 64 64 108 64 104 64 64 46 64\\n\",\n \"10\\n13 3 7 11 13 3 9 8 5 0\\n5 7 1 9 1 2 0 11 1 6\\n\",\n \"5\\n2 1 8 3 2\\n2 3 2 6 1\\n\",\n \"25\\n11 30 47 65 59 124 80 33 19 48 29 78 96 48 96 27 101 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 12 162 23 65 73 65 20 95 124 36 28 79 125 106 116\\n\",\n \"1\\n39\\n0\\n\",\n \"20\\n64 64 64 114 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 128 64 64 7 67 64 50 64 82 64 64 64 108 64 104 64 64 46 64\\n\",\n \"10\\n13 3 7 11 0 3 9 8 5 0\\n5 7 1 9 1 2 0 11 1 6\\n\",\n \"5\\n2 1 8 1 2\\n2 3 2 6 1\\n\",\n \"25\\n4 30 47 65 59 124 80 33 19 48 29 78 96 48 96 27 101 77 102 65 80 113 31 194 35\\n25 64 177 13 12 6 111 80 85 16 12 162 23 65 73 65 20 95 124 36 28 79 125 106 116\\n\",\n \"20\\n64 64 64 114 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 128 64 64 7 67 64 41 64 82 64 64 64 108 64 104 64 64 46 64\\n\",\n \"10\\n13 3 7 11 0 3 9 8 5 0\\n5 7 1 12 1 2 0 11 1 6\\n\",\n \"5\\n2 1 8 1 2\\n2 3 4 6 1\\n\",\n \"25\\n4 30 47 65 59 124 80 33 19 48 29 78 96 48 96 27 101 77 102 65 80 113 31 194 35\\n25 64 1 13 12 6 111 80 85 16 12 162 23 65 73 65 20 95 124 36 28 79 125 106 116\\n\",\n \"2\\n7 0\\n18 17\\n\",\n \"20\\n64 64 64 114 64 64 64 113 64 64 64 64 64 64 64 93 64 64 64 64\\n64 128 12 64 7 67 64 41 64 82 64 64 64 108 64 104 64 64 46 64\\n\"\n ],\n \"output\": [\n \"46\\n\",\n \"22\\n\",\n \"254\\n\",\n \"0\\n\",\n \"510\\n\",\n \"5\\n\",\n \"46\\n\",\n \"7\\n\",\n \"2\\n\",\n \"2000000000\\n\",\n \"7\\n\",\n \"128\\n\",\n \"382\\n\",\n \"510\\n\",\n \"8\\n\",\n \"47\\n\",\n \"1\\n\",\n \"2000000100\\n\",\n \"4\\n\",\n \"178\\n\",\n \"46\\n\",\n \"22\\n\",\n \"494\\n\",\n \"45\\n\",\n \"2000100000\\n\",\n \"11\\n\",\n \"227\\n\",\n \"486\\n\",\n \"3\\n\",\n \"29\\n\",\n \"2000101000\\n\",\n \"14\\n\",\n \"228\\n\",\n \"26\\n\",\n \"482\\n\",\n \"21\\n\",\n \"232\\n\",\n \"30\\n\",\n \"5\\n\",\n \"13\\n\",\n \"244\\n\",\n \"252\\n\",\n \"18\\n\",\n \"33\\n\",\n \"27\\n\",\n \"6\\n\",\n \"37\\n\",\n \"380\\n\",\n \"43\\n\",\n \"51\\n\",\n \"39\\n\",\n \"41\\n\",\n \"28\\n\",\n \"32\\n\",\n \"17\\n\",\n \"19\\n\",\n \"382\\n\",\n \"4\\n\",\n \"46\\n\",\n \"22\\n\",\n \"510\\n\",\n \"46\\n\",\n \"510\\n\",\n \"4\\n\",\n \"8\\n\",\n \"26\\n\",\n \"510\\n\",\n \"21\\n\",\n \"30\\n\",\n \"26\\n\",\n \"510\\n\",\n \"5\\n\",\n \"21\\n\",\n \"26\\n\",\n \"30\\n\",\n \"510\\n\",\n \"4\\n\",\n \"252\\n\",\n \"30\\n\",\n \"18\\n\",\n \"510\\n\",\n \"46\\n\",\n \"252\\n\",\n \"30\\n\",\n \"18\\n\",\n \"510\\n\",\n \"5\\n\",\n \"37\\n\",\n \"47\\n\",\n \"30\\n\",\n \"18\\n\",\n \"510\\n\",\n \"380\\n\",\n \"30\\n\",\n \"18\\n\",\n \"510\\n\",\n \"380\\n\",\n \"30\\n\",\n \"18\\n\",\n \"510\\n\",\n \"39\\n\",\n \"382\\n\",\n \"30\\n\",\n \"18\\n\",\n \"510\\n\",\n \"382\\n\",\n \"30\\n\",\n \"18\\n\",\n \"510\\n\",\n \"26\\n\",\n \"382\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nBlake is a CEO of a large company called \"Blake Technologies\". He loves his company very much and he thinks that his company should be the best. That is why every candidate needs to pass through the interview that consists of the following problem.\n\nWe define function f(x, l, r) as a bitwise OR of integers xl, xl + 1, ..., xr, where xi is the i-th element of the array x. You are given two arrays a and b of length n. You need to determine the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.\n\n<image>\n\nInput\n\nThe first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the length of the arrays.\n\nThe second line contains n integers ai (0 ≤ ai ≤ 109).\n\nThe third line contains n integers bi (0 ≤ bi ≤ 109).\n\nOutput\n\nPrint a single integer — the maximum value of sum f(a, l, r) + f(b, l, r) among all possible 1 ≤ l ≤ r ≤ n.\n\nExamples\n\nInput\n\n5\n1 2 4 3 2\n2 3 3 12 1\n\n\nOutput\n\n22\n\nInput\n\n10\n13 2 7 11 8 4 9 8 5 1\n5 7 18 9 2 3 0 11 8 6\n\n\nOutput\n\n46\n\nNote\n\nBitwise OR of two non-negative integers a and b is the number c = a OR b, such that each of its digits in binary notation is 1 if and only if at least one of a or b have 1 in the corresponding position in binary notation.\n\nIn the first sample, one of the optimal answers is l = 2 and r = 4, because f(a, 2, 4) + f(b, 2, 4) = (2 OR 4 OR 3) + (3 OR 3 OR 12) = 7 + 15 = 22. Other ways to get maximum value is to choose l = 1 and r = 4, l = 1 and r = 5, l = 2 and r = 4, l = 2 and r = 5, l = 3 and r = 4, or l = 3 and r = 5.\n\nIn the second sample, the maximum value is obtained for l = 1 and r = 9.\n\n### Input:\n10\n13 2 7 11 8 4 9 8 5 1\n5 7 18 9 2 3 0 11 8 6\n\n### Output:\n46\n\n\n### Input:\n5\n1 2 4 3 2\n2 3 3 12 1\n\n### Output:\n22\n\n\n### Code:\nread = lambda: map(int, input().split())\nn = int(input())\na = list(read())\nb = list(read())\nf1 = f2 = 0\nfor i in a: f1 |= i\nfor i in b: f2 |= i\nprint(f1 + f2)\n"}}},{"rowIdx":5690,"cells":{"id":{"kind":"string","value":"706_B. Interesting drink_26861"},"description":{"kind":"string","value":"Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink \"Beecola\", which can be bought in n different shops in the city. It's known that the price of one bottle in the shop i is equal to xi coins.\n\nVasiliy plans to buy his favorite drink for q consecutive days. He knows, that on the i-th day he will be able to spent mi coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of \"Beecola\".\n\nInput\n\nThe first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of shops in the city that sell Vasiliy's favourite drink.\n\nThe second line contains n integers xi (1 ≤ xi ≤ 100 000) — prices of the bottles of the drink in the i-th shop.\n\nThe third line contains a single integer q (1 ≤ q ≤ 100 000) — the number of days Vasiliy plans to buy the drink.\n\nThen follow q lines each containing one integer mi (1 ≤ mi ≤ 109) — the number of coins Vasiliy can spent on the i-th day.\n\nOutput\n\nPrint q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.\n\nExample\n\nInput\n\n5\n3 10 8 6 11\n4\n1\n10\n3\n11\n\n\nOutput\n\n0\n4\n1\n5\n\nNote\n\nOn the first day, Vasiliy won't be able to buy a drink in any of the shops.\n\nOn the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4.\n\nOn the third day, Vasiliy can buy a drink only in the shop number 1.\n\nFinally, on the last day Vasiliy can buy a drink in any shop."},"code":{"kind":"string","value":"def binary(t,s):\n fir=0\n last=len(t)-1\n mid=0\n while(fir<=last):\n mid=(fir+last)//2\n if t[mid]>s:\n last=mid-1\n else:\n fir=mid+1 \n return last+1 \n\n\n\nn=int(input())\nt=list(map(int,input().split()))\nm=int(input())\np=0\nt.sort()\nfor i in range(m):\n s=int(input())\n print(binary(t,s))"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"5\\n3 10 8 6 11\\n4\\n1\\n10\\n3\\n11\\n\",\n \"3\\n1 2 3\\n1\\n100005\\n\",\n \"5\\n3 10 8 6 11\\n1\\n10000000\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 29038\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n85724689\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n65622319\\n76517111\\n76605341\\n\",\n \"2\\n1 2\\n3\\n100004\\n100005\\n100006\\n\",\n \"4\\n698 193 1584 76192\\n4\\n553640\\n310518\\n274280\\n429192\\n\",\n \"5\\n1 1 1 1 10\\n2\\n1\\n10\\n\",\n \"3\\n1 2 3\\n1\\n100000\\n\",\n \"1\\n653\\n9\\n903\\n980\\n80\\n770\\n965\\n874\\n381\\n657\\n969\\n\",\n \"1\\n1\\n1\\n100005\\n\",\n \"1\\n1\\n1\\n1\\n\",\n \"1\\n1\\n1\\n1000000000\\n\",\n \"3\\n1 1 1\\n1\\n1\\n\",\n \"3\\n435 482 309\\n7\\n245\\n241\\n909\\n745\\n980\\n29\\n521\\n\",\n \"5\\n868 987 714 168 123\\n10\\n424\\n192\\n795\\n873\\n117\\n914\\n735\\n158\\n631\\n471\\n\",\n \"3\\n2 2 3\\n1\\n100005\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 29038\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n85724689\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n34941071\\n76517111\\n76605341\\n\",\n \"2\\n1 3\\n3\\n100004\\n100005\\n100006\\n\",\n \"4\\n698 193 257 76192\\n4\\n553640\\n310518\\n274280\\n429192\\n\",\n \"1\\n653\\n9\\n903\\n980\\n80\\n156\\n965\\n874\\n381\\n657\\n969\\n\",\n \"1\\n2\\n1\\n1\\n\",\n \"3\\n435 482 309\\n7\\n245\\n241\\n909\\n745\\n980\\n17\\n521\\n\",\n \"5\\n868 987 714 168 123\\n10\\n424\\n192\\n795\\n873\\n117\\n914\\n735\\n158\\n715\\n471\\n\",\n \"1\\n936\\n9\\n903\\n980\\n80\\n156\\n965\\n874\\n381\\n657\\n969\\n\",\n \"3\\n435 482 150\\n7\\n245\\n241\\n909\\n745\\n980\\n17\\n521\\n\",\n \"1\\n936\\n9\\n903\\n980\\n80\\n156\\n965\\n874\\n381\\n657\\n499\\n\",\n \"3\\n435 482 150\\n7\\n245\\n241\\n231\\n745\\n980\\n17\\n674\\n\",\n \"1\\n936\\n9\\n134\\n751\\n80\\n156\\n965\\n880\\n381\\n657\\n499\\n\",\n \"3\\n435 482 150\\n7\\n245\\n241\\n231\\n745\\n304\\n17\\n674\\n\",\n \"3\\n435 482 150\\n7\\n245\\n241\\n231\\n745\\n369\\n17\\n439\\n\",\n \"5\\n3 10 8 10 11\\n1\\n10000000\\n\",\n \"5\\n1 1 1 1 15\\n2\\n1\\n10\\n\",\n \"1\\n653\\n9\\n264\\n980\\n80\\n770\\n965\\n874\\n381\\n657\\n969\\n\",\n \"1\\n1\\n1\\n2\\n\",\n \"3\\n435 482 309\\n7\\n245\\n241\\n27\\n745\\n980\\n29\\n521\\n\",\n \"5\\n868 987 714 168 123\\n10\\n640\\n192\\n795\\n873\\n117\\n914\\n735\\n158\\n631\\n471\\n\",\n \"5\\n3 15 8 6 11\\n4\\n1\\n10\\n3\\n11\\n\",\n \"1\\n653\\n9\\n903\\n586\\n80\\n156\\n965\\n874\\n381\\n657\\n969\\n\",\n \"5\\n868 987 714 168 123\\n10\\n424\\n192\\n795\\n873\\n117\\n233\\n735\\n158\\n715\\n471\\n\",\n \"3\\n435 482 150\\n7\\n245\\n77\\n909\\n745\\n980\\n17\\n521\\n\",\n \"3\\n435 161 150\\n7\\n245\\n241\\n231\\n745\\n980\\n17\\n674\\n\",\n \"3\\n2 2 3\\n1\\n164893\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 29038\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n91433780\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n34941071\\n76517111\\n76605341\\n\",\n \"2\\n1 3\\n3\\n80228\\n100005\\n100006\\n\",\n \"4\\n698 193 257 76192\\n4\\n553640\\n310518\\n274280\\n323550\\n\",\n \"5\\n868 987 714 168 123\\n10\\n424\\n192\\n795\\n909\\n117\\n914\\n735\\n158\\n715\\n471\\n\",\n \"3\\n2 2 3\\n1\\n75571\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n91433780\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n34941071\\n76517111\\n76605341\\n\",\n \"2\\n1 3\\n3\\n80228\\n100005\\n18418\\n\",\n \"4\\n753 193 257 76192\\n4\\n553640\\n310518\\n274280\\n323550\\n\",\n \"3\\n435 482 150\\n7\\n245\\n241\\n909\\n745\\n980\\n17\\n674\\n\",\n \"3\\n2 2 2\\n1\\n75571\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n91433780\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"2\\n1 3\\n3\\n80228\\n69000\\n18418\\n\",\n \"4\\n753 11 257 76192\\n4\\n553640\\n310518\\n274280\\n323550\\n\",\n \"1\\n936\\n9\\n134\\n980\\n80\\n156\\n965\\n874\\n381\\n657\\n499\\n\",\n \"3\\n2 4 2\\n1\\n75571\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n91433780\\n70158847\\n2396455\\n56071296\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"2\\n1 3\\n3\\n153122\\n69000\\n18418\\n\",\n \"1\\n936\\n9\\n134\\n980\\n80\\n156\\n965\\n880\\n381\\n657\\n499\\n\",\n \"3\\n435 482 150\\n7\\n245\\n241\\n231\\n745\\n1025\\n17\\n674\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n44635395\\n28028753\\n91433780\\n70158847\\n2396455\\n56071296\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"2\\n1 4\\n3\\n153122\\n69000\\n18418\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 12417 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n44635395\\n28028753\\n91433780\\n70158847\\n2396455\\n56071296\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"1\\n936\\n9\\n134\\n181\\n80\\n156\\n965\\n880\\n381\\n657\\n499\\n\",\n \"3\\n435 482 150\\n7\\n245\\n241\\n231\\n745\\n369\\n17\\n674\\n\",\n \"12\\n35345 58181 32223 3380 35905 73863 99537 30666 67771 12417 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n44635395\\n28028753\\n91433780\\n70158847\\n2396455\\n56071296\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"1\\n936\\n9\\n134\\n181\\n80\\n156\\n965\\n880\\n539\\n657\\n499\\n\",\n \"12\\n35345 58181 32223 3380 35905 73863 99537 30666 67771 12417 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n3747587\\n61436920\\n14295390\\n44635395\\n28028753\\n91433780\\n70158847\\n2396455\\n56071296\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"1\\n936\\n9\\n95\\n181\\n80\\n156\\n965\\n880\\n539\\n657\\n499\\n\",\n \"3\\n435 482 33\\n7\\n245\\n241\\n231\\n745\\n369\\n17\\n439\\n\",\n \"12\\n35345 58181 32223 3380 35905 73863 99537 30666 67771 12417 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n2990982\\n3747587\\n61436920\\n14295390\\n44635395\\n28028753\\n91433780\\n70158847\\n2396455\\n56071296\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"1\\n936\\n9\\n95\\n181\\n80\\n156\\n1600\\n880\\n539\\n657\\n499\\n\",\n \"1\\n936\\n9\\n95\\n181\\n55\\n156\\n1600\\n880\\n539\\n657\\n499\\n\",\n \"1\\n936\\n9\\n95\\n181\\n55\\n156\\n3088\\n880\\n539\\n657\\n499\\n\",\n \"3\\n2 2 3\\n1\\n111065\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 29038\\n23\\n55052824\\n60884576\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n85724689\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n65622319\\n76517111\\n76605341\\n\",\n \"2\\n1 2\\n3\\n117347\\n100005\\n100006\\n\",\n \"4\\n701 193 1584 76192\\n4\\n553640\\n310518\\n274280\\n429192\\n\",\n \"3\\n1 2 3\\n1\\n100001\\n\",\n \"3\\n2 1 3\\n1\\n100005\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 29038\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n5374205\\n85724689\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n34941071\\n76517111\\n76605341\\n\",\n \"2\\n2 3\\n3\\n100004\\n100005\\n100006\\n\",\n \"4\\n698 193 216 76192\\n4\\n553640\\n310518\\n274280\\n429192\\n\",\n \"1\\n4\\n1\\n1\\n\",\n \"3\\n435 482 309\\n7\\n245\\n241\\n493\\n745\\n980\\n17\\n521\\n\",\n \"3\\n2 2 4\\n1\\n164893\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 29038\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n91433780\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n34941071\\n118223886\\n76605341\\n\",\n \"2\\n1 3\\n3\\n80228\\n184904\\n100006\\n\",\n \"4\\n698 5 257 76192\\n4\\n553640\\n310518\\n274280\\n323550\\n\",\n \"1\\n936\\n9\\n903\\n980\\n70\\n156\\n965\\n874\\n381\\n657\\n969\\n\",\n \"5\\n868 987 714 168 123\\n10\\n609\\n192\\n795\\n909\\n117\\n914\\n735\\n158\\n715\\n471\\n\",\n \"3\\n3 2 3\\n1\\n75571\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 13242 67771 39229 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n91433780\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n34941071\\n76517111\\n76605341\\n\",\n \"2\\n1 3\\n3\\n55416\\n100005\\n18418\\n\",\n \"4\\n192 193 257 76192\\n4\\n553640\\n310518\\n274280\\n323550\\n\",\n \"1\\n936\\n9\\n903\\n980\\n80\\n156\\n965\\n874\\n381\\n657\\n85\\n\",\n \"3\\n435 482 150\\n7\\n245\\n372\\n909\\n745\\n980\\n17\\n674\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 1648 67771 39229 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n91433780\\n70158847\\n2396455\\n66994588\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"4\\n985 11 257 76192\\n4\\n553640\\n310518\\n274280\\n323550\\n\",\n \"1\\n936\\n9\\n134\\n980\\n80\\n156\\n965\\n874\\n596\\n657\\n499\\n\",\n \"3\\n2 4 3\\n1\\n75571\\n\",\n \"12\\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 13291\\n23\\n55052824\\n82504840\\n35160556\\n78141700\\n73401989\\n86305919\\n39430705\\n31939373\\n23501765\\n4406029\\n61436920\\n14295390\\n34275309\\n28028753\\n91433780\\n1908629\\n2396455\\n56071296\\n84024224\\n30175981\\n7580612\\n76517111\\n76605341\\n\",\n \"1\\n936\\n9\\n134\\n980\\n59\\n156\\n965\\n880\\n381\\n657\\n499\\n\"\n ],\n \"output\": [\n \"0\\n4\\n1\\n5\\n\",\n \"3\\n\",\n \"5\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"4\\n5\\n\",\n \"3\\n\",\n \"1\\n1\\n0\\n1\\n1\\n1\\n0\\n1\\n1\\n\",\n \"1\\n\",\n \"1\\n\",\n \"1\\n\",\n \"3\\n\",\n \"0\\n0\\n3\\n3\\n3\\n0\\n3\\n\",\n \"2\\n2\\n3\\n4\\n0\\n4\\n3\\n1\\n2\\n2\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"1\\n1\\n0\\n0\\n1\\n1\\n0\\n1\\n1\\n\",\n \"0\\n\",\n \"0\\n0\\n3\\n3\\n3\\n0\\n3\\n\",\n \"2\\n2\\n3\\n4\\n0\\n4\\n3\\n1\\n3\\n2\\n\",\n \"0\\n1\\n0\\n0\\n1\\n0\\n0\\n0\\n1\\n\",\n \"1\\n1\\n3\\n3\\n3\\n0\\n3\\n\",\n \"0\\n1\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"1\\n1\\n1\\n3\\n3\\n0\\n3\\n\",\n \"0\\n0\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"1\\n1\\n1\\n3\\n1\\n0\\n3\\n\",\n \"1\\n1\\n1\\n3\\n1\\n0\\n2\\n\",\n \"5\\n\",\n \"4\\n4\\n\",\n \"0\\n1\\n0\\n1\\n1\\n1\\n0\\n1\\n1\\n\",\n \"1\\n\",\n \"0\\n0\\n0\\n3\\n3\\n0\\n3\\n\",\n \"2\\n2\\n3\\n4\\n0\\n4\\n3\\n1\\n2\\n2\\n\",\n \"0\\n3\\n1\\n4\\n\",\n \"1\\n0\\n0\\n0\\n1\\n1\\n0\\n1\\n1\\n\",\n \"2\\n2\\n3\\n4\\n0\\n2\\n3\\n1\\n3\\n2\\n\",\n \"1\\n0\\n3\\n3\\n3\\n0\\n3\\n\",\n \"2\\n2\\n2\\n3\\n3\\n0\\n3\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"2\\n2\\n3\\n4\\n0\\n4\\n3\\n1\\n3\\n2\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"1\\n1\\n3\\n3\\n3\\n0\\n3\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"0\\n1\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"0\\n1\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"1\\n1\\n1\\n3\\n3\\n0\\n3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"0\\n0\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"1\\n1\\n1\\n3\\n1\\n0\\n3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"0\\n0\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"0\\n0\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"1\\n1\\n1\\n3\\n1\\n0\\n2\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"0\\n0\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"0\\n0\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"0\\n0\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"3\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"0\\n\",\n \"0\\n0\\n3\\n3\\n3\\n0\\n3\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"0\\n1\\n0\\n0\\n1\\n0\\n0\\n0\\n1\\n\",\n \"2\\n2\\n3\\n4\\n0\\n4\\n3\\n1\\n3\\n2\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"2\\n2\\n2\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"0\\n1\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"1\\n1\\n3\\n3\\n3\\n0\\n3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"4\\n4\\n4\\n4\\n\",\n \"0\\n1\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\",\n \"3\\n\",\n \"12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n12\\n\",\n \"0\\n1\\n0\\n0\\n1\\n0\\n0\\n0\\n0\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nVasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink \"Beecola\", which can be bought in n different shops in the city. It's known that the price of one bottle in the shop i is equal to xi coins.\n\nVasiliy plans to buy his favorite drink for q consecutive days. He knows, that on the i-th day he will be able to spent mi coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of \"Beecola\".\n\nInput\n\nThe first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of shops in the city that sell Vasiliy's favourite drink.\n\nThe second line contains n integers xi (1 ≤ xi ≤ 100 000) — prices of the bottles of the drink in the i-th shop.\n\nThe third line contains a single integer q (1 ≤ q ≤ 100 000) — the number of days Vasiliy plans to buy the drink.\n\nThen follow q lines each containing one integer mi (1 ≤ mi ≤ 109) — the number of coins Vasiliy can spent on the i-th day.\n\nOutput\n\nPrint q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.\n\nExample\n\nInput\n\n5\n3 10 8 6 11\n4\n1\n10\n3\n11\n\n\nOutput\n\n0\n4\n1\n5\n\nNote\n\nOn the first day, Vasiliy won't be able to buy a drink in any of the shops.\n\nOn the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4.\n\nOn the third day, Vasiliy can buy a drink only in the shop number 1.\n\nFinally, on the last day Vasiliy can buy a drink in any shop.\n\n### Input:\n5\n3 10 8 6 11\n4\n1\n10\n3\n11\n\n### Output:\n0\n4\n1\n5\n\n\n### Input:\n3\n1 2 3\n1\n100005\n\n### Output:\n3\n\n\n### Code:\ndef binary(t,s):\n fir=0\n last=len(t)-1\n mid=0\n while(fir<=last):\n mid=(fir+last)//2\n if t[mid]>s:\n last=mid-1\n else:\n fir=mid+1 \n return last+1 \n\n\n\nn=int(input())\nt=list(map(int,input().split()))\nm=int(input())\np=0\nt.sort()\nfor i in range(m):\n s=int(input())\n print(binary(t,s))"}}},{"rowIdx":5691,"cells":{"id":{"kind":"string","value":"729_D. Sea Battle_26865"},"description":{"kind":"string","value":"Galya is playing one-dimensional Sea Battle on a 1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of b consecutive cells. No cell can be part of two ships, however, the ships can touch each other.\n\nGalya doesn't know the ships location. She can shoot to some cells and after each shot she is told if that cell was a part of some ship (this case is called \"hit\") or not (this case is called \"miss\").\n\nGalya has already made k shots, all of them were misses.\n\nYour task is to calculate the minimum number of cells such that if Galya shoot at all of them, she would hit at least one ship.\n\nIt is guaranteed that there is at least one valid ships placement.\n\nInput\n\nThe first line contains four positive integers n, a, b, k (1 ≤ n ≤ 2·105, 1 ≤ a, b ≤ n, 0 ≤ k ≤ n - 1) — the length of the grid, the number of ships on the grid, the length of each ship and the number of shots Galya has already made.\n\nThe second line contains a string of length n, consisting of zeros and ones. If the i-th character is one, Galya has already made a shot to this cell. Otherwise, she hasn't. It is guaranteed that there are exactly k ones in this string. \n\nOutput\n\nIn the first line print the minimum number of cells such that if Galya shoot at all of them, she would hit at least one ship.\n\nIn the second line print the cells Galya should shoot at.\n\nEach cell should be printed exactly once. You can print the cells in arbitrary order. The cells are numbered from 1 to n, starting from the left.\n\nIf there are multiple answers, you can print any of them.\n\nExamples\n\nInput\n\n5 1 2 1\n00100\n\n\nOutput\n\n2\n4 2\n\n\nInput\n\n13 3 2 3\n1000000010001\n\n\nOutput\n\n2\n7 11\n\nNote\n\nThere is one ship in the first sample. It can be either to the left or to the right from the shot Galya has already made (the \"1\" character). So, it is necessary to make two shots: one at the left part, and one at the right part."},"code":{"kind":"string","value":"n,a,b,k = map(int, input().split())\n\nopen = 0\nmust = 0\nmust_arr = []\n\nfor i,c in enumerate(input()):\n if c == '1':\n open = 0\n else:\n open += 1\n if open == b:\n open = 0\n must += 1\n if must >= a:\n must_arr.append(i+1)\n\n\nmust -= a - 1\n\nprint(must)\nprint(*must_arr)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"5 1 2 1\\n00100\\n\",\n \"13 3 2 3\\n1000000010001\\n\",\n \"13 3 2 3\\n1000000010001\\n\",\n \"100 17 4 11\\n0100000100000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"5 1 2 1\\n00100\\n\",\n \"2 2 1 0\\n00\\n\",\n \"10 2 2 0\\n0000000000\\n\",\n \"1 1 1 0\\n0\\n\",\n \"20 1 3 5\\n01001010000000010010\\n\",\n \"5 4 1 0\\n00000\\n\",\n \"100 17 1 11\\n0100000100000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"5 1 2 2\\n00100\\n\",\n \"5 2 2 2\\n00100\\n\",\n \"10 2 2 -1\\n0000000000\\n\",\n \"20 1 3 9\\n01001010000000010010\\n\",\n \"100 7 1 11\\n0100000100000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"10 2 3 -1\\n0000000000\\n\",\n \"20 2 3 9\\n01001010000000010010\\n\",\n \"13 3 2 6\\n1000000010001\\n\",\n \"100 5 4 11\\n0100000100000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"20 2 3 9\\n01001000000000010010\\n\",\n \"100 2 1 11\\n0100000100000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"20 2 4 13\\n01011010000000011010\\n\",\n \"20 2 2 13\\n01010010000000011010\\n\",\n \"10 3 2 0\\n0000000000\\n\",\n \"13 2 2 3\\n1000000010001\\n\",\n \"20 1 3 9\\n01001010000000010000\\n\",\n \"20 2 3 22\\n01100010000000011010\\n\",\n \"100 7 4 17\\n0100000100000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"13 3 2 13\\n1010000010001\\n\",\n \"20 2 3 13\\n01011010100000001010\\n\",\n \"20 1 6 9\\n11001010000000010000\\n\",\n \"100 7 4 17\\n0100000110000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"13 2 2 13\\n1010000010001\\n\",\n \"100 4 4 17\\n0100000110000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"100 4 4 17\\n0100000110000000010000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"5 3 1 0\\n00000\\n\",\n \"5 2 2 0\\n00100\\n\",\n \"20 2 3 9\\n01001010000000011010\\n\",\n \"20 2 3 11\\n01001010000000011010\\n\",\n \"5 2 2 1\\n00100\\n\",\n \"13 3 2 3\\n1000000010011\\n\",\n \"5 1 2 3\\n00100\\n\",\n \"5 2 2 4\\n00100\\n\",\n \"20 2 3 13\\n01001010000000011010\\n\",\n \"20 2 3 11\\n01101010000000011010\\n\",\n \"13 3 2 9\\n1000000010001\\n\",\n \"5 1 2 6\\n00100\\n\",\n \"5 2 2 3\\n00100\\n\",\n \"20 2 3 13\\n01011010000000011010\\n\",\n \"20 2 3 22\\n01101010000000011010\\n\",\n \"20 2 3 22\\n01101010000000011110\\n\",\n \"20 2 4 13\\n01010010000000011010\\n\",\n \"5 2 2 -1\\n00100\\n\",\n \"10 2 2 -2\\n0000000000\\n\",\n \"100 5 4 17\\n0100000100000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\\n\",\n \"20 2 3 4\\n01001000000000010010\\n\",\n \"20 2 3 16\\n01101010000000011010\\n\",\n \"13 3 2 13\\n1000000010001\\n\",\n \"20 2 3 13\\n01011010000000001010\\n\",\n \"20 2 2 12\\n01010010000000011010\\n\",\n \"20 1 3 9\\n11001010000000010000\\n\",\n \"20 2 3 10\\n01101010000000011010\\n\",\n \"20 2 4 22\\n01100010000000011010\\n\",\n \"20 2 2 17\\n01010010000000011010\\n\",\n \"20 2 3 20\\n01011010100000001010\\n\",\n \"20 2 4 22\\n01100010000000011110\\n\",\n \"10 2 3 0\\n0000000000\\n\"\n ],\n \"output\": [\n \"2\\n2 5\\n\",\n \"2\\n3 5 \\n\",\n \"2\\n3 5 \\n\",\n \"2\\n6 12\\n\",\n \"2\\n2 5\\n\",\n \"1\\n1 \\n\",\n \"4\\n2 4 6 8\\n\",\n \"1\\n1 \",\n \"2\\n10 13 \\n\",\n \"2\\n1 2 \\n\",\n \"73\\n1 3 4 5 6 7 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 31 32 33 34 35 37 38 39 42 43 44 45 46 47 48 49 50 51 52 54 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 82 \",\n \"2\\n2 5 \",\n \"1\\n2 \",\n \"4\\n2 4 6 8 \",\n \"2\\n10 13 \",\n \"83\\n1 3 4 5 6 7 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 31 32 33 34 35 37 38 39 42 43 44 45 46 47 48 49 50 51 52 54 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 82 83 84 86 87 88 89 91 92 93 94 \",\n \"2\\n3 6 \",\n \"1\\n10 \",\n \"2\\n3 5 \",\n \"14\\n6 12 16 20 24 29 33 45 49 59 63 67 71 75 \",\n \"2\\n8 11 \",\n \"88\\n1 3 4 5 6 7 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 31 32 33 34 35 37 38 39 42 43 44 45 46 47 48 49 50 51 52 54 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 82 83 84 86 87 88 89 91 92 93 94 95 96 97 98 99 \",\n \"1\\n11 \",\n \"4\\n6 9 11 13 \",\n \"3\\n2 4 6 \",\n \"3\\n3 5 7 \",\n \"3\\n10 13 19 \",\n \"2\\n6 10 \",\n \"12\\n6 12 16 20 24 29 33 45 49 59 63 67 \",\n \"1\\n5 \",\n \"1\\n12 \",\n \"1\\n13 \",\n \"11\\n6 13 17 21 29 33 45 49 59 63 67 \",\n \"2\\n5 7 \",\n \"14\\n6 13 17 21 29 33 45 49 59 63 67 71 75 83 \",\n \"14\\n6 13 17 22 29 33 45 49 59 63 67 71 75 83 \",\n \"3\\n1 2 3 \",\n \"1\\n2 \",\n \"1\\n10 \",\n \"1\\n10 \",\n \"1\\n2 \",\n \"2\\n3 5 \",\n \"2\\n2 5 \",\n \"1\\n2 \",\n \"1\\n10 \",\n \"1\\n10 \",\n \"2\\n3 5 \",\n \"2\\n2 5 \",\n \"1\\n2 \",\n \"1\\n10 \",\n \"1\\n10 \",\n \"1\\n10 \",\n \"1\\n11 \",\n \"1\\n2 \",\n \"4\\n2 4 6 8 \",\n \"14\\n6 12 16 20 24 29 33 45 49 59 63 67 71 75 \",\n \"2\\n8 11 \",\n \"1\\n10 \",\n \"2\\n3 5 \",\n \"2\\n10 13 \",\n \"4\\n6 9 11 13 \",\n \"3\\n10 13 19 \",\n \"1\\n10 \",\n \"1\\n11 \",\n \"4\\n6 9 11 13 \",\n \"1\\n12 \",\n \"1\\n11 \",\n \"2\\n3 6 \"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nGalya is playing one-dimensional Sea Battle on a 1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of b consecutive cells. No cell can be part of two ships, however, the ships can touch each other.\n\nGalya doesn't know the ships location. She can shoot to some cells and after each shot she is told if that cell was a part of some ship (this case is called \"hit\") or not (this case is called \"miss\").\n\nGalya has already made k shots, all of them were misses.\n\nYour task is to calculate the minimum number of cells such that if Galya shoot at all of them, she would hit at least one ship.\n\nIt is guaranteed that there is at least one valid ships placement.\n\nInput\n\nThe first line contains four positive integers n, a, b, k (1 ≤ n ≤ 2·105, 1 ≤ a, b ≤ n, 0 ≤ k ≤ n - 1) — the length of the grid, the number of ships on the grid, the length of each ship and the number of shots Galya has already made.\n\nThe second line contains a string of length n, consisting of zeros and ones. If the i-th character is one, Galya has already made a shot to this cell. Otherwise, she hasn't. It is guaranteed that there are exactly k ones in this string. \n\nOutput\n\nIn the first line print the minimum number of cells such that if Galya shoot at all of them, she would hit at least one ship.\n\nIn the second line print the cells Galya should shoot at.\n\nEach cell should be printed exactly once. You can print the cells in arbitrary order. The cells are numbered from 1 to n, starting from the left.\n\nIf there are multiple answers, you can print any of them.\n\nExamples\n\nInput\n\n5 1 2 1\n00100\n\n\nOutput\n\n2\n4 2\n\n\nInput\n\n13 3 2 3\n1000000010001\n\n\nOutput\n\n2\n7 11\n\nNote\n\nThere is one ship in the first sample. It can be either to the left or to the right from the shot Galya has already made (the \"1\" character). So, it is necessary to make two shots: one at the left part, and one at the right part.\n\n### Input:\n5 1 2 1\n00100\n\n### Output:\n2\n2 5\n\n\n### Input:\n13 3 2 3\n1000000010001\n\n### Output:\n2\n3 5 \n\n\n### Code:\nn,a,b,k = map(int, input().split())\n\nopen = 0\nmust = 0\nmust_arr = []\n\nfor i,c in enumerate(input()):\n if c == '1':\n open = 0\n else:\n open += 1\n if open == b:\n open = 0\n must += 1\n if must >= a:\n must_arr.append(i+1)\n\n\nmust -= a - 1\n\nprint(must)\nprint(*must_arr)"}}},{"rowIdx":5692,"cells":{"id":{"kind":"string","value":"749_E. Inversions After Shuffle_26868"},"description":{"kind":"string","value":"You are given a permutation of integers from 1 to n. Exactly once you apply the following operation to this permutation: pick a random segment and shuffle its elements. Formally:\n\n 1. Pick a random segment (continuous subsequence) from l to r. All <image> segments are equiprobable. \n 2. Let k = r - l + 1, i.e. the length of the chosen segment. Pick a random permutation of integers from 1 to k, p1, p2, ..., pk. All k! permutation are equiprobable. \n 3. This permutation is applied to elements of the chosen segment, i.e. permutation a1, a2, ..., al - 1, al, al + 1, ..., ar - 1, ar, ar + 1, ..., an is transformed to a1, a2, ..., al - 1, al - 1 + p1, al - 1 + p2, ..., al - 1 + pk - 1, al - 1 + pk, ar + 1, ..., an. \n\n\n\nInversion if a pair of elements (not necessary neighbouring) with the wrong relative order. In other words, the number of inversion is equal to the number of pairs (i, j) such that i < j and ai > aj. Find the expected number of inversions after we apply exactly one operation mentioned above.\n\nInput\n\nThe first line contains a single integer n (1 ≤ n ≤ 100 000) — the length of the permutation.\n\nThe second line contains n distinct integers from 1 to n — elements of the permutation.\n\nOutput\n\nPrint one real value — the expected number of inversions. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 9. \n\nNamely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.\n\nExample\n\nInput\n\n3\n2 3 1\n\n\nOutput\n\n1.916666666666666666666666666667"},"code":{"kind":"string","value":"\n\n# Python3 program to count inversions using \n# Binary Indexed Tree \n \n# Returns sum of arr[0..index]. This function \n# assumes that the array is preprocessed and \n# partial sums of array elements are stored \n# in BITree[]. \ndef getSum( BITree, index): \n sum = 0 # Initialize result \n \n # Traverse ancestors of BITree[index] \n while (index > 0): \n \n # Add current element of BITree to sum \n sum += BITree[index] \n \n # Move index to parent node in getSum View \n index -= index & (-index) \n \n return sum\n \n# Updates a node in Binary Index Tree (BITree) \n# at given index in BITree. The given value \n# 'val' is added to BITree[i] and all of its \n# ancestors in tree. \ndef updateBIT(BITree, n, index, val): \n \n # Traverse all ancestors and add 'val' \n while (index <= n): \n \n # Add 'val' to current node of BI Tree \n BITree[index] += val \n \n # Update index to that of parent \n # in update View \n index += index & (-index) \n \n# Returns count of inversions of size three \ndef getInvCount(arr, n): \n \n invcount = 0 # Initialize result \n \n # Find maximum element in arrays \n maxElement = max(arr) \n \n # Create a BIT with size equal to \n # maxElement+1 (Extra one is used \n # so that elements can be directly \n # be used as index) \n BIT = [0] * (maxElement + 1) \n for i in range(1, maxElement + 1): \n BIT[i] = 0\n for i in range(n - 1, -1, -1): \n invcount += getSum(BIT, arr[i] - 1) \n updateBIT(BIT, maxElement, arr[i], 1) \n return invcount \n\ndef getInvCountAdv(arr, n): \n \n invcount = 0 # Initialize result \n \n # Find maximum element in arrays \n maxElement = max(arr) \n \n # Create a BIT with size equal to \n # maxElement+1 (Extra one is used \n # so that elements can be directly \n # be used as index) \n BIT = [0] * (maxElement + 1) \n for i in range(1, maxElement + 1): \n BIT[i] = 0\n for i in range(n - 1, -1, -1): \n invcount += (i + 1) * getSum(BIT, arr[i] - 1) \n updateBIT(BIT, maxElement, arr[i], n-i) \n return invcount \n \n# Driver code \nn = int(input())\na = list(map(int,input().split())) \nInvCount = getInvCount(a, n)\nInvCountAdv = getInvCountAdv(a,n)\nthirdSum = 0\nfor i in range(1,n+1):\n thirdSum += i * (i - 1) * (n- i + 1) / 2\nprint(InvCount - InvCountAdv / (n * (n + 1)) * 2 + thirdSum / (n * (n + 1)))\n \n# Some part of this code is contributed by \n# Shubham Singh(SHUBHAMSINGH10) "},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"3\\n2 3 1\\n\",\n \"3\\n1 2 3\\n\",\n \"100\\n39 8 87 59 49 19 6 64 81 26 90 58 30 93 51 94 91 10 37 68 14 86 75 41 15 73 76 85 13 84 34 25 54 92 23 11 99 53 80 74 22 29 20 79 7 66 62 72 28 71 12 48 18 9 78 38 43 47 5 50 77 82 52 96 97 65 55 88 16 45 69 4 61 42 60 100 24 32 57 21 89 70 27 35 98 83 56 40 46 44 1 2 3 17 31 95 36 67 63 33\\n\",\n \"100\\n30 99 96 51 67 72 33 35 93 70 25 24 6 9 22 83 86 5 79 46 29 88 66 20 87 47 45 71 48 52 61 37 19 40 44 11 8 42 63 92 31 94 2 4 28 77 21 75 13 95 76 14 53 69 54 38 59 60 98 55 39 68 85 23 15 18 58 78 43 49 16 1 82 91 7 84 34 89 17 27 90 26 36 81 64 74 50 57 10 73 12 62 3 100 80 32 56 41 97 65\\n\",\n \"100\\n31 60 34 30 99 76 18 54 43 44 85 17 73 53 93 88 40 80 15 20 21 98 61 26 25 66 49 87 86 2 77 48 51 91 57 39 63 16 89 42 71 13 9 29 4 55 41 78 62 35 65 52 5 32 50 28 92 27 70 10 37 45 94 24 12 8 100 19 64 95 36 68 69 56 6 59 1 67 47 22 97 38 14 46 90 84 23 58 33 75 11 81 82 7 96 72 3 83 79 74\\n\",\n \"4\\n1 4 2 3\\n\",\n \"3\\n1 3 2\\n\",\n \"10\\n10 1 9 2 8 3 7 4 6 5\\n\",\n \"100\\n17 32 25 80 18 74 77 4 97 84 7 51 78 23 93 89 12 95 49 85 99 90 16 9 91 53 3 30 20 34 98 96 59 40 66 14 63 39 94 82 42 60 75 55 71 100 38 73 65 48 13 10 28 5 76 22 36 2 26 45 1 33 6 86 11 70 29 64 50 69 46 41 57 43 68 61 24 27 31 52 81 54 44 21 83 88 62 79 87 8 92 56 72 58 35 37 47 19 15 67\\n\",\n \"100\\n96 36 10 82 40 33 43 91 8 14 84 95 93 62 47 4 22 94 78 83 16 32 48 34 46 67 45 37 18 25 59 5 20 81 58 26 85 90 77 17 98 3 30 11 49 65 15 28 19 53 1 12 99 71 100 31 66 89 13 7 73 39 2 68 6 86 55 92 41 87 29 57 23 80 88 54 42 79 51 56 69 60 38 50 63 72 70 76 61 97 9 27 21 35 24 44 64 52 74 75\\n\",\n \"100\\n51 69 70 74 92 98 95 56 57 93 62 89 21 15 30 80 68 83 76 53 4 47 49 71 24 78 48 2 39 59 35 25 64 3 7 1 87 22 88 58 26 65 6 43 72 13 11 27 37 18 82 12 28 90 85 40 32 38 86 61 20 16 42 100 94 54 96 60 77 9 17 41 73 97 23 34 5 52 63 75 36 44 91 66 99 29 50 79 84 45 31 10 46 33 55 81 14 67 19 8\\n\",\n \"10\\n1 2 3 4 5 6 7 8 9 10\\n\",\n \"100\\n66 29 41 64 11 8 70 67 58 55 92 93 10 77 86 39 33 97 83 26 6 30 40 1 48 34 90 61 28 20 56 49 23 96 89 75 63 42 73 7 68 81 15 65 60 85 76 51 50 31 2 12 14 57 4 95 88 87 79 52 80 78 37 43 13 74 53 46 99 35 54 18 3 22 84 9 38 45 25 21 62 72 71 16 100 32 59 47 94 82 91 44 36 98 24 5 69 19 27 17\\n\",\n \"33\\n24 7 31 16 10 13 14 20 28 23 29 2 18 25 8 19 17 30 32 4 9 26 5 15 3 1 33 11 12 21 6 27 22\\n\",\n \"12\\n2 12 9 3 6 11 8 1 4 10 7 5\\n\",\n \"1\\n1\\n\",\n \"33\\n9 16 4 17 13 32 5 6 1 31 22 8 11 27 15 7 33 25 20 3 12 29 14 10 21 2 30 26 24 23 18 28 19\\n\",\n \"33\\n16 17 8 15 3 29 1 18 21 14 4 31 30 20 13 7 19 22 23 25 5 11 27 24 26 9 6 33 12 2 28 32 10\\n\",\n \"3\\n3 1 2\\n\",\n \"2\\n2 1\\n\",\n \"4\\n4 2 3 1\\n\",\n \"3\\n2 1 3\\n\",\n \"10\\n1 6 2 7 3 8 4 9 5 10\\n\",\n \"3\\n3 2 1\\n\",\n \"2\\n1 2\\n\",\n \"33\\n11 9 16 30 33 31 8 5 21 3 7 18 32 26 28 27 29 1 24 2 6 20 17 13 14 12 25 23 19 22 4 10 15\\n\",\n \"12\\n1 12 9 3 6 11 8 2 4 10 7 5\\n\",\n \"4\\n1 4 3 2\\n\"\n ],\n \"output\": [\n \"1.91666666666666674068\\n\",\n \"0.41666666666666668517\\n\",\n \"2580.22702970297041247250\\n\",\n \"2453.70960396039617990027\\n\",\n \"2452.47871287128737094463\\n\",\n \"2.14999999999999991118\\n\",\n \"1.08333333333333325932\\n\",\n \"24.86363636363636331339\\n\",\n \"2535.50782178217832552036\\n\",\n \"2390.01356435643538134173\\n\",\n \"2666.37178217821792713949\\n\",\n \"4.50000000000000000000\\n\",\n \"2544.16108910891080086003\\n\",\n \"274.72192513368980826272\\n\",\n \"34.48076923076923350209\\n\",\n \"0.00000000000000000000\\n\",\n \"218.02852049910873688532\\n\",\n \"235.61140819964350612281\\n\",\n \"1.91666666666666674068\\n\",\n \"0.83333333333333337034\\n\",\n \"4.65000000000000035527\\n\",\n \"1.08333333333333325932\\n\",\n \"11.95454545454545502992\\n\",\n \"2.58333333333333348136\\n\",\n \"0.16666666666666665741\\n\",\n \"286.68983957219251124116\\n\",\n \"33.544871794871796\\n\",\n \"2.85\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nYou are given a permutation of integers from 1 to n. Exactly once you apply the following operation to this permutation: pick a random segment and shuffle its elements. Formally:\n\n 1. Pick a random segment (continuous subsequence) from l to r. All <image> segments are equiprobable. \n 2. Let k = r - l + 1, i.e. the length of the chosen segment. Pick a random permutation of integers from 1 to k, p1, p2, ..., pk. All k! permutation are equiprobable. \n 3. This permutation is applied to elements of the chosen segment, i.e. permutation a1, a2, ..., al - 1, al, al + 1, ..., ar - 1, ar, ar + 1, ..., an is transformed to a1, a2, ..., al - 1, al - 1 + p1, al - 1 + p2, ..., al - 1 + pk - 1, al - 1 + pk, ar + 1, ..., an. \n\n\n\nInversion if a pair of elements (not necessary neighbouring) with the wrong relative order. In other words, the number of inversion is equal to the number of pairs (i, j) such that i < j and ai > aj. Find the expected number of inversions after we apply exactly one operation mentioned above.\n\nInput\n\nThe first line contains a single integer n (1 ≤ n ≤ 100 000) — the length of the permutation.\n\nThe second line contains n distinct integers from 1 to n — elements of the permutation.\n\nOutput\n\nPrint one real value — the expected number of inversions. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 9. \n\nNamely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if <image>.\n\nExample\n\nInput\n\n3\n2 3 1\n\n\nOutput\n\n1.916666666666666666666666666667\n\n### Input:\n3\n2 3 1\n\n### Output:\n1.91666666666666674068\n\n\n### Input:\n3\n1 2 3\n\n### Output:\n0.41666666666666668517\n\n\n### Code:\n\n\n# Python3 program to count inversions using \n# Binary Indexed Tree \n \n# Returns sum of arr[0..index]. This function \n# assumes that the array is preprocessed and \n# partial sums of array elements are stored \n# in BITree[]. \ndef getSum( BITree, index): \n sum = 0 # Initialize result \n \n # Traverse ancestors of BITree[index] \n while (index > 0): \n \n # Add current element of BITree to sum \n sum += BITree[index] \n \n # Move index to parent node in getSum View \n index -= index & (-index) \n \n return sum\n \n# Updates a node in Binary Index Tree (BITree) \n# at given index in BITree. The given value \n# 'val' is added to BITree[i] and all of its \n# ancestors in tree. \ndef updateBIT(BITree, n, index, val): \n \n # Traverse all ancestors and add 'val' \n while (index <= n): \n \n # Add 'val' to current node of BI Tree \n BITree[index] += val \n \n # Update index to that of parent \n # in update View \n index += index & (-index) \n \n# Returns count of inversions of size three \ndef getInvCount(arr, n): \n \n invcount = 0 # Initialize result \n \n # Find maximum element in arrays \n maxElement = max(arr) \n \n # Create a BIT with size equal to \n # maxElement+1 (Extra one is used \n # so that elements can be directly \n # be used as index) \n BIT = [0] * (maxElement + 1) \n for i in range(1, maxElement + 1): \n BIT[i] = 0\n for i in range(n - 1, -1, -1): \n invcount += getSum(BIT, arr[i] - 1) \n updateBIT(BIT, maxElement, arr[i], 1) \n return invcount \n\ndef getInvCountAdv(arr, n): \n \n invcount = 0 # Initialize result \n \n # Find maximum element in arrays \n maxElement = max(arr) \n \n # Create a BIT with size equal to \n # maxElement+1 (Extra one is used \n # so that elements can be directly \n # be used as index) \n BIT = [0] * (maxElement + 1) \n for i in range(1, maxElement + 1): \n BIT[i] = 0\n for i in range(n - 1, -1, -1): \n invcount += (i + 1) * getSum(BIT, arr[i] - 1) \n updateBIT(BIT, maxElement, arr[i], n-i) \n return invcount \n \n# Driver code \nn = int(input())\na = list(map(int,input().split())) \nInvCount = getInvCount(a, n)\nInvCountAdv = getInvCountAdv(a,n)\nthirdSum = 0\nfor i in range(1,n+1):\n thirdSum += i * (i - 1) * (n- i + 1) / 2\nprint(InvCount - InvCountAdv / (n * (n + 1)) * 2 + thirdSum / (n * (n + 1)))\n \n# Some part of this code is contributed by \n# Shubham Singh(SHUBHAMSINGH10) "}}},{"rowIdx":5693,"cells":{"id":{"kind":"string","value":"797_D. Broken BST_26874"},"description":{"kind":"string","value":"Let T be arbitrary binary tree — tree, every vertex of which has no more than two children. Given tree is rooted, so there exists only one vertex which doesn't have a parent — it's the root of a tree. Every vertex has an integer number written on it. Following algorithm is run on every value from the tree T:\n\n 1. Set pointer to the root of a tree. \n 2. Return success if the value in the current vertex is equal to the number you are looking for \n 3. Go to the left child of the vertex if the value in the current vertex is greater than the number you are looking for \n 4. Go to the right child of the vertex if the value in the current vertex is less than the number you are looking for \n 5. Return fail if you try to go to the vertex that doesn't exist \n\n\n\nHere is the pseudo-code of the described algorithm: \n \n \n \n bool find(TreeNode t, int x) { \n if (t == null) \n return false; \n if (t.value == x) \n return true; \n if (x < t.value) \n return find(t.left, x); \n else \n return find(t.right, x); \n } \n find(root, x); \n \n\nThe described algorithm works correctly if the tree is binary search tree (i.e. for each node the values of left subtree are less than the value in the node, the values of right subtree are greater than the value in the node). But it can return invalid result if tree is not a binary search tree.\n\nSince the given tree is not necessarily a binary search tree, not all numbers can be found this way. Your task is to calculate, how many times the search will fail being running on every value from the tree.\n\nIf the tree has multiple vertices with the same values on them then you should run algorithm on every one of them separately.\n\nInput\n\nFirst line contains integer number n (1 ≤ n ≤ 105) — number of vertices in the tree.\n\nEach of the next n lines contains 3 numbers v, l, r (0 ≤ v ≤ 109) — value on current vertex, index of the left child of the vertex and index of the right child of the vertex, respectively. If some child doesn't exist then number - 1 is set instead. Note that different vertices of the tree may contain the same values.\n\nOutput\n\nPrint number of times when search algorithm will fail.\n\nExamples\n\nInput\n\n3\n15 -1 -1\n10 1 3\n5 -1 -1\n\n\nOutput\n\n2\n\n\nInput\n\n8\n6 2 3\n3 4 5\n12 6 7\n1 -1 8\n4 -1 -1\n5 -1 -1\n14 -1 -1\n2 -1 -1\n\n\nOutput\n\n1\n\nNote\n\nIn the example the root of the tree in vertex 2. Search of numbers 5 and 15 will return fail because on the first step algorithm will choose the subtree which doesn't contain numbers you are looking for."},"code":{"kind":"string","value":"from collections import deque\n\nnodes = []\nparents = []\nvalues = []\nbroken = []\nupperBound = []\nlowerBound = []\n\nn = int(input())\n\nfor _ in range(n):\n v, l, r = map(int, input().split())\n nodes.append((v, l - 1, r - 1))\n parents.append(-1)\n values.append(v)\n broken.append(False)\n upperBound.append(10 ** 9)\n lowerBound.append(-10 ** 9)\n\nfor i, (v, l, r) in enumerate(nodes):\n if l > -1:\n parents[l] = i\n if r > -1:\n parents[r] = i\n\nroot = -1\nfor i in range(n):\n if parents[i] == -1:\n root = i\n\nproc = deque([root])\nwhile len(proc) > 0:\n node = proc.popleft()\n v, l, r = nodes[node]\n if l > -1:\n proc.append(l)\n upperBound[l] = min(upperBound[node], v)\n lowerBound[l] = lowerBound[node]\n if not (lowerBound[l] <= nodes[l][0] <= upperBound[l]):\n broken[l] = True\n if r > -1:\n proc.append(r)\n upperBound[r] = upperBound[node]\n lowerBound[r] = max(lowerBound[node], v)\n if not (lowerBound[r] <= nodes[r][0] <= upperBound[r]):\n broken[r] = True\n \ns = set([])\nfor v, b in zip(values, broken):\n if not b:\n s.add(v)\n\nans = 0\nfor v in values:\n if v not in s:\n ans += 1\n\nprint(ans)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"8\\n6 2 3\\n3 4 5\\n12 6 7\\n1 -1 8\\n4 -1 -1\\n5 -1 -1\\n14 -1 -1\\n2 -1 -1\\n\",\n \"3\\n15 -1 -1\\n10 1 3\\n5 -1 -1\\n\",\n \"10\\n911605217 -1 -1\\n801852416 -1 -1\\n140035920 -1 9\\n981454947 10 2\\n404988051 6 3\\n307545107 8 7\\n278188888 4 1\\n523010786 -1 -1\\n441817740 -1 -1\\n789680429 -1 -1\\n\",\n \"4\\n1 2 3\\n2 -1 -1\\n3 4 -1\\n2 -1 -1\\n\",\n \"8\\n6 -1 -1\\n0 5 -1\\n4 6 7\\n3 -1 -1\\n4 3 1\\n1 -1 -1\\n2 8 4\\n2 -1 -1\\n\",\n \"1\\n901418150 -1 -1\\n\",\n \"4\\n5 3 -1\\n1 4 -1\\n3 -1 2\\n1 -1 -1\\n\",\n \"3\\n6 2 3\\n5 -1 -1\\n5 -1 -1\\n\",\n \"1\\n493041212 -1 -1\\n\",\n \"10\\n921294733 5 9\\n341281094 -1 -1\\n35060484 10 -1\\n363363160 -1 -1\\n771156014 6 8\\n140806462 -1 -1\\n118732846 4 2\\n603229555 -1 -1\\n359289513 3 7\\n423237010 -1 -1\\n\",\n \"4\\n7122 2 3\\n87 4 -1\\n7122 -1 -1\\n7122 -1 -1\\n\",\n \"3\\n2 2 3\\n3 -1 -1\\n3 -1 -1\\n\",\n \"4\\n6 2 -1\\n6 3 4\\n6 -1 -1\\n7 -1 -1\\n\",\n \"3\\n2 -1 -1\\n1 1 3\\n2 -1 -1\\n\",\n \"4\\n98 2 3\\n95 4 -1\\n98 -1 -1\\n98 -1 -1\\n\",\n \"3\\n15 2 3\\n1 -1 -1\\n1 -1 -1\\n\",\n \"4\\n20 2 3\\n16 4 -1\\n20 -1 -1\\n20 -1 -1\\n\",\n \"4\\n1 -1 2\\n0 3 -1\\n1 -1 4\\n0 -1 -1\\n\",\n \"4\\n1 -1 2\\n0 3 -1\\n100 -1 4\\n1 -1 -1\\n\",\n \"10\\n921072710 6 8\\n727122964 -1 -1\\n248695736 2 -1\\n947477665 -1 -1\\n41229309 -1 -1\\n422047611 3 9\\n424558429 -1 4\\n665046372 -1 5\\n74510531 -1 -1\\n630373520 7 1\\n\",\n \"4\\n712222 2 3\\n98887 4 -1\\n712222 -1 -1\\n712222 -1 -1\\n\",\n \"3\\n5 2 -1\\n6 -1 3\\n5 -1 -1\\n\",\n \"1\\n815121916 -1 -1\\n\",\n \"1\\n0 -1 -1\\n\",\n \"3\\n10 2 3\\n5 -1 -1\\n5 -1 -1\\n\",\n \"3\\n2 2 3\\n1 -1 -1\\n1 -1 -1\\n\",\n \"10\\n2 -1 -1\\n1 -1 8\\n2 4 9\\n5 -1 2\\n5 7 6\\n1 -1 1\\n4 -1 -1\\n0 -1 -1\\n8 5 10\\n5 -1 -1\\n\",\n \"3\\n9 2 3\\n5 -1 -1\\n5 -1 -1\\n\",\n \"10\\n921294733 5 9\\n396817200 -1 -1\\n35060484 10 -1\\n363363160 -1 -1\\n771156014 6 8\\n140806462 -1 -1\\n118732846 4 2\\n603229555 -1 -1\\n359289513 3 7\\n423237010 -1 -1\\n\",\n \"3\\n10 2 3\\n4 -1 -1\\n5 -1 -1\\n\",\n \"10\\n2 -1 -1\\n1 -1 8\\n2 4 9\\n5 -1 2\\n5 7 6\\n1 -1 1\\n4 -1 -1\\n0 -1 -1\\n16 5 10\\n5 -1 -1\\n\",\n \"3\\n14 -1 -1\\n10 1 3\\n5 -1 -1\\n\",\n \"10\\n921294733 5 9\\n396817200 -1 -1\\n35060484 10 -1\\n363363160 -1 -1\\n373805313 6 8\\n140806462 -1 -1\\n118732846 4 2\\n603229555 -1 -1\\n359289513 3 7\\n423237010 -1 -1\\n\",\n \"10\\n2 -1 -1\\n1 -1 8\\n2 4 9\\n5 -1 2\\n10 7 6\\n1 -1 1\\n4 -1 -1\\n0 -1 -1\\n16 5 10\\n5 -1 -1\\n\",\n \"4\\n7122 2 3\\n59 4 -1\\n7122 -1 -1\\n7122 -1 -1\\n\",\n \"3\\n2 -1 -1\\n2 1 3\\n2 -1 -1\\n\",\n \"10\\n921072710 6 8\\n727122964 -1 -1\\n248695736 2 -1\\n947477665 -1 -1\\n41229309 -1 -1\\n57935375 3 9\\n424558429 -1 4\\n665046372 -1 5\\n74510531 -1 -1\\n630373520 7 1\\n\",\n \"4\\n712222 2 3\\n98887 4 -1\\n1200820 -1 -1\\n712222 -1 -1\\n\",\n \"1\\n226938178 -1 -1\\n\",\n \"10\\n921294733 5 9\\n65868319 -1 -1\\n35060484 10 -1\\n363363160 -1 -1\\n771156014 6 8\\n140806462 -1 -1\\n118732846 4 2\\n603229555 -1 -1\\n359289513 3 7\\n423237010 -1 -1\\n\",\n \"4\\n608317 2 3\\n98887 4 -1\\n1200820 -1 -1\\n712222 -1 -1\\n\",\n \"3\\n10 2 3\\n7 -1 -1\\n5 -1 -1\\n\",\n \"3\\n21 -1 -1\\n10 1 3\\n5 -1 -1\\n\",\n \"3\\n10 2 3\\n2 -1 -1\\n5 -1 -1\\n\",\n \"10\\n911605217 -1 -1\\n801852416 -1 -1\\n260560214 -1 9\\n981454947 10 2\\n404988051 6 3\\n307545107 8 7\\n278188888 4 1\\n523010786 -1 -1\\n441817740 -1 -1\\n789680429 -1 -1\\n\",\n \"1\\n105007066 -1 -1\\n\",\n \"3\\n15 2 3\\n0 -1 -1\\n1 -1 -1\\n\",\n \"4\\n20 2 3\\n16 4 -1\\n20 -1 -1\\n4 -1 -1\\n\",\n \"1\\n1 -1 -1\\n\",\n \"3\\n10 2 3\\n0 -1 -1\\n5 -1 -1\\n\",\n \"3\\n9 2 3\\n5 -1 -1\\n8 -1 -1\\n\",\n \"4\\n7599 2 3\\n59 4 -1\\n7122 -1 -1\\n7122 -1 -1\\n\",\n \"3\\n11 -1 -1\\n10 1 3\\n5 -1 -1\\n\",\n \"4\\n608317 2 3\\n132082 4 -1\\n1200820 -1 -1\\n712222 -1 -1\\n\",\n \"3\\n2 2 3\\n7 -1 -1\\n5 -1 -1\\n\",\n \"3\\n21 -1 -1\\n10 1 3\\n8 -1 -1\\n\",\n \"1\\n4277071 -1 -1\\n\",\n \"3\\n9 2 3\\n5 -1 -1\\n13 -1 -1\\n\",\n \"3\\n14 -1 -1\\n10 1 3\\n10 -1 -1\\n\",\n \"3\\n9 2 3\\n0 -1 -1\\n13 -1 -1\\n\",\n \"4\\n1 2 3\\n3 -1 -1\\n3 4 -1\\n2 -1 -1\\n\",\n \"1\\n176004083 -1 -1\\n\",\n \"4\\n7122 2 3\\n168 4 -1\\n7122 -1 -1\\n7122 -1 -1\\n\",\n \"4\\n6 2 -1\\n9 3 4\\n6 -1 -1\\n7 -1 -1\\n\",\n \"4\\n79 2 3\\n95 4 -1\\n98 -1 -1\\n98 -1 -1\\n\",\n \"4\\n15 2 3\\n16 4 -1\\n20 -1 -1\\n20 -1 -1\\n\",\n \"4\\n2 -1 2\\n0 3 -1\\n1 -1 4\\n0 -1 -1\\n\",\n \"10\\n921072710 6 8\\n727122964 -1 -1\\n248695736 2 -1\\n947477665 -1 -1\\n41229309 -1 -1\\n422047611 3 9\\n424558429 -1 4\\n499477201 -1 5\\n74510531 -1 -1\\n630373520 7 1\\n\",\n \"1\\n73706168 -1 -1\\n\",\n \"10\\n921294733 5 9\\n106717398 -1 -1\\n35060484 10 -1\\n363363160 -1 -1\\n771156014 6 8\\n140806462 -1 -1\\n118732846 4 2\\n603229555 -1 -1\\n359289513 3 7\\n423237010 -1 -1\\n\",\n \"4\\n7122 2 3\\n64 4 -1\\n7122 -1 -1\\n7122 -1 -1\\n\",\n \"1\\n148435285 -1 -1\\n\",\n \"3\\n10 2 3\\n3 -1 -1\\n5 -1 -1\\n\",\n \"4\\n608317 2 3\\n154956 4 -1\\n1200820 -1 -1\\n712222 -1 -1\\n\",\n \"3\\n3 2 3\\n2 -1 -1\\n5 -1 -1\\n\"\n ],\n \"output\": [\n \"1\\n\",\n \"2\\n\",\n \"7\\n\",\n \"0\\n\",\n \"7\\n\",\n \"0\\n\",\n \"2\\n\",\n \"0\\n\",\n \"0\\n\",\n \"7\\n\",\n \"0\\n\",\n \"0\\n\",\n \"1\\n\",\n \"0\\n\",\n \"0\\n\",\n \"0\\n\",\n \"0\\n\",\n \"2\\n\",\n \"2\\n\",\n \"7\\n\",\n \"0\\n\",\n \"1\\n\",\n \"0\\n\",\n \"0\\n\",\n \"0\\n\",\n \"0\\n\",\n \"3\\n\",\n \"0\\n\",\n \"7\\n\",\n \"1\\n\",\n \"3\\n\",\n \"2\\n\",\n \"6\\n\",\n \"5\\n\",\n \"0\\n\",\n \"0\\n\",\n \"7\\n\",\n \"0\\n\",\n \"0\\n\",\n \"7\\n\",\n \"1\\n\",\n \"1\\n\",\n \"2\\n\",\n \"1\\n\",\n \"7\\n\",\n \"0\\n\",\n \"1\\n\",\n \"0\\n\",\n \"0\\n\",\n \"1\\n\",\n \"1\\n\",\n \"2\\n\",\n \"2\\n\",\n \"1\\n\",\n \"1\\n\",\n \"2\\n\",\n \"0\\n\",\n \"0\\n\",\n \"1\\n\",\n \"0\\n\",\n \"0\\n\",\n \"0\\n\",\n \"0\\n\",\n \"2\\n\",\n \"1\\n\",\n \"1\\n\",\n \"3\\n\",\n \"7\\n\",\n \"0\\n\",\n \"7\\n\",\n \"0\\n\",\n \"0\\n\",\n \"1\\n\",\n \"1\\n\",\n \"0\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nLet T be arbitrary binary tree — tree, every vertex of which has no more than two children. Given tree is rooted, so there exists only one vertex which doesn't have a parent — it's the root of a tree. Every vertex has an integer number written on it. Following algorithm is run on every value from the tree T:\n\n 1. Set pointer to the root of a tree. \n 2. Return success if the value in the current vertex is equal to the number you are looking for \n 3. Go to the left child of the vertex if the value in the current vertex is greater than the number you are looking for \n 4. Go to the right child of the vertex if the value in the current vertex is less than the number you are looking for \n 5. Return fail if you try to go to the vertex that doesn't exist \n\n\n\nHere is the pseudo-code of the described algorithm: \n \n \n \n bool find(TreeNode t, int x) { \n if (t == null) \n return false; \n if (t.value == x) \n return true; \n if (x < t.value) \n return find(t.left, x); \n else \n return find(t.right, x); \n } \n find(root, x); \n \n\nThe described algorithm works correctly if the tree is binary search tree (i.e. for each node the values of left subtree are less than the value in the node, the values of right subtree are greater than the value in the node). But it can return invalid result if tree is not a binary search tree.\n\nSince the given tree is not necessarily a binary search tree, not all numbers can be found this way. Your task is to calculate, how many times the search will fail being running on every value from the tree.\n\nIf the tree has multiple vertices with the same values on them then you should run algorithm on every one of them separately.\n\nInput\n\nFirst line contains integer number n (1 ≤ n ≤ 105) — number of vertices in the tree.\n\nEach of the next n lines contains 3 numbers v, l, r (0 ≤ v ≤ 109) — value on current vertex, index of the left child of the vertex and index of the right child of the vertex, respectively. If some child doesn't exist then number - 1 is set instead. Note that different vertices of the tree may contain the same values.\n\nOutput\n\nPrint number of times when search algorithm will fail.\n\nExamples\n\nInput\n\n3\n15 -1 -1\n10 1 3\n5 -1 -1\n\n\nOutput\n\n2\n\n\nInput\n\n8\n6 2 3\n3 4 5\n12 6 7\n1 -1 8\n4 -1 -1\n5 -1 -1\n14 -1 -1\n2 -1 -1\n\n\nOutput\n\n1\n\nNote\n\nIn the example the root of the tree in vertex 2. Search of numbers 5 and 15 will return fail because on the first step algorithm will choose the subtree which doesn't contain numbers you are looking for.\n\n### Input:\n8\n6 2 3\n3 4 5\n12 6 7\n1 -1 8\n4 -1 -1\n5 -1 -1\n14 -1 -1\n2 -1 -1\n\n### Output:\n1\n\n\n### Input:\n3\n15 -1 -1\n10 1 3\n5 -1 -1\n\n### Output:\n2\n\n\n### Code:\nfrom collections import deque\n\nnodes = []\nparents = []\nvalues = []\nbroken = []\nupperBound = []\nlowerBound = []\n\nn = int(input())\n\nfor _ in range(n):\n v, l, r = map(int, input().split())\n nodes.append((v, l - 1, r - 1))\n parents.append(-1)\n values.append(v)\n broken.append(False)\n upperBound.append(10 ** 9)\n lowerBound.append(-10 ** 9)\n\nfor i, (v, l, r) in enumerate(nodes):\n if l > -1:\n parents[l] = i\n if r > -1:\n parents[r] = i\n\nroot = -1\nfor i in range(n):\n if parents[i] == -1:\n root = i\n\nproc = deque([root])\nwhile len(proc) > 0:\n node = proc.popleft()\n v, l, r = nodes[node]\n if l > -1:\n proc.append(l)\n upperBound[l] = min(upperBound[node], v)\n lowerBound[l] = lowerBound[node]\n if not (lowerBound[l] <= nodes[l][0] <= upperBound[l]):\n broken[l] = True\n if r > -1:\n proc.append(r)\n upperBound[r] = upperBound[node]\n lowerBound[r] = max(lowerBound[node], v)\n if not (lowerBound[r] <= nodes[r][0] <= upperBound[r]):\n broken[r] = True\n \ns = set([])\nfor v, b in zip(values, broken):\n if not b:\n s.add(v)\n\nans = 0\nfor v in values:\n if v not in s:\n ans += 1\n\nprint(ans)"}}},{"rowIdx":5694,"cells":{"id":{"kind":"string","value":"843_A. Sorting by Subsequences_26880"},"description":{"kind":"string","value":"You are given a sequence a1, a2, ..., an consisting of different integers. It is required to split this sequence into the maximum number of subsequences such that after sorting integers in each of them in increasing order, the total sequence also will be sorted in increasing order.\n\nSorting integers in a subsequence is a process such that the numbers included in a subsequence are ordered in increasing order, and the numbers which are not included in a subsequence don't change their places.\n\nEvery element of the sequence must appear in exactly one subsequence.\n\nInput\n\nThe first line of input data contains integer n (1 ≤ n ≤ 105) — the length of the sequence.\n\nThe second line of input data contains n different integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — the elements of the sequence. It is guaranteed that all elements of the sequence are distinct.\n\nOutput\n\nIn the first line print the maximum number of subsequences k, which the original sequence can be split into while fulfilling the requirements.\n\nIn the next k lines print the description of subsequences in the following format: the number of elements in subsequence ci (0 < ci ≤ n), then ci integers l1, l2, ..., lci (1 ≤ lj ≤ n) — indices of these elements in the original sequence. \n\nIndices could be printed in any order. Every index from 1 to n must appear in output exactly once.\n\nIf there are several possible answers, print any of them.\n\nExamples\n\nInput\n\n6\n3 2 1 6 5 4\n\n\nOutput\n\n4\n2 1 3\n1 2\n2 4 6\n1 5\n\n\nInput\n\n6\n83 -75 -49 11 37 62\n\n\nOutput\n\n1\n6 1 2 3 4 5 6\n\nNote\n\nIn the first sample output:\n\nAfter sorting the first subsequence we will get sequence 1 2 3 6 5 4.\n\nSorting the second subsequence changes nothing.\n\nAfter sorting the third subsequence we will get sequence 1 2 3 4 5 6.\n\nSorting the last subsequence changes nothing."},"code":{"kind":"string","value":"\nn = int(input())\nd = list(map(int, input().split()))\n\ntemp = d[:]\nd.sort()\nfrom bisect import bisect_left\n\nA = [bisect_left(d,i) for i in temp]\n\ndel d,temp\n\n\nf = [False]*len(A)\n\nresult = []\n\nfor i in range(n):\n if not f[i]:\n L = [i+1]\n f[i] = True\n j = A[i]\n while j != i:\n L.append(j+1)\n f[j] = True\n j = A[j]\n result.append(L)\n\nprint(len(result))\nfor L in result:\n print(len(L),' '.join(map(str,L)))"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"6\\n83 -75 -49 11 37 62\\n\",\n \"6\\n3 2 1 6 5 4\\n\",\n \"10\\n3 7 10 1 9 5 4 8 6 2\\n\",\n \"100\\n39 77 67 25 81 26 50 11 73 95 86 16 90 33 14 79 12 100 68 64 60 27 41 15 34 24 3 61 83 47 57 65 99 43 40 21 94 72 82 85 23 71 76 32 10 17 30 18 44 59 35 89 6 63 7 69 62 70 4 29 92 87 31 48 36 28 45 97 93 98 56 38 58 80 8 1 74 91 53 55 54 51 96 5 42 52 9 22 78 88 75 13 66 2 37 20 49 19 84 46\\n\",\n \"3\\n3 1 2\\n\",\n \"1\\n1\\n\",\n \"3\\n1 2 3\\n\",\n \"20\\n363756450 -204491568 95834122 -840249197 -49687658 470958158 -445130206 189801569 802780784 -790013317 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 712662868 853829789 735867677\\n\",\n \"2\\n2 1\\n\",\n \"50\\n39 7 45 25 31 26 50 11 19 37 8 16 22 33 14 6 12 46 49 48 29 27 41 15 34 24 3 13 20 47 9 36 5 43 40 21 2 38 35 42 23 28 1 32 10 17 30 18 44 4\\n\",\n \"3\\n3 2 1\\n\",\n \"2\\n1 2\\n\",\n \"100\\n39 77 67 25 81 26 50 11 73 95 150 16 90 33 14 79 12 100 68 64 60 27 41 15 34 24 3 61 83 47 57 65 99 43 40 21 94 72 82 85 23 71 76 32 10 17 30 18 44 59 35 89 6 63 7 69 62 70 4 29 92 87 31 48 36 28 45 97 93 98 56 38 58 80 8 1 74 91 53 55 54 51 96 5 42 52 9 22 78 88 75 13 66 2 37 20 49 19 84 46\\n\",\n \"3\\n4 1 2\\n\",\n \"1\\n2\\n\",\n \"3\\n1 0 3\\n\",\n \"20\\n363756450 -204491568 95834122 -840249197 -49687658 470958158 -445130206 189801569 802780784 -790013317 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 122973488 853829789 735867677\\n\",\n \"2\\n1 3\\n\",\n \"6\\n83 -75 -49 5 37 62\\n\",\n \"20\\n363756450 -204491568 95834122 -840249197 -19100318 470958158 -445130206 83057604 802780784 -790013317 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 122973488 853829789 735867677\\n\",\n \"2\\n1 0\\n\",\n \"6\\n83 -75 -86 2 37 62\\n\",\n \"20\\n95455105 -204491568 95834122 -1672382976 -19100318 470958158 -445130206 83057604 802780784 -790013317 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 122973488 853829789 735867677\\n\",\n \"20\\n95455105 -204491568 95834122 -1672382976 -19100318 470958158 -445130206 83057604 802780784 -790013317 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 122973488 853829789 1436087835\\n\",\n \"3\\n3 0 1\\n\",\n \"3\\n8 1 2\\n\",\n \"1\\n0\\n\",\n \"20\\n363756450 -204491568 95834122 -840249197 -19100318 470958158 -445130206 189801569 802780784 -790013317 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 122973488 853829789 735867677\\n\",\n \"3\\n3 -1 1\\n\",\n \"2\\n1 5\\n\",\n \"6\\n83 -75 -49 2 37 62\\n\",\n \"3\\n8 1 3\\n\",\n \"1\\n-1\\n\",\n \"3\\n6 -1 1\\n\",\n \"2\\n1 4\\n\",\n \"6\\n83 -75 -68 2 37 62\\n\",\n \"1\\n-2\\n\",\n \"20\\n363756450 -204491568 95834122 -1672382976 -19100318 470958158 -445130206 83057604 802780784 -790013317 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 122973488 853829789 735867677\\n\",\n \"3\\n8 -1 1\\n\",\n \"1\\n3\\n\",\n \"3\\n2 -1 1\\n\",\n \"2\\n1 -1\\n\",\n \"6\\n83 -75 -86 2 7 62\\n\",\n \"1\\n6\\n\",\n \"2\\n0 -1\\n\",\n \"6\\n83 -136 -86 2 7 62\\n\",\n \"1\\n9\\n\",\n \"20\\n95455105 -204491568 95834122 -1672382976 -19100318 470958158 -445130206 83057604 802780784 -1495711549 -192321079 586260100 -751917965 -354684803 418379342 -253230108 193944314 122973488 853829789 1436087835\\n\",\n \"6\\n159 -136 -86 2 7 62\\n\",\n \"1\\n18\\n\",\n \"6\\n159 -136 -86 2 12 62\\n\",\n \"1\\n4\\n\",\n \"6\\n232 -136 -86 2 12 62\\n\",\n \"1\\n-4\\n\",\n \"1\\n-3\\n\",\n \"1\\n-8\\n\",\n \"1\\n-7\\n\",\n \"1\\n-13\\n\",\n \"1\\n-10\\n\",\n \"1\\n-20\\n\",\n \"1\\n-26\\n\",\n \"1\\n-47\\n\",\n \"1\\n-82\\n\",\n \"1\\n-37\\n\",\n \"1\\n-24\\n\",\n \"1\\n-46\\n\",\n \"1\\n-90\\n\",\n \"1\\n-5\\n\",\n \"1\\n-6\\n\",\n \"1\\n-16\\n\",\n \"1\\n-57\\n\",\n \"1\\n-62\\n\",\n \"1\\n-34\\n\",\n \"1\\n-33\\n\",\n \"1\\n-49\\n\",\n \"1\\n-78\\n\",\n \"1\\n5\\n\",\n \"1\\n10\\n\",\n \"1\\n-11\\n\",\n \"1\\n-9\\n\",\n \"1\\n-18\\n\",\n \"1\\n8\\n\",\n \"1\\n7\\n\",\n \"1\\n11\\n\",\n \"1\\n16\\n\",\n \"1\\n12\\n\",\n \"1\\n-14\\n\",\n \"1\\n-22\\n\",\n \"1\\n-15\\n\",\n \"1\\n-19\\n\",\n \"1\\n29\\n\",\n \"1\\n13\\n\",\n \"1\\n17\\n\",\n \"1\\n20\\n\"\n ],\n \"output\": [\n \"1\\n6 1 2 3 4 5 6\\n\",\n \"4\\n2 1 3 \\n1 2 \\n2 4 6 \\n1 5 \\n\",\n \"3\\n6 1 3 10 2 7 4 \\n3 5 9 6 \\n1 8 \\n\",\n \"6\\n41 1 39 82 51 35 40 85 42 71 56 69 93 66 28 61 92 13 90 88 22 27 3 67 45 10 95 37 94 2 77 74 80 55 7 50 59 4 25 34 43 76 \\n45 5 81 54 63 31 57 62 87 9 73 58 70 98 19 68 97 49 44 32 65 36 21 60 29 83 96 20 64 48 18 100 46 17 12 16 79 53 6 26 24 15 14 33 99 84 \\n8 8 11 86 52 89 78 91 75 \\n2 23 41 \\n2 30 47 \\n2 38 72 \\n\",\n \"1\\n3 1 2 3\\n\",\n \"1\\n1 1 \\n\",\n \"3\\n1 1 \\n1 2 \\n1 3 \\n\",\n \"3\\n7 1 13 3 10 2 7 4 \\n11 5 9 19 20 18 17 12 16 6 15 14 \\n2 8 11 \\n\",\n \"1\\n2 1 2 \\n\",\n \"6\\n20 1 39 35 40 42 28 13 22 27 3 45 10 37 2 7 50 4 25 34 43 \\n23 5 31 9 19 49 44 32 36 21 29 20 48 18 46 17 12 16 6 26 24 15 14 33 \\n2 8 11 \\n2 23 41 \\n2 30 47 \\n1 38 \\n\",\n \"2\\n2 1 3 \\n1 2 \\n\",\n \"2\\n1 1 \\n1 2 \\n\",\n \"4\\n94 1 76 43 34 25 4 59 50 7 55 80 74 77 2 94 10 45 67 3 27 22 88 52 86 62 57 31 63 54 81 5 84 99 18 48 64 20 96 68 19 98 33 14 15 24 26 6 53 79 16 12 17 46 100 11 8 75 91 61 28 66 93 37 95 83 29 60 21 36 65 32 44 49 97 70 58 73 9 87 90 78 89 13 92 69 56 71 42 85 40 35 51 82 39 \\n2 23 41 \\n2 30 47 \\n2 38 72 \\n\",\n \"1\\n3 1 2 3 \\n\",\n \"1\\n1 1 \\n\",\n \"2\\n2 1 2 \\n1 3 \\n\",\n \"3\\n17 1 4 7 2 10 3 13 17 12 8 11 18 20 19 9 5 14 \\n2 6 16 \\n1 15 \\n\",\n \"2\\n1 1 \\n1 2 \\n\",\n \"1\\n6 1 2 3 4 5 6 \\n\",\n \"3\\n17 1 4 7 2 10 8 11 3 13 17 12 18 20 19 9 5 14 \\n2 6 16 \\n1 15 \\n\",\n \"1\\n2 1 2 \\n\",\n \"2\\n5 1 3 4 5 6 \\n1 2 \\n\",\n \"4\\n7 1 4 7 2 10 8 11 \\n10 3 13 18 20 19 9 5 14 17 12 \\n2 6 16 \\n1 15 \\n\",\n \"6\\n7 1 4 7 2 10 8 11 \\n8 3 13 18 9 5 14 17 12 \\n2 6 16 \\n1 15 \\n1 19 \\n1 20 \\n\",\n \"1\\n3 1 2 3 \\n\",\n \"1\\n3 1 2 3 \\n\",\n \"1\\n1 1 \\n\",\n \"3\\n17 1 4 7 2 10 3 13 17 12 8 11 18 20 19 9 5 14 \\n2 6 16 \\n1 15 \\n\",\n \"1\\n3 1 2 3 \\n\",\n \"2\\n1 1 \\n1 2 \\n\",\n \"1\\n6 1 2 3 4 5 6 \\n\",\n \"1\\n3 1 2 3 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n3 1 2 3 \\n\",\n \"2\\n1 1 \\n1 2 \\n\",\n \"1\\n6 1 2 3 4 5 6 \\n\",\n \"1\\n1 1 \\n\",\n \"3\\n17 1 4 7 2 10 8 11 3 13 17 12 18 20 19 9 5 14 \\n2 6 16 \\n1 15 \\n\",\n \"1\\n3 1 2 3 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n3 1 2 3 \\n\",\n \"1\\n2 1 2 \\n\",\n \"2\\n5 1 3 4 5 6 \\n1 2 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n2 1 2 \\n\",\n \"1\\n6 1 2 3 4 5 6 \\n\",\n \"1\\n1 1 \\n\",\n \"6\\n7 1 4 7 2 10 8 11 \\n8 3 13 18 9 5 14 17 12 \\n2 6 16 \\n1 15 \\n1 19 \\n1 20 \\n\",\n \"1\\n6 1 2 3 4 5 6 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n6 1 2 3 4 5 6 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n6 1 2 3 4 5 6 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\",\n \"1\\n1 1 \\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nYou are given a sequence a1, a2, ..., an consisting of different integers. It is required to split this sequence into the maximum number of subsequences such that after sorting integers in each of them in increasing order, the total sequence also will be sorted in increasing order.\n\nSorting integers in a subsequence is a process such that the numbers included in a subsequence are ordered in increasing order, and the numbers which are not included in a subsequence don't change their places.\n\nEvery element of the sequence must appear in exactly one subsequence.\n\nInput\n\nThe first line of input data contains integer n (1 ≤ n ≤ 105) — the length of the sequence.\n\nThe second line of input data contains n different integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — the elements of the sequence. It is guaranteed that all elements of the sequence are distinct.\n\nOutput\n\nIn the first line print the maximum number of subsequences k, which the original sequence can be split into while fulfilling the requirements.\n\nIn the next k lines print the description of subsequences in the following format: the number of elements in subsequence ci (0 < ci ≤ n), then ci integers l1, l2, ..., lci (1 ≤ lj ≤ n) — indices of these elements in the original sequence. \n\nIndices could be printed in any order. Every index from 1 to n must appear in output exactly once.\n\nIf there are several possible answers, print any of them.\n\nExamples\n\nInput\n\n6\n3 2 1 6 5 4\n\n\nOutput\n\n4\n2 1 3\n1 2\n2 4 6\n1 5\n\n\nInput\n\n6\n83 -75 -49 11 37 62\n\n\nOutput\n\n1\n6 1 2 3 4 5 6\n\nNote\n\nIn the first sample output:\n\nAfter sorting the first subsequence we will get sequence 1 2 3 6 5 4.\n\nSorting the second subsequence changes nothing.\n\nAfter sorting the third subsequence we will get sequence 1 2 3 4 5 6.\n\nSorting the last subsequence changes nothing.\n\n### Input:\n6\n83 -75 -49 11 37 62\n\n### Output:\n1\n6 1 2 3 4 5 6\n\n\n### Input:\n6\n3 2 1 6 5 4\n\n### Output:\n4\n2 1 3 \n1 2 \n2 4 6 \n1 5 \n\n\n### Code:\n\nn = int(input())\nd = list(map(int, input().split()))\n\ntemp = d[:]\nd.sort()\nfrom bisect import bisect_left\n\nA = [bisect_left(d,i) for i in temp]\n\ndel d,temp\n\n\nf = [False]*len(A)\n\nresult = []\n\nfor i in range(n):\n if not f[i]:\n L = [i+1]\n f[i] = True\n j = A[i]\n while j != i:\n L.append(j+1)\n f[j] = True\n j = A[j]\n result.append(L)\n\nprint(len(result))\nfor L in result:\n print(len(L),' '.join(map(str,L)))"}}},{"rowIdx":5695,"cells":{"id":{"kind":"string","value":"863_F. Almost Permutation_26883"},"description":{"kind":"string","value":"Recently Ivan noticed an array a while debugging his code. Now Ivan can't remember this array, but the bug he was trying to fix didn't go away, so Ivan thinks that the data from this array might help him to reproduce the bug.\n\nIvan clearly remembers that there were n elements in the array, and each element was not less than 1 and not greater than n. Also he remembers q facts about the array. There are two types of facts that Ivan remembers:\n\n * 1 li ri vi — for each x such that li ≤ x ≤ ri ax ≥ vi; \n * 2 li ri vi — for each x such that li ≤ x ≤ ri ax ≤ vi. \n\n\n\nAlso Ivan thinks that this array was a permutation, but he is not so sure about it. He wants to restore some array that corresponds to the q facts that he remembers and is very similar to permutation. Formally, Ivan has denoted the cost of array as follows:\n\n<image>, where cnt(i) is the number of occurences of i in the array.\n\nHelp Ivan to determine minimum possible cost of the array that corresponds to the facts!\n\nInput\n\nThe first line contains two integer numbers n and q (1 ≤ n ≤ 50, 0 ≤ q ≤ 100).\n\nThen q lines follow, each representing a fact about the array. i-th line contains the numbers ti, li, ri and vi for i-th fact (1 ≤ ti ≤ 2, 1 ≤ li ≤ ri ≤ n, 1 ≤ vi ≤ n, ti denotes the type of the fact).\n\nOutput\n\nIf the facts are controversial and there is no array that corresponds to them, print -1. Otherwise, print minimum possible cost of the array.\n\nExamples\n\nInput\n\n3 0\n\n\nOutput\n\n3\n\n\nInput\n\n3 1\n1 1 3 2\n\n\nOutput\n\n5\n\n\nInput\n\n3 2\n1 1 3 2\n2 1 3 2\n\n\nOutput\n\n9\n\n\nInput\n\n3 2\n1 1 3 2\n2 1 3 1\n\n\nOutput\n\n-1"},"code":{"kind":"string","value":"import sys\n\ndef is_feasible(cnt,L,R):\n\tn = len(R)\n\tinter = [(L[i],R[i]) for i in range(n)]\n\tAUX = []\n\tfeasible = True\n\tfor x in range(n):\n\t\tfor p in inter:\n\t\t\tif p[0] == x:\n\t\t\t\tAUX.append(p[1])\n\t\t\t\t\n\t\twhile AUX and min(AUX) < x:\n\t\t\tAUX.remove(min(AUX))\n\t\tfor quantity in range(cnt[x]):\n\t\t\tif AUX:\n\t\t\t\tAUX.remove(min(AUX))\n\t\t\telse:\n\t\t\t\tfeasible = False\n\treturn feasible\n\nn,q = map(int,sys.stdin.readline().split())\nL = [0 for i in range(n)]\nR = [n-1 for i in range(n)]\nfor restriction in range(q):\n\tt,l,r,v = map(int,sys.stdin.readline().split())\n\tif t == 1:\n\t\tfor k in range(l-1,r):\n\t\t\tL[k] = max(L[k],v-1)\n\telse:\n\t\tfor k in range(l-1,r):\n\t\t\tR[k] = min(R[k],v-1)\n\t\t\t\nis_possible = all(map(lambda x,y : x <= y,L,R))\nif not is_possible:\n\tprint(-1)\nelse:\n\tcnt = {x:L.count(x) for x in range(n)}\n\thad_pair = True\n\twhile had_pair:\n\t\thad_pair = False\n\t\tfor x in range(n-1,-1,-1):\n\t\t\tfor y in range(n-1,-1,-1):\n\t\t\t\tif cnt[x] > cnt[y]+1:\n\t\t\t\t\tcnt[x] -= 1\n\t\t\t\t\tcnt[y] += 1\n\t\t\t\t\thas_pair = True\n\t\t\t\t\tif not is_feasible(cnt,L,R):\n\t\t\t\t\t\tcnt[x] += 1\n\t\t\t\t\t\tcnt[y] -= 1\n\t\t\t\t\t\thas_pair = False\n\t\t\t\t\thad_pair = had_pair or has_pair \n\t\t\t\t\n\t\n\tans = sum([cnt[x]*cnt[x] for x in range(n)])\n\tprint(ans)\n\t\n\t\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"3 0\\n\",\n \"3 2\\n1 1 3 2\\n2 1 3 2\\n\",\n \"3 1\\n1 1 3 2\\n\",\n \"3 2\\n1 1 3 2\\n2 1 3 1\\n\",\n \"3 6\\n1 1 1 2\\n2 1 1 2\\n1 2 2 2\\n2 2 2 2\\n1 3 3 2\\n2 3 3 3\\n\",\n \"7 3\\n2 1 2 2\\n1 3 7 2\\n2 3 7 3\\n\",\n \"50 2\\n2 1 33 1\\n2 14 50 1\\n\",\n \"29 5\\n2 4 9 27\\n1 25 29 14\\n1 9 10 18\\n2 13 13 5\\n2 1 19 23\\n\",\n \"50 1\\n2 1 2 1\\n\",\n \"8 16\\n1 1 1 2\\n2 1 1 3\\n1 2 2 6\\n2 2 2 8\\n1 3 3 1\\n2 3 3 2\\n1 4 4 3\\n2 4 4 3\\n1 5 5 1\\n2 5 5 2\\n1 6 6 2\\n2 6 6 5\\n1 7 7 3\\n2 7 7 3\\n1 8 8 3\\n2 8 8 3\\n\",\n \"50 20\\n1 44 48 43\\n1 15 24 9\\n2 39 44 25\\n1 36 48 35\\n1 4 30 27\\n1 31 44 15\\n2 19 38 22\\n2 18 43 24\\n1 25 35 10\\n2 38 43 5\\n2 10 22 21\\n2 5 19 30\\n1 17 35 26\\n1 17 31 10\\n2 9 21 1\\n2 29 34 10\\n2 25 44 21\\n2 13 33 13\\n2 34 38 9\\n2 23 43 4\\n\",\n \"50 2\\n2 6 35 37\\n1 19 46 44\\n\",\n \"50 10\\n1 17 44 44\\n2 32 40 4\\n2 1 45 31\\n1 27 29 16\\n1 8 9 28\\n2 1 34 16\\n2 16 25 2\\n2 17 39 32\\n1 16 35 34\\n1 1 28 12\\n\",\n \"50 0\\n\",\n \"5 2\\n1 1 2 4\\n1 3 5 5\\n\",\n \"50 10\\n2 4 24 29\\n1 14 49 9\\n2 21 29 12\\n2 2 46 11\\n2 4 11 38\\n2 3 36 8\\n1 24 47 28\\n2 23 40 32\\n1 16 50 38\\n1 31 49 38\\n\",\n \"50 1\\n2 31 38 25\\n\",\n \"7 14\\n1 1 1 1\\n2 1 1 6\\n1 2 2 1\\n2 2 2 5\\n1 3 3 1\\n2 3 3 6\\n1 4 4 5\\n2 4 4 7\\n1 5 5 1\\n2 5 5 2\\n1 6 6 2\\n2 6 6 2\\n1 7 7 5\\n2 7 7 5\\n\",\n \"49 7\\n1 17 44 13\\n1 14 22 36\\n1 27 39 3\\n2 20 36 16\\n2 29 31 49\\n1 32 40 10\\n2 4 48 48\\n\",\n \"49 10\\n2 17 19 14\\n1 6 46 9\\n2 19 32 38\\n2 27 31 15\\n2 38 39 17\\n1 30 36 14\\n2 35 41 8\\n1 18 23 32\\n2 8 35 13\\n2 24 32 45\\n\",\n \"50 10\\n2 31 38 4\\n2 33 43 1\\n2 33 46 21\\n2 37 48 17\\n1 12 46 33\\n2 25 44 43\\n1 12 50 2\\n1 15 35 18\\n2 9 13 35\\n1 2 25 28\\n\",\n \"42 16\\n2 33 37 36\\n1 14 18 1\\n2 24 25 9\\n2 4 34 29\\n2 32 33 8\\n2 27 38 23\\n2 1 1 7\\n2 15 42 35\\n2 37 42 17\\n2 8 13 4\\n2 19 21 40\\n2 37 38 6\\n2 33 38 18\\n2 12 40 26\\n2 27 42 38\\n2 40 40 30\\n\",\n \"50 2\\n1 15 16 17\\n2 12 35 41\\n\",\n \"1 0\\n\",\n \"1 1\\n1 1 1 1\\n\",\n \"4 3\\n2 1 2 2\\n1 2 2 2\\n2 3 4 1\\n\",\n \"50 20\\n1 14 22 40\\n1 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 30 37\\n1 33 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n1 45 45 32\\n2 6 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 7 49 43\\n1 10 18 42\\n2 10 37 24\\n1 45 46 24\\n2 5 36 33\\n2 17 40 20\\n1 22 30 7\\n1 5 49 25\\n2 18 49 21\\n1 43 49 39\\n2 9 25 23\\n1 10 19 47\\n2 36 48 10\\n1 25 30 50\\n1 15 49 13\\n1 10 17 33\\n2 8 33 7\\n2 28 36 34\\n2 40 40 16\\n1 1 17 31\\n\",\n \"50 8\\n2 11 44 10\\n2 2 13 2\\n2 23 35 41\\n1 16 28 17\\n2 21 21 46\\n1 22 39 43\\n2 10 29 34\\n1 17 27 22\\n\",\n \"5 2\\n1 1 5 4\\n2 3 5 4\\n\",\n \"50 2\\n2 38 41 49\\n1 19 25 24\\n\",\n \"50 1\\n2 12 34 9\\n\",\n \"50 1\\n1 12 38 31\\n\",\n \"7 3\\n2 1 2 2\\n1 3 7 2\\n2 3 7 0\\n\",\n \"8 16\\n1 1 1 2\\n2 1 1 3\\n1 2 2 6\\n2 2 2 8\\n1 3 3 1\\n2 3 3 2\\n1 4 1 3\\n2 4 4 3\\n1 5 5 1\\n2 5 5 2\\n1 6 6 2\\n2 6 6 5\\n1 7 7 3\\n2 7 7 3\\n1 8 8 3\\n2 8 8 3\\n\",\n \"7 14\\n1 1 1 1\\n2 1 1 6\\n1 2 2 1\\n2 2 2 5\\n1 3 3 1\\n2 3 3 6\\n1 4 4 5\\n2 4 4 6\\n1 5 5 1\\n2 5 5 2\\n1 6 6 2\\n2 6 6 2\\n1 7 7 5\\n2 7 7 5\\n\",\n \"42 16\\n2 33 37 15\\n1 14 18 1\\n2 24 25 9\\n2 4 34 29\\n2 32 33 8\\n2 27 38 23\\n2 1 1 7\\n2 15 42 35\\n2 37 42 17\\n2 8 13 4\\n2 19 21 40\\n2 37 38 6\\n2 33 38 18\\n2 12 40 26\\n2 27 42 38\\n2 40 40 30\\n\",\n \"50 2\\n1 15 16 17\\n2 5 35 41\\n\",\n \"1 1\\n1 2 1 1\\n\",\n \"4 3\\n2 1 2 2\\n1 2 1 2\\n2 3 4 1\\n\",\n \"5 2\\n1 1 5 4\\n4 3 5 4\\n\",\n \"50 2\\n1 38 41 49\\n1 19 25 24\\n\",\n \"3 2\\n1 1 3 2\\n1 1 3 2\\n\",\n \"7 14\\n1 1 1 1\\n2 1 1 6\\n1 2 2 1\\n2 2 2 5\\n1 3 3 1\\n2 3 3 6\\n1 4 4 5\\n2 4 4 6\\n1 5 5 1\\n2 5 5 2\\n1 6 6 2\\n1 6 6 2\\n1 7 7 5\\n2 7 7 5\\n\",\n \"50 2\\n2 6 35 26\\n1 19 46 44\\n\",\n \"50 10\\n1 17 44 44\\n2 32 40 4\\n2 1 45 4\\n1 27 29 16\\n1 8 9 28\\n2 1 34 16\\n2 16 25 2\\n2 17 39 32\\n1 16 35 34\\n1 1 28 12\\n\",\n \"50 10\\n2 4 24 29\\n1 14 49 9\\n2 21 29 12\\n3 2 46 11\\n2 4 11 38\\n2 3 36 8\\n1 24 47 28\\n2 23 40 32\\n1 16 50 38\\n1 31 49 38\\n\",\n \"50 20\\n1 20 22 40\\n1 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 30 37\\n1 33 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n1 45 45 32\\n2 6 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 7 49 43\\n1 10 18 42\\n2 10 37 24\\n1 45 46 24\\n2 5 36 33\\n2 17 40 20\\n1 22 30 7\\n1 5 49 25\\n2 9 49 21\\n1 43 49 39\\n2 9 25 23\\n1 10 19 47\\n2 36 48 10\\n1 25 30 50\\n1 15 49 13\\n1 10 17 33\\n2 8 33 7\\n2 28 36 34\\n2 40 40 16\\n1 1 17 31\\n\",\n \"50 8\\n2 11 44 10\\n2 2 13 2\\n2 23 35 14\\n1 16 28 17\\n2 21 21 46\\n1 22 39 43\\n2 10 29 34\\n1 17 27 22\\n\",\n \"3 1\\n2 1 3 2\\n\",\n \"3 2\\n2 1 3 2\\n2 1 3 1\\n\",\n \"50 2\\n2 6 35 26\\n1 33 46 44\\n\",\n \"50 10\\n2 4 24 29\\n1 14 49 9\\n2 21 29 12\\n3 2 46 11\\n2 4 11 38\\n2 3 36 8\\n1 24 47 28\\n2 23 40 32\\n1 16 50 38\\n1 31 39 38\\n\",\n \"50 20\\n1 20 22 40\\n1 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 33 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n1 45 45 32\\n2 6 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 8\\n2 11 44 10\\n2 2 13 2\\n2 23 35 14\\n1 16 28 17\\n2 21 21 46\\n1 22 39 43\\n1 10 29 34\\n1 17 27 22\\n\",\n \"50 10\\n2 4 24 29\\n1 14 49 9\\n2 21 29 12\\n3 2 46 11\\n2 4 11 38\\n2 3 36 8\\n1 24 47 28\\n4 23 40 32\\n1 16 50 38\\n1 31 39 38\\n\",\n \"7 14\\n2 1 1 1\\n2 1 1 6\\n1 2 2 1\\n2 2 2 5\\n1 3 3 1\\n2 3 3 6\\n1 4 4 5\\n2 4 4 6\\n1 5 5 1\\n2 5 5 2\\n1 6 6 2\\n1 6 6 2\\n1 7 7 5\\n2 7 7 5\\n\",\n \"50 20\\n1 21 22 40\\n1 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 33 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n1 45 45 32\\n2 6 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 10\\n2 4 24 29\\n1 14 49 9\\n2 21 29 12\\n3 2 46 11\\n2 4 11 56\\n2 3 36 8\\n1 24 47 28\\n4 23 40 32\\n1 16 50 38\\n1 31 39 38\\n\",\n \"50 20\\n1 21 1 40\\n1 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 33 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n1 45 45 32\\n2 6 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 10\\n2 4 24 29\\n1 14 49 9\\n2 21 29 12\\n3 2 46 11\\n2 4 11 56\\n2 3 36 8\\n1 24 47 28\\n4 23 40 32\\n1 16 50 38\\n1 32 39 38\\n\",\n \"50 20\\n1 21 1 40\\n0 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 33 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n1 45 45 32\\n2 6 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 21 1 40\\n0 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n1 45 45 32\\n2 6 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 21 1 40\\n0 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n0 45 45 32\\n2 6 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 21 1 40\\n0 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n0 45 45 32\\n2 5 24 24\\n2 28 44 16\\n2 36 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 21 1 40\\n0 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 32\\n2 5 37 30\\n0 45 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 21 1 40\\n0 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 45 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 21 1 40\\n0 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 71 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 39 1 40\\n0 23 41 3\\n1 32 39 26\\n1 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 71 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 39 1 40\\n0 23 41 3\\n1 32 39 26\\n0 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 3 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 71 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 39 1 40\\n0 23 41 3\\n1 32 39 26\\n0 8 47 25\\n2 5 13 28\\n2 2 17 32\\n1 23 2 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 71 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 39 1 40\\n0 23 41 3\\n1 32 39 26\\n0 8 47 25\\n2 5 13 28\\n2 2 17 2\\n1 23 2 37\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 71 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 39 1 40\\n0 23 41 3\\n1 32 39 26\\n0 8 47 25\\n2 5 13 28\\n2 2 17 2\\n1 23 2 35\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 71 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 39 1 40\\n0 23 41 3\\n1 32 39 26\\n0 8 47 25\\n3 5 13 28\\n2 2 17 2\\n1 23 2 35\\n1 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 71 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\",\n \"50 20\\n1 39 1 40\\n0 23 41 3\\n1 32 39 26\\n0 8 47 25\\n3 5 13 28\\n2 2 17 2\\n1 23 2 35\\n2 4 45 49\\n2 13 27 43\\n1 30 32 2\\n2 28 49 40\\n2 33 35 34\\n2 5 37 30\\n0 71 45 32\\n2 5 24 24\\n2 28 44 16\\n2 63 47 24\\n1 5 11 9\\n1 9 37 22\\n1 28 40 24\\n\"\n ],\n \"output\": [\n \"3\\n\",\n \"9\\n\",\n \"5\\n\",\n \"-1\\n\",\n \"5\\n\",\n \"17\\n\",\n \"2500\\n\",\n \"29\\n\",\n \"52\\n\",\n \"16\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"50\\n\",\n \"13\\n\",\n \"-1\\n\",\n \"50\\n\",\n \"7\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"64\\n\",\n \"50\\n\",\n \"1\\n\",\n \"1\\n\",\n \"8\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"13\\n\",\n \"50\\n\",\n \"88\\n\",\n \"64\\n\",\n \"-1\\n\",\n \"14\\n\",\n \"9\\n\",\n \"64\\n\",\n \"50\\n\",\n \"1\\n\",\n \"8\\n\",\n \"13\\n\",\n \"54\\n\",\n \"5\\n\",\n \"7\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"5\\n\",\n \"9\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"7\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\",\n \"-1\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nRecently Ivan noticed an array a while debugging his code. Now Ivan can't remember this array, but the bug he was trying to fix didn't go away, so Ivan thinks that the data from this array might help him to reproduce the bug.\n\nIvan clearly remembers that there were n elements in the array, and each element was not less than 1 and not greater than n. Also he remembers q facts about the array. There are two types of facts that Ivan remembers:\n\n * 1 li ri vi — for each x such that li ≤ x ≤ ri ax ≥ vi; \n * 2 li ri vi — for each x such that li ≤ x ≤ ri ax ≤ vi. \n\n\n\nAlso Ivan thinks that this array was a permutation, but he is not so sure about it. He wants to restore some array that corresponds to the q facts that he remembers and is very similar to permutation. Formally, Ivan has denoted the cost of array as follows:\n\n<image>, where cnt(i) is the number of occurences of i in the array.\n\nHelp Ivan to determine minimum possible cost of the array that corresponds to the facts!\n\nInput\n\nThe first line contains two integer numbers n and q (1 ≤ n ≤ 50, 0 ≤ q ≤ 100).\n\nThen q lines follow, each representing a fact about the array. i-th line contains the numbers ti, li, ri and vi for i-th fact (1 ≤ ti ≤ 2, 1 ≤ li ≤ ri ≤ n, 1 ≤ vi ≤ n, ti denotes the type of the fact).\n\nOutput\n\nIf the facts are controversial and there is no array that corresponds to them, print -1. Otherwise, print minimum possible cost of the array.\n\nExamples\n\nInput\n\n3 0\n\n\nOutput\n\n3\n\n\nInput\n\n3 1\n1 1 3 2\n\n\nOutput\n\n5\n\n\nInput\n\n3 2\n1 1 3 2\n2 1 3 2\n\n\nOutput\n\n9\n\n\nInput\n\n3 2\n1 1 3 2\n2 1 3 1\n\n\nOutput\n\n-1\n\n### Input:\n3 0\n\n### Output:\n3\n\n\n### Input:\n3 2\n1 1 3 2\n2 1 3 2\n\n### Output:\n9\n\n\n### Code:\nimport sys\n\ndef is_feasible(cnt,L,R):\n\tn = len(R)\n\tinter = [(L[i],R[i]) for i in range(n)]\n\tAUX = []\n\tfeasible = True\n\tfor x in range(n):\n\t\tfor p in inter:\n\t\t\tif p[0] == x:\n\t\t\t\tAUX.append(p[1])\n\t\t\t\t\n\t\twhile AUX and min(AUX) < x:\n\t\t\tAUX.remove(min(AUX))\n\t\tfor quantity in range(cnt[x]):\n\t\t\tif AUX:\n\t\t\t\tAUX.remove(min(AUX))\n\t\t\telse:\n\t\t\t\tfeasible = False\n\treturn feasible\n\nn,q = map(int,sys.stdin.readline().split())\nL = [0 for i in range(n)]\nR = [n-1 for i in range(n)]\nfor restriction in range(q):\n\tt,l,r,v = map(int,sys.stdin.readline().split())\n\tif t == 1:\n\t\tfor k in range(l-1,r):\n\t\t\tL[k] = max(L[k],v-1)\n\telse:\n\t\tfor k in range(l-1,r):\n\t\t\tR[k] = min(R[k],v-1)\n\t\t\t\nis_possible = all(map(lambda x,y : x <= y,L,R))\nif not is_possible:\n\tprint(-1)\nelse:\n\tcnt = {x:L.count(x) for x in range(n)}\n\thad_pair = True\n\twhile had_pair:\n\t\thad_pair = False\n\t\tfor x in range(n-1,-1,-1):\n\t\t\tfor y in range(n-1,-1,-1):\n\t\t\t\tif cnt[x] > cnt[y]+1:\n\t\t\t\t\tcnt[x] -= 1\n\t\t\t\t\tcnt[y] += 1\n\t\t\t\t\thas_pair = True\n\t\t\t\t\tif not is_feasible(cnt,L,R):\n\t\t\t\t\t\tcnt[x] += 1\n\t\t\t\t\t\tcnt[y] -= 1\n\t\t\t\t\t\thas_pair = False\n\t\t\t\t\thad_pair = had_pair or has_pair \n\t\t\t\t\n\t\n\tans = sum([cnt[x]*cnt[x] for x in range(n)])\n\tprint(ans)\n\t\n\t\t\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\n"}}},{"rowIdx":5696,"cells":{"id":{"kind":"string","value":"912_A. Tricky Alchemy_26889"},"description":{"kind":"string","value":"During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.\n\nGrisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellow ball one needs two yellow crystals, green — one yellow and one blue, and for a blue ball, three blue crystals are enough.\n\nRight now there are A yellow and B blue crystals in Grisha's disposal. Find out how many additional crystals he should acquire in order to produce the required number of balls.\n\nInput\n\nThe first line features two integers A and B (0 ≤ A, B ≤ 109), denoting the number of yellow and blue crystals respectively at Grisha's disposal.\n\nThe next line contains three integers x, y and z (0 ≤ x, y, z ≤ 109) — the respective amounts of yellow, green and blue balls to be obtained.\n\nOutput\n\nPrint a single integer — the minimum number of crystals that Grisha should acquire in addition.\n\nExamples\n\nInput\n\n4 3\n2 1 1\n\n\nOutput\n\n2\n\n\nInput\n\n3 9\n1 1 3\n\n\nOutput\n\n1\n\n\nInput\n\n12345678 87654321\n43043751 1000000000 53798715\n\n\nOutput\n\n2147483648\n\nNote\n\nIn the first sample case, Grisha needs five yellow and four blue crystals to create two yellow balls, one green ball, and one blue ball. To do that, Grisha needs to obtain two additional crystals: one yellow and one blue."},"code":{"kind":"string","value":"y,b=input().split(' ')\nay,ag,ab=input().split(' ')\ny=int(y)\nb=int(b)\nay=int(ay)\nag=int(ag)\nab=int(ab)\nb=b-(ab*3)\ny=y-(ay*2)\nb=b-ag\ny=y-ag\nbr=0\nif(y<0):\n\tbr=br-y\nif(b<0):\n\tbr=br-b\nprint(br)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"4 3\\n2 1 1\\n\",\n \"3 9\\n1 1 3\\n\",\n \"12345678 87654321\\n43043751 1000000000 53798715\\n\",\n \"25 5\\n3 3 3\\n\",\n \"612127849 669475006\\n271630930 676010757 22959739\\n\",\n \"100 10\\n2 3 4\\n\",\n \"626115781 966381948\\n395190569 820194184 229233367\\n\",\n \"48 27\\n22 39 20\\n\",\n \"198066417 825228166\\n602477839 532312735 520830423\\n\",\n \"139903376 532155119\\n641157122 289897263 629020178\\n\",\n \"217434393 579352456\\n694817470 981409480 756706026\\n\",\n \"80356306 962548053\\n601547868 549830008 914769984\\n\",\n \"566568710 765371101\\n60614022 80126928 809950465\\n\",\n \"0 0\\n0 0 0\\n\",\n \"3555165 6693472\\n1499112 556941 3075290\\n\",\n \"843552056 919184611\\n341530221 423649259 101547519\\n\",\n \"1000000000 1000000000\\n1000000000 1000000000 1000000000\\n\",\n \"1000000000 1000000000\\n499999998 4 333333332\\n\",\n \"980630143 241021722\\n24734406 928857659 312079781\\n\",\n \"4 12\\n1 2 3\\n\",\n \"862920032 378341609\\n360240924 241342224 337423122\\n\",\n \"394691574 716672343\\n398920207 72555681 150645586\\n\",\n \"1 1\\n0 1 0\\n\",\n \"770 1390\\n170 442 311\\n\",\n \"20809236 56504497\\n972004030 441166533 495487081\\n\",\n \"999998118 700178721\\n822106746 82987112 547955384\\n\",\n \"4 20\\n1 2 1\\n\",\n \"117708228 562858833\\n118004008 360437130 154015822\\n\",\n \"4 0\\n1 1 1\\n\",\n \"12 12\\n3 5 2\\n\",\n \"276981463 853992230\\n29394015 90072954 839552440\\n\",\n \"448858599 829062060\\n764716760 97644201 203890025\\n\",\n \"0 0\\n1000000000 1000000000 1000000000\\n\",\n \"257613487 394835231\\n642087093 567347282 308709545\\n\",\n \"803372962 103701834\\n394260597 837711458 623172928\\n\",\n \"40177212 515661496\\n64343660 963892207 731362684\\n\",\n \"4 3\\n1 0 1\\n\",\n \"6 0\\n1 1 1\\n\",\n \"25 5\\n1 3 3\\n\",\n \"612127849 669475006\\n112934930 676010757 22959739\\n\",\n \"100 10\\n2 1 4\\n\",\n \"626115781 966381948\\n676223744 820194184 229233367\\n\",\n \"48 27\\n42 39 20\\n\",\n \"198066417 825228166\\n602477839 532312735 834067762\\n\",\n \"139903376 822847568\\n641157122 289897263 629020178\\n\",\n \"217434393 598584651\\n694817470 981409480 756706026\\n\",\n \"80356306 962548053\\n601547868 549830008 648426053\\n\",\n \"566568710 765371101\\n6098528 80126928 809950465\\n\",\n \"0 0\\n1 0 0\\n\",\n \"3555165 6693472\\n1499112 556941 4375704\\n\",\n \"843552056 919184611\\n341530221 423649259 116620098\\n\",\n \"1000000000 1000000000\\n1000100000 1000000000 1000000000\\n\",\n \"1000000001 1000000000\\n499999998 4 333333332\\n\",\n \"980630143 442908239\\n24734406 928857659 312079781\\n\",\n \"862920032 378341609\\n360240924 262089708 337423122\\n\",\n \"675522432 716672343\\n398920207 72555681 150645586\\n\",\n \"20809236 56504497\\n972004030 550616085 495487081\\n\",\n \"999998118 700178721\\n822106746 82987112 247538793\\n\",\n \"4 20\\n1 3 1\\n\",\n \"117708228 562858833\\n118004008 440468403 154015822\\n\",\n \"2 0\\n1 1 1\\n\",\n \"276981463 675305415\\n29394015 90072954 839552440\\n\",\n \"448858599 72573895\\n764716760 97644201 203890025\\n\",\n \"0 0\\n1000000000 1000100000 1000000000\\n\",\n \"257613487 394835231\\n642087093 66399732 308709545\\n\",\n \"803372962 71536479\\n394260597 837711458 623172928\\n\",\n \"6202932 515661496\\n64343660 963892207 731362684\\n\",\n \"6 0\\n2 1 1\\n\",\n \"23046767 87654321\\n43043751 1000000000 53798715\\n\",\n \"626115781 612893495\\n676223744 820194184 229233367\\n\",\n \"48 27\\n42 77 20\\n\",\n \"198066417 825228166\\n751253210 532312735 834067762\\n\",\n \"139903376 822847568\\n565091137 289897263 629020178\\n\",\n \"217434393 598584651\\n694817470 1720675506 756706026\\n\",\n \"80356306 962548053\\n601547868 389083544 648426053\\n\",\n \"566568710 765371101\\n6098528 80126928 1531886653\\n\",\n \"3555165 6693472\\n1499112 405401 4375704\\n\",\n \"843552056 444582372\\n341530221 423649259 116620098\\n\",\n \"1000000000 1010000000\\n1000100000 1000000000 1000000000\\n\",\n \"980630143 442908239\\n24734406 830532403 312079781\\n\",\n \"862920032 378341609\\n360240924 262089708 113051389\\n\",\n \"983 1390\\n170 442 591\\n\",\n \"20809236 5030463\\n972004030 550616085 495487081\\n\",\n \"999998118 700178721\\n822106746 82987112 53041322\\n\",\n \"117708228 562858833\\n74296517 440468403 154015822\\n\",\n \"448858599 72573895\\n764716760 97644201 374022092\\n\",\n \"0 0\\n1000000000 1000100010 1000000000\\n\",\n \"257613487 93930639\\n642087093 66399732 308709545\\n\",\n \"595373095 71536479\\n394260597 837711458 623172928\\n\",\n \"6202932 515661496\\n64343660 963892207 910911390\\n\",\n \"21541770 87654321\\n43043751 1000000000 53798715\\n\",\n \"612127849 669475006\\n112934930 438737177 22959739\\n\",\n \"1170521211 612893495\\n676223744 820194184 229233367\\n\",\n \"48 15\\n42 77 20\\n\",\n \"198066417 1519965424\\n751253210 532312735 834067762\\n\",\n \"139903376 916953909\\n565091137 289897263 629020178\\n\",\n \"217434393 744980688\\n694817470 1720675506 756706026\\n\",\n \"105667381 962548053\\n601547868 389083544 648426053\\n\",\n \"3555165 6693472\\n1499112 777286 4375704\\n\",\n \"1084825411 444582372\\n341530221 423649259 116620098\\n\",\n \"1000000000 1010000000\\n1000100001 1000000000 1000000000\\n\",\n \"1000000001 1000000000\\n387843571 4 572299834\\n\",\n \"34224343 378341609\\n360240924 262089708 113051389\\n\",\n \"324368495 716672343\\n398920207 72555681 145201949\\n\",\n \"184 1390\\n170 442 591\\n\",\n \"20809236 5030463\\n993945312 550616085 495487081\\n\",\n \"999998118 700178721\\n822106746 19318762 53041322\\n\",\n \"117708228 562858833\\n74296517 232869707 154015822\\n\",\n \"4 12\\n2 2 3\\n\",\n \"1 2\\n0 1 0\\n\",\n \"983 1390\\n170 442 311\\n\",\n \"12 16\\n3 5 2\\n\",\n \"4 3\\n2 0 1\\n\",\n \"4 1\\n2 1 1\\n\",\n \"3 9\\n2 1 3\\n\",\n \"30 5\\n1 3 3\\n\",\n \"612127849 669475006\\n112934930 239213424 22959739\\n\",\n \"110 10\\n2 1 4\\n\",\n \"1000000001 1000000000\\n387843571 4 333333332\\n\",\n \"4 12\\n2 3 3\\n\",\n \"675522432 716672343\\n398920207 72555681 145201949\\n\",\n \"1 4\\n0 1 0\\n\",\n \"4 20\\n1 1 1\\n\",\n \"3 0\\n1 1 1\\n\",\n \"12 16\\n3 5 0\\n\",\n \"153594196 675305415\\n29394015 90072954 839552440\\n\",\n \"4 0\\n2 0 1\\n\",\n \"6 0\\n3 1 1\\n\",\n \"4 1\\n0 1 1\\n\",\n \"4 9\\n2 1 3\\n\",\n \"11 5\\n1 3 3\\n\",\n \"110 10\\n2 1 0\\n\",\n \"566568710 765371101\\n9775714 80126928 1531886653\\n\",\n \"980630143 442908239\\n8953073 830532403 312079781\\n\",\n \"4 12\\n2 3 1\\n\",\n \"1 8\\n0 1 0\\n\",\n \"4 20\\n2 1 1\\n\"\n ],\n \"output\": [\n \"2\\n\",\n \"1\\n\",\n \"2147483648\\n\",\n \"7\\n\",\n \"682559736\\n\",\n \"5\\n\",\n \"1525971878\\n\",\n \"107\\n\",\n \"2808777834\\n\",\n \"3077110809\\n\",\n \"4825785129\\n\",\n \"4004161345\\n\",\n \"1744607222\\n\",\n \"0\\n\",\n \"3089339\\n\",\n \"263157645\\n\",\n \"5000000000\\n\",\n \"0\\n\",\n \"1624075280\\n\",\n \"0\\n\",\n \"974174021\\n\",\n \"475704521\\n\",\n \"0\\n\",\n \"12\\n\",\n \"4235488636\\n\",\n \"1753877029\\n\",\n \"0\\n\",\n \"738362681\\n\",\n \"4\\n\",\n \"0\\n\",\n \"1754738044\\n\",\n \"1178219122\\n\",\n \"7000000000\\n\",\n \"2692548667\\n\",\n \"3426388098\\n\",\n \"3694721078\\n\",\n \"0\\n\",\n \"4\\n\",\n \"7\\n\",\n \"365167736\\n\",\n \"3\\n\",\n \"2088038228\\n\",\n \"147\\n\",\n \"3748489851\\n\",\n \"2786418360\\n\",\n \"4806552934\\n\",\n \"3205129552\\n\",\n \"1744607222\\n\",\n \"2\\n\",\n \"6990581\\n\",\n \"263157645\\n\",\n \"5000200000\\n\",\n \"0\\n\",\n \"1422188763\\n\",\n \"1015668989\\n\",\n \"194873663\\n\",\n \"4454387740\\n\",\n \"852627256\\n\",\n \"1\\n\",\n \"898425227\\n\",\n \"5\\n\",\n \"1933424859\\n\",\n \"1814959503\\n\",\n \"7000200000\\n\",\n \"1690653567\\n\",\n \"3458553453\\n\",\n \"3728695358\\n\",\n \"4\\n\",\n \"2136782559\\n\",\n \"2441526681\\n\",\n \"223\\n\",\n \"4046040593\\n\",\n \"2634286390\\n\",\n \"6285084986\\n\",\n \"2883636624\\n\",\n \"3910415786\\n\",\n \"6839041\\n\",\n \"592084826\\n\",\n \"4990200000\\n\",\n \"1323863507\\n\",\n \"342553790\\n\",\n \"825\\n\",\n \"4505861774\\n\",\n \"727202486\\n\",\n \"811010245\\n\",\n \"2325355704\\n\",\n \"7000200020\\n\",\n \"1991558159\\n\",\n \"3666553320\\n\",\n \"4267341476\\n\",\n \"2138287556\\n\",\n \"52479188\\n\",\n \"1897121251\\n\",\n \"235\\n\",\n \"3351303335\\n\",\n \"2540180049\\n\",\n \"6138688949\\n\",\n \"2858325549\\n\",\n \"7431271\\n\",\n \"350811471\\n\",\n \"4990200002\\n\",\n \"716899506\\n\",\n \"1171249479\\n\",\n \"546027600\\n\",\n \"1423\\n\",\n \"4549744338\\n\",\n \"663534136\\n\",\n \"395812853\\n\",\n \"2\\n\",\n \"0\\n\",\n \"0\\n\",\n \"0\\n\",\n \"0\\n\",\n \"4\\n\",\n \"3\\n\",\n \"7\\n\",\n \"0\\n\",\n \"3\\n\",\n \"0\\n\",\n \"3\\n\",\n \"194873663\\n\",\n \"0\\n\",\n \"0\\n\",\n \"4\\n\",\n \"0\\n\",\n \"1933424859\\n\",\n \"3\\n\",\n \"5\\n\",\n \"3\\n\",\n \"2\\n\",\n \"7\\n\",\n \"0\\n\",\n \"3910415786\\n\",\n \"1323863507\\n\",\n \"3\\n\",\n \"0\\n\",\n \"1\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nDuring the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.\n\nGrisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellow ball one needs two yellow crystals, green — one yellow and one blue, and for a blue ball, three blue crystals are enough.\n\nRight now there are A yellow and B blue crystals in Grisha's disposal. Find out how many additional crystals he should acquire in order to produce the required number of balls.\n\nInput\n\nThe first line features two integers A and B (0 ≤ A, B ≤ 109), denoting the number of yellow and blue crystals respectively at Grisha's disposal.\n\nThe next line contains three integers x, y and z (0 ≤ x, y, z ≤ 109) — the respective amounts of yellow, green and blue balls to be obtained.\n\nOutput\n\nPrint a single integer — the minimum number of crystals that Grisha should acquire in addition.\n\nExamples\n\nInput\n\n4 3\n2 1 1\n\n\nOutput\n\n2\n\n\nInput\n\n3 9\n1 1 3\n\n\nOutput\n\n1\n\n\nInput\n\n12345678 87654321\n43043751 1000000000 53798715\n\n\nOutput\n\n2147483648\n\nNote\n\nIn the first sample case, Grisha needs five yellow and four blue crystals to create two yellow balls, one green ball, and one blue ball. To do that, Grisha needs to obtain two additional crystals: one yellow and one blue.\n\n### Input:\n4 3\n2 1 1\n\n### Output:\n2\n\n\n### Input:\n3 9\n1 1 3\n\n### Output:\n1\n\n\n### Code:\ny,b=input().split(' ')\nay,ag,ab=input().split(' ')\ny=int(y)\nb=int(b)\nay=int(ay)\nag=int(ag)\nab=int(ab)\nb=b-(ab*3)\ny=y-(ay*2)\nb=b-ag\ny=y-ag\nbr=0\nif(y<0):\n\tbr=br-y\nif(b<0):\n\tbr=br-b\nprint(br)"}}},{"rowIdx":5697,"cells":{"id":{"kind":"string","value":"934_A. A Compatible Pair_26893"},"description":{"kind":"string","value":"Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of which frighten the monster out of coming.\n\nLittle Tommy has n lanterns and Big Banban has m lanterns. Tommy's lanterns have brightness a1, a2, ..., an, and Banban's have brightness b1, b2, ..., bm respectively.\n\nTommy intends to hide one of his lanterns, then Banban picks one of Tommy's non-hidden lanterns and one of his own lanterns to form a pair. The pair's brightness will be the product of the brightness of two lanterns.\n\nTommy wants to make the product as small as possible, while Banban tries to make it as large as possible.\n\nYou are asked to find the brightness of the chosen pair if both of them choose optimally.\n\nInput\n\nThe first line contains two space-separated integers n and m (2 ≤ n, m ≤ 50).\n\nThe second line contains n space-separated integers a1, a2, ..., an.\n\nThe third line contains m space-separated integers b1, b2, ..., bm.\n\nAll the integers range from - 109 to 109.\n\nOutput\n\nPrint a single integer — the brightness of the chosen pair.\n\nExamples\n\nInput\n\n2 2\n20 18\n2 14\n\n\nOutput\n\n252\n\n\nInput\n\n5 3\n-1 0 1 2 3\n-1 0 1\n\n\nOutput\n\n2\n\nNote\n\nIn the first example, Tommy will hide 20 and Banban will choose 18 from Tommy and 14 from himself.\n\nIn the second example, Tommy will hide 3 and Banban will choose 2 from Tommy and 1 from himself."},"code":{"kind":"string","value":"n, m = [int(x) for x in input().split()]\nlstT = [int(x) for x in input().split()]\nlstB = [int(x) for x in input().split()]\nz=-9999999999999999999999999999\nT=0\nB=0\nfor i in range(n):\n for j in range(m):\n if z<lstT[i]*lstB[j]:\n T=i\n B=j\n z=lstT[i]*lstB[j]\nlol = -99999999999999999999\nfor i in range(n):\n for j in range(m):\n if T!=i:\n lol = max(lol, lstT[i]*lstB[j])\nprint(lol)\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"2 2\\n20 18\\n2 14\\n\",\n \"5 3\\n-1 0 1 2 3\\n-1 0 1\\n\",\n \"14 8\\n-1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000\\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\\n\",\n \"5 7\\n869535768 926886134 457905290 946881177 936471280\\n-550057074 -517146573 -138904928 -683289266 -805395532 -979722367 -331183396\\n\",\n \"33 14\\n-576562007 -218618150 -471719380 -583840778 -256368365 -68451917 -405045344 -775538133 -896830082 -439261765 -947070124 -716577019 -456110999 -689862512 -132480131 -10805271 -518903339 -196240188 -222292638 -828546042 -43887962 -161359263 -281422097 -484060534 963147664 -492377073 -154570101 -52145116 187803553 858844161 66540410 418777176 434025748\\n-78301978 -319393213 -12393024 542953412 786804661 845642067 754996432 -985617475 -487171947 56142664 203173079 -268261708 -817080591 -511720682\\n\",\n \"24 24\\n299931317 581208095 975349898 832722683 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 225791789 53290960 405421751 723296526 565432511 256399554 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -596056305 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -244549551 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"6 30\\n-524297819 -947277203 -444186475 -182837689 -385379656 -453917269\\n834529938 35245081 663687669 585422565 164412867 850052113 796429008 -307345676 -127653313 426960600 211854713 -733687358 251466836 -33491050 -882811238 455544614 774581544 768447941 -241033484 441104324 -493975870 308277556 275268265 935941507 -152292053 -961509996 -740482111 -954176110 -924254634 -518710544\\n\",\n \"39 9\\n44558618 981372779 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 954204512 795507844 389962019 507308352 408180613 194676444 44962879 922688019 101163040 327953325 560462120 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 694808087 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -97031207 -311654366 -389141528\\n\",\n \"50 50\\n1 6 2 10 2 3 2 10 6 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 5 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 0\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 4 2 5 3 5 1 3 2 4 1 6 5 3 8 6\\n\",\n \"5 7\\n-130464232 -73113866 -542094710 -53118823 -63528720\\n449942926 482853427 861095072 316710734 194604468 20277633 668816604\\n\",\n \"12 25\\n-464030345 -914672073 -483242132 -856226270 -925135169 -353124606 -294027092 -619650850 -490724485 -240424784 -483066792 -921640365\\n279850608 726838739 -431610610 242749870 -244020223 -396865433 129534799 182767854 -939698671 342579400 330027106 893561388 -263513962 643369418 276245179 -99206565 -473767261 -168908664 -853755837 -270920164 -661186118 199341055 765543053 908211534 -93363867\\n\",\n \"5 7\\n-130464232 -73113866 -542094710 -53118823 -63528720\\n-775179088 631683023 -974858199 -157471745 -629658630 71825477 -6235611\\n\",\n \"5 32\\n-540510995 -841481393 -94342377 -74818927 -93445356\\n686714668 -82581175 736472406 502016312 575563638 -899308712 503504178 -644271272 -437408397 385778869 -746757839 306275973 -663503743 -431116516 -418708278 -515261493 -988182324 900230931 218258353 -714420102 -241118202 294802602 -937785552 -857537498 -723195312 -690515139 -214508504 -44086454 -231621215 -418360090 -810003786 -675944617\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -167277317 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -774208211 -946709040 -594578249 -276703474 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n704881272 169877679 705460701 94083210 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 192465301 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -808736065 -481883825 -263383991 -664780611 -605377134\\n718174936 -140362196 -669193674 -598621021 -464130929 450701419 -331183926 107203430 946959233 -565825915 -558199897 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -295615495 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 295706874 477139483 375083042 726254399 -439255703 662913604 -481588088 673747948 -345999555 -723334478 -656721905 276267528 628773156 851420802 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"15 8\\n-966400308 -992207261 -302395973 -837980754 -516443826 -492405613 -378127629 -762650324 -519519776 -36132939 -286460372 -351445284 -407653342 -604960925 -523442015\\n610042288 27129580 -103108347 -942517864 842060508 -588904868 614786155 37455106\\n\",\n \"12 22\\n-102896616 -311161241 -67541276 -402842686 -830595520 -813834033 -44046671 -584806552 -598620444 -968935604 -303048547 -545969410\\n545786451 262898403 442511997 -441241260 -479587986 -752123290 720443264 500646237 737842681 -571966572 -798463881 -477248830 89875164 410339460 -359022689 -251280099 -441455542 -538431186 -406793869 374561004 -108755237 -440143410\\n\",\n \"10 2\\n1 6 2 10 2 3 2 10 6 4\\n5 7\\n\",\n \"16 15\\n-94580188 -713689767 -559972014 -632609438 -930348091 -567718487 -611395744 -819913097 -924009672 -427913920 -812510647 -546415480 -982072775 -693369647 -693004777 -714181162\\n-772924706 -202246100 -165871667 -991426281 -490838183 209351416 134956137 -36128588 -754413937 -616596290 696201705 -201191199 967464971 -244181984 -729907974\\n\",\n \"17 13\\n-483786205 -947257449 -125949195 -294711143 -420288876 -812462057 -250049555 -911026413 -188146919 -129501682 -869006661 -649643966 -26976411 -275761039 -869067490 -272248209 -342067346\\n445539900 529728842 -808170728 673157826 -70778491 642872105 299298867 -76674218 -902394063 377664752 723887448 -121522827 906464625\\n\",\n \"32 13\\n-999451897 -96946179 -524159869 -906101658 -63367320 -629803888 -968586834 -658416130 -874232857 -926556428 -749908220 -517073321 -659752288 -910152878 -786916085 -607633039 -191428642 -867952926 -873793977 -584331784 -733245792 -779809700 -554228536 -464503499 561577340 258991071 -569805979 -372655165 -106685554 -619607960 188856473 -268960803\\n886429660 -587284372 911396803 -462990289 -228681210 -876239914 -822830527 -750131315 -401234943 116991909 -582713480 979631847 813552478\\n\",\n \"5 7\\n1386172532 926886134 457905290 946881177 936471280\\n-550057074 -517146573 -138904928 -683289266 -805395532 -979722367 -331183396\\n\",\n \"33 14\\n-576562007 -218618150 -471719380 -583840778 -256368365 -133430322 -405045344 -775538133 -896830082 -439261765 -947070124 -716577019 -456110999 -689862512 -132480131 -10805271 -518903339 -196240188 -222292638 -828546042 -43887962 -161359263 -281422097 -484060534 963147664 -492377073 -154570101 -52145116 187803553 858844161 66540410 418777176 434025748\\n-78301978 -319393213 -12393024 542953412 786804661 845642067 754996432 -985617475 -487171947 56142664 203173079 -268261708 -817080591 -511720682\\n\",\n \"24 24\\n299931317 581208095 975349898 832722683 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 80836191 53290960 405421751 723296526 565432511 256399554 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -596056305 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -244549551 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"6 30\\n-524297819 -947277203 -444186475 -182837689 -385379656 -453917269\\n834529938 35245081 643540671 585422565 164412867 850052113 796429008 -307345676 -127653313 426960600 211854713 -733687358 251466836 -33491050 -882811238 455544614 774581544 768447941 -241033484 441104324 -493975870 308277556 275268265 935941507 -152292053 -961509996 -740482111 -954176110 -924254634 -518710544\\n\",\n \"39 9\\n44558618 981372779 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 954204512 795507844 604520066 507308352 408180613 194676444 44962879 922688019 101163040 327953325 560462120 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 694808087 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -97031207 -311654366 -389141528\\n\",\n \"50 50\\n1 6 2 10 2 3 2 10 4 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 5 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 0\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 4 2 5 3 5 1 3 2 4 1 6 5 3 8 6\\n\",\n \"5 7\\n-130464232 -73113866 -204605704 -53118823 -63528720\\n449942926 482853427 861095072 316710734 194604468 20277633 668816604\\n\",\n \"12 25\\n-464030345 -914672073 -483242132 -856226270 -925135169 -353124606 -294027092 -619650850 -490724485 -240424784 -483066792 -921640365\\n279850608 1299327888 -431610610 242749870 -244020223 -396865433 129534799 182767854 -939698671 342579400 330027106 893561388 -263513962 643369418 276245179 -99206565 -473767261 -168908664 -853755837 -270920164 -661186118 199341055 765543053 908211534 -93363867\\n\",\n \"5 7\\n-130464232 -73113866 -542094710 -53118823 -63528720\\n-775179088 631683023 -1920750402 -157471745 -629658630 71825477 -6235611\\n\",\n \"5 32\\n-540510995 -841481393 -94342377 -74818927 -93445356\\n686714668 -82581175 736472406 502016312 575563638 -899308712 503504178 -644271272 -437408397 594101399 -746757839 306275973 -663503743 -431116516 -418708278 -515261493 -988182324 900230931 218258353 -714420102 -241118202 294802602 -937785552 -857537498 -723195312 -690515139 -214508504 -44086454 -231621215 -418360090 -810003786 -675944617\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -167277317 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -394887347 -946709040 -594578249 -276703474 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n704881272 169877679 705460701 94083210 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 192465301 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -808736065 -481883825 -263383991 -664780611 -605377134\\n718174936 -140362196 -669193674 -598621021 -464130929 450701419 -331183926 107203430 946959233 -826872392 -558199897 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -295615495 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 63978619 477139483 375083042 726254399 -439255703 662913604 -481588088 673747948 -345999555 -723334478 -656721905 276267528 628773156 851420802 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"15 8\\n-966400308 -992207261 -302395973 -837980754 -516443826 -492405613 -378127629 -762650324 -519519776 -36132939 -286460372 -351445284 -407653342 -473409377 -523442015\\n610042288 27129580 -103108347 -942517864 842060508 -588904868 614786155 37455106\\n\",\n \"12 22\\n-102896616 -102914786 -67541276 -402842686 -830595520 -813834033 -44046671 -584806552 -598620444 -968935604 -303048547 -545969410\\n545786451 262898403 442511997 -441241260 -479587986 -752123290 720443264 500646237 737842681 -571966572 -798463881 -477248830 89875164 410339460 -359022689 -251280099 -441455542 -538431186 -406793869 374561004 -108755237 -440143410\\n\",\n \"10 2\\n1 6 2 10 3 3 2 10 6 4\\n5 7\\n\",\n \"17 13\\n-483786205 -947257449 -125949195 -294711143 -420288876 -812462057 -250049555 -911026413 -188146919 -129501682 -869006661 -649643966 -26976411 -275761039 -869067490 -272248209 -342067346\\n691960220 529728842 -808170728 673157826 -70778491 642872105 299298867 -76674218 -902394063 377664752 723887448 -121522827 906464625\\n\",\n \"2 2\\n20 18\\n0 14\\n\",\n \"5 3\\n-1 0 1 0 3\\n-1 0 1\\n\",\n \"5 7\\n1386172532 926886134 457905290 946881177 936471280\\n-550057074 -517146573 -138904928 -683289266 -805395532 -12009979 -331183396\\n\",\n \"6 30\\n-524297819 -947277203 -444186475 -182837689 -385379656 -453917269\\n834529938 35245081 643540671 585422565 164412867 850052113 796429008 -307345676 -127653313 426960600 211854713 -733687358 251466836 -33491050 -882811238 455544614 774581544 768447941 -241033484 441104324 -493975870 308277556 275268265 935941507 -152292053 -7505176 -740482111 -954176110 -924254634 -518710544\\n\",\n \"2 2\\n15 18\\n0 14\\n\",\n \"39 9\\n44558618 171808877 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 954204512 795507844 604520066 507308352 408180613 194676444 44962879 922688019 101163040 327953325 560462120 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 694808087 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -155095247 -311654366 -389141528\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -34128113 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -394887347 -946709040 -594578249 -276703474 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n704881272 169877679 705460701 94083210 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 20882951 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"17 13\\n-483786205 -947257449 -125949195 -294711143 -420288876 -1413838766 -250049555 -911026413 -188146919 -129501682 -869006661 -649643966 -26976411 -275761039 -869067490 -272248209 -342067346\\n691960220 529728842 -808170728 83523262 -70778491 642872105 299298867 -76674218 -902394063 377664752 723887448 -121522827 906464625\\n\",\n \"2 2\\n15 18\\n0 4\\n\",\n \"5 7\\n-130464232 -73113866 -204605704 -53118823 -59351417\\n87545370 482853427 1178494260 316710734 194604468 20277633 668816604\\n\",\n \"24 24\\n299931317 581208095 975349898 956924990 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 80836191 53290960 405421751 723296526 565432511 37843844 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -85862406 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -335862257 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"39 9\\n44558618 171808877 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 954204512 795507844 604520066 507308352 408180613 194676444 44962879 922688019 101163040 327953325 691322069 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 443601362 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -155095247 -67248663 -389141528\\n\",\n \"10 2\\n1 6 4 10 3 3 4 14 12 2\\n5 7\\n\",\n \"6 30\\n-524297819 -947277203 -444186475 -182837689 -101877869 -453917269\\n834529938 35245081 643540671 585422565 164412867 850052113 796429008 -307345676 -127653313 426960600 211854713 -733687358 322015097 -33491050 -367504346 455544614 977398030 768447941 -241033484 441104324 -493975870 308277556 275268265 935941507 -152292053 -7505176 -740482111 -469344943 -924254634 -518710544\\n\",\n \"5 7\\n-138600254 -73113866 -204605704 -53118823 -59351417\\n87545370 482853427 1178494260 192231230 194604468 1415578 668816604\\n\",\n \"33 14\\n-234069420 -218618150 -471719380 -583840778 -256368365 -133430322 -405045344 -775538133 -896830082 -439261765 -947070124 -716577019 -456110999 -689862512 -132480131 -10805271 -518903339 -196240188 -222292638 -828546042 -43887962 -161359263 -281422097 -484060534 963147664 -492377073 -154570101 -52145116 187803553 858844161 66540410 418777176 434025748\\n-78301978 -319393213 -12393024 542953412 786804661 845642067 754996432 -985617475 -487171947 56142664 203173079 -268261708 -817080591 -511720682\\n\",\n \"24 24\\n299931317 581208095 975349898 956924990 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 80836191 53290960 405421751 723296526 565432511 256399554 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -596056305 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -244549551 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"39 9\\n44558618 171808877 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 954204512 795507844 604520066 507308352 408180613 194676444 44962879 922688019 101163040 327953325 560462120 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 694808087 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -97031207 -311654366 -389141528\\n\",\n \"50 50\\n1 6 2 10 2 3 3 10 4 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 5 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 0\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 4 2 5 3 5 1 3 2 4 1 6 5 3 8 6\\n\",\n \"5 7\\n-130464232 -73113866 -204605704 -53118823 -63528720\\n87545370 482853427 861095072 316710734 194604468 20277633 668816604\\n\",\n \"12 25\\n-464030345 -914672073 -483242132 -856226270 -925135169 -353124606 -294027092 -619650850 -490724485 -240424784 -483066792 -921640365\\n279850608 1299327888 -431610610 242749870 -244020223 -396865433 129534799 182767854 -939698671 342579400 330027106 893561388 -263513962 643369418 276245179 -99206565 -473767261 -168908664 -853755837 -270920164 -661186118 199341055 765543053 70538483 -93363867\\n\",\n \"5 7\\n-130464232 -87982786 -542094710 -53118823 -63528720\\n-775179088 631683023 -1920750402 -157471745 -629658630 71825477 -6235611\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -167277317 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -394887347 -946709040 -594578249 -276703474 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n704881272 169877679 705460701 94083210 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 20882951 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -808736065 -481883825 -263383991 -664780611 -605377134\\n718174936 -140362196 -669193674 -598621021 -464130929 314844539 -331183926 107203430 946959233 -826872392 -558199897 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -295615495 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 63978619 477139483 375083042 726254399 -439255703 850069098 -481588088 673747948 -345999555 -723334478 -656721905 276267528 628773156 851420802 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"12 22\\n-102896616 -102914786 -67541276 -402842686 -830595520 -813834033 -44046671 -584806552 -598620444 -968935604 -303048547 -545969410\\n545786451 262898403 442511997 -441241260 -479587986 -752123290 720443264 500646237 737842681 -713808293 -798463881 -477248830 89875164 410339460 -359022689 -251280099 -441455542 -538431186 -406793869 374561004 -108755237 -440143410\\n\",\n \"10 2\\n1 6 4 10 3 3 2 10 6 4\\n5 7\\n\",\n \"17 13\\n-483786205 -947257449 -125949195 -294711143 -420288876 -812462057 -250049555 -911026413 -188146919 -129501682 -869006661 -649643966 -26976411 -275761039 -869067490 -272248209 -342067346\\n691960220 529728842 -808170728 83523262 -70778491 642872105 299298867 -76674218 -902394063 377664752 723887448 -121522827 906464625\\n\",\n \"5 3\\n-1 0 1 0 3\\n0 0 1\\n\",\n \"5 7\\n1386172532 926886134 457905290 945180121 936471280\\n-550057074 -517146573 -138904928 -683289266 -805395532 -12009979 -331183396\\n\",\n \"24 24\\n299931317 581208095 975349898 956924990 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 80836191 53290960 405421751 723296526 565432511 256399554 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -596056305 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -335862257 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"6 30\\n-524297819 -947277203 -444186475 -182837689 -385379656 -453917269\\n834529938 35245081 643540671 585422565 164412867 850052113 796429008 -307345676 -127653313 426960600 211854713 -733687358 251466836 -33491050 -367504346 455544614 774581544 768447941 -241033484 441104324 -493975870 308277556 275268265 935941507 -152292053 -7505176 -740482111 -954176110 -924254634 -518710544\\n\",\n \"50 50\\n1 6 2 10 2 3 3 10 4 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 5 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 0\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 4 2 5 3 5 2 3 2 4 1 6 5 3 8 6\\n\",\n \"5 7\\n-130464232 -73113866 -204605704 -53118823 -63528720\\n87545370 482853427 1178494260 316710734 194604468 20277633 668816604\\n\",\n \"12 25\\n-464030345 -914672073 -483242132 -856226270 -925135169 -353124606 -294027092 -619650850 -490724485 -240424784 -78320326 -921640365\\n279850608 1299327888 -431610610 242749870 -244020223 -396865433 129534799 182767854 -939698671 342579400 330027106 893561388 -263513962 643369418 276245179 -99206565 -473767261 -168908664 -853755837 -270920164 -661186118 199341055 765543053 70538483 -93363867\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -808736065 -55414768 -263383991 -664780611 -605377134\\n718174936 -140362196 -669193674 -598621021 -464130929 314844539 -331183926 107203430 946959233 -826872392 -558199897 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -295615495 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 63978619 477139483 375083042 726254399 -439255703 850069098 -481588088 673747948 -345999555 -744388840 -656721905 276267528 628773156 851420802 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"10 2\\n1 6 4 10 3 3 2 10 6 2\\n5 7\\n\",\n \"5 3\\n0 0 1 0 3\\n0 0 1\\n\",\n \"5 7\\n1386172532 926886134 457905290 945180121 936471280\\n-550057074 -571772864 -138904928 -683289266 -805395532 -12009979 -331183396\\n\",\n \"24 24\\n299931317 581208095 975349898 956924990 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 80836191 53290960 405421751 723296526 565432511 488170420 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -596056305 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -335862257 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"6 30\\n-524297819 -947277203 -444186475 -182837689 -101877869 -453917269\\n834529938 35245081 643540671 585422565 164412867 850052113 796429008 -307345676 -127653313 426960600 211854713 -733687358 251466836 -33491050 -367504346 455544614 774581544 768447941 -241033484 441104324 -493975870 308277556 275268265 935941507 -152292053 -7505176 -740482111 -954176110 -924254634 -518710544\\n\",\n \"39 9\\n44558618 171808877 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 954204512 795507844 604520066 507308352 408180613 194676444 44962879 922688019 101163040 327953325 691322069 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 694808087 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -155095247 -311654366 -389141528\\n\",\n \"50 50\\n1 6 2 10 2 3 3 10 4 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 5 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 0\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 4 2 5 3 5 2 3 2 4 1 6 5 0 8 6\\n\",\n \"12 25\\n-464030345 -914672073 -483242132 -856226270 -925135169 -353124606 -294027092 -619650850 -490724485 -240424784 -78320326 -921640365\\n279850608 1299327888 -431610610 242749870 -244020223 -396865433 129534799 182767854 -939698671 342579400 330027106 893561388 -263513962 413850275 276245179 -99206565 -473767261 -168908664 -853755837 -270920164 -661186118 199341055 765543053 70538483 -93363867\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -34128113 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -394887347 -946709040 -594578249 -276703474 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n704881272 226760560 705460701 94083210 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 20882951 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -808736065 -55414768 -263383991 -664780611 -605377134\\n718174936 -140362196 -669193674 -598621021 -464130929 314844539 -331183926 107203430 946959233 -826872392 -84489586 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -295615495 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 63978619 477139483 375083042 726254399 -439255703 850069098 -481588088 673747948 -345999555 -744388840 -656721905 276267528 628773156 1559996763 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"10 2\\n1 6 4 10 3 3 2 14 6 2\\n5 7\\n\",\n \"5 7\\n1386172532 926886134 457905290 945180121 936471280\\n-550057074 -571772864 -138904928 -683289266 -48796831 -12009979 -331183396\\n\",\n \"24 24\\n299931317 581208095 975349898 956924990 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 80836191 53290960 405421751 723296526 565432511 488170420 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -85862406 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -335862257 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"6 30\\n-524297819 -947277203 -444186475 -182837689 -101877869 -453917269\\n834529938 35245081 643540671 585422565 164412867 850052113 796429008 -307345676 -127653313 426960600 211854713 -733687358 322015097 -33491050 -367504346 455544614 774581544 768447941 -241033484 441104324 -493975870 308277556 275268265 935941507 -152292053 -7505176 -740482111 -954176110 -924254634 -518710544\\n\",\n \"39 9\\n44558618 171808877 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 954204512 795507844 604520066 507308352 408180613 194676444 44962879 922688019 101163040 327953325 691322069 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 443601362 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -155095247 -311654366 -389141528\\n\",\n \"50 50\\n1 6 2 10 2 3 3 10 4 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 7 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 0\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 4 2 5 3 5 2 3 2 4 1 6 5 0 8 6\\n\",\n \"5 7\\n-130464232 -73113866 -204605704 -53118823 -59351417\\n87545370 482853427 1178494260 192231230 194604468 20277633 668816604\\n\",\n \"12 25\\n-464030345 -914672073 -304742983 -856226270 -925135169 -353124606 -294027092 -619650850 -490724485 -240424784 -78320326 -921640365\\n279850608 1299327888 -431610610 242749870 -244020223 -396865433 129534799 182767854 -939698671 342579400 330027106 893561388 -263513962 413850275 276245179 -99206565 -473767261 -168908664 -853755837 -270920164 -661186118 199341055 765543053 70538483 -93363867\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -34128113 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -394887347 -946709040 -594578249 -276703474 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n1194737871 226760560 705460701 94083210 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 20882951 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -808736065 -55414768 -263383991 -664780611 -605377134\\n718174936 -140362196 -669193674 -598621021 -464130929 314844539 -331183926 70053590 946959233 -826872392 -84489586 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -295615495 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 63978619 477139483 375083042 726254399 -638114508 850069098 -481588088 673747948 -345999555 -744388840 -656721905 276267528 628773156 1559996763 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"10 2\\n1 6 4 10 3 3 4 14 6 2\\n5 7\\n\",\n \"6 30\\n-524297819 -947277203 -444186475 -182837689 -101877869 -453917269\\n834529938 35245081 643540671 585422565 164412867 850052113 796429008 -307345676 -127653313 426960600 211854713 -733687358 322015097 -33491050 -367504346 455544614 977398030 768447941 -241033484 441104324 -493975870 308277556 275268265 935941507 -152292053 -7505176 -740482111 -954176110 -924254634 -518710544\\n\",\n \"50 50\\n1 6 2 10 2 3 3 10 4 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 7 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 1\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 4 2 5 3 5 2 3 2 4 1 6 5 0 8 6\\n\",\n \"5 7\\n-138600254 -73113866 -204605704 -53118823 -59351417\\n87545370 482853427 1178494260 192231230 194604468 20277633 668816604\\n\",\n \"12 25\\n-464030345 -914672073 -304742983 -856226270 -925135169 -353124606 -294027092 -619650850 -490724485 -240424784 -78320326 -921640365\\n279850608 1299327888 -431610610 242749870 -244020223 -396865433 129534799 182767854 -939698671 342579400 330027106 893561388 -263513962 413850275 276245179 -99206565 -473767261 -168908664 -853755837 -270920164 -661186118 199341055 19074042 70538483 -93363867\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -34128113 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -394887347 -946709040 -594578249 -276703474 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n1194737871 226760560 705460701 172892295 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 20882951 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -1242918326 -55414768 -263383991 -664780611 -605377134\\n718174936 -140362196 -669193674 -598621021 -464130929 314844539 -331183926 70053590 946959233 -826872392 -84489586 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -295615495 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 63978619 477139483 375083042 726254399 -638114508 850069098 -481588088 214206708 -345999555 -744388840 -656721905 276267528 628773156 1559996763 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"24 24\\n299931317 581208095 975349898 956924990 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 80836191 105056338 405421751 723296526 565432511 37843844 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -85862406 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -335862257 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"39 9\\n44558618 171808877 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 954204512 795507844 223762259 507308352 408180613 194676444 44962879 922688019 101163040 327953325 691322069 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 443601362 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -155095247 -67248663 -389141528\\n\",\n \"50 50\\n1 6 2 10 2 3 1 10 4 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 7 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 1\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 4 2 5 3 5 2 3 2 4 1 6 5 0 8 6\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -34128113 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -394887347 -946709040 -594578249 -321958052 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n1194737871 226760560 705460701 172892295 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 20882951 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -1242918326 -55414768 -263383991 -664780611 -605377134\\n718174936 -134366682 -669193674 -598621021 -464130929 314844539 -331183926 70053590 946959233 -826872392 -84489586 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -35458688 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 63978619 477139483 375083042 726254399 -638114508 850069098 -481588088 214206708 -345999555 -744388840 -656721905 276267528 628773156 1559996763 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"10 2\\n1 6 4 10 3 3 4 14 2 2\\n5 7\\n\",\n \"24 24\\n299931317 581208095 975349898 956924990 817690798 482251493 336949323 145902930 573001018 802990442 898055771 253410043 150981561 80836191 105056338 405421751 1127821089 565432511 37843844 374970926 22699716 104391316 121063780 149329252\\n-295118728 -830122321 -294539299 -905916790 -85862406 -12021689 -213837494 -341932332 -302359125 -999813713 -704441404 -713529724 -748686121 -646928807 -335862257 -826629397 -194449623 -807534699 -831064506 -889838257 -714860574 -14761264 -276778132 -479320983\\n\",\n \"39 9\\n44558618 171808877 318891054 283079237 285093436 907256321 414759796 652683534 79042330 249010687 7020063 309415438 788425492 138577429 714835649 108956958 795507844 223762259 507308352 408180613 194676444 44962879 922688019 101163040 327953325 691322069 183657590 273616448 226876035 233697890 720185285 689340674 372938362 15088928 283418109 796807778 149989495 443601362 276385512\\n-681609072 -210918688 -757170622 -205635977 -597872997 -496188744 -155095247 -67248663 -389141528\\n\",\n \"50 50\\n1 6 2 10 2 3 1 10 4 4 5 0 3 1 7 3 2 4 4 2 1 5 0 6 10 1 8 0 10 9 0 4 10 7 5 7 4 9 9 5 5 2 6 7 9 4 3 7 2 1\\n0 5 9 4 4 6 1 8 2 1 6 6 8 6 4 4 7 2 1 8 6 7 4 9 8 3 0 2 0 10 7 1 4 9 4 6 2 5 3 5 2 3 2 4 1 6 5 0 8 6\\n\",\n \"5 7\\n-138600254 -73113866 -204605704 -53118823 -59351417\\n87545370 265489868 1178494260 192231230 194604468 1415578 668816604\\n\",\n \"24 24\\n-700068683 -418791905 -24650102 -34128113 -182309202 -517748507 -663050677 -854097070 -426998982 -197009558 -101944229 -746589957 -849018439 -394887347 -946709040 -594578249 -321958052 -434567489 -743600446 -625029074 -977300284 -895608684 -878936220 -850670748\\n1194737871 226760560 705460701 78055382 403943695 987978311 786162506 658067668 697640875 186287 295558596 286470276 251313879 353071193 755450449 173370603 805550377 20882951 168935494 110161743 285139426 985238736 723221868 520679017\\n\",\n \"10 13\\n-749120991 -186261632 -335412349 -231354880 -195919225 -1999964756 -55414768 -263383991 -664780611 -605377134\\n718174936 -134366682 -669193674 -598621021 -464130929 314844539 -331183926 70053590 946959233 -826872392 -84489586 246556991 -666216081\\n\",\n \"15 29\\n-716525085 -464205793 -577203110 -979997115 -491032521 -70793687 -770595947 -817983495 -767886763 -223333719 -971913221 -944656683 -200397825 -35458688 -945544540\\n-877638425 -146878165 523758517 -158778747 -49535534 597311016 77325385 494128313 12111658 -4196724 63978619 477139483 375083042 726254399 -638114508 850069098 -640904436 214206708 -345999555 -744388840 -656721905 276267528 628773156 1559996763 -585029291 -643535709 -968999740 -384418713 -510285542\\n\",\n \"10 2\\n1 6 4 10 3 3 3 14 2 2\\n5 7\\n\"\n ],\n \"output\": [\n \"252\\n\",\n \"2\\n\",\n \"-1000000000000000000\\n\",\n \"-120782803247464704\\n\",\n \"883931400924882950\\n\",\n \"-640647347631440\\n\",\n \"504117593849498724\\n\",\n \"-1464096896176096\\n\",\n \"100\\n\",\n \"-1288212069119760\\n\",\n \"866064226130454915\\n\",\n \"127184126241438168\\n\",\n \"534123411186652380\\n\",\n \"-18990884587723\\n\",\n \"501307028237810934\\n\",\n \"941783658451562540\\n\",\n \"910849554065102112\\n\",\n \"663200522440413120\\n\",\n \"70\\n\",\n \"922371547895579571\\n\",\n \"822104826327386019\\n\",\n \"848714444125692276\\n\",\n \"-128749051707468352\\n\",\n \"883931400924882950\\n\",\n \"-640647347631440\\n\",\n \"504117593849498724\\n\",\n \"-1464096896176096\\n\",\n \"100\\n\",\n \"-1288212069119760\\n\",\n \"866064226130454915\\n\",\n \"250589226060621264\\n\",\n \"534123411186652380\\n\",\n \"-18990884587723\\n\",\n \"619427465725580472\\n\",\n \"941783658451562540\\n\",\n \"910849554065102112\\n\",\n \"663200522440413120\\n\",\n \"70\\n\",\n \"822104826327386019\\n\",\n \"252\\n\",\n \"1\\n\",\n \"-11131883004731186\\n\",\n \"500272453414904090\\n\",\n \"210\\n\",\n \"-2340221015125216\\n\",\n \"-6357623786431\\n\",\n \"854799498110125287\\n\",\n \"60\\n\",\n \"-1203506251955961\\n\",\n \"-454946923132516\\n\",\n \"-1014710234103264\\n\",\n \"84\\n\",\n \"484584688806843246\\n\",\n \"-84016560174026\\n\",\n \"883931400924882950\\n\",\n \"-640647347631440\\n\",\n \"-1464096896176096\\n\",\n \"100\\n\",\n \"-1288212069119760\\n\",\n \"866064226130454915\\n\",\n \"250589226060621264\\n\",\n \"-18990884587723\\n\",\n \"619427465725580472\\n\",\n \"941783658451562540\\n\",\n \"663200522440413120\\n\",\n \"70\\n\",\n \"822104826327386019\\n\",\n \"1\\n\",\n \"-11131883004731186\\n\",\n \"-640647347631440\\n\",\n \"500272453414904090\\n\",\n \"100\\n\",\n \"-1288212069119760\\n\",\n \"866064226130454915\\n\",\n \"619427465725580472\\n\",\n \"941783658451562540\\n\",\n \"70\\n\",\n \"1\\n\",\n \"-11131883004731186\\n\",\n \"-640647347631440\\n\",\n \"500272453414904090\\n\",\n \"-2340221015125216\\n\",\n \"100\\n\",\n \"866064226130454915\\n\",\n \"-6357623786431\\n\",\n \"619427465725580472\\n\",\n \"941783658451562540\\n\",\n \"70\\n\",\n \"-11131883004731186\\n\",\n \"-640647347631440\\n\",\n \"500272453414904090\\n\",\n \"-2340221015125216\\n\",\n \"100\\n\",\n \"-1203506251955961\\n\",\n \"866064226130454915\\n\",\n \"-6357623786431\\n\",\n \"619427465725580472\\n\",\n \"941783658451562540\\n\",\n \"70\\n\",\n \"500272453414904090\\n\",\n \"100\\n\",\n \"-1203506251955961\\n\",\n \"866064226130454915\\n\",\n \"-6357623786431\\n\",\n \"619427465725580472\\n\",\n \"941783658451562540\\n\",\n \"-454946923132516\\n\",\n \"-1014710234103264\\n\",\n \"100\\n\",\n \"-6357623786431\\n\",\n \"619427465725580472\\n\",\n \"941783658451562540\\n\",\n \"70\\n\",\n \"-454946923132516\\n\",\n \"-1014710234103264\\n\",\n \"100\\n\",\n \"-84016560174026\\n\",\n \"-6357623786431\\n\",\n \"619427465725580472\\n\",\n \"941783658451562540\\n\",\n \"70\\n\"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nNian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of which frighten the monster out of coming.\n\nLittle Tommy has n lanterns and Big Banban has m lanterns. Tommy's lanterns have brightness a1, a2, ..., an, and Banban's have brightness b1, b2, ..., bm respectively.\n\nTommy intends to hide one of his lanterns, then Banban picks one of Tommy's non-hidden lanterns and one of his own lanterns to form a pair. The pair's brightness will be the product of the brightness of two lanterns.\n\nTommy wants to make the product as small as possible, while Banban tries to make it as large as possible.\n\nYou are asked to find the brightness of the chosen pair if both of them choose optimally.\n\nInput\n\nThe first line contains two space-separated integers n and m (2 ≤ n, m ≤ 50).\n\nThe second line contains n space-separated integers a1, a2, ..., an.\n\nThe third line contains m space-separated integers b1, b2, ..., bm.\n\nAll the integers range from - 109 to 109.\n\nOutput\n\nPrint a single integer — the brightness of the chosen pair.\n\nExamples\n\nInput\n\n2 2\n20 18\n2 14\n\n\nOutput\n\n252\n\n\nInput\n\n5 3\n-1 0 1 2 3\n-1 0 1\n\n\nOutput\n\n2\n\nNote\n\nIn the first example, Tommy will hide 20 and Banban will choose 18 from Tommy and 14 from himself.\n\nIn the second example, Tommy will hide 3 and Banban will choose 2 from Tommy and 1 from himself.\n\n### Input:\n2 2\n20 18\n2 14\n\n### Output:\n252\n\n\n### Input:\n5 3\n-1 0 1 2 3\n-1 0 1\n\n### Output:\n2\n\n\n### Code:\nn, m = [int(x) for x in input().split()]\nlstT = [int(x) for x in input().split()]\nlstB = [int(x) for x in input().split()]\nz=-9999999999999999999999999999\nT=0\nB=0\nfor i in range(n):\n for j in range(m):\n if z<lstT[i]*lstB[j]:\n T=i\n B=j\n z=lstT[i]*lstB[j]\nlol = -99999999999999999999\nfor i in range(n):\n for j in range(m):\n if T!=i:\n lol = max(lol, lstT[i]*lstB[j])\nprint(lol)\n"}}},{"rowIdx":5698,"cells":{"id":{"kind":"string","value":"960_C. Subsequence Counting_26897"},"description":{"kind":"string","value":"Pikachu had an array with him. He wrote down all the non-empty subsequences of the array on paper. Note that an array of size n has 2n - 1 non-empty subsequences in it. \n\nPikachu being mischievous as he always is, removed all the subsequences in which Maximum_element_of_the_subsequence - Minimum_element_of_subsequence ≥ d\n\nPikachu was finally left with X subsequences. \n\nHowever, he lost the initial array he had, and now is in serious trouble. He still remembers the numbers X and d. He now wants you to construct any such array which will satisfy the above conditions. All the numbers in the final array should be positive integers less than 1018. \n\nNote the number of elements in the output array should not be more than 104. If no answer is possible, print - 1.\n\nInput\n\nThe only line of input consists of two space separated integers X and d (1 ≤ X, d ≤ 109).\n\nOutput\n\nOutput should consist of two lines.\n\nFirst line should contain a single integer n (1 ≤ n ≤ 10 000)— the number of integers in the final array.\n\nSecond line should consist of n space separated integers — a1, a2, ... , an (1 ≤ ai < 1018).\n\nIf there is no answer, print a single integer -1. If there are multiple answers, print any of them.\n\nExamples\n\nInput\n\n10 5\n\n\nOutput\n\n6\n5 50 7 15 6 100\n\nInput\n\n4 2\n\n\nOutput\n\n4\n10 100 1000 10000\n\nNote\n\nIn the output of the first example case, the remaining subsequences after removing those with Maximum_element_of_the_subsequence - Minimum_element_of_subsequence ≥ 5 are [5], [5, 7], [5, 6], [5, 7, 6], [50], [7], [7, 6], [15], [6], [100]. There are 10 of them. Hence, the array [5, 50, 7, 15, 6, 100] is valid.\n\nSimilarly, in the output of the second example case, the remaining sub-sequences after removing those with Maximum_element_of_the_subsequence - Minimum_element_of_subsequence ≥ 2 are [10], [100], [1000], [10000]. There are 4 of them. Hence, the array [10, 100, 1000, 10000] is valid."},"code":{"kind":"string","value":"X, d = map(int, input().split())\n\nx = X\nans = list()\nln = 0\nlast = 1\nwhile x > 0:\n if last >= 10 ** 18:\n print(-1)\n exit()\n\n i = 0\n while 2 ** (i + 1) - 1 <= x:\n i += 1\n\n t = 2 ** i - 1\n x -= t\n\n if ln + i > 10000:\n print(-1)\n exit()\n\n for _ in range(i):\n ans.append(last)\n ln += 1\n\n last += d\n\nprint(len(ans))\nprint(' '.join(map(str, ans)))\n"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"10 5\\n\",\n \"4 2\\n\",\n \"985629174 189232688\\n\",\n \"21537803 166017060\\n\",\n \"863230070 895037311\\n\",\n \"641009859 54748096\\n\",\n \"248004555 280013594\\n\",\n \"1048576 1\\n\",\n \"1 1\\n\",\n \"702209411 496813081\\n\",\n \"890 553\\n\",\n \"1000000000 1\\n\",\n \"691688417 162011045\\n\",\n \"10001 1\\n\",\n \"70 3321\\n\",\n \"869771841 30527185\\n\",\n \"41313494 468586155\\n\",\n \"585325539 365329221\\n\",\n \"536870911 1\\n\",\n \"100000000 1\\n\",\n \"63 1\\n\",\n \"335521569 160137548\\n\",\n \"685146646 26521171\\n\",\n \"167959139 481199252\\n\",\n \"992170945 324722563\\n\",\n \"4 2\\n\",\n \"746 173\\n\",\n \"1000000 1\\n\",\n \"1 1000\\n\",\n \"2691939 514300407\\n\",\n \"519879446 764655030\\n\",\n \"843454379 297500920\\n\",\n \"695 188\\n\",\n \"98 88\\n\",\n \"604171403 722078578\\n\",\n \"131120683 148529734\\n\",\n \"824608515 940751563\\n\",\n \"808572289 733686393\\n\",\n \"341796022 486073481\\n\",\n \"883 1000\\n\",\n \"487287531 295627423\\n\",\n \"904653932 739565904\\n\",\n \"10 5\\n\",\n \"930971393 177624874\\n\",\n \"260820780 181630889\\n\",\n \"6358 1646\\n\",\n \"15000 1\\n\",\n \"109054817 751173719\\n\",\n \"941492387 72235422\\n\",\n \"219396918 747167704\\n\",\n \"787770060 313114749\\n\",\n \"1000000000 1000000000\\n\",\n \"170254369 48014511\\n\",\n \"4 1\\n\",\n \"524125987 923264237\\n\",\n \"452405440 586588704\\n\",\n \"752887969 604076030\\n\",\n \"58376259 643910770\\n\",\n \"10009 1\\n\",\n \"665370955 18919371\\n\",\n \"102513046 615683844\\n\",\n \"802030518 598196518\\n\",\n \"458679894 912524637\\n\",\n \"2060 697\\n\",\n \"43603670 268405779\\n\",\n \"1953505105 189232688\\n\",\n \"21537803 161863301\\n\",\n \"863230070 1293874210\\n\",\n \"641009859 43822803\\n\",\n \"248004555 473501496\\n\",\n \"235964 1\\n\",\n \"1 0\\n\",\n \"114177248 496813081\\n\",\n \"39 553\\n\",\n \"1000100000 1\\n\",\n \"691688417 310361311\\n\",\n \"10000 1\\n\",\n \"63 3321\\n\",\n \"1205121820 30527185\\n\",\n \"41313494 736912716\\n\",\n \"585325539 587581825\\n\",\n \"893073975 1\\n\",\n \"67 1\\n\",\n \"104715590 160137548\\n\",\n \"685146646 5704015\\n\",\n \"167959139 60592572\\n\",\n \"405529119 324722563\\n\",\n \"4 3\\n\",\n \"746 141\\n\",\n \"1000000 2\\n\",\n \"594951 514300407\\n\",\n \"519879446 698959837\\n\",\n \"843454379 232921862\\n\",\n \"109 188\\n\",\n \"98 154\\n\",\n \"604171403 489416792\\n\",\n \"131120683 154528370\\n\",\n \"191312597 940751563\\n\",\n \"836841373 733686393\\n\",\n \"553046986 486073481\\n\",\n \"883 0000\\n\",\n \"487287531 146272423\\n\",\n \"180467638 739565904\\n\",\n \"10 10\\n\",\n \"1498720403 177624874\\n\",\n \"260820780 79400568\\n\",\n \"6358 1943\\n\",\n \"15000 2\\n\",\n \"172824338 751173719\\n\",\n \"1515209808 72235422\\n\",\n \"418669059 747167704\\n\",\n \"892506171 313114749\\n\",\n \"1000000000 0000000000\\n\",\n \"170254369 76279477\\n\",\n \"4 0\\n\",\n \"524125987 1458767015\\n\",\n \"568047892 586588704\\n\",\n \"752887969 583761717\\n\",\n \"62959749 643910770\\n\",\n \"7160 1\\n\",\n \"433552589 18919371\\n\",\n \"49344029 615683844\\n\",\n \"802030518 647389050\\n\",\n \"175249788 912524637\\n\",\n \"2060 47\\n\",\n \"43603670 64119657\\n\",\n \"10 6\\n\",\n \"5 2\\n\",\n \"21537803 251486657\\n\",\n \"1703497565 1293874210\\n\",\n \"1047799808 43822803\\n\",\n \"248004555 263375625\\n\",\n \"235964 0\\n\",\n \"202100118 496813081\\n\",\n \"54 553\\n\",\n \"1000100000 2\\n\",\n \"516046671 310361311\\n\",\n \"971566982 30527185\\n\",\n \"41313494 357660777\\n\",\n \"585325539 819672489\\n\",\n \"907127461 1\\n\",\n \"64 1\\n\",\n \"47634196 160137548\\n\",\n \"315246503 5704015\\n\",\n \"149867081 60592572\\n\",\n \"405529119 264290628\\n\",\n \"4 -1\\n\",\n \"746 216\\n\",\n \"197206 514300407\\n\",\n \"197906878 698959837\\n\",\n \"828148548 232921862\\n\",\n \"66 188\\n\",\n \"98 260\\n\",\n \"604171403 590405940\\n\",\n \"1 1010\\n\",\n \"1 -1\\n\",\n \"63 301\\n\",\n \"1 1001\\n\"\n ],\n \"output\": [\n \"5\\n1 1 1 6 6 \\n\",\n \"3\\n1 1 3 \\n\",\n \"269\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2270792257 2270792257 2270792257 2270792257 2270792257 2270792257 2270792257 2270792257 2270792257 2460024945 2460024945 \\n\",\n \"109\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 166017061 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 332034121 498051181 498051181 498051181 498051181 498051181 498051181 498051181 498051181 498051181 498051181 498051181 498051181 498051181 498051181 498051181 664068241 664068241 664068241 664068241 664068241 664068241 664068241 664068241 664068241 664068241 664068241 664068241 664068241 830085301 830085301 830085301 830085301 830085301 830085301 830085301 830085301 830085301 830085301 996102361 996102361 996102361 996102361 1162119421 1328136481 \\n\",\n \"264\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 895037312 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 1790074623 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 2685111934 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 3580149245 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 4475186556 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 5370223867 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 6265261178 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 7160298489 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8055335800 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 8950373111 9845410422 9845410422 9845410422 9845410422 9845410422 9845410422 9845410422 9845410422 9845410422 9845410422 9845410422 9845410422 10740447733 10740447733 10740447733 10740447733 10740447733 10740447733 10740447733 10740447733 10740447733 10740447733 10740447733 11635485044 11635485044 11635485044 11635485044 11635485044 11635485044 11635485044 12530522355 12530522355 13425559666 \\n\",\n \"186\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 54748097 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 109496193 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 164244289 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 218992385 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 273740481 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 328488577 383236673 383236673 383236673 383236673 383236673 383236673 383236673 383236673 383236673 383236673 383236673 437984769 437984769 437984769 437984769 437984769 437984769 437984769 492732865 492732865 492732865 492732865 492732865 492732865 547480961 547480961 547480961 602229057 602229057 656977153 656977153 \\n\",\n \"227\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 280013595 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 560027189 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 840040783 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1120054377 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1400067971 1680081565 1680081565 1680081565 1680081565 1680081565 1680081565 1680081565 1680081565 1680081565 1680081565 1680081565 1680081565 1680081565 1960095159 1960095159 1960095159 1960095159 1960095159 1960095159 1960095159 1960095159 1960095159 1960095159 1960095159 1960095159 2240108753 2240108753 2240108753 2240108753 2240108753 2240108753 2240108753 2240108753 2240108753 2240108753 2240108753 2520122347 2520122347 2520122347 2520122347 2520122347 2520122347 2520122347 2520122347 2520122347 2520122347 2800135941 2800135941 2800135941 2800135941 2800135941 2800135941 2800135941 2800135941 2800135941 3080149535 3080149535 3080149535 3080149535 3080149535 3080149535 3080149535 3080149535 3360163129 3360163129 3360163129 3360163129 3360163129 3360163129 3360163129 3640176723 3640176723 3640176723 3640176723 3640176723 3640176723 3920190317 3920190317 3920190317 3920190317 4200203911 4200203911 4200203911 4480217505 4480217505 \\n\",\n \"21\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 \\n\",\n \"1\\n1 \\n\",\n \"264\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 5464943892 5464943892 5464943892 5464943892 5464943892 5464943892 5464943892 5464943892 5464943892 5464943892 5464943892 5961756973 5961756973 5961756973 5961756973 5961756973 5961756973 5961756973 5961756973 5961756973 5961756973 6458570054 6458570054 6458570054 6458570054 6458570054 6458570054 6458570054 6458570054 6955383135 6955383135 6955383135 6955383135 6955383135 6955383135 6955383135 7452196216 7452196216 7452196216 7452196216 7949009297 7949009297 \\n\",\n \"36\\n1 1 1 1 1 1 1 1 1 554 554 554 554 554 554 554 554 1107 1107 1107 1107 1107 1107 1660 1660 1660 1660 1660 2213 2213 2213 2213 2766 2766 2766 2766 \\n\",\n \"268\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 11 11 11 11 11 11 11 11 11 11 11 11 11 11 12 12 12 12 12 12 12 12 12 12 12 13 13 13 13 13 13 13 13 13 14 14 14 15 15 16 16 \\n\",\n \"222\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 162011046 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 324022091 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 486033136 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 648044181 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 810055226 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 972066271 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1134077316 1296088361 1296088361 1296088361 1296088361 1296088361 1296088361 1296088361 1296088361 1296088361 1296088361 1296088361 1296088361 1458099406 1458099406 1458099406 1458099406 1458099406 1458099406 1458099406 1458099406 1458099406 1620110451 1620110451 1620110451 1620110451 1620110451 1620110451 1620110451 1620110451 1782121496 1782121496 1782121496 1782121496 1782121496 1782121496 1782121496 1944132541 1944132541 1944132541 1944132541 1944132541 1944132541 2106143586 2106143586 2106143586 2106143586 2106143586 2268154631 2268154631 2268154631 2268154631 \\n\",\n \"48\\n1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 6 6 7 7 \\n\",\n \"9\\n1 1 1 1 1 1 3322 3322 3322 \\n\",\n \"281\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 366326221 366326221 366326221 366326221 366326221 366326221 366326221 366326221 366326221 366326221 366326221 396853406 396853406 396853406 396853406 396853406 396853406 396853406 396853406 396853406 427380591 427380591 427380591 427380591 427380591 427380591 457907776 457907776 457907776 457907776 488434961 \\n\",\n \"180\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 468586156 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 937172311 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1405758466 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 1874344621 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2342930776 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 2811516931 3280103086 3280103086 3280103086 3280103086 3280103086 3280103086 3280103086 3280103086 3280103086 3280103086 3280103086 3280103086 3280103086 3748689241 3748689241 3748689241 3748689241 3748689241 3748689241 3748689241 3748689241 3748689241 3748689241 4217275396 4217275396 4217275396 4217275396 4217275396 4217275396 4217275396 4685861551 4685861551 4685861551 4685861551 4685861551 4685861551 5154447706 5154447706 5154447706 5154447706 5154447706 5623033861 6091620016 \\n\",\n \"231\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 365329222 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 730658443 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1095987664 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1461316885 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 1826646106 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2191975327 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2557304548 2922633769 2922633769 2922633769 2922633769 2922633769 2922633769 2922633769 2922633769 2922633769 2922633769 2922633769 2922633769 3287962990 3287962990 3287962990 3287962990 3287962990 3287962990 3287962990 3287962990 3287962990 3287962990 3287962990 3653292211 3653292211 3653292211 3653292211 3653292211 3653292211 3653292211 3653292211 3653292211 4018621432 4018621432 4018621432 4018621432 4018621432 4018621432 4018621432 4018621432 4383950653 4383950653 4383950653 4383950653 4383950653 4383950653 4383950653 4749279874 4749279874 4749279874 4749279874 4749279874 4749279874 5114609095 5114609095 5114609095 5114609095 5114609095 5479938316 5479938316 5479938316 5479938316 5845267537 5845267537 \\n\",\n \"29\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \\n\",\n \"227\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 11 11 11 11 11 11 11 11 11 11 11 11 11 12 12 12 12 12 12 12 12 13 13 13 14 14 15 16 \\n\",\n \"6\\n1 1 1 1 1 1 \\n\",\n \"299\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 2081788125 2081788125 2081788125 2081788125 2081788125 2081788125 2081788125 2081788125 2081788125 2081788125 2241925673 2241925673 2241925673 2241925673 2241925673 2241925673 2241925673 2241925673 2241925673 2402063221 2402063221 2402063221 2402063221 2402063221 2402063221 2402063221 2402063221 2562200769 2562200769 2562200769 2562200769 2562200769 2722338317 2722338317 2722338317 2722338317 2882475865 2882475865 \\n\",\n \"185\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 26521172 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 53042343 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 79563514 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 106084685 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 132605856 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 159127027 185648198 185648198 185648198 185648198 185648198 185648198 185648198 185648198 185648198 185648198 185648198 185648198 185648198 185648198 185648198 212169369 212169369 212169369 212169369 212169369 212169369 212169369 212169369 212169369 238690540 238690540 238690540 238690540 238690540 \\n\",\n \"148\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 481199253 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 962398505 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1443597757 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 1924797009 2405996261 2405996261 2405996261 2405996261 2405996261 2405996261 2405996261 2405996261 2405996261 2405996261 2405996261 2405996261 2887195513 2887195513 2887195513 2887195513 2887195513 2887195513 2887195513 2887195513 2887195513 2887195513 2887195513 3368394765 3368394765 3368394765 3368394765 3368394765 3368394765 3368394765 3368394765 3368394765 3849594017 3849594017 3849594017 3849594017 3849594017 3849594017 4330793269 4330793269 4330793269 4330793269 4330793269 4811992521 4811992521 4811992521 5293191773 5293191773 5774391025 5774391025 \\n\",\n \"247\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 3247225631 3247225631 3247225631 3247225631 3247225631 3247225631 3247225631 3247225631 3247225631 3571948194 3571948194 3571948194 3571948194 3571948194 3571948194 3571948194 3571948194 3896670757 3896670757 3896670757 3896670757 3896670757 3896670757 3896670757 4221393320 4221393320 4221393320 4221393320 4221393320 4221393320 4546115883 4546115883 4546115883 4546115883 \\n\",\n \"3\\n1 1 3 \\n\",\n \"33\\n1 1 1 1 1 1 1 1 1 174 174 174 174 174 174 174 347 347 347 347 347 347 520 520 520 520 520 693 693 693 866 866 866 \\n\",\n \"102\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 8 8 8 \\n\",\n \"1\\n1 \\n\",\n \"102\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 2057201629 2057201629 2057201629 2057201629 2057201629 2057201629 2057201629 2057201629 2057201629 2571502036 2571502036 2571502036 2571502036 2571502036 2571502036 2571502036 2571502036 3085802443 3085802443 3085802443 3085802443 3085802443 3085802443 3600102850 3600102850 3600102850 3600102850 3600102850 4114403257 4114403257 4114403257 4628703664 4628703664 5143004071 \\n\",\n \"305\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 764655031 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 1529310061 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 2293965091 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3058620121 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 3823275151 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 4587930181 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 5352585211 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6117240241 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 6881895271 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 7646550301 8411205331 8411205331 8411205331 8411205331 8411205331 8411205331 8411205331 8411205331 8411205331 8411205331 8411205331 8411205331 8411205331 9175860361 9175860361 9175860361 9175860361 9175860361 9175860361 9175860361 9175860361 9175860361 9175860361 9175860361 9175860361 9940515391 9940515391 9940515391 9940515391 9940515391 9940515391 9940515391 9940515391 9940515391 9940515391 9940515391 10705170421 10705170421 10705170421 10705170421 10705170421 10705170421 10705170421 10705170421 10705170421 11469825451 11469825451 11469825451 11469825451 11469825451 11469825451 11469825451 11469825451 12234480481 12234480481 12234480481 12234480481 12234480481 12999135511 12999135511 12999135511 \\n\",\n \"198\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 297500921 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 595001841 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 892502761 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1190003681 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1487504601 1785005521 1785005521 1785005521 1785005521 1785005521 1785005521 1785005521 1785005521 1785005521 1785005521 1785005521 1785005521 2082506441 2082506441 2082506441 2082506441 2082506441 2082506441 2082506441 2082506441 2082506441 2082506441 2380007361 2380007361 2380007361 2380007361 2380007361 2380007361 2380007361 2380007361 2380007361 2677508281 2677508281 2677508281 2677508281 2677508281 2677508281 2677508281 2677508281 2975009201 2975009201 2975009201 2975009201 2975009201 2975009201 2975009201 3272510121 3272510121 3272510121 3272510121 3272510121 3570011041 3570011041 3570011041 3570011041 3867511961 3867511961 3867511961 4165012881 \\n\",\n \"31\\n1 1 1 1 1 1 1 1 1 189 189 189 189 189 189 189 377 377 377 377 377 565 565 565 565 753 753 753 941 941 1129 \\n\",\n \"14\\n1 1 1 1 1 1 89 89 89 89 89 177 177 265 \\n\",\n \"150\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 722078579 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 1444157157 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2166235735 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 2888314313 3610392891 3610392891 3610392891 3610392891 3610392891 3610392891 3610392891 3610392891 3610392891 3610392891 3610392891 3610392891 3610392891 4332471469 4332471469 4332471469 4332471469 4332471469 4332471469 4332471469 4332471469 4332471469 4332471469 4332471469 5054550047 5054550047 5054550047 5054550047 5054550047 5054550047 5054550047 5054550047 5054550047 5054550047 5776628625 5776628625 5776628625 5776628625 5776628625 5776628625 5776628625 6498707203 6498707203 6498707203 6498707203 7220785781 7220785781 7942864359 8664942937 \\n\",\n \"224\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 148529735 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 297059469 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 445589203 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 594118937 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 742648671 891178405 891178405 891178405 891178405 891178405 891178405 891178405 891178405 891178405 891178405 891178405 891178405 891178405 891178405 891178405 1039708139 1039708139 1039708139 1039708139 1039708139 1039708139 1039708139 1039708139 1039708139 1039708139 1039708139 1039708139 1039708139 1188237873 1188237873 1188237873 1188237873 1188237873 1188237873 1188237873 1188237873 1188237873 1188237873 1188237873 1188237873 1336767607 1336767607 1336767607 1336767607 1336767607 1336767607 1336767607 1336767607 1336767607 1336767607 1336767607 1485297341 1485297341 1485297341 1485297341 1485297341 1485297341 1485297341 1485297341 1485297341 1485297341 1633827075 1633827075 1633827075 1633827075 1633827075 1633827075 1633827075 1633827075 1633827075 1782356809 1782356809 1782356809 1782356809 1782356809 1930886543 1930886543 1930886543 1930886543 2079416277 2079416277 2079416277 2227946011 2376475745 \\n\",\n \"186\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 9407515631 9407515631 9407515631 10348267194 10348267194 11289018757 11289018757 \\n\",\n \"187\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 6603177538 6603177538 6603177538 6603177538 6603177538 6603177538 6603177538 6603177538 7336863931 7336863931 7336863931 7336863931 7336863931 7336863931 7336863931 8070550324 8070550324 8070550324 8804236717 8804236717 9537923110 10271609503 \\n\",\n \"218\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 5346808292 5346808292 5346808292 5346808292 5346808292 5346808292 5346808292 5832881773 5832881773 5832881773 5832881773 5832881773 5832881773 6318955254 6318955254 \\n\",\n \"36\\n1 1 1 1 1 1 1 1 1 1001 1001 1001 1001 1001 1001 1001 1001 2001 2001 2001 2001 2001 2001 3001 3001 3001 3001 3001 4001 4001 4001 4001 5001 5001 5001 6001 \\n\",\n \"231\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 295627424 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 591254847 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 886882270 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1182509693 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1478137116 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 1773764539 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2069391962 2365019385 2365019385 2365019385 2365019385 2365019385 2365019385 2365019385 2365019385 2365019385 2365019385 2365019385 2365019385 2365019385 2660646808 2660646808 2660646808 2660646808 2660646808 2660646808 2660646808 2660646808 2660646808 2660646808 2660646808 2956274231 2956274231 2956274231 2956274231 2956274231 2956274231 2956274231 2956274231 2956274231 3251901654 3251901654 3251901654 3251901654 3251901654 3251901654 3251901654 3547529077 3547529077 3547529077 3547529077 3547529077 3547529077 3843156500 3843156500 3843156500 3843156500 3843156500 4138783923 4138783923 4138783923 4138783923 4434411346 4434411346 4434411346 4730038769 4730038769 \\n\",\n \"309\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 9614356753 9614356753 9614356753 9614356753 9614356753 9614356753 9614356753 9614356753 9614356753 9614356753 9614356753 10353922657 10353922657 10353922657 10353922657 10353922657 10353922657 10353922657 10353922657 10353922657 10353922657 11093488561 11093488561 11093488561 11093488561 11093488561 11093488561 11833054465 11833054465 11833054465 11833054465 11833054465 12572620369 12572620369 12572620369 12572620369 13312186273 13312186273 13312186273 14051752177 14051752177 14051752177 \\n\",\n \"5\\n1 1 1 6 6 \\n\",\n \"332\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 1953873615 2131498489 2131498489 2131498489 2131498489 2131498489 2131498489 2131498489 2131498489 2131498489 2131498489 2131498489 2131498489 2131498489 2309123363 2309123363 2309123363 2309123363 2309123363 2309123363 2309123363 2309123363 2309123363 2309123363 2309123363 2309123363 2486748237 2486748237 2486748237 2486748237 2486748237 2486748237 2486748237 2486748237 2486748237 2486748237 2486748237 2664373111 2664373111 2664373111 2664373111 2664373111 2664373111 2664373111 2664373111 2664373111 2664373111 2841997985 2841997985 2841997985 2841997985 2841997985 2841997985 2841997985 2841997985 2841997985 3019622859 3019622859 3019622859 3019622859 3019622859 3019622859 3019622859 3019622859 3197247733 3197247733 3197247733 3197247733 3374872607 3374872607 3552497481 \\n\",\n \"260\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 181630890 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 363261779 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 544892668 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 726523557 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 908154446 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1089785335 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1271416224 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1453047113 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1634678002 1816308891 1816308891 1816308891 1816308891 1816308891 1816308891 1816308891 1816308891 1816308891 1816308891 1816308891 1997939780 1997939780 1997939780 1997939780 1997939780 1997939780 1997939780 1997939780 1997939780 1997939780 2179570669 2179570669 2179570669 2179570669 2179570669 2179570669 2179570669 2179570669 2179570669 2361201558 2361201558 2361201558 2361201558 2361201558 2361201558 2361201558 2361201558 2542832447 2542832447 2542832447 2542832447 2542832447 2724463336 2724463336 2724463336 2724463336 2906094225 2906094225 2906094225 3087725114 3087725114 3269356003 3450986892 \\n\",\n \"46\\n1 1 1 1 1 1 1 1 1 1 1 1 1647 1647 1647 1647 1647 1647 1647 1647 1647 1647 1647 3293 3293 3293 3293 3293 3293 3293 4939 4939 4939 4939 4939 4939 6585 6585 6585 6585 8231 8231 8231 9877 9877 11523 \\n\",\n \"62\\n1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 7 7 7 8 8 8 \\n\",\n \"118\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 4507042315 4507042315 4507042315 4507042315 4507042315 4507042315 5258216034 5258216034 5258216034 5258216034 5258216034 6009389753 6009389753 6009389753 6760563472 7511737191 \\n\",\n \"188\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 505647955 505647955 505647955 505647955 505647955 505647955 505647955 505647955 505647955 505647955 505647955 577883377 577883377 577883377 577883377 577883377 577883377 577883377 650118799 650118799 650118799 650118799 650118799 722354221 722354221 722354221 794589643 794589643 866825065 866825065 \\n\",\n \"206\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 7471677041 7471677041 7471677041 7471677041 7471677041 7471677041 7471677041 7471677041 7471677041 8218844745 8218844745 8218844745 8218844745 8218844745 8218844745 8218844745 8218844745 8966012449 8966012449 8966012449 8966012449 8966012449 8966012449 9713180153 9713180153 \\n\",\n \"282\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 3131147491 3131147491 3131147491 3131147491 3131147491 3131147491 3131147491 3131147491 3131147491 3131147491 3131147491 3131147491 3131147491 3444262240 3444262240 3444262240 3444262240 3444262240 3444262240 3444262240 3444262240 3444262240 3444262240 3444262240 3757376989 3757376989 3757376989 3757376989 3757376989 3757376989 3757376989 3757376989 3757376989 4070491738 4070491738 4070491738 4070491738 4070491738 4070491738 4070491738 4383606487 4383606487 4383606487 4383606487 4383606487 4383606487 4696721236 4696721236 4696721236 4696721236 5009835985 5009835985 5009835985 5322950734 5322950734 5636065483 5949180232 \\n\",\n \"268\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 2000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 3000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 4000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 5000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 6000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 7000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 8000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 9000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 10000000001 11000000001 11000000001 11000000001 11000000001 11000000001 11000000001 11000000001 11000000001 11000000001 11000000001 11000000001 12000000001 12000000001 12000000001 12000000001 12000000001 12000000001 12000000001 12000000001 12000000001 13000000001 13000000001 13000000001 14000000001 14000000001 15000000001 15000000001 \\n\",\n \"159\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 48014512 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 96029023 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 144043534 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 192058045 240072556 240072556 240072556 240072556 240072556 240072556 240072556 240072556 240072556 240072556 240072556 240072556 240072556 240072556 240072556 288087067 288087067 288087067 288087067 288087067 288087067 288087067 288087067 288087067 288087067 288087067 288087067 288087067 288087067 336101578 336101578 336101578 336101578 336101578 336101578 336101578 336101578 336101578 336101578 336101578 336101578 336101578 384116089 384116089 384116089 384116089 384116089 432130600 432130600 432130600 480145111 480145111 \\n\",\n \"3\\n1 1 2 \\n\",\n \"277\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 923264238 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 1846528475 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 2769792712 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 3693056949 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 4616321186 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 5539585423 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 6462849660 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 7386113897 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 8309378134 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 9232642371 10155906608 10155906608 10155906608 10155906608 10155906608 10155906608 10155906608 10155906608 10155906608 10155906608 11079170845 11079170845 11079170845 11079170845 11079170845 11079170845 11079170845 11079170845 11079170845 12002435082 12002435082 12002435082 12002435082 12002435082 12002435082 12002435082 12002435082 12925699319 12925699319 12925699319 12925699319 12925699319 13848963556 13848963556 13848963556 13848963556 14772227793 14772227793 \\n\",\n \"260\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 7039064449 7039064449 7039064449 7039064449 7039064449 7039064449 7039064449 7625653153 7625653153 7625653153 7625653153 7625653153 7625653153 8212241857 8212241857 8212241857 8798830561 8798830561 8798830561 \\n\",\n \"190\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 604076031 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1208152061 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 1812228091 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 2416304121 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3020380151 3624456181 3624456181 3624456181 3624456181 3624456181 3624456181 3624456181 3624456181 3624456181 3624456181 3624456181 3624456181 3624456181 4228532211 4228532211 4228532211 4228532211 4228532211 4228532211 4228532211 4228532211 4228532211 4228532211 4228532211 4832608241 4832608241 4832608241 4832608241 4832608241 4832608241 4832608241 5436684271 5436684271 5436684271 5436684271 5436684271 6040760301 6040760301 6040760301 6644836331 6644836331 7248912361 \\n\",\n \"190\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5151286161 5795196931 5795196931 5795196931 5795196931 5795196931 5795196931 6439107701 6439107701 6439107701 7083018471 7083018471 7726929241 7726929241 \\n\",\n \"50\\n1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 6 6 6 7 7 7 \\n\",\n \"217\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 170274340 170274340 170274340 170274340 170274340 170274340 170274340 170274340 189193711 189193711 189193711 189193711 189193711 189193711 208113082 208113082 208113082 208113082 227032453 227032453 227032453 \\n\",\n \"165\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 5541154597 5541154597 5541154597 5541154597 5541154597 5541154597 5541154597 6156838441 6156838441 6156838441 6156838441 6156838441 6772522285 \\n\",\n \"263\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 598196519 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1196393037 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 1794589555 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2392786073 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 2990982591 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 3589179109 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4187375627 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 4785572145 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5383768663 5981965181 5981965181 5981965181 5981965181 5981965181 5981965181 5981965181 5981965181 5981965181 6580161699 6580161699 6580161699 6580161699 6580161699 6580161699 6580161699 6580161699 7178358217 7178358217 7178358217 7178358217 7178358217 7178358217 7178358217 7776554735 7776554735 7776554735 7776554735 7776554735 7776554735 8374751253 8374751253 8972947771 \\n\",\n \"257\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 9125246371 9125246371 9125246371 9125246371 9125246371 9125246371 9125246371 9125246371 9125246371 9125246371 9125246371 9125246371 9125246371 10037771008 10037771008 10037771008 10037771008 10037771008 10037771008 10037771008 10037771008 10037771008 10037771008 10950295645 10950295645 10950295645 10950295645 10950295645 10950295645 10950295645 10950295645 10950295645 11862820282 11862820282 11862820282 11862820282 11862820282 11862820282 12775344919 12775344919 12775344919 12775344919 12775344919 13687869556 13687869556 14600394193 15512918830 \\n\",\n \"18\\n1 1 1 1 1 1 1 1 1 1 1 698 698 698 1395 1395 2092 2092 \\n\",\n \"168\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 268405780 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 536811559 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 805217338 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1073623117 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1342028896 1610434675 1610434675 1610434675 1610434675 1610434675 1610434675 1610434675 1610434675 1610434675 1610434675 1610434675 1610434675 1878840454 1878840454 1878840454 1878840454 1878840454 1878840454 1878840454 1878840454 1878840454 1878840454 2147246233 2147246233 2147246233 2147246233 2147246233 2147246233 2147246233 2147246233 2147246233 2415652012 2415652012 2415652012 2415652012 2415652012 2415652012 2415652012 2684057791 2684057791 2684057791 2684057791 2684057791 2684057791 2952463570 2952463570 2952463570 2952463570 2952463570 3220869349 3489275128 \\n\",\n \"240\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 189232689 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 378465377 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 567698065 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 756930753 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 946163441 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1135396129 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1324628817 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1513861505 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1703094193 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 1892326881 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2081559569 2270792257 2270792257 2270792257 2270792257 2270792257 2270792257 2460024945 2460024945 2460024945 2460024945 2649257633 2649257633 2649257633 2649257633 \",\n \"109\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 161863302 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 323726603 485589904 485589904 485589904 485589904 485589904 485589904 485589904 485589904 485589904 485589904 485589904 485589904 485589904 485589904 485589904 647453205 647453205 647453205 647453205 647453205 647453205 647453205 647453205 647453205 647453205 647453205 647453205 647453205 809316506 809316506 809316506 809316506 809316506 809316506 809316506 809316506 809316506 809316506 971179807 971179807 971179807 971179807 1133043108 1294906409 \",\n \"264\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 15526490521 15526490521 15526490521 15526490521 15526490521 15526490521 15526490521 15526490521 15526490521 15526490521 15526490521 16820364731 16820364731 16820364731 16820364731 16820364731 16820364731 16820364731 18114238941 18114238941 19408113151 \",\n \"186\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 350582425 350582425 350582425 350582425 350582425 350582425 350582425 394405228 394405228 394405228 394405228 394405228 394405228 438228031 438228031 438228031 482050834 482050834 525873637 525873637 \",\n \"227\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 473501497 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 947002993 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1420504489 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 1894005985 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2367507481 2841008977 2841008977 2841008977 2841008977 2841008977 2841008977 2841008977 2841008977 2841008977 2841008977 2841008977 2841008977 2841008977 3314510473 3314510473 3314510473 3314510473 3314510473 3314510473 3314510473 3314510473 3314510473 3314510473 3314510473 3314510473 3788011969 3788011969 3788011969 3788011969 3788011969 3788011969 3788011969 3788011969 3788011969 3788011969 3788011969 4261513465 4261513465 4261513465 4261513465 4261513465 4261513465 4261513465 4261513465 4261513465 4261513465 4735014961 4735014961 4735014961 4735014961 4735014961 4735014961 4735014961 4735014961 4735014961 5208516457 5208516457 5208516457 5208516457 5208516457 5208516457 5208516457 5208516457 5682017953 5682017953 5682017953 5682017953 5682017953 5682017953 5682017953 6155519449 6155519449 6155519449 6155519449 6155519449 6155519449 6629020945 6629020945 6629020945 6629020945 7102522441 7102522441 7102522441 7576023937 7576023937 \",\n \"95\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 8 8 8 8 8 8 9 9 10 \",\n \"1\\n1 \",\n \"210\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 5464943892 5464943892 5464943892 5464943892 5464943892 5464943892 5961756973 5961756973 5961756973 5961756973 5961756973 6458570054 6458570054 6458570054 6955383135 6955383135 7452196216 7452196216 \",\n \"9\\n1 1 1 1 1 554 554 554 1107 \",\n \"258\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 11 11 11 11 11 11 11 11 11 11 11 11 12 12 12 12 12 12 12 13 13 13 13 13 14 14 14 15 15 16 16 \",\n \"222\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 3103613111 3103613111 3103613111 3103613111 3103613111 3103613111 3103613111 3103613111 3413974422 3413974422 3413974422 3413974422 3413974422 3413974422 3413974422 3724335733 3724335733 3724335733 3724335733 3724335733 3724335733 4034697044 4034697044 4034697044 4034697044 4034697044 4345058355 4345058355 4345058355 4345058355 \",\n \"48\\n1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 6 6 7 8 \",\n \"6\\n1 1 1 1 1 1 \",\n \"255\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 366326221 366326221 366326221 366326221 366326221 366326221 366326221 366326221 396853406 396853406 396853406 396853406 396853406 427380591 427380591 427380591 457907776 457907776 \",\n \"180\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 736912717 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 1473825433 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2210738149 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 2947650865 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 3684563581 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 4421476297 5158389013 5158389013 5158389013 5158389013 5158389013 5158389013 5158389013 5158389013 5158389013 5158389013 5158389013 5158389013 5158389013 5895301729 5895301729 5895301729 5895301729 5895301729 5895301729 5895301729 5895301729 5895301729 5895301729 6632214445 6632214445 6632214445 6632214445 6632214445 6632214445 6632214445 7369127161 7369127161 7369127161 7369127161 7369127161 7369127161 8106039877 8106039877 8106039877 8106039877 8106039877 8842952593 9579865309 \",\n \"231\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 587581826 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1175163651 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 1762745476 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2350327301 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 2937909126 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 3525490951 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4113072776 4700654601 4700654601 4700654601 4700654601 4700654601 4700654601 4700654601 4700654601 4700654601 4700654601 4700654601 4700654601 5288236426 5288236426 5288236426 5288236426 5288236426 5288236426 5288236426 5288236426 5288236426 5288236426 5288236426 5875818251 5875818251 5875818251 5875818251 5875818251 5875818251 5875818251 5875818251 5875818251 6463400076 6463400076 6463400076 6463400076 6463400076 6463400076 6463400076 6463400076 7050981901 7050981901 7050981901 7050981901 7050981901 7050981901 7050981901 7638563726 7638563726 7638563726 7638563726 7638563726 7638563726 8226145551 8226145551 8226145551 8226145551 8226145551 8813727376 8813727376 8813727376 8813727376 9401309201 9401309201 \",\n \"255\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 10 10 10 10 11 11 11 11 11 11 11 11 11 11 11 11 12 12 12 12 12 12 12 12 12 12 12 13 13 13 13 13 13 13 13 13 14 14 14 14 14 14 15 15 16 17 \",\n \"9\\n1 1 1 1 1 1 2 2 3 \",\n \"217\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1921650577 1921650577 1921650577 1921650577 1921650577 1921650577 2081788125 2081788125 2081788125 2081788125 2241925673 2241925673 2402063221 \",\n \"185\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 45632121 45632121 45632121 45632121 45632121 45632121 45632121 45632121 45632121 51336136 51336136 51336136 51336136 51336136 \",\n \"148\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 484740577 484740577 484740577 484740577 484740577 484740577 545333149 545333149 545333149 545333149 545333149 605925721 605925721 605925721 666518293 666518293 727110865 727110865 \",\n \"189\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 324722564 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 649445127 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 974167690 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1298890253 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1623612816 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 1948335379 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2273057942 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2597780505 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 2922503068 3247225631 3247225631 3247225631 3247225631 3247225631 3571948194 3571948194 3571948194 3896670757 3896670757 \",\n \"3\\n1 1 4 \",\n \"33\\n1 1 1 1 1 1 1 1 1 142 142 142 142 142 142 142 283 283 283 283 283 283 424 424 424 424 424 565 565 565 706 706 706 \",\n \"102\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 9 9 9 9 9 9 9 9 9 9 9 9 9 9 11 11 11 11 11 11 11 11 11 13 13 13 13 13 13 15 15 15 \",\n \"63\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 2057201629 2057201629 2057201629 2571502036 2571502036 3085802443 \",\n \"305\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 9086477882 9086477882 9086477882 9086477882 9086477882 9086477882 9086477882 9086477882 9086477882 9086477882 9086477882 9785437719 9785437719 9785437719 9785437719 9785437719 9785437719 9785437719 9785437719 9785437719 10484397556 10484397556 10484397556 10484397556 10484397556 10484397556 10484397556 10484397556 11183357393 11183357393 11183357393 11183357393 11183357393 11882317230 11882317230 11882317230 \",\n \"198\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 2096296759 2096296759 2096296759 2096296759 2096296759 2096296759 2096296759 2096296759 2329218621 2329218621 2329218621 2329218621 2329218621 2329218621 2329218621 2562140483 2562140483 2562140483 2562140483 2562140483 2795062345 2795062345 2795062345 2795062345 3027984207 3027984207 3027984207 3260906069 \",\n \"15\\n1 1 1 1 1 1 189 189 189 189 189 377 377 377 377 \",\n \"14\\n1 1 1 1 1 1 155 155 155 155 155 309 309 463 \",\n \"150\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 489416793 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 978833585 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1468250377 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 1957667169 2447083961 2447083961 2447083961 2447083961 2447083961 2447083961 2447083961 2447083961 2447083961 2447083961 2447083961 2447083961 2447083961 2936500753 2936500753 2936500753 2936500753 2936500753 2936500753 2936500753 2936500753 2936500753 2936500753 2936500753 3425917545 3425917545 3425917545 3425917545 3425917545 3425917545 3425917545 3425917545 3425917545 3425917545 3915334337 3915334337 3915334337 3915334337 3915334337 3915334337 3915334337 4404751129 4404751129 4404751129 4404751129 4894167921 4894167921 5383584713 5873001505 \",\n \"224\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 154528371 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 309056741 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 463585111 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 618113481 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 772641851 927170221 927170221 927170221 927170221 927170221 927170221 927170221 927170221 927170221 927170221 927170221 927170221 927170221 927170221 927170221 1081698591 1081698591 1081698591 1081698591 1081698591 1081698591 1081698591 1081698591 1081698591 1081698591 1081698591 1081698591 1081698591 1236226961 1236226961 1236226961 1236226961 1236226961 1236226961 1236226961 1236226961 1236226961 1236226961 1236226961 1236226961 1390755331 1390755331 1390755331 1390755331 1390755331 1390755331 1390755331 1390755331 1390755331 1390755331 1390755331 1545283701 1545283701 1545283701 1545283701 1545283701 1545283701 1545283701 1545283701 1545283701 1545283701 1699812071 1699812071 1699812071 1699812071 1699812071 1699812071 1699812071 1699812071 1699812071 1854340441 1854340441 1854340441 1854340441 1854340441 2008868811 2008868811 2008868811 2008868811 2163397181 2163397181 2163397181 2317925551 2472453921 \",\n \"224\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 940751564 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 1881503127 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 2822254690 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 3763006253 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 4703757816 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 5644509379 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 6585260942 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 7526012505 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 8466764068 9407515631 9407515631 9407515631 9407515631 9407515631 9407515631 9407515631 9407515631 9407515631 10348267194 10348267194 10348267194 10348267194 10348267194 10348267194 10348267194 11289018757 11289018757 11289018757 11289018757 11289018757 11289018757 12229770320 12229770320 12229770320 12229770320 12229770320 13170521883 13170521883 \",\n \"232\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 733686394 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 1467372787 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2201059180 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 2934745573 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 3668431966 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 4402118359 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5135804752 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 5869491145 6603177538 6603177538 6603177538 6603177538 6603177538 6603177538 6603177538 6603177538 6603177538 6603177538 7336863931 7336863931 7336863931 7336863931 7336863931 7336863931 7336863931 7336863931 7336863931 8070550324 8070550324 8070550324 8070550324 8070550324 8070550324 8070550324 8070550324 8804236717 8804236717 8804236717 8804236717 8804236717 8804236717 8804236717 9537923110 9537923110 9537923110 9537923110 9537923110 10271609503 10271609503 10271609503 11005295896 11005295896 11738982289 \",\n \"230\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 486073482 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 972146963 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1458220444 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 1944293925 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2430367406 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 2916440887 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3402514368 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 3888587849 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4374661330 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 4860734811 5346808292 5346808292 5346808292 5346808292 5346808292 5346808292 5346808292 5346808292 5832881773 5832881773 5832881773 5832881773 5832881773 5832881773 5832881773 6318955254 6318955254 6318955254 6318955254 6318955254 6318955254 6805028735 6805028735 6805028735 6805028735 7291102216 7291102216 7291102216 7777175697 8263249178 \",\n \"36\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \",\n \"231\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 146272424 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 292544847 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 438817270 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 585089693 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 731362116 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 877634539 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1023906962 1170179385 1170179385 1170179385 1170179385 1170179385 1170179385 1170179385 1170179385 1170179385 1170179385 1170179385 1170179385 1170179385 1316451808 1316451808 1316451808 1316451808 1316451808 1316451808 1316451808 1316451808 1316451808 1316451808 1316451808 1462724231 1462724231 1462724231 1462724231 1462724231 1462724231 1462724231 1462724231 1462724231 1608996654 1608996654 1608996654 1608996654 1608996654 1608996654 1608996654 1755269077 1755269077 1755269077 1755269077 1755269077 1755269077 1901541500 1901541500 1901541500 1901541500 1901541500 2047813923 2047813923 2047813923 2047813923 2194086346 2194086346 2194086346 2340358769 2340358769 \",\n \"195\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 739565905 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 1479131809 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2218697713 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 2958263617 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 3697829521 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 4437395425 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5176961329 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 5916527233 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 6656093137 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 7395659041 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8135224945 8874790849 8874790849 8874790849 8874790849 8874790849 8874790849 9614356753 9614356753 \",\n \"5\\n1 1 1 11 11 \",\n \"223\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 177624875 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 355249749 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 532874623 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 710499497 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 888124371 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1065749245 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1243374119 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1420998993 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1598623867 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1776248741 1953873615 1953873615 1953873615 1953873615 2131498489 2131498489 2131498489 2131498489 \",\n \"260\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 79400569 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 158801137 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 238201705 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 317602273 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 397002841 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 476403409 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 555803977 635204545 635204545 635204545 635204545 635204545 635204545 635204545 635204545 635204545 635204545 635204545 635204545 635204545 635204545 635204545 714605113 714605113 714605113 714605113 714605113 714605113 714605113 714605113 714605113 714605113 714605113 714605113 714605113 714605113 794005681 794005681 794005681 794005681 794005681 794005681 794005681 794005681 794005681 794005681 794005681 873406249 873406249 873406249 873406249 873406249 873406249 873406249 873406249 873406249 873406249 952806817 952806817 952806817 952806817 952806817 952806817 952806817 952806817 952806817 1032207385 1032207385 1032207385 1032207385 1032207385 1032207385 1032207385 1032207385 1111607953 1111607953 1111607953 1111607953 1111607953 1191008521 1191008521 1191008521 1191008521 1270409089 1270409089 1270409089 1349809657 1349809657 1429210225 1508610793 \",\n \"46\\n1 1 1 1 1 1 1 1 1 1 1 1 1944 1944 1944 1944 1944 1944 1944 1944 1944 1944 1944 3887 3887 3887 3887 3887 3887 3887 5830 5830 5830 5830 5830 5830 7773 7773 7773 7773 9716 9716 9716 11659 11659 13602 \",\n \"62\\n1 1 1 1 1 1 1 1 1 1 1 1 1 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 7 7 9 9 9 9 9 9 9 11 11 11 11 13 13 13 15 15 15 \",\n \"177\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 751173720 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 1502347439 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 2253521158 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3004694877 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 3755868596 4507042315 4507042315 4507042315 4507042315 4507042315 4507042315 4507042315 4507042315 4507042315 4507042315 4507042315 4507042315 5258216034 5258216034 5258216034 5258216034 5258216034 5258216034 5258216034 5258216034 5258216034 5258216034 6009389753 6009389753 6009389753 6009389753 6009389753 6009389753 6009389753 6009389753 6009389753 6760563472 6760563472 6760563472 6760563472 6760563472 6760563472 6760563472 6760563472 7511737191 7511737191 7511737191 7511737191 8262910910 8262910910 8262910910 9014084629 9014084629 9765258348 9765258348 \",\n \"191\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 72235423 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 144470845 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 216706267 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 288941689 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 361177111 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 433412533 505647955 505647955 505647955 505647955 505647955 505647955 505647955 505647955 505647955 505647955 577883377 577883377 577883377 577883377 577883377 577883377 650118799 650118799 650118799 650118799 722354221 722354221 722354221 794589643 794589643 \",\n \"202\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 747167705 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 1494335409 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2241503113 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 2988670817 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 3735838521 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 4483006225 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5230173929 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 5977341633 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 6724509337 7471677041 7471677041 7471677041 8218844745 8218844745 8966012449 8966012449 \",\n \"202\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 313114750 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 626229499 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 939344248 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1252458997 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1565573746 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 1878688495 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2191803244 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2504917993 2818032742 2818032742 2818032742 2818032742 2818032742 2818032742 3131147491 3131147491 3444262240 3757376989 \",\n \"268\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \",\n \"159\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 76279478 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 152558955 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 228838432 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 305117909 381397386 381397386 381397386 381397386 381397386 381397386 381397386 381397386 381397386 381397386 381397386 381397386 381397386 381397386 381397386 457676863 457676863 457676863 457676863 457676863 457676863 457676863 457676863 457676863 457676863 457676863 457676863 457676863 457676863 533956340 533956340 533956340 533956340 533956340 533956340 533956340 533956340 533956340 533956340 533956340 533956340 533956340 610235817 610235817 610235817 610235817 610235817 686515294 686515294 686515294 762794771 762794771 \",\n \"3\\n1 1 1 \",\n \"277\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 1458767016 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 2917534031 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 4376301046 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 5835068061 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 7293835076 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 8752602091 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 10211369106 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 11670136121 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 13128903136 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 14587670151 16046437166 16046437166 16046437166 16046437166 16046437166 16046437166 16046437166 16046437166 16046437166 16046437166 17505204181 17505204181 17505204181 17505204181 17505204181 17505204181 17505204181 17505204181 17505204181 18963971196 18963971196 18963971196 18963971196 18963971196 18963971196 18963971196 18963971196 20422738211 20422738211 20422738211 20422738211 20422738211 21881505226 21881505226 21881505226 21881505226 23340272241 23340272241 \",\n \"236\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 586588705 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1173177409 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 1759766113 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2346354817 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 2932943521 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 3519532225 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4106120929 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 4692709633 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5279298337 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 5865887041 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 6452475745 7039064449 7039064449 7039064449 7039064449 7039064449 7039064449 7039064449 7039064449 7625653153 7625653153 7625653153 7625653153 7625653153 8212241857 8798830561 \",\n \"190\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 583761718 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1167523435 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 1751285152 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2335046869 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 2918808586 3502570303 3502570303 3502570303 3502570303 3502570303 3502570303 3502570303 3502570303 3502570303 3502570303 3502570303 3502570303 3502570303 4086332020 4086332020 4086332020 4086332020 4086332020 4086332020 4086332020 4086332020 4086332020 4086332020 4086332020 4670093737 4670093737 4670093737 4670093737 4670093737 4670093737 4670093737 5253855454 5253855454 5253855454 5253855454 5253855454 5837617171 5837617171 5837617171 6421378888 6421378888 7005140605 \",\n \"148\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 643910771 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1287821541 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 1931732311 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 2575643081 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3219553851 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 3863464621 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 4507375391 5151286161 5151286161 5151286161 5795196931 5795196931 6439107701 6439107701 \",\n \"63\\n1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 6 6 7 7 7 7 7 8 8 8 8 8 \",\n \"278\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 18919372 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 37838743 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 56758114 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 75677485 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 94596856 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 113516227 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 132435598 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 151354969 170274340 170274340 170274340 170274340 170274340 170274340 170274340 170274340 170274340 170274340 170274340 170274340 170274340 170274340 189193711 189193711 189193711 189193711 189193711 189193711 189193711 189193711 189193711 189193711 189193711 189193711 189193711 208113082 208113082 208113082 208113082 208113082 208113082 208113082 208113082 208113082 208113082 208113082 208113082 227032453 227032453 227032453 227032453 227032453 227032453 227032453 227032453 227032453 227032453 227032453 245951824 245951824 245951824 245951824 245951824 245951824 245951824 245951824 245951824 245951824 264871195 264871195 264871195 264871195 264871195 264871195 264871195 283790566 283790566 283790566 283790566 283790566 283790566 302709937 302709937 302709937 302709937 321629308 321629308 321629308 340548679 340548679 340548679 \",\n \"193\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 615683845 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1231367689 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 1847051533 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 2462735377 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3078419221 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 3694103065 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4309786909 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 4925470753 5541154597 5541154597 5541154597 5541154597 5541154597 5541154597 5541154597 5541154597 5541154597 5541154597 6156838441 6156838441 6156838441 6156838441 6156838441 6156838441 6156838441 6156838441 6156838441 6772522285 6772522285 6772522285 6772522285 6772522285 7388206129 7388206129 7388206129 8003889973 8619573817 \",\n \"263\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 647389051 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1294778101 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 1942167151 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 2589556201 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3236945251 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 3884334301 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 4531723351 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5179112401 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 5826501451 6473890501 6473890501 6473890501 6473890501 6473890501 6473890501 6473890501 6473890501 6473890501 7121279551 7121279551 7121279551 7121279551 7121279551 7121279551 7121279551 7121279551 7768668601 7768668601 7768668601 7768668601 7768668601 7768668601 7768668601 8416057651 8416057651 8416057651 8416057651 8416057651 8416057651 9063446701 9063446701 9710835751 \",\n \"174\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 912524638 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 1825049275 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 2737573912 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 3650098549 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 4562623186 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 5475147823 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 6387672460 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 7300197097 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 8212721734 9125246371 9125246371 10037771008 10037771008 \",\n \"18\\n1 1 1 1 1 1 1 1 1 1 1 48 48 48 95 95 142 142 \",\n \"168\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 64119658 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 128239315 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 192358972 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 256478629 320598286 320598286 320598286 320598286 320598286 320598286 320598286 320598286 320598286 320598286 320598286 320598286 320598286 320598286 384717943 384717943 384717943 384717943 384717943 384717943 384717943 384717943 384717943 384717943 384717943 384717943 448837600 448837600 448837600 448837600 448837600 448837600 448837600 448837600 448837600 448837600 512957257 512957257 512957257 512957257 512957257 512957257 512957257 512957257 512957257 577076914 577076914 577076914 577076914 577076914 577076914 577076914 641196571 641196571 641196571 641196571 641196571 641196571 705316228 705316228 705316228 705316228 705316228 769435885 833555542 \",\n \"5\\n1 1 1 7 7 \",\n \"4\\n1 1 3 5 \",\n \"109\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 251486658 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 502973315 754459972 754459972 754459972 754459972 754459972 754459972 754459972 754459972 754459972 754459972 754459972 754459972 754459972 754459972 754459972 1005946629 1005946629 1005946629 1005946629 1005946629 1005946629 1005946629 1005946629 1005946629 1005946629 1005946629 1005946629 1005946629 1257433286 1257433286 1257433286 1257433286 1257433286 1257433286 1257433286 1257433286 1257433286 1257433286 1508919943 1508919943 1508919943 1508919943 1760406600 2011893257 \",\n \"236\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 1293874211 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 2587748421 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 3881622631 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 5175496841 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 6469371051 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 7763245261 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 9057119471 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 10350993681 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 11644867891 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 12938742101 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 14232616311 15526490521 15526490521 15526490521 15526490521 15526490521 15526490521 16820364731 16820364731 16820364731 16820364731 16820364731 18114238941 18114238941 18114238941 19408113151 19408113151 20701987361 \",\n \"246\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 43822804 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 87645607 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 131468410 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 175291213 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 219114016 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 262936819 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 306759622 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 350582425 394405228 394405228 394405228 394405228 394405228 394405228 394405228 394405228 394405228 394405228 394405228 394405228 394405228 438228031 438228031 438228031 438228031 438228031 438228031 438228031 438228031 438228031 438228031 438228031 482050834 482050834 482050834 525873637 525873637 569696440 \",\n \"227\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 263375626 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 526751251 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 790126876 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1053502501 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1316878126 1580253751 1580253751 1580253751 1580253751 1580253751 1580253751 1580253751 1580253751 1580253751 1580253751 1580253751 1580253751 1580253751 1843629376 1843629376 1843629376 1843629376 1843629376 1843629376 1843629376 1843629376 1843629376 1843629376 1843629376 1843629376 2107005001 2107005001 2107005001 2107005001 2107005001 2107005001 2107005001 2107005001 2107005001 2107005001 2107005001 2370380626 2370380626 2370380626 2370380626 2370380626 2370380626 2370380626 2370380626 2370380626 2370380626 2633756251 2633756251 2633756251 2633756251 2633756251 2633756251 2633756251 2633756251 2633756251 2897131876 2897131876 2897131876 2897131876 2897131876 2897131876 2897131876 2897131876 3160507501 3160507501 3160507501 3160507501 3160507501 3160507501 3160507501 3423883126 3423883126 3423883126 3423883126 3423883126 3423883126 3687258751 3687258751 3687258751 3687258751 3950634376 3950634376 3950634376 4214010001 4214010001 \",\n \"95\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 \",\n \"177\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 496813082 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 993626163 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1490439244 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 1987252325 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2484065406 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 2980878487 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3477691568 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 3974504649 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4471317730 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 4968130811 5464943892 5464943892 5464943892 5464943892 5464943892 5961756973 6458570054 \",\n \"13\\n1 1 1 1 1 554 554 554 554 1107 1107 1107 1660 \",\n \"258\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 11 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 13 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 15 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 17 19 19 19 19 19 19 19 19 19 19 19 19 19 19 21 21 21 21 21 21 21 21 21 21 21 21 23 23 23 23 23 23 23 25 25 25 25 25 27 27 27 29 29 31 31 \",\n \"247\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 310361312 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 620722623 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 931083934 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1241445245 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1551806556 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 1862167867 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2172529178 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2482890489 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 2793251800 3103613111 3103613111 3103613111 3103613111 3103613111 3103613111 3103613111 3103613111 3103613111 3103613111 3413974422 3413974422 3413974422 3413974422 3413974422 3413974422 3413974422 3413974422 3413974422 3724335733 3724335733 3724335733 3724335733 3724335733 3724335733 3724335733 3724335733 4034697044 4034697044 4034697044 4034697044 4034697044 4034697044 4345058355 4345058355 4345058355 4345058355 4655419666 4655419666 4655419666 4965780977 4965780977 4965780977 \",\n \"287\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 30527186 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 61054371 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 91581556 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 122108741 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 152635926 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 183163111 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 213690296 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 244217481 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 274744666 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 305271851 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 335799036 366326221 366326221 366326221 366326221 366326221 366326221 366326221 366326221 366326221 366326221 396853406 396853406 396853406 396853406 396853406 396853406 396853406 396853406 396853406 427380591 427380591 427380591 427380591 427380591 427380591 427380591 427380591 457907776 457907776 457907776 457907776 457907776 457907776 457907776 488434961 488434961 488434961 488434961 518962146 518962146 518962146 \",\n \"180\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 357660778 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 715321555 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1072982332 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1430643109 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 1788303886 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2145964663 2503625440 2503625440 2503625440 2503625440 2503625440 2503625440 2503625440 2503625440 2503625440 2503625440 2503625440 2503625440 2503625440 2861286217 2861286217 2861286217 2861286217 2861286217 2861286217 2861286217 2861286217 2861286217 2861286217 3218946994 3218946994 3218946994 3218946994 3218946994 3218946994 3218946994 3576607771 3576607771 3576607771 3576607771 3576607771 3576607771 3934268548 3934268548 3934268548 3934268548 3934268548 4291929325 4649590102 \",\n \"231\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 819672490 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 1639344979 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 2459017468 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 3278689957 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4098362446 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 4918034935 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 5737707424 6557379913 6557379913 6557379913 6557379913 6557379913 6557379913 6557379913 6557379913 6557379913 6557379913 6557379913 6557379913 7377052402 7377052402 7377052402 7377052402 7377052402 7377052402 7377052402 7377052402 7377052402 7377052402 7377052402 8196724891 8196724891 8196724891 8196724891 8196724891 8196724891 8196724891 8196724891 8196724891 9016397380 9016397380 9016397380 9016397380 9016397380 9016397380 9016397380 9016397380 9836069869 9836069869 9836069869 9836069869 9836069869 9836069869 9836069869 10655742358 10655742358 10655742358 10655742358 10655742358 10655742358 11475414847 11475414847 11475414847 11475414847 11475414847 12295087336 12295087336 12295087336 12295087336 13114759825 13114759825 \",\n \"210\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 10 10 10 10 10 10 10 10 10 11 11 11 11 11 11 11 12 12 12 12 12 13 13 13 13 14 15 \",\n \"7\\n1 1 1 1 1 1 2 \",\n \"199\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 160137549 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 320275097 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 480412645 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 640550193 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 800687741 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 960825289 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1120962837 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1281100385 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1441237933 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1601375481 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1761513029 1921650577 1921650577 1921650577 1921650577 1921650577 2081788125 \",\n \"194\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 5704016 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 11408031 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 17112046 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 22816061 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 28520076 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 34224091 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 39928106 45632121 45632121 45632121 45632121 45632121 45632121 45632121 45632121 45632121 51336136 51336136 51336136 51336136 51336136 51336136 51336136 51336136 57040151 57040151 57040151 57040151 57040151 57040151 57040151 62744166 62744166 62744166 62744166 62744166 68448181 68448181 68448181 68448181 74152196 74152196 79856211 \",\n \"210\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 60592573 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 121185145 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 181777717 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 242370289 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 302962861 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 363555433 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 424148005 484740577 484740577 484740577 484740577 484740577 484740577 484740577 484740577 484740577 484740577 484740577 484740577 484740577 484740577 545333149 545333149 545333149 545333149 545333149 545333149 545333149 545333149 545333149 545333149 545333149 605925721 605925721 605925721 605925721 605925721 605925721 605925721 605925721 605925721 666518293 666518293 666518293 666518293 666518293 666518293 727110865 727110865 727110865 727110865 787703437 787703437 848296009 848296009 \",\n \"189\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 264290629 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 528581257 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 792871885 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1057162513 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1321453141 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1585743769 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 1850034397 2114325025 2114325025 2114325025 2114325025 2114325025 2114325025 2114325025 2114325025 2114325025 2114325025 2114325025 2114325025 2114325025 2378615653 2378615653 2378615653 2378615653 2378615653 2378615653 2378615653 2378615653 2378615653 2642906281 2642906281 2642906281 2642906281 2642906281 2907196909 2907196909 2907196909 3171487537 3171487537 \",\n \"3\\n1 1 0 \",\n \"33\\n1 1 1 1 1 1 1 1 1 217 217 217 217 217 217 217 433 433 433 433 433 433 649 649 649 649 649 865 865 865 1081 1081 1081 \",\n \"58\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 514300408 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1028600815 1542901222 1542901222 1542901222 1542901222 1542901222 1542901222 2057201629 2057201629 2057201629 2057201629 2571502036 2571502036 2571502036 3085802443 3085802443 3600102850 \",\n \"242\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 698959838 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 1397919675 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2096879512 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 2795839349 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 3494799186 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4193759023 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 4892718860 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 5591678697 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6290638534 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 6989598371 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 7688558208 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 8387518045 9086477882 9086477882 9086477882 9086477882 9086477882 9086477882 9785437719 9785437719 9785437719 10484397556 10484397556 11183357393 11882317230 \",\n \"214\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 232921863 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 465843725 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 698765587 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 931687449 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1164609311 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1397531173 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1630453035 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 1863374897 2096296759 2096296759 2096296759 2096296759 2096296759 2096296759 2096296759 2096296759 2096296759 2329218621 2329218621 2329218621 2329218621 2329218621 2329218621 2329218621 2329218621 2562140483 2562140483 2562140483 2562140483 2562140483 2562140483 2795062345 2795062345 2795062345 2795062345 3027984207 \",\n \"8\\n1 1 1 1 1 1 189 189 \",\n \"14\\n1 1 1 1 1 1 261 261 261 261 261 521 521 781 \",\n \"150\\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 590405941 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1180811881 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 1771217821 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2361623761 2952029701 2952029701 2952029701 2952029701 2952029701 2952029701 2952029701 2952029701 2952029701 2952029701 2952029701 2952029701 2952029701 3542435641 3542435641 3542435641 3542435641 3542435641 3542435641 3542435641 3542435641 3542435641 3542435641 3542435641 4132841581 4132841581 4132841581 4132841581 4132841581 4132841581 4132841581 4132841581 4132841581 4132841581 4723247521 4723247521 4723247521 4723247521 4723247521 4723247521 4723247521 5313653461 5313653461 5313653461 5313653461 5904059401 5904059401 6494465341 7084871281 \",\n \"1\\n1 \",\n \"1\\n1 \",\n \"6\\n1 1 1 1 1 1 \",\n \"1\\n1 \"\n ]\n}"},"source":{"kind":"class label","value":"2","name":"CODEFORCES"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nPikachu had an array with him. He wrote down all the non-empty subsequences of the array on paper. Note that an array of size n has 2n - 1 non-empty subsequences in it. \n\nPikachu being mischievous as he always is, removed all the subsequences in which Maximum_element_of_the_subsequence - Minimum_element_of_subsequence ≥ d\n\nPikachu was finally left with X subsequences. \n\nHowever, he lost the initial array he had, and now is in serious trouble. He still remembers the numbers X and d. He now wants you to construct any such array which will satisfy the above conditions. All the numbers in the final array should be positive integers less than 1018. \n\nNote the number of elements in the output array should not be more than 104. If no answer is possible, print - 1.\n\nInput\n\nThe only line of input consists of two space separated integers X and d (1 ≤ X, d ≤ 109).\n\nOutput\n\nOutput should consist of two lines.\n\nFirst line should contain a single integer n (1 ≤ n ≤ 10 000)— the number of integers in the final array.\n\nSecond line should consist of n space separated integers — a1, a2, ... , an (1 ≤ ai < 1018).\n\nIf there is no answer, print a single integer -1. If there are multiple answers, print any of them.\n\nExamples\n\nInput\n\n10 5\n\n\nOutput\n\n6\n5 50 7 15 6 100\n\nInput\n\n4 2\n\n\nOutput\n\n4\n10 100 1000 10000\n\nNote\n\nIn the output of the first example case, the remaining subsequences after removing those with Maximum_element_of_the_subsequence - Minimum_element_of_subsequence ≥ 5 are [5], [5, 7], [5, 6], [5, 7, 6], [50], [7], [7, 6], [15], [6], [100]. There are 10 of them. Hence, the array [5, 50, 7, 15, 6, 100] is valid.\n\nSimilarly, in the output of the second example case, the remaining sub-sequences after removing those with Maximum_element_of_the_subsequence - Minimum_element_of_subsequence ≥ 2 are [10], [100], [1000], [10000]. There are 4 of them. Hence, the array [10, 100, 1000, 10000] is valid.\n\n### Input:\n10 5\n\n### Output:\n5\n1 1 1 6 6 \n\n\n### Input:\n4 2\n\n### Output:\n3\n1 1 3 \n\n\n### Code:\nX, d = map(int, input().split())\n\nx = X\nans = list()\nln = 0\nlast = 1\nwhile x > 0:\n if last >= 10 ** 18:\n print(-1)\n exit()\n\n i = 0\n while 2 ** (i + 1) - 1 <= x:\n i += 1\n\n t = 2 ** i - 1\n x -= t\n\n if ln + i > 10000:\n print(-1)\n exit()\n\n for _ in range(i):\n ans.append(last)\n ln += 1\n\n last += d\n\nprint(len(ans))\nprint(' '.join(map(str, ans)))\n"}}},{"rowIdx":5699,"cells":{"id":{"kind":"string","value":"p02592 AtCoder Grand Contest 047 - Product Simulation_26912"},"description":{"kind":"string","value":"This is an output-only problem. You shouldn't read anything from the input.\n\nIn short, your task is to simulate multiplication by using only comparison (x < y) and addition (x + y). There is no input in this problem, you just print a sequence of operations.\n\nImagine that there is a big array a[0], a[1], ..., a[N-1] of length N. The first two values are initially two non-negative integers A and B (which are unknown to you), the other elements are zeros. Your goal is to get the product A \\cdot B in a[2] at the end.\n\nYou are allowed operations of two types, with the following format (where 0 \\leq i, j, k < N):\n\n* `+ i j k` — applies operation a[k] = a[i] + a[j].\n* `< i j k` — applies operation a[k] = a[i] < a[j]. That is, if a[i] < a[j] then a[k] becomes 1, otherwise it becomes 0.\n\n\n\nYou can use at most Q operations. Elements of a can't exceed V. Indices (i, j, k) don't have to be distinct. It's allowed to modify any element of the array (including the first two). The actual checker simulates the process for multiple pairs (A, B) within a single test. Each time, the checker chooses values A and B, creates the array a = [A, B, 0, 0, \\ldots, 0], applies all your operations and ensures that a[2] = A \\cdot B.\n\nConstraints\n\n* 0 \\leq A, B \\leq 10^9\n* N = Q = 200\\,000\n* V = 10^{19} = 10\\,000\\,000\\,000\\,000\\,000\\,000\n\nInput\n\nThe Standard Input is empty.\n\nOutput\n\nIn the first line, print the number of operations. Each operation should then be printed in a single line of format `+ i j k` or `< i j k`.\n\nExample\n\nInput\n\n\n\n\nOutput"},"code":{"kind":"string","value":"n=97\np=print\nr=range\ndef a(i,j,k,l=0):p(chr(43+l*17),i,j,k)\ndef b(i):a(i,i,i+1)\ndef d(x,i,j):\n\tfor t in r(30):\n\t\tb(j+t-1);a(j+t,n,j+t)\n\t\tfor s in r(j+t,j+29):b(s)\n\t\ta(j+29,x,i+t,1);b(j+t-1);a(j+t,i+t,j+t)\np(3933)\na(0,1,n)\na(2,n,n,1)\na(0,n,3)\na(1,n,4)\nd(3,5,36)\nd(4,36,67)\nfor t in r(59):\n\ta(2,2,2)\n\tfor s in r(t+1):\n\t\tif t-30<s<30:a(5+t-s,36+s,98);a(n,98,99,1);a(2,99,2)"},"test_samples":{"kind":"string","value":"{\n \"input\": [\n \"\"\n ],\n \"output\": [\n \"\"\n ]\n}"},"source":{"kind":"class label","value":"5","name":"ATCODER"},"prompt":{"kind":"string","value":"Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.\n\n### Description:\nThis is an output-only problem. You shouldn't read anything from the input.\n\nIn short, your task is to simulate multiplication by using only comparison (x < y) and addition (x + y). There is no input in this problem, you just print a sequence of operations.\n\nImagine that there is a big array a[0], a[1], ..., a[N-1] of length N. The first two values are initially two non-negative integers A and B (which are unknown to you), the other elements are zeros. Your goal is to get the product A \\cdot B in a[2] at the end.\n\nYou are allowed operations of two types, with the following format (where 0 \\leq i, j, k < N):\n\n* `+ i j k` — applies operation a[k] = a[i] + a[j].\n* `< i j k` — applies operation a[k] = a[i] < a[j]. That is, if a[i] < a[j] then a[k] becomes 1, otherwise it becomes 0.\n\n\n\nYou can use at most Q operations. Elements of a can't exceed V. Indices (i, j, k) don't have to be distinct. It's allowed to modify any element of the array (including the first two). The actual checker simulates the process for multiple pairs (A, B) within a single test. Each time, the checker chooses values A and B, creates the array a = [A, B, 0, 0, \\ldots, 0], applies all your operations and ensures that a[2] = A \\cdot B.\n\nConstraints\n\n* 0 \\leq A, B \\leq 10^9\n* N = Q = 200\\,000\n* V = 10^{19} = 10\\,000\\,000\\,000\\,000\\,000\\,000\n\nInput\n\nThe Standard Input is empty.\n\nOutput\n\nIn the first line, print the number of operations. Each operation should then be printed in a single line of format `+ i j k` or `< i j k`.\n\nExample\n\nInput\n\n\n\n\nOutput\n\n### Input:\n\n### Output:\n\n\n### Code:\nn=97\np=print\nr=range\ndef a(i,j,k,l=0):p(chr(43+l*17),i,j,k)\ndef b(i):a(i,i,i+1)\ndef d(x,i,j):\n\tfor t in r(30):\n\t\tb(j+t-1);a(j+t,n,j+t)\n\t\tfor s in r(j+t,j+29):b(s)\n\t\ta(j+29,x,i+t,1);b(j+t-1);a(j+t,i+t,j+t)\np(3933)\na(0,1,n)\na(2,n,n,1)\na(0,n,3)\na(1,n,4)\nd(3,5,36)\nd(4,36,67)\nfor t in r(59):\n\ta(2,2,2)\n\tfor s in r(t+1):\n\t\tif t-30<s<30:a(5+t-s,36+s,98);a(n,98,99,1);a(2,99,2)"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":56,"numItemsPerPage":100,"numTotalItems":8139,"offset":5600,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6Im1sR1pFYktIVHRVSGRhX1RRdEczQ0N1S3k5ME9Qd25DNHY5elRjM3FVYzgifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4MjcwNTgxNiwianRpIjoiZmQzNDQzZjQtMDllZi00OWM3LTllZjMtY2FmMjNlYmQxYmE3Iiwic3ViIjoiL2RhdGFzZXRzL2lhbXRhcnVuL2NvZGVfY29udGVzdF9weXRob24zX2FscGFjYSIsImV4cCI6MTc4MjcwOTQxNiwiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.N8DEWjjLNKd-lN04AgqCFdrJ-eofkh-CnlVgD7yBEuH3bsg3GralBWA6CrSQhRKX1uDybaSGEwypfmdpAuBSBg","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"test","numRows":122,"numBytesParquet":5201201},{"config":"default","split":"train","numRows":8139,"numBytesParquet":183461727},{"config":"default","split":"valid","numRows":95,"numBytesParquet":3656966}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
id stringlengths 14 117 | description stringlengths 29 13k | code stringlengths 10 49.8k | test_samples dict | source class label 3
classes | prompt stringlengths 391 104k |
|---|---|---|---|---|---|
1428_A. Box is Pull_26450 | Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pull the box. He can only pull the box if he stands exactly 1 unit away from the box in the direction of one of two coordinate axes. He will... | for i in range(int(input())):
x1,y1,x2,y2=map(int,input().split())
q=abs(x1-x2)+abs(y1-y2)
print(q if x1==x2 or y1==y2 else q+2) | {
"input": [
"2\n1 2 2 2\n1 1 2 2\n",
"1\n69 69 69 69\n",
"1\n3 2 4 7\n",
"5\n1 1 1000000000 1000000000\n1 1 1000000000 1000000000\n1 1 1000000000 1000000000\n1 1 1000000000 1000000000\n1 1 65537 65537\n",
"1\n1 1 131073 131073\n",
"1\n69 69 34 69\n",
"1\n3 2 4 1\n",
"5\n1 1 1000000000... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Wabbit is trying to move a box containing food for the rest of the zoo in the coordinate plane from the point (x_1,y_1) to the point (x_2,y_2).
He has a rope, which he can use to pul... |
1451_A. Subtract or Divide_26454 | Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater than 1.
A proper divisor is a divisor of a number, excluding itself. For example, 1, 2, 4, 5, and 10 are proper divisors of 20, but 2... | for _ in range(int(input())):
k = 3
n = int(input())
if n == 1:
print("0")
elif n == 2:
print("1")
elif n == 3:
print("2")
elif n%2==0:
print("2")
else:
print("3") | {
"input": [
"6\n1\n2\n3\n4\n6\n9\n",
"6\n1\n2\n3\n4\n6\n16\n",
"6\n1\n2\n3\n7\n6\n16\n",
"6\n1\n2\n3\n7\n1\n30\n",
"6\n1\n2\n3\n4\n11\n9\n",
"6\n1\n3\n3\n4\n6\n16\n",
"6\n1\n2\n3\n7\n6\n45\n",
"6\n1\n2\n3\n7\n1\n17\n",
"6\n1\n2\n3\n4\n1\n9\n",
"6\n1\n2\n3\n7\n1\n1\n",
"6\n... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Ridbit starts with an integer n.
In one move, he can perform one of the following operations:
* divide n by one of its proper divisors, or
* subtract 1 from n if n is greater ... |
1475_A. Odd Divisor_26458 | You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, then there is x=3. If n=4, then such a number does not exist.
Input
The first line contains one integer t (1 ≤ t ≤ 10^4) — the number of t... | test_cases = 1
test_cases = int(input())
for ttttt in range(test_cases):
n = int(input())
while n%2==0:
n/=2
if n==1:
print("NO")
else:
print("YES") | {
"input": [
"6\n2\n3\n4\n5\n998244353\n1099511627776\n",
"4\n4\n4\n4\n147862179\n",
"2\n1234567\n1234567\n",
"4\n4\n4\n4\n171787042\n",
"2\n1234567\n17471\n",
"6\n2\n6\n4\n5\n998244353\n1099511627776\n",
"4\n5\n4\n8\n44823782\n",
"2\n97\n64\n",
"6\n3\n3\n4\n5\n998244353\n109951162... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x > 1) that n is divisible by x and x is odd).
For example, if n=6, the... |
14_D. Two Paths_26462 | As you know, Bob's brother lives in Flatland. In Flatland there are n cities, connected by n - 1 two-way roads. The cities are numbered from 1 to n. You can get from one city to another moving along the roads.
The «Two Paths» company, where Bob's brother works, has won a tender to repair two paths in Flatland. A path ... | import os
import sys
from io import BytesIO, IOBase
from types import GeneratorType
from collections import defaultdict
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" ... | {
"input": [
"6\n1 2\n2 3\n2 4\n5 4\n6 4\n",
"7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n",
"4\n1 2\n2 3\n3 4\n",
"4\n3 2\n3 4\n1 4\n",
"6\n1 2\n2 5\n4 5\n4 6\n3 2\n",
"8\n8 6\n1 8\n7 8\n3 1\n2 6\n5 3\n8 4\n",
"8\n7 2\n7 1\n6 7\n4 1\n7 3\n6 8\n2 5\n",
"2\n2 1\n",
"15\n10 12\n12 4\n15 12\n15 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
As you know, Bob's brother lives in Flatland. In Flatland there are n cities, connected by n - 1 two-way roads. The cities are numbered from 1 to n. You can get from one city to anoth... |
1525_A. Potion-making_26466 | You have an initially empty cauldron, and you want to brew a potion in it. The potion consists of two ingredients: magic essence and water. The potion you want to brew should contain exactly k\ \% magic essence and (100 - k)\ \% water.
In one step, you can pour either one liter of magic essence or one liter of water i... | import math
for i in range(int(input())):
n=int(input())
a=100-n
b=n
if n==100:
print(1)
else:
g=math.gcd(a,b)
print(a//g+b//g)
| {
"input": [
"3\n3\n100\n25\n",
"100\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\n3\n7\... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You have an initially empty cauldron, and you want to brew a potion in it. The potion consists of two ingredients: magic essence and water. The potion you want to brew should contain ... |
156_C. Cipher_26470 | Sherlock Holmes found a mysterious correspondence of two VIPs and made up his mind to read it. But there is a problem! The correspondence turned out to be encrypted. The detective tried really hard to decipher the correspondence, but he couldn't understand anything.
At last, after some thought, he thought of somethin... | S, N = 2501, 101
m = 1000000007
k = 26
p = [[0] * (S + k) for i in range(N)]
p[0][0] = 1
for n in range(1, N):
for s in range(S):
p[n][s] = (p[n][s - 1] + p[n - 1][s] - p[n - 1][s - k]) % m
r = []
for j in range(int(input())):
t = input()
s = sum(ord(q) - 97 for q in t)
print(p[len(t)][s] - 1) | {
"input": [
"1\naaaaaaaaaaa\n",
"1\nab\n",
"2\nya\nklmbfxzb\n",
"1\nz\n",
"1\na\n",
"19\nqhovyphr\nttymgy\nqbed\nidxitl\nusbrx\nqevvydqdb\nltyjljj\ncgv\nsruvudcu\naqjbqjybyq\nrhtwwtthhh\nh\nksktyyst\npmwmnzswlw\nm\nuwaup\nxhvk\nj\nvii\n",
"15\nieqqe\nwwbnobrb\ngyftfg\nclrn\nzwtviipwww\nms... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Sherlock Holmes found a mysterious correspondence of two VIPs and made up his mind to read it. But there is a problem! The correspondence turned out to be encrypted. The detective tri... |
199_D. Jumping on Walls_26476 | Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long areas and number them with positive integers from 1 to n from bottom to top. Some... | from collections import deque
l, j = [int(i) for i in input().split(' ')]
wallA = list(input())
wallB = list(input())
g = {}
for i in range(l):
# Each 4-tuple represents: (Visited?, Current Height, Current Water Height, Drowned?)
if wallA[i] == '-':
g[(1,i+1)] = (-1, 0, 0, False)
if wallB[i] == '... | {
"input": [
"6 2\n--X-X-\nX--XX-\n",
"7 3\n---X--X\n-X--XX-\n",
"5 4\n-X---\n----X\n",
"10 1\n-X-X-X-X-X\nX-X-X-X-X-\n",
"50 4\n-X-X-X--X--X--X-XX-----XX--X--------------XXX-X-X-\n--XX---XXXXXXX----XX--X--XXX--XXXX-XX--X--X--X----\n",
"6 2\n--X--X\nXX-X-X\n",
"100 10\n-X------XXX--XXX-XXX... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon.
The canyon consists of two vertical parallel walls, their height is n meters. Le... |
222_E. Decoding Genome_26480 | Recently a top secret mission to Mars has taken place. As a result, scientists managed to obtain some information about the Martian DNA. Now we know that any Martian DNA contains at most m different nucleotides, numbered from 1 to m. Special characteristics of the Martian DNA prevent some nucleotide pairs from followin... | import sys
def pyes_no(condition) :
if condition :
print ("YES")
else :
print ("NO")
def plist(a, s = ' ') :
print (s.join(map(str, a)))
def rint() :
return int(sys.stdin.readline())
def rints() :
return map(int, sys.stdin.readline().split())
def rfield(n, m = None) :
if m == None :
m = n
... | {
"input": [
"3 3 0\n",
"2 1 1\naa\n",
"3 3 2\nab\nba\n",
"3 3 6\naa\nab\nac\nbb\nbc\ncc\n",
"1000000000000000 52 26\naa\nbb\ncc\ndd\nee\nff\ngg\nhh\nii\njj\nkk\nll\nmm\nnn\noo\npp\nqq\nrr\nss\ntt\nuu\nvv\nww\nxx\nyy\nzz\n",
"50000 52 10\nAa\naA\nBy\ntS\nzA\nZu\nyy\nUU\nen\neq\n",
"3 3 7\n... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Recently a top secret mission to Mars has taken place. As a result, scientists managed to obtain some information about the Martian DNA. Now we know that any Martian DNA contains at m... |
246_C. Beauty Pageant_26484 | General Payne has a battalion of n soldiers. The soldiers' beauty contest is coming up, it will last for k days. Payne decided that his battalion will participate in the pageant. Now he has choose the participants.
All soldiers in the battalion have different beauty that is represented by a positive integer. The value... | n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
t = [[i] for i in p]
for i in range(1, n):
t += [t[-1] + i for i in t[: n - i]]
print('\n'.join(str(len(i)) + ' ' + ' '.join(map(str, i)) for i in t[: k])) | {
"input": [
"2 1\n7 12\n",
"3 3\n1 2 3\n",
"10 9\n5 10 2 14 15 6 3 11 4 1\n",
"1 1\n1000\n",
"50 263\n110 98 17 54 76 31 195 77 207 168 104 229 37 88 29 164 130 156 261 181 8 113 232 234 132 53 179 59 3 141 178 61 276 152 163 85 148 129 235 79 135 94 108 69 117 2 18 158 275 174\n",
"50 144\n9... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
General Payne has a battalion of n soldiers. The soldiers' beauty contest is coming up, it will last for k days. Payne decided that his battalion will participate in the pageant. Now ... |
271_D. Good Substrings_26488 | You've got string s, consisting of small English letters. Some of the English letters are good, the rest are bad.
A substring s[l...r] (1 ≤ l ≤ r ≤ |s|) of string s = s1s2...s|s| (where |s| is the length of string s) is string slsl + 1...sr.
The substring s[l...r] is good, if among the letters sl, sl + 1, ..., sr t... | import collections as cc
import sys
input=sys.stdin.readline
I=lambda:list(map(int,input().split()))
S=lambda :list(input().strip())
s=S()
t=S()
k,=I()
ans=0
prev=''
ss=sorted([s[i:] for i in range(len(s))])
for j in ss:
now=0
f=0
for i in range(len(j)):
if i>=len(prev) or j[i]!=prev[i]:
f=1
now+=t[ord(j[i])-... | {
"input": [
"acbacbacaa\n00000000000000000000000000\n2\n",
"ababab\n01000000000000000000000000\n1\n",
"aaaabaababbbbbbbbbaaabaaabbbababbbbbbabbaaabaabaabaaabaaaabbababbaaaaaaababbaababbabbaabbbabaabbbbababaaabbabbbabaaabbbabbbbbbbbabababaaaaaabaababbbbbaaaaaaaaaaaaaaababbbbabbbbbbababaabbabbbaababaabaaaa... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You've got string s, consisting of small English letters. Some of the English letters are good, the rest are bad.
A substring s[l...r] (1 ≤ l ≤ r ≤ |s|) of string s = s1s2...s|s| (wh... |
295_A. Greg and Array_26492 | Greg has an array a = a1, a2, ..., an and m operations. Each operation looks as: li, ri, di, (1 ≤ li ≤ ri ≤ n). To apply operation i to the array means to increase all array elements with numbers li, li + 1, ..., ri by value di.
Greg wrote down k queries on a piece of paper. Each query has the following form: xi, yi, ... | import sys
input=sys.stdin.readline
n,m,k=map(int,input().split())
a=list(map(int,input().split()))
query=[]
times=[]
x=[0]*(m+2)
y=[0]*(n+2)
for i in range(m):
query.append(list(map(int,input().split())))
for i in range(k):
times.append(list(map(int,input().split())))
for i in range(k):
l,r=times[i]
x[... | {
"input": [
"3 3 3\n1 2 3\n1 2 1\n1 3 2\n2 3 4\n1 2\n1 3\n2 3\n",
"1 1 1\n1\n1 1 1\n1 1\n",
"4 3 6\n1 2 3 4\n1 2 1\n2 3 2\n3 4 4\n1 2\n1 3\n2 3\n1 2\n1 3\n2 3\n",
"1 1 1\n0\n1 1 0\n1 1\n",
"3 3 3\n1 2 3\n1 2 1\n2 3 2\n2 3 4\n1 2\n1 3\n2 3\n",
"4 3 6\n2 2 3 4\n1 2 1\n2 3 2\n3 4 4\n1 2\n1 3\n2 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Greg has an array a = a1, a2, ..., an and m operations. Each operation looks as: li, ri, di, (1 ≤ li ≤ ri ≤ n). To apply operation i to the array means to increase all array elements ... |
366_A. Dima and Guards_26501 | Nothing has changed since the last round. Dima and Inna still love each other and want to be together. They've made a deal with Seryozha and now they need to make a deal with the dorm guards...
There are four guardposts in Dima's dorm. Each post contains two guards (in Russia they are usually elderly women). You can b... | import itertools as it
n = int(input())
res = None
for i in range(4):
a = list(map(int, input().split()))
for v in list(it.product(a[:2], a[2:])):
if sum(v) <= n:
res = [i + 1, v[0], n - v[0]]
break
if res is not None:
break
print(-1 if res is None else ' '.join(ma... | {
"input": [
"10\n6 6 6 6\n7 7 7 7\n4 4 4 4\n8 8 8 8\n",
"10\n5 6 5 6\n6 6 7 7\n5 8 6 6\n9 9 9 9\n",
"5\n3 3 3 3\n3 3 3 3\n3 3 3 3\n3 3 3 3\n",
"100000\n25000 75000 80000 80000\n99999 99999 2 2\n99999 2 99999 99999\n2 99999 99999 99999\n",
"100000\n25000 50000 50001 75001\n25000 50000 50001 75001\... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Nothing has changed since the last round. Dima and Inna still love each other and want to be together. They've made a deal with Seryozha and now they need to make a deal with the dorm... |
389_E. Fox and Card Game_26505 | Fox Ciel is playing a card game with her friend Fox Jiro. There are n piles of cards on the table. And there is a positive integer on each card.
The players take turns and Ciel takes the first turn. In Ciel's turn she takes a card from the top of any non-empty pile, and in Jiro's turn he takes a card from the bottom o... | n = int(input())
lista = []
aux = []
somaA = 0
somaB = 0
for i in range(n):
a = [int(i) for i in input().split()][1:]
if len(a) > 1:
somaA += sum(a[0:len(a)//2])
somaB += sum(a[-(len(a)//2):])
if len(a) % 2 == 1:
aux.append(a[len(a)//2])
aux.sort(reverse=True)
for i in range(... | {
"input": [
"3\n3 1000 1000 1000\n6 1000 1000 1000 1000 1000 1000\n5 1000 1000 1000 1000 1000\n",
"2\n1 100\n2 1 10\n",
"3\n3 1 3 2\n3 5 4 6\n2 8 7\n",
"1\n9 2 8 6 5 9 4 7 1 3\n",
"5\n1 3\n1 2\n1 8\n1 1\n1 4\n",
"2\n2 200 1\n3 1 100 2\n",
"4\n3 1 5 100\n3 1 5 100\n3 100 1 1\n3 100 1 1\n",... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Fox Ciel is playing a card game with her friend Fox Jiro. There are n piles of cards on the table. And there is a positive integer on each card.
The players take turns and Ciel takes... |
409_H. A + B Strikes Back_26509 | A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?
Input
The input contains two integers a and b (0 ≤ a, b ≤ 103), separated by a single space.
Output
Output ... | import sys
import os
a,b=input().split()
a=int(a)
b=int(b)
print(a+b)
| {
"input": [
"381 492\n",
"5 14\n",
"629 657\n",
"536 298\n",
"441 915\n",
"522 92\n",
"723 350\n",
"339 433\n",
"953 553\n",
"433 126\n",
"399 280\n",
"538 261\n",
"740 519\n",
"242 86\n",
"117 399\n",
"632 264\n",
"143 522\n",
"923 488\n",
... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to g... |
437_C. The Child and Toy_26513 | On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Each rope links two parts, but every pair of parts is linked by at most one rope. To split the toy, the child must remove all its parts. The... | def mlt(): return map(int, input().split())
x, y = mlt()
s = [0] + list(mlt())
res = 0
for n in range(y):
a, b = mlt()
res += min(s[a], s[b])
print(res)
| {
"input": [
"4 4\n100 100 100 100\n1 2\n2 3\n2 4\n3 4\n",
"4 3\n10 20 30 40\n1 4\n1 2\n2 3\n",
"7 10\n40 10 20 10 20 80 40\n1 5\n4 7\n4 5\n5 2\n5 7\n6 4\n1 6\n1 3\n4 3\n1 4\n",
"1 0\n23333\n",
"3 3\n1 1 1\n1 2\n2 3\n3 1\n",
"5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n",
"10 30\n3 6 17 15 13 15 6... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty that he can't wait to destroy the toy.
The toy consists of n parts and m ropes. Eac... |
506_D. Mr. Kitayuta's Colorful Graph_26522 | Mr. Kitayuta has just bought an undirected graph with n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting vertex ai and bi.
Mr. Kitayuta wants you to process the following q queries.
In the i-th query, he gives you two integers - ui and vi.
... |
#make a table
n,m = map(int,input().split())
arr = [[] for i in range(n+1)]
for i in range(1,m+1):
l = list(map(int,input().split()))
arr[l[0]].append((l[1],l[2]))
arr[l[1]].append((l[0],l[2]))
#dfs
def dfs(a,b,k):
if a == b:
return True
seen.append(a)
for i in arr[a]:
x,c = i... | {
"input": [
"4 5\n1 2 1\n1 2 2\n2 3 1\n2 3 3\n2 4 3\n3\n1 2\n3 4\n1 4\n",
"5 7\n1 5 1\n2 5 1\n3 5 1\n4 5 1\n1 2 2\n2 3 2\n3 4 2\n5\n1 5\n5 1\n2 5\n1 5\n1 4\n",
"2 1\n1 2 1\n1\n1 2\n",
"2 5\n1 2 1\n1 2 2\n1 2 3\n1 2 4\n1 2 5\n1\n1 2\n",
"2 3\n1 2 3\n1 2 2\n1 2 1\n1\n1 2\n",
"5 7\n1 5 1\n3 5 1\... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Mr. Kitayuta has just bought an undirected graph with n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting ... |
52_C. Circular RMQ_26525 | You are given circular array a0, a1, ..., an - 1. There are two types of operations with it:
* inc(lf, rg, v) — this operation increases each element on the segment [lf, rg] (inclusively) by v;
* rmq(lf, rg) — this operation returns minimal value on the segment [lf, rg] (inclusively).
Assume segments to be c... | import math,sys,bisect,heapq,os
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
from functools import lru_cache
#sys.setrecursionlimit(200000000)
int1 = lambda x: int(x) - 1
def input(): return sys.stdin.readline().rstrip('\r\n')
#input = iter(sys.stdin.buffer.read().decode().... | {
"input": [
"4\n1 2 3 4\n4\n3 0\n3 0 -1\n0 1\n2 1\n",
"2\n-1 -1\n10\n0 0\n0 0\n0 0 1\n0 0\n1 1\n0 0 -1\n0 0 0\n0 0 1\n1 1 0\n0 0 -1\n",
"1\n-1\n10\n0 0 -1\n0 0\n0 0 1\n0 0\n0 0 1\n0 0\n0 0 0\n0 0\n0 0 -1\n0 0 1\n",
"1\n1\n1\n0 0 0\n"
],
"output": [
"1\n0\n0\n",
"-1\n-1\n0\n-1\n",
"-2\... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You are given circular array a0, a1, ..., an - 1. There are two types of operations with it:
* inc(lf, rg, v) — this operation increases each element on the segment [lf, rg] (incl... |
581_D. Three Logos_26531 | Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers will put up the ad only if it is possible to place all three logos on the billboard so that they do not overlap and the billboard has no e... | #------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
# from fractions import *
# from heapq import*
from bisect import *
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')... | {
"input": [
"4 4 2 6 4 2\n",
"5 1 2 5 5 2\n",
"2 5 6 7 3 4\n",
"100 12 88 61 39 88\n",
"13 68 100 87 13 32\n",
"70 7 70 2 70 62\n",
"100 20 96 80 80 4\n",
"70 10 47 59 23 59\n",
"75 100 19 100 6 100\n",
"100 100 100 1 100 100\n",
"2 3 2 5 5 8\n",
"2 3 2 3 2 2\n",
"... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Three companies decided to order a billboard with pictures of their logos. A billboard is a big square board. A logo of each company is a rectangle of a non-zero area.
Advertisers w... |
603_C. Lieges of Legendre_26535 | Kevin and Nicky Sun have invented a new game called Lieges of Legendre. In this game, two players take turns modifying the game state with Kevin moving first. Initially, the game is set up so that there are n piles of cows, with the i-th pile containing ai cows. During each player's turn, that player calls upon the pow... | def grundy(n, k):
if k % 2 == 0:
if n <= 2:
return n
else:
return n % 2 == 0
else:
if n <= 4:
return [0, 1, 0, 1, 2][n]
elif n % 2 == 1:
return 0
else:
return 2 if grundy(n // 2, k) == 1 else 1
if __name__ == "... | {
"input": [
"1 2\n3\n",
"2 1\n3 4\n",
"6 1\n1 4 4 4 2 2\n",
"4 5\n20 21 22 25\n",
"9 2\n8 2 9 4 7 5 2 4 9\n",
"2 2\n2 4\n",
"9 2\n2 8 4 2 5 7 1 8 10\n",
"10 1\n2 3 5 2 7 4 7 7 4 2\n",
"2 3\n1000000000 1000000000\n",
"2 1\n160 150\n",
"7 1\n8 6 10 10 1 5 8\n",
"2 3\n7 7... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Kevin and Nicky Sun have invented a new game called Lieges of Legendre. In this game, two players take turns modifying the game state with Kevin moving first. Initially, the game is s... |
626_A. Robot Sequence_26539 | Calvin the robot lies in an infinite rectangular grid. Calvin's source code contains a list of n commands, each either 'U', 'R', 'D', or 'L' — instructions to move a single square up, right, down, or left, respectively. How many ways can Calvin execute a non-empty contiguous substrings of commands and return to the sam... | import io
import sys
import time
import random
start = time.clock()
#~ test = '''6
#~ URLLDR'''
#~ test = '''7
#~ RLRLRLR'''
#~ test = '''200
#~ '''
#~ for i in range(200):
#~ test += random.choice("UDLR")
#~ print(test)
#~ test = '10 15'
#~ test = '1 1000000' #28733372
#~ test = '1 11' #55
#~ test = '1 21' #130
... | {
"input": [
"6\nURLLDR\n",
"4\nDLUU\n",
"7\nRLRLRLR\n",
"197\nDUUDUDUDUDUUDUUDUUUDDDDUUUDUUUDUUUUUDUUUDDUDDDUUDUDDDUUDDUUUUUUUDUDDDDDUUUUUDDDDDDUUUUDDUDDUDDDUDUUUDUUDUDUDUUUDUDDDDUUDDUDDDDUDDDUDUUUDUUDUUUDDDDUUUDUUDDUUUUUDDDDUUDUUDDDDUDDUUDUUUDDDDUDUUUDDDUUDU\n",
"20\nLDURLDURRLRUDLRRUDLU\n",
... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Calvin the robot lies in an infinite rectangular grid. Calvin's source code contains a list of n commands, each either 'U', 'R', 'D', or 'L' — instructions to move a single square up,... |
675_B. Restoring Painting_26543 | Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was stolen while he was on duty. He doesn't want to be fired, so he has to quickly restore the painting. He remembers some facts about it.
* The painting is a square 3 × 3, each cell contains a single integer from 1 to n, an... | n,a,b,c,d=map(int,input().split())
count=0
for x in range(1,n+1):
y=x+b-c
z=x+a-d
w=y+a-d
if (y>=1 and y<=n) and(z>=1 and z<=n) and (w>=1 and w<=n):
count+=1
print(count*n)
| {
"input": [
"3 3 1 2 3\n",
"2 1 1 1 2\n",
"100000 64022 49026 55956 88430\n",
"10 9 10 8 10\n",
"100000 100000 1 1 1\n",
"5 1 1 5 5\n",
"100000 1 100000 100000 100000\n",
"100000 87223 66046 27153 40823\n",
"100000 100000 1 100000 100000\n",
"100000 83958 32567 91083 95317\n",... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Vasya works as a watchman in the gallery. Unfortunately, one of the most expensive paintings was stolen while he was on duty. He doesn't want to be fired, so he has to quickly restore... |
699_C. Vacations_26547 | Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest was carried out in the Internet on that day. For the i-th day there are four options:
1. on this day the gym is closed and... | size = int(input())
days = [int(a) for a in input().split()]
daysoff = 0
yesterday = 0
if days[0] == 0:
daysoff += 1
yesterday = 0
elif days[0] == 3:
yesterday = 0
else:
yesterday = days[0]
for i in range(1, size):
if days[i] == 0:
yesterday = 0
daysoff += 1
elif days[i] == y... | {
"input": [
"4\n1 3 2 0\n",
"7\n1 3 3 2 1 2 3\n",
"2\n2 2\n",
"70\n1 0 0 0 1 0 1 0 0 0 1 1 0 1 0 0 1 1 1 0 1 1 0 0 1 1 1 3 1 1 0 1 2 0 2 1 0 0 0 1 1 1 1 1 0 0 1 0 0 0 1 1 1 3 0 0 1 0 0 0 1 0 0 0 0 0 1 0 1 1\n",
"25\n2 3 1 3 3 2 1 3 3 3 1 3 3 1 3 2 3 3 1 3 3 3 2 3 3\n",
"30\n1 2 3 2 2 3 3 3 3 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whethe... |
71_E. Nuclear Fusion_26551 | There is the following puzzle popular among nuclear physicists.
A reactor contains a set of n atoms of some chemical elements. We shall understand the phrase "atomic number" as the number of this atom's element in the periodic table of the chemical elements.
You are allowed to take any two different atoms and fuse a ... | numbersDict = {
"1": "H",
"2": "He",
"3": "Li",
"4": "Be",
"5": "B",
"6": "C",
"7": "N",
"8": "O",
"9": "F",
"10": "Ne",
"11": "Na",
"12": "Mg",
"13": "Al",
"14": "Si",
"15": "P",
"16": "S",
"17": "Cl",
"18": "Ar",
"19": "K",
"20": "Ca",
"21": "Sc",
"22": "Ti",
"23": "V",
"24": "Cr",
"25": "Mn",
"26": "Fe",
"27": "Co",... | {
"input": [
"2 2\nBk Fm\nCf Es\n",
"2 1\nH H\nHe\n",
"10 3\nMn Co Li Mg C P F Zn Sc K\nSn Pt Y\n",
"17 7\nH H H H H H H H H H H H H H H H B\nLi Li Li Li Li Li Li\n",
"16 9\nB Zn Mn Li Li B Na Mg Sc Ne Mn Cr V N Ne Cr\nB V Cd Sc Al Fm B Cl C\n",
"17 13\nHe Ru Cu Sr P Br Ar Cr Na In Kr In Ca K ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
There is the following puzzle popular among nuclear physicists.
A reactor contains a set of n atoms of some chemical elements. We shall understand the phrase "atomic number" as the n... |
741_B. Arpa's weak amphitheater and Mehrdad's valuable Hoses_26555 | Just to remind, girls in Arpa's land are really nice.
Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight wi and some beauty bi. Also each Hos may have some friends. Hoses are divided in some friendship groups. Two Hoses x and y are in the same friendship group if and only if... | n, m, k = map(int, input().split())
a = map(int, input().split())
b = map(int, input().split())
ab = [(0, 0)] + list(zip(a, b))
l = list(range(n + 1))
def f(x):
if x == l[x]:
return x
l[x] = f(l[x])
return l[x]
for i in range(m):
x, y = map(int, input().split())
x, y = f(x), f(y)
... | {
"input": [
"3 1 5\n3 2 5\n2 4 2\n1 2\n",
"4 2 11\n2 4 6 6\n6 4 2 1\n1 2\n2 3\n",
"10 5 100\n78 89 3 2 95 96 87 11 13 60\n694709 921 799687 428614 221900 536251 117674 36488 219932 771513\n4 5\n3 4\n6 2\n2 3\n8 3\n",
"10 5 100\n64 90 3 94 96 97 52 54 82 31\n796554 444893 214351 43810 684158 555762 68... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Just to remind, girls in Arpa's land are really nice.
Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weight wi and some beauty bi. Also each ... |
765_A. Neverending competitions_26559 | There are literally dozens of snooker competitions held each year, and team Jinotega tries to attend them all (for some reason they prefer name "snookah")! When a competition takes place somewhere far from their hometown, Ivan, Artsem and Konstantin take a flight to the contest and back.
Jinotega's best friends, team ... | import sys,math
from collections import deque
#input = sys.stdin.buffer.readline
def solve():
return;
# for _ in range(int(input())):
# solve()
n = int(input())
h = input()
cnt=0
for i in range(n):
s = input()
if h==s[:3] or h==s[-3:]:
cnt+=1
if cnt%2==0:
print("home")
else:
print("contest")
| {
"input": [
"3\nSVO\nSVO->HKT\nHKT->SVO\nSVO->RAP\n",
"4\nSVO\nSVO->CDG\nLHR->SVO\nSVO->LHR\nCDG->SVO\n",
"1\nESJ\nESJ->TSJ\n",
"1\nAAK\nAAK->ABA\n",
"3\nZIZ\nDWJ->ZIZ\nZIZ->DWJ\nZIZ->DWJ\n",
"3\nSVO\nSVO->HKT\nHKT->SVO\nSVO->RAP\n",
"11\nFGH\nFGH->BRZ\nUBK->FGH\nQRE-... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
There are literally dozens of snooker competitions held each year, and team Jinotega tries to attend them all (for some reason they prefer name "snookah")! When a competition takes pl... |
788_C. The Great Mixing_26563 | Sasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentration <image>. Today, on the party in honour of Sergiy of Vancouver they decided to prepare a glass of Coke with carbon dioxide concentration <image>. The drink should als... | ##
##
##
import sys
def line():
return sys.stdin.readline()
def numbers():
return list(map(int, line().split()))
def number():
return int(line())
adjlist = {}
n, k = 0, 0
mark = [False]*2010
edges = [False]*1010
# bfs for "ssph"
def bfs(s):
i = 0
frontier = [s]
while frontier:
... | {
"input": [
"400 4\n100 300 450 500\n",
"50 2\n100 25\n",
"998 2\n1 1000\n",
"995 5\n996 997 998 999 1000\n",
"917 21\n999 998 1000 997 1000 998 78 991 964 985 987 78 985 999 83 987 1000 999 999 78 83\n",
"134 6\n505 10 1 363 344 162\n",
"500 3\n499 1000 300\n",
"500 1\n1000\n",
"... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Sasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentration <image>. Today, on the party... |
834_C. The Meaningless Game_26568 | <image>
Slastyona and her loyal dog Pushok are playing a meaningless game that is indeed very interesting.
The game consists of multiple rounds. Its rules are very simple: in each round, a natural number k is chosen. Then, the one who says (or barks) it faster than the other wins the round. After that, the winner's s... | # ---------------------------iye ha aam zindegi---------------------------------------------
import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
mod = 10 ** 9 + 7
mod1 = 998244353
# ------------------------------warmup----------------------------
impor... | {
"input": [
"6\n2 4\n75 45\n8 8\n16 16\n247 994\n1000000000 1000000\n",
"1\n6 12\n",
"1\n1062961 1031\n",
"1\n16 8\n",
"1\n9907 98148649\n",
"1\n12004 18012002\n",
"1\n3 10\n",
"1\n31159 970883281\n",
"3\n1 1\n8 27\n1000 1331\n",
"1\n2 3\n",
"1\n3331 11095561\n",
"1\n3... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
<image>
Slastyona and her loyal dog Pushok are playing a meaningless game that is indeed very interesting.
The game consists of multiple rounds. Its rules are very simple: in each r... |
855_A. Tom Riddle's Diary_26572 | Harry Potter is on a mission to destroy You-Know-Who's Horcruxes. The first Horcrux that he encountered in the Chamber of Secrets is Tom Riddle's diary. The diary was with Ginny and it forced her to open the Chamber of Secrets. Harry wants to know the different people who had ever possessed the diary to make sure they ... | l = []
for _ in range(int(input())):
s = input()
if s not in l:
print('NO')
l.append(s)
else:
print('YES')
| {
"input": [
"6\ntom\nlucius\nginny\nharry\nginny\nharry\n",
"3\na\na\na\n",
"9\nliyzmbjwnzryjokufuxcqtzwworjeoxkbaqrujrhdidqdvwdfzilwszgnzglnnbogaclckfnbqovtziuhwvyrqwmskx\nliyzmbjwnzryjokufuxcqtzwworjeoxkbaqrujrhdidqdvwdfzilwszgnzglnnbogaclckfnbqovtziuhwvyrqwmskx\nliyzmbjwnzryjokufuxcqtzwworjeoxkbaqrujr... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Harry Potter is on a mission to destroy You-Know-Who's Horcruxes. The first Horcrux that he encountered in the Chamber of Secrets is Tom Riddle's diary. The diary was with Ginny and i... |
879_D. Teams Formation_26576 | This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a participant from the city ai.
Today the bus has completed m trips, each time bringing n participants. The participants were then aligned in ... | def main():
_, k, m = [int(x) for x in input().split()]
a = []
last = ("-1", 0)
a.append(last)
for ai in input().split():
if last[0] == ai:
last = (ai, last[1]+1)
a[-1] = last
else:
last = (ai, 1)
a.append(last)
if last[1] == k... | {
"input": [
"1 9 10\n1\n",
"4 2 5\n1 2 3 1\n",
"3 2 10\n1 2 1\n",
"5 3 2\n1 1 2 1 1\n",
"5 3 3\n1 2 2 1 1\n",
"10 5 1000000000\n1 1 1 2 2 1 2 2 2 2\n",
"2 4 1\n1 1\n",
"1 10 10\n1\n",
"5 2 4\n1 2 3 2 1\n",
"1 1000000000 1000000000\n100000\n",
"5 3 2\n1 1 2 1 2\n",
"10 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
This time the Berland Team Olympiad in Informatics is held in a remote city that can only be reached by one small bus. Bus has n passenger seats, seat i can be occupied only by a part... |
903_A. Hungry Student Problem_26580 | Ivan's classes at the university have just finished, and now he wants to go to the local CFK cafe and eat some fried chicken.
CFK sells chicken chunks in small and large portions. A small portion contains 3 chunks; a large one — 7 chunks. Ivan wants to eat exactly x chunks. Now he wonders whether he can buy exactly th... | t = int(input())
for i in range(0,t):
flag = 0
x = int(input())
b = 0
temp = x
while temp >= 0 :
if(temp%3 == 0):
flag = 1
break
b = b+1
temp = x-7*b
if flag == 1 :
print("YES")
else:
print("NO")
| {
"input": [
"2\n6\n5\n",
"100\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n25\n26\n27\n28\n29\n30\n31\n32\n33\n34\n35\n36\n37\n38\n39\n40\n41\n42\n43\n44\n45\n46\n47\n48\n49\n50\n51\n52\n53\n54\n55\n56\n57\n58\n59\n60\n61\n62\n63\n64\n65\n66\n67\n68\n69\n70\n71\n72\... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Ivan's classes at the university have just finished, and now he wants to go to the local CFK cafe and eat some fried chicken.
CFK sells chicken chunks in small and large portions. A ... |
925_B. Resource Distribution_26584 | One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-th server may be expressed with a single integer number c_j of artificial resource units.
In order for production to work, it is needed ... | def fin(c, x):
return (x + c - 1) // c
def ck(x, b):
r = (n, n)
for i in range(b, n):
r = min(r, (i + fin(c[i][0], x), i))
return r
def sol(r, l):
if r[0] <= n and l[0] <= n and r[1] < n and l[1] < n :
print("Yes")
print(r[0] - r[1], l[0]- l[1])
print(' '.join([str... | {
"input": [
"6 8 16\n3 5 2 9 8 7\n",
"4 20 32\n21 11 11 12\n",
"4 11 32\n5 5 16 16\n",
"5 12 20\n7 8 4 11 9\n",
"2 1 1\n1 1000000\n",
"4 12 11\n4 4 6 11\n",
"15 250 200\n71 2 77 69 100 53 54 40 73 32 82 58 24 82 41\n",
"2 1 1\n1000000000 1000000000\n",
"2 1 1\n1 1\n",
"6 8 16\... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-... |
954_C. Matrix Walk_26588 | There is a matrix A of size x × y filled with integers. For every <image>, <image> Ai, j = y(i - 1) + j. Obviously, every integer from [1..xy] occurs exactly once in this matrix.
You have traversed some path in this matrix. Your path can be described as a sequence of visited cells a1, a2, ..., an denoting that you st... | def main():
int(input())
a = list(map(int, input().split()))
ds = [i - j for i, j in zip(a[1:], a)]
dss = set(abs(x) for x in ds)
if 0 in dss:
return False
try:
dss.remove(1)
except KeyError:
pass
if len(dss) > 1:
return False
if not dss:
retu... | {
"input": [
"6\n1 2 1 2 5 3\n",
"2\n1 10\n",
"8\n1 2 3 6 9 8 5 2\n",
"5\n3 4 5 6 2\n",
"2\n999999999 1000000000\n",
"7\n550 555 554 553 554 555 560\n",
"3\n9 7 5\n",
"2\n999999998 1000000000\n",
"2\n500000000 1000000000\n",
"2\n1 10\n",
"23\n92 34 58 40 76 3 38 66 76 23 85... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
There is a matrix A of size x × y filled with integers. For every <image>, <image> Ai, j = y(i - 1) + j. Obviously, every integer from [1..xy] occurs exactly once in this matrix.
Yo... |
980_B. Marlin_26592 | The city of Fishtopia can be imagined as a grid of 4 rows and an odd number of columns. It has two main villages; the first is located at the top-left cell (1,1), people who stay there love fishing at the Tuna pond at the bottom-right cell (4, n). The second village is located at (4, 1) and its people love the Salmon p... | EMPTY = "."
HOTEL = "#"
def main():
n, k = map(int, input().split())
print("YES")
print(EMPTY * n)
if k % 2 == 0:
m = k // 2
s = EMPTY + HOTEL * m + EMPTY * (n - m - 1)
print(s)
print(s)
elif k < n - 1:
s = (HOTEL * k).center(n, EMPTY)
print(s)
... | {
"input": [
"7 2\n",
"5 3\n",
"33 57\n",
"99 55\n",
"37 19\n",
"31 32\n",
"99 20\n",
"37 39\n",
"7 10\n",
"57 15\n",
"99 177\n",
"99 193\n",
"19 12\n",
"13 21\n",
"57 67\n",
"23 39\n",
"97 100\n",
"99 99\n",
"69 17\n",
"55 55\n",
"39... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
The city of Fishtopia can be imagined as a grid of 4 rows and an odd number of columns. It has two main villages; the first is located at the top-left cell (1,1), people who stay ther... |
9_B. Running Student_26596 | And again a misfortune fell on Poor Student. He is being late for an exam.
Having rushed to a bus stop that is in point (0, 0), he got on a minibus and they drove along a straight line, parallel to axis OX, in the direction of increasing x.
Poor Student knows the following:
* during one run the minibus makes n st... | # -*- coding: utf - 8 -*-
"""""""""""""""""""""""""""""""""""""""""""""
| author: mr.math - Hakimov Rahimjon |
| e-mail: mr.math0777@gmail.com |
| created: 27.01.2018 9:50 |
"""""""""""""""""""""""""""""""""""""""""""""
# inp = open("input.txt", "r"); input = inp.readline; out = open... | {
"input": [
"4 5 2\n0 2 4 6\n4 1\n",
"2 1 1\n0 100000\n100000 100000\n",
"2 1 1\n0 100000\n-100000 -100000\n",
"55 11 44\n0 3343 3387 3470 3825 3832 3971 4026 4043 4389 4492 4886 5015 5084 5161 5436 5595 5616 5677 5987 6251 6312 6369 6469 6487 6493 6507 6641 6928 7067 7159 7280 7303 7385 7387 7465 75... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
And again a misfortune fell on Poor Student. He is being late for an exam.
Having rushed to a bus stop that is in point (0, 0), he got on a minibus and they drove along a straight li... |
p02545 ACL Contest 1 - Center Rearranging_26608 | Given are integer sequences A and B of length 3N. Each of these two sequences contains three copies of each of 1, 2, \dots, N. In other words, A and B are both arrangements of (1, 1, 1, 2, 2, 2, \dots, N, N, N).
Tak can perform the following operation to the sequence A arbitrarily many times:
* Pick a value from 1, 2... | import sys
readline = sys.stdin.buffer.readline
class E:
def __init__(self,to,nx):
self.to=to
self.nx=nx
class Graph:
def __init__(self,n):
self.n=n
self.head=[None]*n
def ae(self,a,b):
head=self.head
head[a]=E(b,head[a])
#head[b]=E(a,head[b])
return head[a]
def scc(g):
n=g.n
cur=g.head
last=... | {
"input": [
"8\n3 6 7 5 4 8 4 1 1 3 8 7 3 8 2 4 7 5 2 2 6 5 6 1\n7 5 8 1 3 6 7 5 4 8 1 3 3 8 2 4 2 6 5 6 1 4 7 2",
"3\n1 1 1 2 2 2 3 3 3\n1 1 1 2 2 2 3 3 3",
"3\n2 3 3 1 1 1 2 2 3\n3 2 2 1 1 1 3 3 2",
"3\n2 3 1 1 3 2 2 1 3\n1 2 2 3 1 2 3 1 3",
"3\n2 3 3 1 2 1 2 1 3\n3 2 2 1 1 1 3 3 2",
"3\n1 ... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Given are integer sequences A and B of length 3N. Each of these two sequences contains three copies of each of 1, 2, \dots, N. In other words, A and B are both arrangements of (1, 1, ... |
p02676 AtCoder Beginner Contest 168 - ... (Triple Dots)_26611 | We have a string S consisting of lowercase English letters.
If the length of S is at most K, print S without change.
If the length of S exceeds K, extract the first K characters in S, append `...` to the end of them, and print the result.
Constraints
* K is an integer between 1 and 100 (inclusive).
* S is a string ... | K = int(input())
S = input()
print(S[:K] + "...") if len(S) > K else print(S)
| {
"input": [
"7\nnikoandsolstice",
"40\nferelibenterhominesidquodvoluntcredunt",
"7\necitslosdnaokin",
"40\nferelibenterhominesidquodvomuntcredunt",
"7\nnikoandrolstice",
"40\nferelibenterhominesidquodvonuntcredunt",
"7\noikoandrolstice",
"40\nferelibenterhominesidquodvonuntcreudnt",
... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
We have a string S consisting of lowercase English letters.
If the length of S is at most K, print S without change.
If the length of S exceeds K, extract the first K characters in ... |
p02804 AtCoder Beginner Contest 151 - Max-Min Sums_26615 | For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish elements with different indices even when their values are the same, there are {}_N C_K ways to make this choice. Find the sum of f(S) ove... | N,K = map(int,input().split())
A = list(map(int,input().split()))
mod = 10**9+7
A = sorted(A)
bikkuri = [1]
for i in range(1,N+1):
bikkuri.append((bikkuri[-1]*i)%mod)
bikkuri2 = [1]
for i in range(1,N+1):
bikkuri2.append(pow(bikkuri[i],mod-2,mod))
def comb(n,r):
if n<r:
return 0
else:
... | {
"input": [
"3 1\n1 1 1",
"4 2\n1 1 3 4",
"10 6\n1000000000 1000000000 1000000000 1000000000 1000000000 0 0 0 0 0",
"6 3\n10 10 10 -10 -10 -10",
"3 1\n1 1 2",
"4 2\n1 1 2 4",
"10 5\n1000000000 1000000000 1000000000 1000000000 1000000000 0 0 0 0 0",
"6 4\n10 10 10 -10 -10 -10",
"4 ... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
For a finite set of integers X, let f(X)=\max X - \min X.
Given are N integers A_1,...,A_N.
We will choose K of them and let S be the set of the integers chosen. If we distinguish e... |
p02940 AtCoder Grand Contest 037 - RGB Balls_26618 | We have 3N colored balls with IDs from 1 to 3N. A string S of length 3N represents the colors of the balls. The color of Ball i is red if S_i is `R`, green if S_i is `G`, and blue if S_i is `B`. There are N red balls, N green balls, and N blue balls.
Takahashi will distribute these 3N balls to N people so that each pe... | MOD = 998244353
N = int(input())
Ss = input()
convs = {'R': 0, 'G': 1, 'B': 2}
num0 = N
num1s = [0] * 3
num2s = [0] * 3
ans = 1
for S in Ss:
c = convs[S]
if num2s[c]:
ans *= num2s[c]
num2s[c] -= 1
else:
for i in range(3):
if i == c: continue
if num1s[i]:
... | {
"input": [
"3\nRRRGGGBBB",
"5\nBBRGRRGRGGRBBGB",
"3\nBBBGGGRRR",
"3\nRRRBGGBGB",
"3\nBRRGGGRBB",
"5\nBGRGRRBRGGRBBGB",
"3\nBGRGGRRBB",
"5\nBGBBRGGRGRRGRBB",
"3\nRGRBGRBGB",
"5\nBGRGRRBBGGRBRGB",
"5\nBRRBRGGBBGRGRGB",
"5\nBRRBRBGBGGRGRGB",
"3\nBBBGGRRGR",
"5\nB... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
We have 3N colored balls with IDs from 1 to 3N. A string S of length 3N represents the colors of the balls. The color of Ball i is red if S_i is `R`, green if S_i is `G`, and blue if ... |
p03077 AtCoder Beginner Contest 123 - Five Transportations_26622 | In 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!
There are five means of transport in this empire:
* Train: travels from City 1 to 2 in one minute. A train can occupy at most A people.
* Bus: travels from City 2 to 3 in one minute. A bus can occupy a... | n = int(input())
l = [int(input()) for _ in range(5)]
print(-(-n//min(l))+4) | {
"input": [
"5\n3\n2\n4\n3\n5",
"10\n123\n123\n123\n123\n123",
"10000000007\n2\n3\n5\n7\n11",
"5\n3\n2\n4\n3\n6",
"10\n123\n219\n123\n123\n123",
"10000000007\n2\n3\n5\n3\n11",
"10000000007\n2\n3\n1\n3\n11",
"10\n123\n633\n27\n9\n123",
"5\n3\n2\n4\n1\n6",
"10\n31\n457\n1\n123\n... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
In 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City 1, 2, 3, 4, 5, 6)!
There are five means of transport in this empire:
* Train: trave... |
p03219 AtCoder Beginner Contest 113 - Discount Fare_26626 | There is a train going from Station A to Station B that costs X yen (the currency of Japan).
Also, there is a bus going from Station B to Station C that costs Y yen.
Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then trav... | L = list(map(int,input().split()))
print(L[0]+L[1]//2) | {
"input": [
"81 58",
"4 54",
"35 58",
"3 54",
"68 58",
"3 34",
"88 58",
"5 34",
"88 51",
"5 0",
"88 27",
"5 -1",
"51 11",
"51 1",
"2 -2",
"95 1",
"2 -4",
"54 1",
"4 -1",
"47 0",
"7 -1",
"47 -1",
"10 -1",
"77 1",
"15 -... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
There is a train going from Station A to Station B that costs X yen (the currency of Japan).
Also, there is a bus going from Station B to Station C that costs Y yen.
Joisino got a s... |
p03691 AtCoder Grand Contest 016 - Poor Turkeys_26632 | There are N turkeys. We number them from 1 through N.
M men will visit here one by one. The i-th man to visit will take the following action:
* If both turkeys x_i and y_i are alive: selects one of them with equal probability, then eats it.
* If either turkey x_i or y_i is alive (but not both): eats the alive one.
* ... | import sys
from itertools import combinations
def solve(n, pairs):
survivors = {v: {v} for v in range(1, n + 1)}
for x, y in reversed(pairs):
for v, srv in survivors.copy().items():
if x in srv:
if y in srv:
del survivors[v]
else:
... | {
"input": [
"3 2\n1 2\n1 2",
"4 3\n1 2\n3 4\n2 3",
"10 10\n8 9\n2 8\n4 6\n4 9\n7 8\n2 8\n1 8\n3 4\n3 4\n2 7",
"3 1\n1 2",
"4 1\n1 2\n3 4\n2 3",
"10 10\n8 9\n2 8\n4 6\n4 9\n7 8\n2 9\n1 8\n3 4\n3 4\n2 7",
"3 2\n1 2\n2 2",
"4 3\n1 2\n3 4\n2 2",
"6 1\n1 2",
"1 1\n1 2\n3 4\n2 3",
... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
There are N turkeys. We number them from 1 through N.
M men will visit here one by one. The i-th man to visit will take the following action:
* If both turkeys x_i and y_i are alive... |
p03844 AtCoder Beginner Contest 050 - Addition and Subtraction Easy_26636 | Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Constraints
* 1≦A,B≦10^9
* op is either `+` or `-`.
Input
The input is given from Standard Input in the following format:
A op B
Outpu... | a,b,c=input().split();print(int(a)+int(c)if b=='+'else int(a)-int(c)) | {
"input": [
"1 + 2",
"5 - 7",
"0 + 2",
"5 - 13",
"-1 + 2",
"5 - 14",
"1 - 14",
"1 - 1",
"1 - 7",
"-1 + 0",
"5 - 20",
"2 - 7",
"1 - 4",
"3 - 7",
"9 - 4",
"0 - 7",
"7 - 4",
"7 - 3",
"0 + -2",
"5 - 23",
"3 - 14",
"1 - 27",
"5 - ... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Joisino wants to evaluate the formula "A op B". Here, A and B are integers, and the binary operator op is either `+` or `-`. Your task is to evaluate the formula instead of her.
Cons... |
p04011 AtCoder Beginner Contest 044 - Tak and Hotels (ABC Edit)_26640 | There is a hotel with the following accommodation fee:
* X yen (the currency of Japan) per night, for the first K nights
* Y yen per night, for the (K+1)-th and subsequent nights
Tak is staying at this hotel for N consecutive nights. Find his total accommodation fee.
Constraints
* 1 \leq N, K \leq 10000
* 1 \leq ... | a,b,c,d=[int(input()) for i in range(4)]
if a<=b:
print(a*c)
else:
print(b*c+(a-b)*d)
| {
"input": [
"2\n3\n10000\n9000",
"5\n3\n10000\n9000",
"2\n3\n10000\n2613",
"5\n3\n10010\n9000",
"2\n3\n10010\n2613",
"5\n3\n10010\n10766",
"5\n3\n10010\n18306",
"2\n3\n10110\n4944",
"5\n6\n10010\n18306",
"5\n6\n00010\n18306",
"2\n0\n10110\n4944",
"2\n-1\n10110\n4944",
... | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
There is a hotel with the following accommodation fee:
* X yen (the currency of Japan) per night, for the first K nights
* Y yen per night, for the (K+1)-th and subsequent nights
... |
p00097 Sum of Integers II_26644 | Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same number cannot be used in one combination. For example, if n is 3 and s is 6, the combination of the three numbers totaling 6 is
1 + 2 + 3 = ... | dp = [[0 for _ in range(1001)] for _ in range(10)]
dp[1][0] = dp[0][0] = 1
for now in range(1, 101):
for used in range(9, 0, -1):
dpu = dp[used]
dpu_1 = dp[used - 1]
for s in range(now, 1001):
dpu[s] = dpu_1[s - now] + dpu[s]
while True:
n, s = map(int, input().split())
if not n:
break
p... | {
"input": [
"3 6\n3 1\n0 0",
"3 12\n3 1\n0 0",
"5 12\n3 0\n0 0",
"5 23\n3 0\n0 0",
"5 28\n3 0\n0 0",
"6 6\n3 1\n0 0",
"3 12\n3 3\n0 0",
"6 23\n3 0\n0 0",
"3 11\n3 3\n0 0",
"3 19\n3 -1\n0 0",
"6 19\n3 0\n0 0",
"3 11\n3 2\n0 0",
"6 26\n3 0\n0 0",
"3 22\n3 1\n0 0"... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Write a program that extracts n different numbers from the numbers 0 to 100 and outputs the number of combinations that add up to s. Each n number is from 0 to 100, and the same numbe... |
p00229 Big Hit !_26648 | Ataru Oafoot of Aizu Gakuen University High School decided to play with a slot machine.
When you insert a medal on this machine, three reels will start spinning and each reel will stop automatically. In a normal game (normal game), 3 medals are inserted, and when the symbols are aligned, the following medals are obtai... | while 1:
b, r, g, c, s, t = map(int, input().split())
if t == 0:
break
ans = 100
ans += (15 - 2) * (5*b) + (15 - 3) * b
t -= 6*b
ans += (15 - 2) * (3*r) + (15 - 3) * r
t -= 4*r
ans += (7 - 3) * g
t -= g
ans += (2 - 3) * c
t -= c
t -= s
ans += (0 - 3) * t... | {
"input": [
"3 2 30 3 26 226\n9 0 18 3 20 118\n5 5 12 2 15 203\n7 4 19 2 22 197\n7 4 24 4 17 209\n0 0 0 0 0 0",
"3 2 30 3 26 226\n9 0 18 3 20 118\n5 5 12 0 15 203\n7 4 19 2 22 197\n7 4 24 4 17 209\n0 0 0 0 0 0",
"3 2 30 3 41 226\n9 0 18 3 20 118\n5 5 12 0 15 203\n7 4 19 2 22 197\n7 4 24 4 17 209\n0 0 0 0... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Ataru Oafoot of Aizu Gakuen University High School decided to play with a slot machine.
When you insert a medal on this machine, three reels will start spinning and each reel will st... |
p00391 Treasure Map_26651 | Mr. Kobou found a bundle of old paper when he was cleaning his family home. On each paper, two series of numbers are written. Strange as it appeared to him, Mr. Kobou further went through the storehouse and found out a note his ancestor left. According to it, the bundle of paper is a treasure map, in which the two sequ... | import sys,heapq
_,a,q=[[-int(e) for e in sys.stdin.readline().split() if e!='0'] for _ in[0]*3]
heapq.heapify(q)
for e in a:
t=[]
for _ in [0]*-e:
if not q:print(0);exit()
if q[0]!=-1:heapq.heappush(t,q[0]+1)
heapq.heappop(q)
while t:heapq.heappush(q,t[0]);heapq.heappop(t)
print(int(not q))
| {
"input": [
"5 5\n3 2 3 0 0\n4 2 0 0 2",
"5 4\n0 2 2 1 1\n1 1 1 3",
"5 3\n3 2 3 0 0\n4 2 0 0 2",
"4 4\n0 1 1 1 1\n1 0 1 4",
"5 3\n3 2 5 0 0\n4 2 0 0 2",
"4 3\n3 2 5 0 0\n4 2 0 0 2",
"4 3\n3 2 5 0 0\n4 2 0 0 4",
"4 3\n3 2 6 0 0\n4 2 0 0 4",
"4 3\n3 1 6 0 0\n4 2 0 0 4",
"5 5\n3 ... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Mr. Kobou found a bundle of old paper when he was cleaning his family home. On each paper, two series of numbers are written. Strange as it appeared to him, Mr. Kobou further went thr... |
p00607 Emacs-like Editor_26654 | Emacs is a text editor which is widely used by many programmers.
The advantage of Emacs is that we can move a cursor without arrow keys and the mice. For example, the cursor can be moved right, left, down, and up by pushing f, b, n, p with the Control Key respectively. In addition, cut-and-paste can be performed witho... | class Editer:
def __init__(self, text):
# カーソルの位置
self.row = 0 #行
self.col = 0 #列
# 編集中のテキスト
self.text = [list(t) + ['\n'] for t in text]
# バッファー
self.buffer = []
def row_head(self):
return 0
def row_tail(self):
return len(self.text)... | {
"input": [
"hyo\nni\nEND_OF_TEXT\nf\nd\nf\nf\nk\np\np\ne\ny\na\nk\ny\ny\nn\ny\n-",
"oyh\nni\nEND_OF_TEXT\nf\nd\nf\nf\nk\np\np\ne\ny\na\nk\ny\ny\nn\ny\n-",
"hyo\nnh\nEND_OF_TEXT\nf\nd\nf\nf\nk\np\np\ne\ny\na\nk\ny\ny\nn\ny\n-",
"hyo\nni\nEND_OF_TEXT\nf\nd\ng\nf\nk\np\np\ne\ny\na\nk\ny\ny\nn\ny\n-",
... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Emacs is a text editor which is widely used by many programmers.
The advantage of Emacs is that we can move a cursor without arrow keys and the mice. For example, the cursor can be m... |
p00744 Cards_26658 | There are many blue cards and red cards on the table. For each card, an integer number greater than 1 is printed on its face. The same number may be printed on several cards.
A blue card and a red card can be paired when both of the numbers printed on them have a common divisor greater than 1. There may be more than o... | import collections
import math
class Dinic:
"""Dinic Algorithm: find max-flow
complexity: O(EV^2)
used in GRL6A(AOJ)
"""
class edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, V, E, source, sink):
""" V: th... | {
"input": [
"4 3\n2 6 6 15\n2 3 5\n2 3\n4 9\n8 16 32\n4 2\n4 9 11 13\n5 7\n5 5\n2 3 5 1001 1001\n7 11 13 30 30\n10 10\n2 3 5 7 9 11 13 15 17 29\n4 6 10 14 18 22 26 30 34 38\n20 20\n195 144 903 63 137 513 44 626 75 473\n876 421 568 519 755 840 374 368 570 872\n363 650 155 265 64 26 426 391 15 421\n373 984 564 54 ... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
There are many blue cards and red cards on the table. For each card, an integer number greater than 1 is printed on its face. The same number may be printed on several cards.
A blue ... |
p00883 Infected Land_26661 | The earth is under an attack of a deadly virus. Luckily, prompt actions of the Ministry of Health against this emergency successfully confined the spread of the infection within a square grid of areas. Recently, public health specialists found an interesting pattern with regard to the transition of infected areas. At e... | from collections import deque
import sys
readline = sys.stdin.readline
write = sys.stdout.write
dd0 = ((-1, 0), (-1, -1), (0, -1), (1, -1), (1, 0), (1, 1), (0, 1), (-1, 1))
DD = []
for k in range(6):
ddk = []
for y in range(k):
for x in range(k):
v = 0
for dx, dy in dd0:
... | {
"input": [
"3\n...\n.@.\n...\n3\n.##\n.#.\n@##\n3\n##.\n#..\n@..\n5\n....@\n##...\n#....\n...#.\n##.##\n5\n#...#\n...#.\n#....\n...##\n..@..\n5\n#....\n.....\n.....\n.....\n..@..\n5\n#..#.\n#.#.#\n.#.#.\n....#\n.#@##\n5\n..##.\n..#..\n#....\n#....\n.#@..\n0",
"3\n...\n.@.\n...\n3\n.##\n.#.\n@##\n3\n.\n..\n@... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
The earth is under an attack of a deadly virus. Luckily, prompt actions of the Ministry of Health against this emergency successfully confined the spread of the infection within a squ... |
p01285 Find the Point_26667 | We understand that reading English is a great pain to many of you. So we’ll keep this problem statememt simple. Write a program that reports the point equally distant from a set of lines given as the input. In case of no solutions or multiple solutions, your program should report as such.
Input
The input consists o... | import sys
readline = sys.stdin.readline
write = sys.stdout.write
EPS = 1e-9
def line_cross_point(P1, P2, Q1, Q2):
x0, y0 = P1; x1, y1 = P2
x2, y2 = Q1; x3, y3 = Q2
dx0 = x1 - x0; dy0 = y1 - y0
dx1 = x3 - x2; dy1 = y3 - y2
s = (y0-y2)*dx1 - (x0-x2)*dy1
sm = dx0*dy1 - dy0*dx1
if -EPS < sm ... | {
"input": [
"2\n-35 -35 100 100\n-49 49 2000 -2000\n4\n0 0 0 3\n0 0 3 0\n0 3 3 3\n3 0 3 3\n4\n0 3 -4 6\n3 0 6 -4\n2 3 6 6\n-1 2 -4 6\n0",
"2\n-35 -35 100 100\n-49 49 2000 -2000\n4\n0 0 0 3\n0 0 3 0\n0 3 3 3\n6 0 3 3\n4\n0 3 -4 6\n3 0 6 -4\n2 3 6 6\n-1 2 -4 6\n0",
"2\n-35 -35 100 100\n-49 49 1588 -2000\n4... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
We understand that reading English is a great pain to many of you. So we’ll keep this problem statememt simple. Write a program that reports the point equally distant from a set of li... |
p01767 RUPC_26673 | Problem statement
A programming contest will be held in the Russian Federation. The contest has N questions and has M participants. Question i has a score a_i, and it is known that participant j's ability is b_j. For problem i and participant j, participant j can always solve problem i if a_i ≤ b_j and only then. The ... | import bisect
n=int(input())
a=sorted(list(map(int,input().split())))
d=[0]*(n+1)
for i in range(1,n+1):d[i]=d[i-1]+a[i-1]
m=int(input())
b,c=[list(map(int,input().split())) for _ in [0,0]]
for i in range(m):
p=bisect.bisect_right(a,b[i])
print(['Yes','No'][d[p]<c[i]]) | {
"input": [
"6\n1 2 1 3 4 5\n7\n1 3 4 5 3 1 0\n2 4 5 3 4 5 3",
"6\n1 2 1 3 4 5\n7\n1 3 4 5 3 1 0\n2 8 5 3 4 5 3",
"6\n1 2 1 3 4 5\n7\n1 3 4 10 3 1 0\n2 4 5 3 4 5 3",
"6\n1 2 1 5 4 5\n7\n1 3 4 7 3 1 0\n2 8 5 3 7 5 3",
"6\n1 2 2 5 4 5\n7\n1 3 4 7 3 1 0\n2 8 5 3 7 5 3",
"6\n2 0 1 3 3 5\n7\n1 1 4... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Problem statement
A programming contest will be held in the Russian Federation. The contest has N questions and has M participants. Question i has a score a_i, and it is known that p... |
p01901 Suntan_26676 | D: Sunburn-Suntan-
story
Aizunyan is a second-year student who belongs to the programming contest club of Wakagamatsu High School, commonly known as the Prokon club. Cute like an angel. Aizu Nyan is planning to participate in this summer festival, so I made a schedule for the band to go to listen to. I'm worried abou... | # AOJ 2801: Suntan
# Python3 2018.7.11 bal4u
from bisect import bisect_left
T, N = int(input()), int(input())
a, s, t = [0], [0], [0]
for i in range(N):
_s, _t = map(int, input().split())
s.append(_s)
t.append(_t)
a.append(a[-1]+_t-_s)
s.append(1<<62)
t.append(1<<62)
ans = 0
k = bisect_left(t, T, 0)-1
for i in ra... | {
"input": [
"20\n1\n0 10",
"20\n1\n1 10",
"20\n1\n0 7",
"20\n1\n2 10",
"20\n1\n3 7",
"20\n1\n0 19",
"20\n1\n0 12",
"20\n1\n2 7",
"20\n1\n4 10",
"20\n1\n0 28",
"20\n0\n0 12",
"20\n1\n0 3",
"20\n1\n4 6",
"20\n1\n1 15",
"20\n1\n-1 12",
"20\n1\n6 7",
"2... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
D: Sunburn-Suntan-
story
Aizunyan is a second-year student who belongs to the programming contest club of Wakagamatsu High School, commonly known as the Prokon club. Cute like an an... |
p02038 Tanuki and Fox_26680 | problem
There is a mysterious device $ M $, and if you put Tanuki and Fox in this device, one animal will come out from the device (hereinafter, Tanuki will be $ T $ and Fox will be $ F $).
$ M (x, y) $ represents an animal that came out by putting animals in the device $ M $ in the order of $ x, y $.
As a result of... | from functools import reduce
def M(x, y):
if x == 'T' and y == 'T':
return 'T'
elif x == 'T' and y == 'F':
return 'F'
elif x == 'F' and y == 'T':
return 'T'
else:
return 'T'
_ = input()
P = input().split()
print(reduce(M, P))
| {
"input": [
"3\nF T T",
"3\nF S T",
"3\nF R T",
"3\nG S T",
"3\nG R T",
"3\nH R T",
"3\nF U T",
"3\nE S T",
"3\nE T T",
"3\nD T T",
"3\nI R T",
"3\nG Q T",
"3\nE U T",
"3\nE R T",
"3\nD S T",
"3\nE V T",
"3\nF Q T",
"3\nE W T",
"3\nD V T",
... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
problem
There is a mysterious device $ M $, and if you put Tanuki and Fox in this device, one animal will come out from the device (hereinafter, Tanuki will be $ T $ and Fox will be ... |
p02182 Spot The Difference_26683 | A: Find the difference
problem
Given rectangular boards A and B with N squares vertically and M squares horizontally. For each board, each square is painted white or black.
The color of the square in the i-th row and j-th column of the board X is written as C (i, j, X).
Count how many pairs of integers (i, j) meet ... | N, M = map(int, input().split())
table1 = ''
table2 = ''
for i in range(2 * N):
if i < N:
table1 += input()
else:
table2 += input()
count = 0
for i, j in zip(table1, table2):
if i != j:
count+=1
print(count)
| {
"input": [
"2 3\n..#\n##.\n.##\n#..",
"2 3\n..\"\n##.\n.##\n#..",
"2 3\n..\"\n.##\n.##\n#..",
"2 3\n..#\n#\".\n.##\n$./",
"2 1\n..\"\n.##\n.##\n#./",
"2 3\n..#\n#\".\n##.\n$./",
"0 3\n..#\n.\"#\n##.\n$./",
"3 3\n#..\n.#\"\n##.\n$./",
"2 3\n.#.\n##.\n##.\n#..",
"4 3\n..\"\n##.... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
A: Find the difference
problem
Given rectangular boards A and B with N squares vertically and M squares horizontally. For each board, each square is painted white or black.
The col... |
p02324 Chinese Postman Problem_26687 | For a given weighted undirected graph G(V, E), find the distance of the shortest route that meets the following criteria:
* It is a closed cycle where it ends at the same point it starts.
* The route must go through every edge at least once.
Constraints
* 2 ≤ |V| ≤ 15
* 0 ≤ |E| ≤ 1,000
* 0 ≤ di ≤ 1,000
* si ≠ ti
* T... | import sys
f_i = sys.stdin
V, E = map(int, f_i.readline().split())
# adjacency matrix
no_edge = float("inf")
adj = [[no_edge] * V for i in range(V)]
for i in range(V):
adj[i][i] = 0
odd_b = 0 # bit DP to record odd vertex
ans = 0
# acceptance of input
for l_i in f_i:
s, t, d = map(int, l_i.split())
... | {
"input": [
"4 5\n0 1 1\n0 2 2\n1 3 3\n2 3 4\n1 2 5",
"4 4\n0 1 1\n0 2 2\n1 3 3\n2 3 4",
"2 3\n0 1 1\n0 1 2\n0 1 3",
"4 5\n0 1 1\n0 2 2\n1 3 3\n2 3 4\n1 3 5",
"4 4\n0 1 1\n1 2 2\n1 3 3\n2 3 4",
"6 5\n0 1 1\n0 2 2\n1 3 3\n2 3 7\n1 3 5",
"6 4\n0 1 0\n1 2 2\n1 3 3\n2 3 4",
"6 4\n0 1 0\n1... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
For a given weighted undirected graph G(V, E), find the distance of the shortest route that meets the following criteria:
* It is a closed cycle where it ends at the same point it st... |
p02469 Least Common Multiple_26691 | Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a1 a2 ... an
n is given in the first line. Then, n integers are given in the second line.
Output
Print the least common multiple of th... | from functools import reduce
import math
n = int(input())
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
numlis = [int(a) for a in input().split()]
print(lcm_list(numlis))
| {
"input": [
"4\n1 2 3 5",
"3\n3 4 6",
"4\n1 2 5 5",
"3\n3 4 3",
"4\n1 2 5 7",
"3\n3 7 3",
"4\n1 2 1 7",
"3\n3 10 3",
"3\n3 13 3",
"4\n1 2 2 11",
"3\n6 13 3",
"3\n4 13 3",
"3\n4 13 4",
"3\n4 13 5",
"3\n4 6 5",
"3\n4 6 7",
"3\n4 4 7",
"3\n5 4 7",
... | 6AIZU | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Find the least common multiple (LCM) of given n integers.
Constraints
* 2 ≤ n ≤ 10
* 1 ≤ ai ≤ 1000
* Product of given integers ai(i = 1, 2, ... n) does not exceed 231-1
Input
n
a... |
1033_C. Permutation Game_26701 | After a long day, Alice and Bob decided to play a little game. The game board consists of n cells in a straight line, numbered from 1 to n, where each cell contains a number a_i between 1 and n. Furthermore, no two cells contain the same number.
A token is placed in one of the cells. They take alternating turns of mo... | import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.wr... | {
"input": [
"15\n3 11 2 5 10 9 7 13 15 8 4 12 6 1 14\n",
"8\n3 6 5 4 2 7 1 8\n",
"7\n1 2 3 6 7 4 5\n",
"15\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15\n",
"3\n2 3 1\n",
"40\n5 40 6 27 39 37 17 34 3 30 28 13 12 8 11 10 31 4 1 16 38 22 29 35 33 23 7 9 24 14 18 26 19 21 15 36 2 20 32 25\n",
"6\n5 3... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
After a long day, Alice and Bob decided to play a little game. The game board consists of n cells in a straight line, numbered from 1 to n, where each cell contains a number a_i betwe... |
1056_A. Determine Line_26705 | Arkady's morning seemed to be straight of his nightmare. He overslept through the whole morning and, still half-asleep, got into the tram that arrived the first. Some time after, leaving the tram, he realized that he was not sure about the line number of the tram he was in.
During his ride, Arkady woke up several time... | n = int(input())
def intersect(a, b):
x = []
for i in a:
if i in b:
x.append(i)
return x
things = [input().split()[1:] for i in range(n)]
ans = things[0]
for i in range(1, n):
ans = intersect(ans, things[i])
print(" ".join(ans)) | {
"input": [
"3\n3 1 4 6\n2 1 4\n5 10 5 6 4 1\n",
"5\n1 1\n10 10 9 8 7 100 5 4 3 99 1\n5 1 2 3 4 5\n5 4 1 3 2 5\n4 10 1 5 3\n",
"2\n1 2\n1 2\n",
"6\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n",
"2\n35 35 15 89 27 51 72 54 41 58 97 18 93 86 16 44 99 92 29 2 4 26 19 61 21 81 23 10 33 76 83 46 39 32 17 14\n20 90... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Arkady's morning seemed to be straight of his nightmare. He overslept through the whole morning and, still half-asleep, got into the tram that arrived the first. Some time after, leav... |
1078_B. The Unbearable Lightness of Weights_26709 | You have a set of n weights. You know that their masses are a_1, a_2, ..., a_n grams, but you don't know which of them has which mass. You can't distinguish the weights.
However, your friend does know the mass of each weight. You can ask your friend to give you exactly k weights with the total mass m (both parameters ... | from collections import defaultdict
def calcBinomials(N):
global binom
N += 1
binom = [[0]*N for _ in range(N)]
for n in range(N):
binom[n][0] = binom[n][n] = 1
for k in range(1, n):
binom[n][k] = binom[n-1][k] + binom[n-1][k-1]
n = int(input())
a = list(map(int, input().sp... | {
"input": [
"6\n1 2 4 4 4 9\n",
"4\n1 4 2 2\n",
"50\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50\n",
"100\n50 50 50 50 50 50 87 87 87 46 46 46 96 96 96 96 94 94 94 47 47 47 42 84 86 84 84 93 49 49 49 49 8... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You have a set of n weights. You know that their masses are a_1, a_2, ..., a_n grams, but you don't know which of them has which mass. You can't distinguish the weights.
However, you... |
1099_B. Squares and Segments_26713 | Little Sofia is in fourth grade. Today in the geometry lesson she learned about segments and squares. On the way home, she decided to draw n squares in the snow with a side length of 1. For simplicity, we assume that Sofia lives on a plane and can draw only segments of length 1, parallel to the coordinate axes, with ve... | # cook your dish here
t=int(input())
l=int(t**(0.5))
if l==(t**(0.5)):
print(2*l)
else:
if abs((l**2)-t) < ((l+1)**2)-t:
print(2*l+1)
else:
print(2*(l+1)) | {
"input": [
"4\n",
"1\n",
"2\n",
"10\n",
"87341\n",
"204575811\n",
"605551861\n",
"8\n",
"776\n",
"864918\n",
"377684528\n",
"15\n",
"972\n",
"1000000000\n",
"8795795\n",
"423353776\n",
"16\n",
"9\n",
"772168\n",
"11\n",
"306495050\n... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Little Sofia is in fourth grade. Today in the geometry lesson she learned about segments and squares. On the way home, she decided to draw n squares in the snow with a side length of ... |
111_A. Petya and Inequiations_26717 | Little Petya loves inequations. Help him find n positive integers a1, a2, ..., an, such that the following two conditions are satisfied:
* a12 + a22 + ... + an2 ≥ x
* a1 + a2 + ... + an ≤ y
Input
The first line contains three space-separated integers n, x and y (1 ≤ n ≤ 105, 1 ≤ x ≤ 1012, 1 ≤ y ≤ 106).
Please d... | from math import sqrt, ceil
n, x, y = map(int, input().split())
t = 1 if x < n else ceil(sqrt(x - n + 1))
if t + n - 1 > y: print(-1)
else: print(str(t), '\n1' * (n - 1)) | {
"input": [
"5 15 15\n",
"1 99 11\n",
"2 3 2\n",
"99976 664640815001 915230\n",
"7 937519681542 968262\n",
"100000 1 1\n",
"99999 681508136225 925533\n",
"100000 1000000000000 1000000\n",
"1 1 1\n",
"10 3 8\n",
"1 860113420929 927423\n",
"4 324 77\n",
"5 37 10\n",
... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Little Petya loves inequations. Help him find n positive integers a1, a2, ..., an, such that the following two conditions are satisfied:
* a12 + a22 + ... + an2 ≥ x
* a1 + a2 + .... |
1167_F. Scalar Queries_26723 | You are given an array a_1, a_2, ..., a_n. All a_i are pairwise distinct.
Let's define function f(l, r) as follows:
* let's define array b_1, b_2, ..., b_{r - l + 1}, where b_i = a_{l - 1 + i};
* sort array b in increasing order;
* result of the function f(l, r) is ∑_{i = 1}^{r - l + 1}{b_i ⋅ i}.
Calcula... | import sys
MOD = (int)(1e9+7)
def add(a, b):
a += b
if a >= MOD: a -= MOD
return a
def mul(a, b):
return (a * b) % MOD
class fenwickTree:
def __init__(self, max_val):
self.max_val = max_val + 5
self.tree = [0] * self.max_val
def update(self, idx, value):
idx += 1
while idx < self.max_val:
self.t... | {
"input": [
"3\n123456789 214365879 987654321\n",
"4\n5 2 4 7\n",
"8\n9 1 4 10 7 5 8 6\n",
"8\n3 8 10 6 7 5 2 9\n",
"8\n9 8 4 5 6 1 7 10\n",
"8\n2 5 4 9 7 1 6 3\n",
"8\n10 8 5 1 4 2 3 6\n",
"2\n1 1000000000\n",
"8\n2 3 10 5 9 1 4 7\n",
"8\n8 5 2 3 7 1 6 10\n",
"1\n1\n",
... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You are given an array a_1, a_2, ..., a_n. All a_i are pairwise distinct.
Let's define function f(l, r) as follows:
* let's define array b_1, b_2, ..., b_{r - l + 1}, where b_i =... |
1186_A. Vus the Cossack and a Contest_26727 | Vus the [Cossack](https://en.wikipedia.org/wiki/Cossacks) holds a programming competition, in which n people participate. He decided to award them all with pens and notebooks. It is known that Vus has exactly m pens and k notebooks.
Determine whether the Cossack can reward all participants, giving each of them at leas... | def solve(n, m, k):
if min(m,k) >= n:
return "Yes"
else:
return "No"
def main():
n, m, k = list(map(int, input().split()))
print(solve(n, m, k))
if __name__ == '__main__':
main() | {
"input": [
"8 5 20\n",
"3 9 3\n",
"5 8 6\n",
"5 3 2\n",
"20 61 100\n",
"44 2 53\n",
"100 1 1\n",
"100 100 100\n",
"68 73 96\n",
"92 35 39\n",
"2 2 2\n",
"68 91 90\n",
"54 82 100\n",
"1 1 1\n",
"2 1 1\n",
"2 1 2\n",
"2 2 1\n",
"100 99 99\n",
... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Vus the [Cossack](https://en.wikipedia.org/wiki/Cossacks) holds a programming competition, in which n people participate. He decided to award them all with pens and notebooks. It is k... |
1205_A. Almost Equal_26731 | You are given integer n. You have to arrange numbers from 1 to 2n, using each of them exactly once, on the circle, so that the following condition would be satisfied:
For every n consecutive numbers on the circle write their sum on the blackboard. Then any two of written on the blackboard 2n numbers differ not more th... | n = int(input())
if n%2 == 0:
print("NO")
exit(0)
arr = []
for i in range(1, n+1):
if i%2 == 1:
arr.append(2*i-1)
else:
arr.append(2*i)
for i in range(n):
if arr[i] % 2 == 1:
arr.append(arr[i]+1)
else:
arr.append(arr[i]-1)
print("YES")
print(*arr) | {
"input": [
"4\n",
"3\n",
"11\n",
"2\n",
"6\n",
"10\n",
"65\n",
"9\n",
"4096\n",
"5\n",
"64\n",
"14786\n",
"4097\n",
"78946\n",
"100000\n",
"14785\n",
"1\n",
"1024\n",
"63\n",
"13\n",
"58\n",
"7\n",
"85\n",
"463\n",
"... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You are given integer n. You have to arrange numbers from 1 to 2n, using each of them exactly once, on the circle, so that the following condition would be satisfied:
For every n con... |
1221_E. Game With String_26735 | Alice and Bob play a game. Initially they have a string s_1, s_2, ..., s_n, consisting of only characters . and X. They take alternating turns, and Alice is moving first. During each turn, the player has to select a contiguous substring consisting only of characters . and replaces each of them with X. Alice must select... | q = int(input())
for i in range(q):
a, b = [int(item) for item in input().split()]
s = input().rstrip() + "#"
cnt = 0
bob_world = 0
alice_world = 0
length = 0
bob_winning = False
for ch in s:
if ch == ".":
cnt += 1
else:
if cnt < b:
... | {
"input": [
"3\n3 2\nXX......XX...X\n4 2\nX...X.X..X\n5 3\n.......X..X\n",
"6\n5 4\n...............\n5 4\n...............X.....\n5 4\n...............X....\n5 4\n...............X.....X....\n5 4\n...................\n5 4\n...................X.....\n",
"7\n240501 42869\nXX.X.X.X.X.X...\n251441 50561\nX\n247... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Alice and Bob play a game. Initially they have a string s_1, s_2, ..., s_n, consisting of only characters . and X. They take alternating turns, and Alice is moving first. During each ... |
1248_B. Grow The Tree_26739 | Gardener Alexey teaches competitive programming to high school students. To congratulate Alexey on the Teacher's Day, the students have gifted him a collection of wooden sticks, where every stick has an integer length. Now Alexey wants to grow a tree from them.
The tree looks like a polyline on the plane, consisting o... | a=int(input());b=sorted(list(map(int,input().split())),reverse=True);from math import ceil as c;print(sum(b[:c(len(b)/2)])**2+sum(b[c(len(b)/2):])**2)
| {
"input": [
"4\n1 1 2 2\n",
"3\n1 2 3\n",
"1\n2359\n",
"10\n9381 6234 2965 9236 4685 3101 5832 7369 5233 5308\n",
"10\n5957 94 8220 2463 9623 7028 9656 677 8373 1126\n",
"10\n9906 9903 10000 9998 9936 9952 9924 9939 9917 9966\n",
"11\n15 12 9915 40 63 9984 9968 9924 9925 11 9991\n",
"... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Gardener Alexey teaches competitive programming to high school students. To congratulate Alexey on the Teacher's Day, the students have gifted him a collection of wooden sticks, where... |
1288_A. Deadline_26745 | Adilbek was assigned to a special project. For Adilbek it means that he has n days to run a special program and provide its results. But there is a problem: the program needs to run for d days to calculate the results.
Fortunately, Adilbek can optimize the program. If he spends x (x is a non-negative integer) days opt... | import math
for _ in range(int(input())):
n,d = map(int,input().split())
if ((1-n)**2) - (4*(d-n)) >= 0:
print('YES')
else:
print('NO')
| {
"input": [
"3\n1 1\n4 5\n5 11\n",
"1\n1000000 1000000\n",
"2\n63242 999919263\n63242 999919264\n",
"5\n1000000000 1000000000\n1000000000 1000000000\n1000000000 1000000000\n1000000000 1000000000\n1000000000 1000000000\n",
"5\n998244353 999999998\n998244353 999999999\n998244353 999999978\n99824435... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Adilbek was assigned to a special project. For Adilbek it means that he has n days to run a special program and provide its results. But there is a problem: the program needs to run f... |
1331_D. Again?_26749 |
Input
The only line of the input contains a 7-digit hexadecimal number. The first "digit" of the number is letter A, the rest of the "digits" are decimal digits 0-9.
Output
Output a single integer.
Examples
Input
A278832
Output
0
Input
A089956
Output
0
Input
A089957
Output
1
Input
A1440... | value = input()
print(int(value, 16)%2) | {
"input": [
"A089956\n",
"A089957\n",
"A144045\n",
"A278832\n",
"A089946\n",
"A144035\n",
"A378822\n",
"A089947\n",
"A378282\n",
"A079948\n",
"A388282\n",
"A079848\n",
"A388822\n",
"A079849\n",
"B388822\n",
"A079749\n",
"B398822\n",
"A079759\n",... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Input
The only line of the input contains a 7-digit hexadecimal number. The first "digit" of the number is letter A, the rest of the "digits" are decimal digits 0-9.
Output
Outpu... |
1351_B. Square?_26753 | Vasya claims that he had a paper square. He cut it into two rectangular parts using one vertical or horizontal cut. Then Vasya informed you the dimensions of these two rectangular parts. You need to check whether Vasya originally had a square. In other words, check if it is possible to make a square using two given rec... | for t in range(int(input())):
a, b = map(int, input().split())
c, d = map(int, input().split())
a, b = min(a, b), max(a, b)
c, d = min(c, d), max(c, d)
if a + c == b == d:
print("YES")
else:
print("NO")
| {
"input": [
"3\n2 3\n3 1\n3 2\n1 3\n3 3\n1 3\n",
"1\n64 9\n41 36\n",
"1\n64 9\n41 14\n",
"3\n2 3\n3 1\n3 2\n1 3\n3 6\n1 3\n",
"3\n2 3\n3 1\n3 0\n1 3\n3 6\n1 3\n",
"3\n2 4\n3 1\n3 0\n1 3\n3 6\n1 3\n",
"1\n59 9\n41 14\n",
"1\n5 9\n41 14\n",
"1\n5 14\n41 14\n",
"3\n3 3\n3 1\n3 0\... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Vasya claims that he had a paper square. He cut it into two rectangular parts using one vertical or horizontal cut. Then Vasya informed you the dimensions of these two rectangular par... |
1371_D. Grid-00100_26757 | A mad scientist Dr.Jubal has made a competitive programming task. Try to solve it!
You are given integers n,k. Construct a grid A with size n × n consisting of integers 0 and 1. The very important condition should be satisfied: the sum of all elements in the grid is exactly k. In other words, the number of 1 in the gr... | import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self... | {
"input": [
"4\n2 2\n3 8\n1 0\n4 16\n",
"2\n297 47297\n103 6336\n",
"2\n79 4902\n292 64563\n",
"1\n297 66454\n",
"2\n300 8182\n100 1998\n",
"2\n201 28281\n201 22388\n",
"1\n300 90000\n",
"2\n296 52649\n104 10109\n",
"6\n46 1953\n149 14272\n70 3514\n98 8445\n124 4555\n196 26273\n",... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
A mad scientist Dr.Jubal has made a competitive programming task. Try to solve it!
You are given integers n,k. Construct a grid A with size n × n consisting of integers 0 and 1. The ... |
1394_A. Boboniu Chats with Du_26761 | Have you ever used the chat application QQ? Well, in a chat group of QQ, administrators can muzzle a user for days.
In Boboniu's chat group, there's a person called Du Yi who likes to make fun of Boboniu every day.
Du will chat in the group for n days. On the i-th day:
* If Du can speak, he'll make fun of Boboniu ... | #! /usr/bin/python3
n, d, m = [int(inp) for inp in input().split()]
aArr = sorted([int(inp) for inp in input().split()], reverse = True)
i = sum([j > m for j in aArr])
aU = aArr[:i]
aL = aArr[i:]
aUS = aU
for i in range(1, len(aU)):
aUS[i] += aUS[i - 1]
aUS = [0] + aUS
aLS = aL
for i in range(1, len(aL)):
aLS[i]... | {
"input": [
"20 2 16\n20 5 8 2 18 16 2 16 16 1 5 16 2 13 6 16 4 17 21 7\n",
"5 2 11\n8 10 15 23 5\n",
"10 1 73\n46 83 26 98 96 83 87 42 10 17\n",
"10 3 10\n17 17 17 8 7 6 5 4 1 1\n",
"39 37 39\n38 56 198 166 86 51 13 54 101 143 82 138 122 146 86 198 81 177 92 56 107 58 124 82 41 126 79 47 191 41 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Have you ever used the chat application QQ? Well, in a chat group of QQ, administrators can muzzle a user for days.
In Boboniu's chat group, there's a person called Du Yi who likes t... |
1436_E. Complicated Computations_26767 | In this problem MEX of a certain array is the smallest positive integer not contained in this array.
Everyone knows this definition, including Lesha. But Lesha loves MEX, so he comes up with a new problem involving MEX every day, including today.
You are given an array a of length n. Lesha considers all the non-empty... | class SegmentTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.tree = [ide_ele] * 2 * self.num
self.range = [(-1,n)] * 2 * self.num
# 配列の値を葉にセット
... | {
"input": [
"5\n1 4 3 1 2\n",
"3\n1 3 2\n",
"94\n23 8 25 27 33 16 8 8 15 11 33 23 13 18 26 20 21 10 18 15 6 11 21 14 27 16 5 1 33 11 31 33 3 21 31 7 28 32 19 16 20 22 23 18 24 16 24 18 22 12 31 9 14 29 25 29 29 16 12 15 21 6 30 21 28 11 2 33 7 12 33 16 28 32 28 27 21 18 27 17 24 22 23 4 16 2 5 23 2 21 3 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
In this problem MEX of a certain array is the smallest positive integer not contained in this array.
Everyone knows this definition, including Lesha. But Lesha loves MEX, so he comes... |
1461_C. Random Events_26771 | Ron is a happy owner of a permutation a of length n.
A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is... | # by the authority of GOD author: manhar singh sachdev #
import os,sys
from io import BytesIO, IOBase
def main():
for _ in range(int(input())):
n,m = map(int,input().split())
a = list(map(int,input().split()))
j = n-1
while j != -1 and a[j] == j+1:
j -= 1
if... | {
"input": [
"4\n4 3\n4 3 2 1\n1 0.3\n3 1\n4 0.6\n5 3\n4 2 1 3 5\n3 0.8\n4 0.6\n5 0.3\n6 5\n1 3 2 4 5 6\n4 0.9\n5 0.3\n2 0.4\n6 0.7\n3 0.5\n4 2\n1 2 3 4\n2 0.5\n4 0.1\n",
"1\n5 5\n1 2 3 5 4\n5 0.5\n5 0.5\n5 0.5\n5 0.5\n5 0.5\n",
"4\n9 1\n1 2 3 4 5 6 7 8 9\n6 0.000000\n6 1\n1 2 3 4 5 6\n1 0.000033\n4 1\n1 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Ron is a happy owner of a permutation a of length n.
A permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] ... |
1486_D. Max Median_26775 | You are a given an array a of length n. Find a subarray a[l..r] with length at least k with the largest median.
A median in an array of length n is an element which occupies position number ⌊ (n + 1)/(2) ⌋ after we sort the elements in non-decreasing order. For example: median([1, 2, 3, 4]) = 2, median([3, 2, 1]) = 2,... | import collections
def solveTestCase():
n, k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
r = n + 1
l = 1
while r - l > 1:
m = (r+l)//2
b = [1 if i >= m else -1 for i in a]
for i in range(1, len(b)):
b[i] += b[i - 1]
ans = False
if b[k-1] > 0:
ans = True
mm = 0
fo... | {
"input": [
"5 3\n1 2 3 2 1\n",
"4 2\n1 2 3 4\n",
"100 99\n11 9 99 37 72 48 71 61 19 75 41 94 71 86 7 35 2 83 77 72 71 60 32 38 5 35 28 61 46 31 70 33 96 70 75 64 44 81 95 71 62 70 83 21 98 55 40 42 59 64 86 13 90 81 78 55 15 78 76 62 68 9 69 23 45 75 2 36 78 16 75 99 40 34 9 32 13 42 73 63 98 83 86 28 7... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You are a given an array a of length n. Find a subarray a[l..r] with length at least k with the largest median.
A median in an array of length n is an element which occupies position... |
1510_D. Digits_26778 | Diana loves playing with numbers. She's got n cards with positive integer numbers a_i written on them. She spends her free time multiplying the numbers on the cards. She picks a non-empty subset of the cards and multiplies all the numbers a_i written on them.
Diana is happy when the product of the numbers ends with he... | import math;n, d = map(int, input().split());a = [int(_) for _ in input().split()];dp = [[-1e10] * 10 for _ in range(n + 1)]
come = [[(0, 0, 0) for i in range(10)] for j in range(n + 1)];dp[0][1] = 0
for i in range(n):
for j in range(10):
val = dp[i][j] + math.log(a[i])
if dp[i + 1][(j * a[i]) % 10]... | {
"input": [
"5 7\n1 3 1 5 3\n",
"6 4\n4 11 8 2 1 13\n",
"6 3\n8 9 4 17 11 5\n",
"5 6\n2 2 2 2 2\n",
"3 1\n2 4 6\n",
"10 9\n6 4 1 6 4 9 2 2 10 5\n",
"10 7\n5 10 4 3 8 10 6 1 6 2\n",
"8 2\n65 77 69 91 4 5 79 52\n",
"3 8\n2 9 108\n",
"10 2\n9 4 6 3 10 6 6 4 10 2\n",
"10 1\n9 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Diana loves playing with numbers. She's got n cards with positive integer numbers a_i written on them. She spends her free time multiplying the numbers on the cards. She picks a non-e... |
1536_F. Omkar and Akmar_26781 | Omkar and Akmar are playing a game on a circular board with n (2 ≤ n ≤ 10^6) cells. The cells are numbered from 1 to n so that for each i (1 ≤ i ≤ n-1) cell i is adjacent to cell i+1 and cell 1 is adjacent to cell n. Initially, each cell is empty.
Omkar and Akmar take turns placing either an A or a B on the board, wit... | import sys
input = sys.stdin.readline
n = int(input())
mod = 10 ** 9 + 7
F = [0] * (n + 1)
F[0] = 1
for i in range(1, n + 1):
F[i] = i * F[i - 1] % mod
iF = [0] * (n + 1)
iF[-1] = pow(F[-1], mod - 2, mod)
for i in range(n - 1, -1, -1):
iF[i] = iF[i + 1] * (i + 1) % mod
def C(n, k):
if k > n: return 0
... | {
"input": [
"69420\n",
"42069\n",
"2\n",
"24\n",
"38\n",
"999993\n",
"31\n",
"999989\n",
"27\n",
"46\n",
"999972\n",
"5\n",
"41\n",
"999996\n",
"999994\n",
"19\n",
"999975\n",
"35\n",
"4\n",
"33\n",
"23\n",
"45\n",
"37\n",
... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Omkar and Akmar are playing a game on a circular board with n (2 ≤ n ≤ 10^6) cells. The cells are numbered from 1 to n so that for each i (1 ≤ i ≤ n-1) cell i is adjacent to cell i+1 ... |
185_A. Plant_26787 | Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides into four triangle plants: three of them will point "upwards" and one will point "downwards". After another year, each triangle plant divide... | n=int(input())
e=10**9+7
print(1if n==0else(pow(2,n-1,e)+pow(2,n*2-1,e))%e)
# Made By Mostafa_Khaled | {
"input": [
"1\n",
"2\n",
"7\n",
"84324827171274022\n",
"74859961358140080\n",
"10\n",
"5\n",
"148049062285906746\n",
"615812227854199662\n",
"585335721566249104\n",
"791809296233191092\n",
"522842183413115087\n",
"819875140559301751\n",
"16\n",
"9313565017... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Dwarfs have planted a very interesting plant, which is a triangle directed "upwards". This plant has an amusing feature. After one year a triangle plant directed "upwards" divides int... |
231_B. Magic, Wizardry and Wonders_26793 | Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in the Universe than the magic of numbers. That's why Vasya adores math and spends a lot of time turning some numbers into... | n, d, L = map(int, input().split())
sp = []
for _ in range(n - 1):
if d <= 0:
sp.append(1)
d = 1 - d
else:
sp.append(L)
d = L - d
if 1 <= d <= L:
sp.append(d)
print(*sp)
else:
print(-1)
| {
"input": [
"3 3 2\n",
"5 -4 4\n",
"5 -4 3\n",
"100 -1000 100\n",
"20 97 13\n",
"100 1000 3\n",
"100 -1000 100\n",
"50 231 39\n",
"60 -728 29\n",
"5 2 2\n",
"2 1 1\n",
"100 -1000 1\n",
"100 1000 100\n",
"100 -1000 3\n",
"100 -10000 100\n",
"70 2335 100\... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is n... |
257_A. Sockets_26797 | Vasya has got many devices that work on electricity. He's got n supply-line filters to plug the devices, the i-th supply-line filter has ai sockets.
Overall Vasya has got m devices and k electrical sockets in his flat, he can plug the devices or supply-line filters directly. Of course, he can plug the supply-line filt... | n,m,k=map(int,input().split(" "))
li=list(map(int,input().split(" ",n)[:n]))
li.sort(reverse=True)
fl=0
a,s=0,0
if m<=k:
print(0)
else:
while fl==0 and a<n:
s+=li[a]
a+=1
if a!=1:
s-=1
if s+k-1>=m and a!=0:
fl=1
break
if fl!=1:
prin... | {
"input": [
"4 7 2\n3 3 2 4\n",
"3 5 3\n3 1 2\n",
"5 5 1\n1 3 1 2 1\n",
"10 49 11\n5 18 1 19 11 11 16 5 6 6\n",
"1 1 1\n1\n",
"13 20 9\n2 9 2 2 5 11 10 10 13 4 6 11 14\n",
"15 26 4\n3 6 7 1 5 2 4 4 7 3 8 7 2 4 8\n",
"5 50 6\n2 1 3 1 3\n",
"50 50 2\n2 2 4 5 2 1 5 4 5 4 5 2 1 2 3 3 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Vasya has got many devices that work on electricity. He's got n supply-line filters to plug the devices, the i-th supply-line filter has ai sockets.
Overall Vasya has got m devices a... |
280_A. Rectangle Puzzle_26801 | You are given two rectangles on a plane. The centers of both rectangles are located in the origin of coordinates (meaning the center of the rectangle's symmetry). The first rectangle's sides are parallel to the coordinate axes: the length of the side that is parallel to the Ox axis, equals w, the length of the side tha... | from math import radians, cos, sin, atan2
def rotate(point, alpha):
x = point[0]
y = point[1]
return (x * cos(alpha) - y * sin(alpha), x * sin(alpha) + y * cos(alpha))
def crs(a, b):
return a[0] * b[1] - a[1] * b[0]
def m(end, start):
return (end[0] - start[0], end[1] - start[1])
def area(poly):... | {
"input": [
"6 4 30\n",
"1 1 45\n",
"938133 287232 156\n",
"143003 283714 102\n",
"2 100 90\n",
"129842 930245 115\n",
"646084 979010 45\n",
"659245 591935 32\n",
"991245 527535 69\n",
"100 100 30\n",
"44247 849307 176\n",
"34989 23482 180\n",
"606243 819219 106\n"... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You are given two rectangles on a plane. The centers of both rectangles are located in the origin of coordinates (meaning the center of the rectangle's symmetry). The first rectangle'... |
32_A. Reconnaissance_26808 | According to the regulations of Berland's army, a reconnaissance unit should consist of exactly two soldiers. Since these two soldiers shouldn't differ much, their heights can differ by at most d centimeters. Captain Bob has n soldiers in his detachment. Their heights are a1, a2, ..., an centimeters. Some soldiers are ... | n, d = [int(i) for i in input().split()]
S = sorted([int(i) for i in input().split()])
k = 0
for i in range(n):
for j in range(i+1, n):
if(S[j]-S[i]<=d):
k += 1
else:
break
print(k*2) | {
"input": [
"5 1\n55 30 29 31 55\n",
"5 10\n10 20 50 60 65\n",
"100 100\n51 93 101 960 2 477 213 129 663 925 254 78 1486 274 160 481 132 156 412 372 5 57 152 298 1771 7 359 468 254 406 202 929 221 366 552 97 555 29 822 118 539 140 992 854 7 163 134 103 940 30 409 1003 398 43 555 79 107 40 23 103 643 171 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
According to the regulations of Berland's army, a reconnaissance unit should consist of exactly two soldiers. Since these two soldiers shouldn't differ much, their heights can differ ... |
397_B. On Corruption and Numbers_26816 | Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the diversity — he has not yet decided what profession he wants to get. At school, he had bad grades in all subjects, and it's only thanks to w... | t = int(input())
for _ in range(t):
n, l, r = map(int, input().split())
print("No" if n // l * r < n else "Yes") | {
"input": [
"2\n5 2 3\n6 4 5\n",
"50\n69 6 6\n22 1 1\n23 3 3\n60 13 13\n13 3 3\n7 4 7\n6 1 1\n49 7 9\n68 8 8\n20 2 2\n34 1 1\n79 5 5\n22 1 1\n77 58 65\n10 3 3\n72 5 5\n47 1 1\n82 3 3\n92 8 8\n34 1 1\n42 9 10\n63 14 14\n10 3 3\n38 2 2\n80 6 6\n79 5 5\n53 5 5\n44 7 7\n85 2 2\n24 2 2\n57 3 3\n95 29 81\n77 6 6\n... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Alexey, a merry Berland entrant, got sick of the gray reality and he zealously wants to go to university. There are a lot of universities nowadays, so Alexey is getting lost in the di... |
41_C. Email address_26820 | Sometimes one has to spell email addresses over the phone. Then one usually pronounces a dot as dot, an at sign as at. As a result, we get something like vasyaatgmaildotcom. Your task is to transform it into a proper email address (vasya@gmail.com).
It is known that a proper email address contains only such symbols a... | a = input()
b = ''
if a[0] + a[1] + a[2] == 'dot':
b += 'dot'
i = 3
elif a[0] + a[1] == 'at':
b += 'at'
i = 2
else:
i = 0
at = 0
while i < len(a) - 3:
if a[i] == 'd' and a[i + 1] == 'o' and a[i + 2] == 't':
b += '.'
i += 3
elif a[i] == 'a' and a[i + 1] == 't' and at == 0:
... | {
"input": [
"vasyaatgmaildotcom\n",
"aatt\n",
"dotdotdotatdotdotat\n",
"dotdotdotdotdotdotdotdotdotdotdotdoatdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdotdot\n",
"zdotdotatdotz\n",
"hatatatdotcatqatdotwhvdotatdotsatattatatcdotddotdotvasatdottxdotatatdotatmdotvvatkatdotxatcdotdo... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Sometimes one has to spell email addresses over the phone. Then one usually pronounces a dot as dot, an at sign as at. As a result, we get something like vasyaatgmaildotcom. Your task... |
446_A. DZY Loves Sequences_26824 | DZY has a sequence a, consisting of n integers.
We'll call a sequence ai, ai + 1, ..., aj (1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of the subsegment.
Your task is to find the longest subsegment of a, such that it is possible to change at most one number (change one numb... | def ii(): return int(input())
def si(): return input()
def mi(): return map(int,input().split())
def msi(): return map(str,input().split())
def li(): return list(mi())
n=ii()
a=li()
pre,suf = [1]*n,[1]*n
for i in range(1,n):
if a[i]>a[i-1]:
pre[i]+=pre[i-1]
for i in range(n-2,-1,-1):
if a[i]... | {
"input": [
"6\n7 2 3 1 5 6\n",
"5\n2 3 7 5 6\n",
"5\n1 3 3 4 5\n",
"3\n81 33 64\n",
"5\n1 2 3 4 1\n",
"3\n5 1 2\n",
"3\n20 1 9\n",
"4\n1 5 3 4\n",
"10\n1 1 5 3 2 9 9 7 7 6\n",
"5\n2 4 7 6 8\n",
"10\n1 2 3 4 5 10 10 11 12 13\n",
"1\n1\n",
"5\n1 2 5 3 4\n",
"2\n... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
DZY has a sequence a, consisting of n integers.
We'll call a sequence ai, ai + 1, ..., aj (1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of ... |
468_B. Two Sets_26828 | Little X has n distinct integers: p1, p2, ..., pn. He wants to divide all of them into two sets A and B. The following two conditions must be satisfied:
* If number x belongs to set A, then number a - x must also belong to set A.
* If number x belongs to set B, then number b - x must also belong to set B.
Hel... | import sys
import queue
sys.setrecursionlimit(100000)
# global constant
INF = int(1e7+1)
MAX = 100005
# For testing
#sys.stdin = open("INP.txt", 'r')
#sys.stdout = open("OUT.txt", 'w')
# global variables
parents = []
ranks = []
size = []
n = 0
# classes
class Pair:
def __init__(self, a, b):
self.first... | {
"input": [
"3 3 4\n1 2 4\n",
"4 5 9\n2 3 4 5\n",
"4 10 9\n6 5 4 3\n",
"1 1 1\n1\n",
"2 2 3\n1 2\n",
"70 416035 416023\n70034 70322 345689 345965 345701 70046 345737 345713 70166 345821 70010 345749 345677 345725 69962 345869 70178 70310 345785 69998 70070 69974 70058 346001 70106 345953 7022... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Little X has n distinct integers: p1, p2, ..., pn. He wants to divide all of them into two sets A and B. The following two conditions must be satisfied:
* If number x belongs to se... |
490_B. Queue_26832 | During the lunch break all n Berland State University students lined up in the food court. However, it turned out that the food court, too, has a lunch break and it temporarily stopped working.
Standing in a queue that isn't being served is so boring! So, each of the students wrote down the number of the student ID of... | import math
from collections import deque
class Empty(Exception):
pass
class _DoublyLinkedBase:
"""A base class providing a doubly linked list representation."""
#-------------------------- nested _Node class --------------------------
# nested _Node class
class _Node:
"""Lightweight, nonpublic class ... | {
"input": [
"4\n92 31\n0 7\n31 0\n7 141\n",
"6\n10001 0\n0 10005\n10003 10001\n10002 10000\n10005 10002\n10004 10003\n",
"3\n0 2\n1 3\n2 0\n",
"9\n308992 348750\n0 6496\n487447 676506\n874677 985199\n260782 487447\n985199 260782\n348750 0\n570981 308992\n6496 570981\n",
"6\n341637 51795\n0 809471... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
During the lunch break all n Berland State University students lined up in the food court. However, it turned out that the food court, too, has a lunch break and it temporarily stoppe... |
514_B. Han Solo and Lazer Gun_26836 | There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plane.
Han Solo has the newest duplex lazer gun to fight these stormtroopers. It is situated at the point (x0, y0). In one shot it can can ... | n, x0, y0 = map(int, input().split())
slopes = {} # key: (num, den), val: count
for i in range(n):
x, y = map(int, input().split())
num = y - y0
den = x - x0
# print(num, den)
if den == 0 and "inf" in slopes:
slopes["inf"] += 1
elif den == 0:
slopes["inf"] = 1
else:
... | {
"input": [
"2 1 2\n1 1\n1 0\n",
"4 0 0\n1 1\n2 2\n2 0\n-1 -1\n",
"2 -10000 -10000\n9998 9999\n9999 10000\n",
"10 -4 -4\n2 -4\n2 0\n-4 2\n5 -4\n-3 -5\n1 4\n-4 2\n-3 5\n0 -3\n2 4\n",
"2 -10000 -10000\n10000 10000\n10000 9999\n",
"2 0 0\n10000 -10000\n10000 10000\n",
"2 0 0\n0 2\n1 90\n",
... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
There are n Imperial stormtroopers on the field. The battle field is a plane with Cartesian coordinate system. Each stormtrooper is associated with his coordinates (x, y) on this plan... |
540_C. Ice Cave_26840 | You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through the ice.
The level of the cave where you are is a rectangular square grid of n rows and m columns. Each cell consists e... | import queue
MAX = 500
dr = [0,0,1,-1]
dc = [1,-1,0,0]
def isValid(r, c):
return r in range(m) and c in range(n)
def BFS(sr, sc, fr, fc):
q = [0] * (MAX * MAX)
left = right = 0
q[0] = (sr, sc)
while left <= right:
ur, uc = q[left]
left += 1
for i in range(4):
vr = ur + dr[i]
vc = uc ... | {
"input": [
"5 4\n.X..\n...X\nX.X.\n....\n.XX.\n5 3\n1 1\n",
"4 7\n..X.XX.\n.XX..X.\nX...X..\nX......\n2 2\n1 6\n",
"4 6\nX...XX\n...XX.\n.X..X.\n......\n1 6\n2 2\n",
"1 2\nX.\n1 1\n1 2\n",
"2 1\nX\nX\n2 1\n2 1\n",
"4 3\n..X\n..X\n.XX\n.XX\n4 2\n2 2\n",
"2 2\n..\nXX\n2 1\n1 1\n",
"2 2... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is... |
58_B. Coins_26847 | In Berland a money reform is being prepared. New coins are being introduced. After long economic calculations was decided that the most expensive coin should possess the denomination of exactly n Berland dollars. Also the following restriction has been introduced for comfort: the denomination of each coin should be div... | def O(x):
l=[]
if x==1:
return 1
for i in range(1,x//2+1):
if x%i==0:
l.append(i)
print(x)
return O(l[len(l)-1])
x=int(input())
O(x)
print(1)
| {
"input": [
"3\n",
"4\n",
"10\n",
"473273\n",
"784653\n",
"8\n",
"1000000\n",
"20\n",
"10000\n",
"25\n",
"627251\n",
"7\n",
"2430\n",
"12\n",
"733035\n",
"893193\n",
"1331\n",
"648\n",
"600\n",
"21\n",
"999999\n",
"36\n",
"10... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
In Berland a money reform is being prepared. New coins are being introduced. After long economic calculations was decided that the most expensive coin should possess the denomination ... |
631_A. Interview_26854 | Blake is a CEO of a large company called "Blake Technologies". He loves his company very much and he thinks that his company should be the best. That is why every candidate needs to pass through the interview that consists of the following problem.
We define function f(x, l, r) as a bitwise OR of integers xl, xl + 1, ... | read = lambda: map(int, input().split())
n = int(input())
a = list(read())
b = list(read())
f1 = f2 = 0
for i in a: f1 |= i
for i in b: f2 |= i
print(f1 + f2)
| {
"input": [
"10\n13 2 7 11 8 4 9 8 5 1\n5 7 18 9 2 3 0 11 8 6\n",
"5\n1 2 4 3 2\n2 3 3 12 1\n",
"25\n12 30 38 109 81 124 80 33 38 48 29 78 96 48 96 27 80 77 102 65 80 113 31 118 35\n25 64 95 13 12 6 111 80 85 16 61 119 23 65 73 65 20 95 124 18 28 79 125 106 116\n",
"1\n0\n0\n",
"8\n1 2 4 8 16 32 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Blake is a CEO of a large company called "Blake Technologies". He loves his company very much and he thinks that his company should be the best. That is why every candidate needs to p... |
706_B. Interesting drink_26861 | Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different shops in the city. It's known that the price of one bottle in the shop i is equal to xi coins.
Vasiliy plans to buy his favorite drink fo... | def binary(t,s):
fir=0
last=len(t)-1
mid=0
while(fir<=last):
mid=(fir+last)//2
if t[mid]>s:
last=mid-1
else:
fir=mid+1
return last+1
n=int(input())
t=list(map(int,input().split()))
m=int(input())
p=0
t.sort()
for i in range(m):
s=int(inp... | {
"input": [
"5\n3 10 8 6 11\n4\n1\n10\n3\n11\n",
"3\n1 2 3\n1\n100005\n",
"5\n3 10 8 6 11\n1\n10000000\n",
"12\n35345 58181 32223 84621 35905 73863 99537 30666 67771 39229 36847 29038\n23\n55052824\n82504840\n35160556\n78141700\n73401989\n86305919\n39430705\n31939373\n23501765\n4406029\n61436920\n142... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different s... |
729_D. Sea Battle_26865 | Galya is playing one-dimensional Sea Battle on a 1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of b consecutive cells. No cell can be part of two ships, however, the ships can touch each other.
Galya doesn't know the ships location. She can shoot to some cells and after each shot ... | n,a,b,k = map(int, input().split())
open = 0
must = 0
must_arr = []
for i,c in enumerate(input()):
if c == '1':
open = 0
else:
open += 1
if open == b:
open = 0
must += 1
if must >= a:
must_arr.append(i+1)
must -= a - 1
print(must)
... | {
"input": [
"5 1 2 1\n00100\n",
"13 3 2 3\n1000000010001\n",
"13 3 2 3\n1000000010001\n",
"100 17 4 11\n0100000100000000000000001000000000010001100000000000101000000000000000000000001000001000010000000000\n",
"5 1 2 1\n00100\n",
"2 2 1 0\n00\n",
"10 2 2 0\n0000000000\n",
"1 1 1 0\n0\n... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Galya is playing one-dimensional Sea Battle on a 1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of b consecutive cells. No cell can be part of two... |
749_E. Inversions After Shuffle_26868 | You are given a permutation of integers from 1 to n. Exactly once you apply the following operation to this permutation: pick a random segment and shuffle its elements. Formally:
1. Pick a random segment (continuous subsequence) from l to r. All <image> segments are equiprobable.
2. Let k = r - l + 1, i.e. the le... |
# Python3 program to count inversions using
# Binary Indexed Tree
# Returns sum of arr[0..index]. This function
# assumes that the array is preprocessed and
# partial sums of array elements are stored
# in BITree[].
def getSum( BITree, index):
sum = 0 # Initialize result
# Traverse anc... | {
"input": [
"3\n2 3 1\n",
"3\n1 2 3\n",
"100\n39 8 87 59 49 19 6 64 81 26 90 58 30 93 51 94 91 10 37 68 14 86 75 41 15 73 76 85 13 84 34 25 54 92 23 11 99 53 80 74 22 29 20 79 7 66 62 72 28 71 12 48 18 9 78 38 43 47 5 50 77 82 52 96 97 65 55 88 16 45 69 4 61 42 60 100 24 32 57 21 89 70 27 35 98 83 56 40 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You are given a permutation of integers from 1 to n. Exactly once you apply the following operation to this permutation: pick a random segment and shuffle its elements. Formally:
1... |
797_D. Broken BST_26874 | Let T be arbitrary binary tree — tree, every vertex of which has no more than two children. Given tree is rooted, so there exists only one vertex which doesn't have a parent — it's the root of a tree. Every vertex has an integer number written on it. Following algorithm is run on every value from the tree T:
1. Set ... | from collections import deque
nodes = []
parents = []
values = []
broken = []
upperBound = []
lowerBound = []
n = int(input())
for _ in range(n):
v, l, r = map(int, input().split())
nodes.append((v, l - 1, r - 1))
parents.append(-1)
values.append(v)
broken.append(False)
upperBound.append(10 *... | {
"input": [
"8\n6 2 3\n3 4 5\n12 6 7\n1 -1 8\n4 -1 -1\n5 -1 -1\n14 -1 -1\n2 -1 -1\n",
"3\n15 -1 -1\n10 1 3\n5 -1 -1\n",
"10\n911605217 -1 -1\n801852416 -1 -1\n140035920 -1 9\n981454947 10 2\n404988051 6 3\n307545107 8 7\n278188888 4 1\n523010786 -1 -1\n441817740 -1 -1\n789680429 -1 -1\n",
"4\n1 2 3\n... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Let T be arbitrary binary tree — tree, every vertex of which has no more than two children. Given tree is rooted, so there exists only one vertex which doesn't have a parent — it's th... |
843_A. Sorting by Subsequences_26880 | You are given a sequence a1, a2, ..., an consisting of different integers. It is required to split this sequence into the maximum number of subsequences such that after sorting integers in each of them in increasing order, the total sequence also will be sorted in increasing order.
Sorting integers in a subsequence is... |
n = int(input())
d = list(map(int, input().split()))
temp = d[:]
d.sort()
from bisect import bisect_left
A = [bisect_left(d,i) for i in temp]
del d,temp
f = [False]*len(A)
result = []
for i in range(n):
if not f[i]:
L = [i+1]
f[i] = True
j = A[i]
while j != i:
L.append(j+1)
f[j] = ... | {
"input": [
"6\n83 -75 -49 11 37 62\n",
"6\n3 2 1 6 5 4\n",
"10\n3 7 10 1 9 5 4 8 6 2\n",
"100\n39 77 67 25 81 26 50 11 73 95 86 16 90 33 14 79 12 100 68 64 60 27 41 15 34 24 3 61 83 47 57 65 99 43 40 21 94 72 82 85 23 71 76 32 10 17 30 18 44 59 35 89 6 63 7 69 62 70 4 29 92 87 31 48 36 28 45 97 93 9... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
You are given a sequence a1, a2, ..., an consisting of different integers. It is required to split this sequence into the maximum number of subsequences such that after sorting intege... |
863_F. Almost Permutation_26883 | Recently Ivan noticed an array a while debugging his code. Now Ivan can't remember this array, but the bug he was trying to fix didn't go away, so Ivan thinks that the data from this array might help him to reproduce the bug.
Ivan clearly remembers that there were n elements in the array, and each element was not less... | import sys
def is_feasible(cnt,L,R):
n = len(R)
inter = [(L[i],R[i]) for i in range(n)]
AUX = []
feasible = True
for x in range(n):
for p in inter:
if p[0] == x:
AUX.append(p[1])
while AUX and min(AUX) < x:
AUX.remove(min(AUX))
for quantity in range(cnt[x]):
if AUX:
AUX.remove(min(AUX)... | {
"input": [
"3 0\n",
"3 2\n1 1 3 2\n2 1 3 2\n",
"3 1\n1 1 3 2\n",
"3 2\n1 1 3 2\n2 1 3 1\n",
"3 6\n1 1 1 2\n2 1 1 2\n1 2 2 2\n2 2 2 2\n1 3 3 2\n2 3 3 3\n",
"7 3\n2 1 2 2\n1 3 7 2\n2 3 7 3\n",
"50 2\n2 1 33 1\n2 14 50 1\n",
"29 5\n2 4 9 27\n1 25 29 14\n1 9 10 18\n2 13 13 5\n2 1 19 23\n... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Recently Ivan noticed an array a while debugging his code. Now Ivan can't remember this array, but the bug he was trying to fix didn't go away, so Ivan thinks that the data from this ... |
912_A. Tricky Alchemy_26889 | During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing magic crystals.
Grisha needs to obtain some yellow, green and blue balls. It's known that to produce a yellow ball one needs two yellow ... | y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | {
"input": [
"4 3\n2 1 1\n",
"3 9\n1 1 3\n",
"12345678 87654321\n43043751 1000000000 53798715\n",
"25 5\n3 3 3\n",
"612127849 669475006\n271630930 676010757 22959739\n",
"100 10\n2 3 4\n",
"626115781 966381948\n395190569 820194184 229233367\n",
"48 27\n22 39 20\n",
"198066417 82522... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
During the winter holidays, the demand for Christmas balls is exceptionally high. Since it's already 2018, the advances in alchemy allow easy and efficient ball creation by utilizing ... |
934_A. A Compatible Pair_26893 | Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of which frighten the monster out of coming.
Little Tommy has n lanterns and Big Ban... | n, m = [int(x) for x in input().split()]
lstT = [int(x) for x in input().split()]
lstB = [int(x) for x in input().split()]
z=-9999999999999999999999999999
T=0
B=0
for i in range(n):
for j in range(m):
if z<lstT[i]*lstB[j]:
T=i
B=j
... | {
"input": [
"2 2\n20 18\n2 14\n",
"5 3\n-1 0 1 2 3\n-1 0 1\n",
"14 8\n-1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 ... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villa... |
960_C. Subsequence Counting_26897 | Pikachu had an array with him. He wrote down all the non-empty subsequences of the array on paper. Note that an array of size n has 2n - 1 non-empty subsequences in it.
Pikachu being mischievous as he always is, removed all the subsequences in which Maximum_element_of_the_subsequence - Minimum_element_of_subsequence... | X, d = map(int, input().split())
x = X
ans = list()
ln = 0
last = 1
while x > 0:
if last >= 10 ** 18:
print(-1)
exit()
i = 0
while 2 ** (i + 1) - 1 <= x:
i += 1
t = 2 ** i - 1
x -= t
if ln + i > 10000:
print(-1)
exit()
for _ in range(i):
a... | {
"input": [
"10 5\n",
"4 2\n",
"985629174 189232688\n",
"21537803 166017060\n",
"863230070 895037311\n",
"641009859 54748096\n",
"248004555 280013594\n",
"1048576 1\n",
"1 1\n",
"702209411 496813081\n",
"890 553\n",
"1000000000 1\n",
"691688417 162011045\n",
"1... | 2CODEFORCES | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
Pikachu had an array with him. He wrote down all the non-empty subsequences of the array on paper. Note that an array of size n has 2n - 1 non-empty subsequences in it.
Pikachu bein... |
p02592 AtCoder Grand Contest 047 - Product Simulation_26912 | This is an output-only problem. You shouldn't read anything from the input.
In short, your task is to simulate multiplication by using only comparison (x < y) and addition (x + y). There is no input in this problem, you just print a sequence of operations.
Imagine that there is a big array a[0], a[1], ..., a[N-1] of ... | n=97
p=print
r=range
def a(i,j,k,l=0):p(chr(43+l*17),i,j,k)
def b(i):a(i,i,i+1)
def d(x,i,j):
for t in r(30):
b(j+t-1);a(j+t,n,j+t)
for s in r(j+t,j+29):b(s)
a(j+29,x,i+t,1);b(j+t-1);a(j+t,i+t,j+t)
p(3933)
a(0,1,n)
a(2,n,n,1)
a(0,n,3)
a(1,n,4)
d(3,5,36)
d(4,36,67)
for t in r(59):
a(2,2,2)
for s in r(t+1):
if... | {
"input": [
""
],
"output": [
""
]
} | 5ATCODER | Below is a problem description that describes the problem. Write code in Python that appropriately solves the problem.
### Description:
This is an output-only problem. You shouldn't read anything from the input.
In short, your task is to simulate multiplication by using only comparison (x < y) and addition (x + y). T... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.