Datasets:

mlfoundations-dev
/

code_stratos_scale_pre_decontamination

Dataset card Data Studio Files Files and versions Community

Split (1)

train · 48.3k rows

Search is not available for this dataset

problem_id stringlengths 32 32	name stringlengths 2 112	problem stringlengths 200 14k	test_cases stringlengths 33 79.2M	difficulty stringclasses 33 values	language sequencelengths 1 1	source stringclasses 14 values	num_solutions int64 2 1.9M	subset stringclasses 3 values
b7bb00724e30ca5e030171a98d9c0d0c	Polo the Penguin and Houses	Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1<=≤<=pi<=≤<=n). Little penguin Polo loves walking around this village. The walk looks like that. First he stands by a house number x. Then he goes to the house whose number is written on the plaque of house x (that is, to house px), then he goes to the house whose number is written on the plaque of house px (that is, to house ppx), and so on. We know that: 1. When the penguin starts walking from any house indexed from 1 to k, inclusive, he can walk to house number 1. 1. When the penguin starts walking from any house indexed from k<=+<=1 to n, inclusive, he definitely cannot walk to house number 1. 1. When the penguin starts walking from house number 1, he can get back to house number 1 after some non-zero number of walks from a house to a house. You need to find the number of ways you may write the numbers on the houses' plaques so as to fulfill the three above described conditions. Print the remainder after dividing this number by 1000000007 (109<=+<=7). The single line contains two space-separated integers n and k (1<=≤<=n<=≤<=1000,<=1<=≤<=k<=≤<=min(8,<=n)) — the number of the houses and the number k from the statement. In a single line print a single integer — the answer to the problem modulo 1000000007 (109<=+<=7). Sample Input 5 2 7 4 Sample Output 54 1728	{"inputs": ["5 2", "7 4", "8 5", "8 1", "10 7", "12 8", "50 2", "100 8", "1000 8", "999 7", "685 7", "975 8", "475 5", "227 6", "876 8", "1000 1", "1000 2", "1000 3", "1000 4", "1000 5", "1000 6", "657 3", "137 5", "8 8", "9 8", "1 1", "2 1", "2 2", "3 3", "473 4"], "outputs": ["54", "1728", "16875", "823543", "3176523", "536870912", "628702797", "331030906", "339760446", "490075342", "840866481", "531455228", "449471303", "407444135", "703293724", "760074701", "675678679", "330155123", "660270610", "583047503", "834332109", "771999480", "160909830", "2097152", "2097152", "1", "1", "2", "9", "145141007"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	23	codeforces
b7ce3faab689d1f84c1a04272bc4d6e8	Classroom Watch	Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this number and the teacher of mathematics Inna Petrovna answered Vova that n is the answer to the arithmetic task for first-graders. In the textbook, a certain positive integer x was given. The task was to add x to the sum of the digits of the number x written in decimal numeral system. Since the number n on the board was small, Vova quickly guessed which x could be in the textbook. Now he wants to get a program which will search for arbitrary values of the number n for all suitable values of x or determine that such x does not exist. Write such a program for Vova. The first line contains integer n (1<=≤<=n<=≤<=109). In the first line print one integer k — number of different values of x satisfying the condition. In next k lines print these values in ascending order. Sample Input 21 20 Sample Output 1 15 0	{"inputs": ["21", "20", "1", "2", "3", "100000001", "1000000000", "999999979", "9", "10", "11", "39", "66", "75", "100", "101", "2014", "999999994"], "outputs": ["1\n15", "0", "0", "1\n1", "0", "2\n99999937\n100000000", "1\n999999932", "2\n999999899\n999999908", "0", "1\n5", "1\n10", "1\n33", "1\n60", "0", "1\n86", "2\n91\n100", "2\n1988\n2006", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	172	codeforces
b7d07bbf111bba1f3ecb254e4e9c03d1	Isomorphic Strings	You are given a string s of length n consisting of lowercase English letters. For two given strings s and t, say S is the set of distinct characters of s and T is the set of distinct characters of t. The strings s and t are isomorphic if their lengths are equal and there is a one-to-one mapping (bijection) f between S and T for which f(si)<==<=ti. Formally: 1. f(si)<==<=ti for any index i, 1. for any character there is exactly one character that f(x)<==<=y, 1. for any character there is exactly one character that f(x)<==<=y. For example, the strings "aababc" and "bbcbcz" are isomorphic. Also the strings "aaaww" and "wwwaa" are isomorphic. The following pairs of strings are not isomorphic: "aab" and "bbb", "test" and "best". You have to handle m queries characterized by three integers x,<=y,<=len (1<=≤<=x,<=y<=≤<=n<=-<=len<=+<=1). For each query check if two substrings s[x... x<=+<=len<=-<=1] and s[y... y<=+<=len<=-<=1] are isomorphic. The first line contains two space-separated integers n and m (1<=≤<=n<=≤<=2·105, 1<=≤<=m<=≤<=2·105) — the length of the string s and the number of queries. The second line contains string s consisting of n lowercase English letters. The following m lines contain a single query on each line: xi, yi and leni (1<=≤<=xi,<=yi<=≤<=n, 1<=≤<=leni<=≤<=n<=-<=max(xi,<=yi)<=+<=1) — the description of the pair of the substrings to check. For each query in a separate line print "YES" if substrings s[xi... xi<=+<=leni<=-<=1] and s[yi... yi<=+<=leni<=-<=1] are isomorphic and "NO" otherwise. Sample Input 7 4 abacaba 1 1 1 1 4 2 2 1 3 2 4 3 Sample Output YES YES NO YES	{"inputs": ["7 4\nabacaba\n1 1 1\n1 4 2\n2 1 3\n2 4 3", "1 2\nz\n1 1 1\n1 1 1", "36 4\naababcbbcbczaaawwwwwaaaabbbbtestbest\n1 7 6\n13 18 5\n23 26 3\n29 33 4", "4 1\nabac\n1 2 3", "5 10\ncaabc\n5 4 1\n5 4 1\n1 5 1\n4 2 2\n1 3 1\n5 5 1\n4 4 1\n4 3 2\n1 4 1\n5 1 1", "10 30\naccbaaccac\n6 8 3\n2 9 1\n6 8 3\n10 5 1\n6 2 2\n1 4 7\n3 10 1\n6 9 1\n7 7 3\n7 3 2\n8 4 1\n4 9 1\n7 6 4\n6 8 2\n10 2 1\n1 3 5\n5 10 1\n7 10 1\n4 1 2\n8 5 3\n9 8 1\n8 6 2\n6 9 2\n10 3 1\n3 9 1\n5 5 5\n1 5 6\n4 2 6\n10 7 1\n9 8 2", "64 1\nabbbbbbaababaaabbabbaabababbabbabbbbbbaabbaaabbbabbbaaaabaaabaaa\n1 33 32", "64 1\naabbbabaabaaaababbaabbbabbaaababababbbbaabaaaaababbaaababbbabbab\n1 33 32", "64 1\nbbabaabbabbaaaaabaaabbbbbbbbbbabbaaabbbbbbbbabaabaababaaabbabaaa\n1 33 32", "64 1\nbbbbaababaabbbabbaaaabbaaaaaaaaaaaaabbabbbbbbaababbabbababbbabaa\n1 33 32", "64 1\nababbaaabbaabaababbbbbbbbbaabbaabaaabbaabbaaabbabaabaabbaababbba\n1 33 32", "64 1\nbaabbaababbbbbaaaaaaabaabbbbbbbaaabbbaaaaaababbabbaaabbbbabaaaab\n1 33 32", "64 1\naabbaabababbaababababbabbabaaabbbbbaaaababbaaabbbaabbaaaabbaaaba\n1 33 32", "64 1\naaaaaaabaabaabaababbbaabbabbabaabbbbaabaaabbabbaabaaabbabbbbaaba\n1 33 32", "40 1\nbabbaaaabaabbbaabbaaabbbabbbbbaaaabaaaab\n1 21 20", "80 1\nabaabbbbaaaaabbabbaaaabbaabaaaaababababaaabaabaaaaababbabbaaaaabbbabbbbaaaaabbbb\n1 41 40", "24 1\nccacbbabcacabababaacaacc\n1 13 12", "80 1\naaaabaaaaababbbbbbaabbbabbbbbbaaaaabaaaaabbabbbababaabbbbbbabbababbbbabbaabbabbb\n1 41 40", "80 1\naaabbbaababbabbbbaabbaabbbaaabbabaabaaabbabaaaaabbbbbaaabaaabbbabaaababbbbbbabba\n1 41 40", "80 1\naabbbbbaaabaaabbabaabaababbabbbbabbaaabababbabaaaaabbaaaabaabaabbaaaaabaaaabaaba\n1 41 40"], "outputs": ["YES\nYES\nNO\nYES", "YES\nYES", "YES\nYES\nNO\nNO", "NO", "YES\nYES\nYES\nNO\nYES\nYES\nYES\nYES\nYES\nYES", "NO\nYES\nNO\nYES\nNO\nNO\nYES\nYES\nYES\nNO\nYES\nYES\nNO\nYES\nYES\nNO\nYES\nYES\nYES\nNO\nYES\nYES\nYES\nYES\nYES\nYES\nNO\nNO\nYES\nYES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
b7d321c69eff68ca61b821eff8437223	Median	A median in an array with the length of n is an element which occupies position number after we sort the elements in the non-decreasing order (the array elements are numbered starting with 1). A median of an array (2,<=6,<=1,<=2,<=3) is the number 2, and a median of array (0,<=96,<=17,<=23) — the number 17. We define an expression as the integer part of dividing number a by number b. One day Vasya showed Petya an array consisting of n integers and suggested finding the array's median. Petya didn't even look at the array and said that it equals x. Petya is a very honest boy, so he decided to add several numbers to the given array so that the median of the resulting array would be equal to x. Petya can add any integers from 1 to 105 to the array, including the same numbers. Of course, he can add nothing to the array. If a number is added multiple times, then we should consider it the number of times it occurs. It is not allowed to delete of change initial numbers of the array. While Petya is busy distracting Vasya, your task is to find the minimum number of elements he will need. The first input line contains two space-separated integers n and x (1<=≤<=n<=≤<=500, 1<=≤<=x<=≤<=105) — the initial array's length and the required median's value. The second line contains n space-separated numbers — the initial array. The elements of the array are integers from 1 to 105. The array elements are not necessarily different. Print the only integer — the minimum number of elements Petya needs to add to the array so that its median equals x. Sample Input 3 10 10 20 30 3 4 1 2 3 Sample Output 1 4	{"inputs": ["3 10\n10 20 30", "3 4\n1 2 3", "2 2\n3 2", "5 1\n1 1 2 1 2", "5 4\n5 5 4 3 5", "10 2\n2 2 1 3 2 1 2 1 1 3", "10 55749\n46380 58202 54935 26290 18295 83040 6933 89652 75187 93963", "10 809\n949 31 175 118 640 588 809 398 792 743", "50 1\n1 2 1 2 1 1 1 2 2 2 2 2 1 1 2 2 2 2 1 2 2 2 1 2 1 1 2 1 1 1 2 2 2 2 2 2 2 2 1 2 2 1 1 1 2 2 1 2 2 2", "100 6\n7 5 2 8 4 9 4 8 6 1 7 8 7 8 1 5 4 10 9 10 7 5 6 2 1 6 9 10 6 5 10 9 9 5 1 4 4 5 4 4 1 1 6 7 4 9 3 5 6 5 6 3 7 6 9 4 4 8 7 10 6 10 4 6 6 5 1 9 6 7 10 1 9 4 5 3 7 7 4 4 7 4 7 3 3 7 2 5 5 3 8 9 6 9 4 5 5 9 1 7", "100 813\n285 143 378 188 972 950 222 557 170 755 470 164 800 553 146 820 842 62 496 980 746 944 677 828 465 577 791 277 303 515 561 653 925 692 871 424 626 795 813 343 418 280 123 364 496 447 435 404 645 141 169 315 830 289 450 675 81 212 509 661 7 217 468 877 172 141 475 409 178 71 936 843 761 889 417 282 530 612 328 572 310 632 498 271 19 753 3 787 31 266 251 897 450 206 731 678 64 417 664 224", "100 37\n20 20 3 35 36 14 30 9 33 36 32 46 43 22 43 50 34 6 13 25 1 34 10 6 21 30 19 17 1 23 9 23 38 21 7 43 49 28 33 42 4 19 39 23 12 42 31 13 26 23 1 26 24 48 10 6 12 48 40 18 10 26 9 5 22 45 46 23 46 34 34 45 3 7 16 39 14 29 48 1 12 37 4 20 29 26 35 38 20 47 39 29 12 35 4 32 26 1 50 33", "100 20\n40 44 41 81 59 96 91 49 57 41 44 42 65 31 74 70 54 47 51 7 71 7 75 79 13 20 2 78 66 34 81 84 18 37 85 42 5 40 17 15 66 10 95 93 20 43 63 83 60 61 9 33 68 81 97 25 39 37 22 90 63 45 33 89 1 68 37 66 89 86 6 29 40 33 44 11 83 21 11 32 92 41 45 79 29 86 89 87 14 1 32 22 25 90 56 6 1 49 15 89", "1 1\n1", "1 2\n1", "1 1\n2", "4 1\n2 3 4 5", "9 228\n1 1 1 1 1 1 228 228 228"], "outputs": ["1", "4", "0", "0", "1", "0", "1", "7", "12", "0", "69", "53", "58", "0", "2", "1", "4", "4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	27	codeforces
b7da26f8d4b9ae6a92c5d977a88d7616	Balancer	Petya has k matches, placed in n matchboxes lying in a line from left to right. We know that k is divisible by n. Petya wants all boxes to have the same number of matches inside. For that, he can move a match from its box to the adjacent one in one move. How many such moves does he need to achieve the desired configuration? The first line contains integer n (1<=≤<=n<=≤<=50000). The second line contains n non-negative numbers that do not exceed 109, the i-th written number is the number of matches in the i-th matchbox. It is guaranteed that the total number of matches is divisible by n. Print the total minimum number of moves. Sample Input 6 1 6 2 5 3 7 Sample Output 12	{"inputs": ["6\n1 6 2 5 3 7", "6\n6 6 6 0 0 0", "6\n0 0 0 6 6 6", "6\n6 6 0 0 6 6", "5\n0 0 0 0 0", "10\n0 100 0 100 0 100 0 100 0 100", "1\n0", "2\n0 0", "3\n0 0 0", "4\n0 0 0 0", "2\n921 29111", "2\n0 1000000000", "2\n291911 1", "2\n20180000 0", "10\n10 9 7 13 7 5 13 15 10 11", "100\n6 3 4 5 3 4 2 4 1 2 4 1 8 5 2 2 4 4 6 8 4 10 4 4 6 8 6 5 5 4 8 4 3 3 6 5 7 2 9 7 6 5 6 3 2 6 8 10 3 6 8 7 2 3 5 4 8 6 5 6 6 8 4 1 5 6 1 8 12 5 3 3 8 2 4 2 4 5 6 6 9 5 1 2 8 8 3 7 5 3 4 5 7 6 3 9 4 6 3 6", "10\n1 1 1 1 1 999999999 999999999 999999999 999999999 999999999", "10\n1 1 1 1 1 1 1 1 2 1000000000", "14\n0 0 0 0 0 0 0 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "20\n1 1 1 1 1 1 1 1 1 1 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999", "20\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 2 2 2 2 2 2 2 2 2 2"], "outputs": ["12", "27", "27", "12", "0", "250", "0", "0", "0", "0", "14095", "500000000", "145955", "10090000", "27", "867", "12499999975", "4499999999", "24500000000", "49999999900", "49999999900"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	19	codeforces
b7dcd21ec503ab2edf961df1c3ec9de6	k-rounding	For a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zeros in base 10 and is divisible by n. For example, 4-rounding of 375 is 375·80<==<=30000. 30000 is the minimum integer such that it ends with 4 or more zeros and is divisible by 375. Write a program that will perform the k-rounding of n. The only line contains two integers n and k (1<=≤<=n<=≤<=109, 0<=≤<=k<=≤<=8). Print the k-rounding of n. Sample Input 375 4 10000 1 38101 0 123456789 8 Sample Output 30000 10000 38101 12345678900000000	{"inputs": ["375 4", "10000 1", "38101 0", "123456789 8", "1 0", "2 0", "100 0", "1000000000 0", "160 2", "3 0", "10 0", "1 1", "2 1", "3 1", "4 1", "5 1", "6 1", "7 1", "8 1", "9 1", "10 1", "11 1", "12 1", "16 2", "2 2", "1 2", "5 2", "15 2", "36 2", "1 8", "8 8", "96 8", "175 8", "9999995 8", "999999999 8", "12345678 8", "78125 8", "390625 8", "1953125 8", "9765625 8", "68359375 8", "268435456 8", "125829120 8", "128000 8", "300000 8", "3711871 8", "55555 8", "222222222 8", "479001600 8", "655360001 7", "655360001 8", "1000000000 1", "1000000000 7", "1000000000 8", "100000000 8", "10000000 8", "1000000 8", "10000009 8", "10000005 8", "10000002 8", "999999997 8", "999999997 7", "999999995 8", "123 8", "24 2", "16 4", "123456787 8", "100000000 8", "7 1", "101 1", "50 2", "999999818 1", "2 1", "123 1", "16 1", "1 1", "1000000000 8", "15304 6", "3 8", "4 2", "100000 7", "5 8", "16724 6", "999999999 1", "999999990 8", "999999999 8", "100000 1", "8 3", "16768 6", "123456789 1", "2 8", "999999937 8", "5 1", "2000000 7", "1999998 2", "125 3"], "outputs": ["30000", "10000", "38101", "12345678900000000", "1", "2", "100", "1000000000", "800", "3", "10", "10", "10", "30", "20", "10", "30", "70", "40", "90", "10", "110", "60", "400", "100", "100", "100", "300", "900", "100000000", "100000000", "300000000", "700000000", "199999900000000", "99999999900000000", "617283900000000", "100000000", "100000000", "500000000", "2500000000", "17500000000", "104857600000000", "9830400000000", "400000000", "300000000", "371187100000000", "1111100000000", "11111111100000000", "7484400000000", "6553600010000000", "65536000100000000", "1000000000", "1000000000", "1000000000", "100000000", "100000000", "100000000", "1000000900000000", "200000100000000", "500000100000000", "99999999700000000", "9999999970000000", "19999999900000000", "12300000000", "600", "10000", "12345678700000000", "100000000", "70", "1010", "100", "4999999090", "10", "1230", "80", "10", "1000000000", "1913000000", "300000000", "100", "10000000", "100000000", "4181000000", "9999999990", "9999999900000000", "99999999900000000", "100000", "1000", "262000000", "1234567890", "100000000", "99999993700000000", "10", "10000000", "99999900", "1000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	250	codeforces
b7f25d647ca43fead8becd81059cb693	Bear in the Field	Our bear's forest has a checkered field. The checkered field is an n<=×<=n table, the rows are numbered from 1 to n from top to bottom, the columns are numbered from 1 to n from left to right. Let's denote a cell of the field on the intersection of row x and column y by record (x,<=y). Each cell of the field contains growing raspberry, at that, the cell (x,<=y) of the field contains x<=+<=y raspberry bushes. The bear came out to walk across the field. At the beginning of the walk his speed is (dx,<=dy). Then the bear spends exactly t seconds on the field. Each second the following takes place: - Let's suppose that at the current moment the bear is in cell (x,<=y). - First the bear eats the raspberry from all the bushes he has in the current cell. After the bear eats the raspberry from k bushes, he increases each component of his speed by k. In other words, if before eating the k bushes of raspberry his speed was (dx,<=dy), then after eating the berry his speed equals (dx<=+<=k,<=dy<=+<=k). - Let's denote the current speed of the bear (dx,<=dy) (it was increased after the previous step). Then the bear moves from cell (x,<=y) to cell (((x<=+<=dx<=-<=1) mod n)<=+<=1,<=((y<=+<=dy<=-<=1) mod n)<=+<=1). - Then one additional raspberry bush grows in each cell of the field. You task is to predict the bear's actions. Find the cell he ends up in if he starts from cell (sx,<=sy). Assume that each bush has infinitely much raspberry and the bear will never eat all of it. The first line of the input contains six space-separated integers: n, sx, sy, dx, dy, t (1<=≤<=n<=≤<=109; 1<=≤<=sx,<=sy<=≤<=n; <=-<=100<=≤<=dx,<=dy<=≤<=100; 0<=≤<=t<=≤<=1018). Print two integers — the coordinates of the cell the bear will end up in after t seconds. Sample Input 5 1 2 0 1 2 1 1 1 -1 -1 2 Sample Output 3 11 1	{"inputs": ["5 1 2 0 1 2", "1 1 1 -1 -1 2", "1 1 1 1 1 0", "2 2 1 -2 -2 5", "1000000000 1 1 1 1 1000000000000000000", "1000000000 1 2 -100 -100 1", "3 2 2 -100 -100 2", "1000000000 1000000000 1000000000 100 -100 1000000000000000000", "907122235 107269653 309181328 26 -64 242045007473044676", "804 658 177 -95 37 9", "2 1 1 31 -74 2712360435504330", "230182675 73108597 42152975 -72 -8 93667970058209518", "487599125 469431740 316230350 -77 57 18", "1710 654 941 -81 -37 1281183940", "568980902 147246752 87068387 -17 58 677739653", "38 10 36 19 30 4054886", "546978166 115293871 313560296 -33 54 215761558342792301", "323544442 39059198 2970015 92 17 98", "321575625 2929581 31407414 -40 -44 920902537044", "5928 1508 4358 75 -4 794927060433551549", "7310962 7564 6333485 -45 41 81980903005818", "224 81 30 57 -13 8363", "75081054 91 47131957 -94 -54 5588994022550344", "185144 100489 52 32 -21 5752324832726786", "61728 24280 17963 -19 81 652432745607745078", "25699863 23288611 24796719 -45 46 437606836", "475875319 333393831 284835031 22 7 90332975949346", "372903 106681 40781 54 -40 6188704", "923 452 871 -95 -55 273135237285890", "672939 589365 391409 -54 -70 205083640", "560010572 4172512 514044248 -78 13 97386", "717485513 5935 3 -5 -67 28", "138971202 137695723 48931985 -28 -3 68901440898766", "910958510 60 98575 38 -99 97880", "67163467 36963416 50381 -49 -12 76558237", "557911547 9 460221236 -58 -96 74518856", "85 37 69 30 47 131", "852525230 538352221 97088953 -12 98 9197937568", "885849694 703278210 46391 33 23 965949118732", "976890548 675855343 988 -11 46 796041265897304", "108774060 15274597 430014 -85 -94 6", "2 2 2 -36 94 9429569334", "713835677 404390162 67429 -91 10 178697004637242062", "620330674 603592488 3 38 94 34309127789188", "95 70 7 -36 -100 5", "900854530 82 7 30 -88 6797628981503799", "147834 6 2565 15 -35 166779", "642762664 588605882 1 -47 82 8", "122740849 8646067 70003215 -100 -80 70", "73221379 4311914 992324 65 -40 705623357422685593"], "outputs": ["3 1", "1 1", "1 1", "1 2", "168318977 168318977", "999999904 999999905", "1 1", "969796608 969796608", "23731316 525833901", "270 173", "1 1", "34918692 197804272", "320939970 167740992", "1568 945", "150920864 281916196", "18 36", "353006839 497349709", "105890973 69794440", "320222592 65760999", "4973 5148", "5246110 6302893", "130 205", "6742019 52104963", "56326 173503", "3174 1169", "24072870 13015404", "441571464 288459461", "161485 86089", "563 142", "503747 218115", "11882888 530616750", "71683921 71676253", "110585553 85995539", "304849180 291538135", "23368224 65407811", "246089810 106240697", "74 38", "84737577 321684009", "16593182 13087113", "652954007 789518296", "98184736 83340099", "1 1", "244834060 560206120", "200990066 258175045", "85 82", "66039616 641057009", "54423 144570", "355500874 409658689", "80795619 19413318", "62692638 21726334"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
b7fb6e57a6651eb7e580fa89cf2c426c	Cutting Rectangle	A rectangle with sides $A$ and $B$ is cut into rectangles with cuts parallel to its sides. For example, if $p$ horizontal and $q$ vertical cuts were made, $(p + 1) \cdot (q + 1)$ rectangles were left after the cutting. After the cutting, rectangles were of $n$ different types. Two rectangles are different if at least one side of one rectangle isn't equal to the corresponding side of the other. Note that the rectangle can't be rotated, this means that rectangles $a \times b$ and $b \times a$ are considered different if $a \neq b$. For each type of rectangles, lengths of the sides of rectangles are given along with the amount of the rectangles of this type that were left after cutting the initial rectangle. Calculate the amount of pairs $(A; B)$ such as the given rectangles could be created by cutting the rectangle with sides of lengths $A$ and $B$. Note that pairs $(A; B)$ and $(B; A)$ are considered different when $A \neq B$. The first line consists of a single integer $n$ ($1 \leq n \leq 2 \cdot 10^{5}$) — amount of different types of rectangles left after cutting the initial rectangle. The next $n$ lines each consist of three integers $w_{i}, h_{i}, c_{i}$ $(1 \leq w_{i}, h_{i}, c_{i} \leq 10^{12})$ — the lengths of the sides of the rectangles of this type and the amount of the rectangles of this type. It is guaranteed that the rectangles of the different types are different. Output one integer — the answer to the problem. Sample Input 1 1 1 9 2 2 3 20 2 4 40 2 1 2 5 2 3 5 Sample Output 3 6 0	{"inputs": ["1\n1 1 9", "2\n2 3 20\n2 4 40", "2\n1 2 5\n2 3 5"], "outputs": ["3", "6", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
b81d6b2d5370a2792e2da862c3adb452	Two Squares	You are given two squares, one with sides parallel to the coordinate axes, and another one with sides at 45 degrees to the coordinate axes. Find whether the two squares intersect. The interior of the square is considered to be part of the square, i.e. if one square is completely inside another, they intersect. If the two squares only share one common point, they are also considered to intersect. The input data consists of two lines, one for each square, both containing 4 pairs of integers. Each pair represents coordinates of one vertex of the square. Coordinates within each line are either in clockwise or counterclockwise order. The first line contains the coordinates of the square with sides parallel to the coordinate axes, the second line contains the coordinates of the square at 45 degrees. All the values are integer and between $-100$ and $100$. Print "Yes" if squares intersect, otherwise print "No". You can print each letter in any case (upper or lower). Sample Input 0 0 6 0 6 6 0 6 1 3 3 5 5 3 3 1 0 0 6 0 6 6 0 6 7 3 9 5 11 3 9 1 6 0 6 6 0 6 0 0 7 4 4 7 7 10 10 7 Sample Output YES NO YES	{"inputs": ["0 0 6 0 6 6 0 6\n1 3 3 5 5 3 3 1", "0 0 6 0 6 6 0 6\n7 3 9 5 11 3 9 1", "6 0 6 6 0 6 0 0\n7 4 4 7 7 10 10 7", "0 0 6 0 6 6 0 6\n8 4 4 8 8 12 12 8", "2 2 4 2 4 4 2 4\n0 3 3 6 6 3 3 0", "-5 -5 5 -5 5 5 -5 5\n-5 7 0 2 5 7 0 12", "-5 -5 5 -5 5 5 -5 5\n-5 12 0 7 5 12 0 17", "-5 -5 5 -5 5 5 -5 5\n6 0 0 6 -6 0 0 -6", "-100 -100 100 -100 100 100 -100 100\n-100 0 0 -100 100 0 0 100", "92 1 92 98 -5 98 -5 1\n44 60 56 48 44 36 32 48", "-12 -54 -12 33 -99 33 -99 -54\n-77 -40 -86 -31 -77 -22 -68 -31", "3 45 19 45 19 61 3 61\n-29 45 -13 29 3 45 -13 61", "79 -19 79 15 45 15 45 -19\n-1 24 -29 52 -1 80 27 52", "75 -57 75 -21 39 -21 39 -57\n10 -42 -32 0 10 42 52 0", "-11 53 9 53 9 73 -11 73\n-10 9 -43 42 -10 75 23 42", "-10 -36 -10 27 -73 27 -73 -36\n44 -28 71 -55 44 -82 17 -55", "-63 -15 6 -15 6 54 -63 54\n15 -13 -8 10 15 33 38 10", "47 15 51 15 51 19 47 19\n19 0 -27 46 19 92 65 46", "87 -5 87 79 3 79 3 -5\n36 36 78 -6 36 -48 -6 -6", "-4 56 10 56 10 70 -4 70\n-11 47 -35 71 -11 95 13 71", "-41 6 -41 8 -43 8 -43 6\n-7 27 43 -23 -7 -73 -57 -23", "44 -58 44 7 -21 7 -21 -58\n22 19 47 -6 22 -31 -3 -6", "-37 -63 49 -63 49 23 -37 23\n-52 68 -21 37 -52 6 -83 37", "93 20 93 55 58 55 58 20\n61 -17 39 5 61 27 83 5", "-7 4 -7 58 -61 58 -61 4\n-28 45 -17 34 -28 23 -39 34", "24 -79 87 -79 87 -16 24 -16\n-59 21 -85 47 -59 73 -33 47", "-68 -15 6 -15 6 59 -68 59\n48 -18 57 -27 48 -36 39 -27", "25 1 25 91 -65 91 -65 1\n24 3 15 12 24 21 33 12", "55 24 73 24 73 42 55 42\n49 17 10 56 49 95 88 56", "69 -65 69 -28 32 -28 32 -65\n-1 50 43 6 -1 -38 -45 6", "86 -26 86 18 42 18 42 -26\n3 -22 -40 21 3 64 46 21", "52 -47 52 -30 35 -30 35 -47\n49 -22 64 -37 49 -52 34 -37", "27 -59 27 9 -41 9 -41 -59\n-10 -17 2 -29 -10 -41 -22 -29", "-90 2 0 2 0 92 -90 92\n-66 31 -86 51 -66 71 -46 51", "-93 -86 -85 -86 -85 -78 -93 -78\n-13 61 0 48 -13 35 -26 48", "-3 -45 85 -45 85 43 -3 43\n-22 0 -66 44 -22 88 22 44", "-27 -73 72 -73 72 26 -27 26\n58 11 100 -31 58 -73 16 -31", "-40 -31 8 -31 8 17 -40 17\n0 18 -35 53 0 88 35 53", "-15 -63 -15 7 -85 7 -85 -63\n-35 -40 -33 -42 -35 -44 -37 -42", "-100 -100 -100 100 100 100 100 -100\n-100 0 0 100 100 0 0 -100", "67 33 67 67 33 67 33 33\n43 11 9 45 43 79 77 45", "14 8 9 8 9 3 14 3\n-2 -13 14 3 30 -13 14 -29", "4 3 7 3 7 6 4 6\n7 29 20 16 7 3 -6 16", "14 30 3 30 3 19 14 19\n19 -13 11 -5 19 3 27 -5", "-54 3 -50 3 -50 -1 -54 -1\n3 -50 -6 -41 -15 -50 -6 -59", "3 8 3 -10 21 -10 21 8\n-9 2 -21 -10 -9 -22 3 -10", "-35 3 -21 3 -21 -11 -35 -11\n-8 -10 3 -21 -8 -32 -19 -21", "-5 -23 -5 -31 3 -31 3 -23\n-7 -23 -2 -28 3 -23 -2 -18", "3 20 10 20 10 13 3 13\n3 20 21 38 39 20 21 2", "25 3 16 3 16 12 25 12\n21 -2 16 -7 11 -2 16 3", "-1 18 -1 3 14 3 14 18\n14 3 19 8 14 13 9 8", "-44 -17 -64 -17 -64 3 -44 3\n-56 15 -44 27 -32 15 -44 3", "17 3 2 3 2 18 17 18\n22 23 2 3 -18 23 2 43", "3 -22 3 -36 -11 -36 -11 -22\n11 -44 19 -36 11 -28 3 -36", "3 45 3 48 0 48 0 45\n13 38 4 47 13 56 22 47", "3 -10 2 -10 2 -9 3 -9\n38 -10 20 -28 2 -10 20 8", "-66 3 -47 3 -47 22 -66 22\n-52 -2 -45 5 -52 12 -59 5", "3 37 -1 37 -1 41 3 41\n6 31 9 34 6 37 3 34", "13 1 15 1 15 3 13 3\n13 19 21 11 13 3 5 11", "20 8 3 8 3 -9 20 -9\n2 -11 3 -10 2 -9 1 -10", "3 41 3 21 -17 21 -17 41\n26 12 10 28 26 44 42 28", "11 11 11 3 3 3 3 11\n-12 26 -27 11 -12 -4 3 11", "-29 3 -29 12 -38 12 -38 3\n-35 9 -29 15 -23 9 -29 3", "3 -32 1 -32 1 -30 3 -30\n4 -32 -16 -52 -36 -32 -16 -12", "-16 -10 -16 9 3 9 3 -10\n-8 -1 2 9 12 -1 2 -11", "3 -42 -5 -42 -5 -34 3 -34\n-8 -54 -19 -43 -8 -32 3 -43", "-47 3 -37 3 -37 -7 -47 -7\n-37 3 -33 -1 -37 -5 -41 -1", "10 3 12 3 12 5 10 5\n12 4 20 12 12 20 4 12", "3 -41 -9 -41 -9 -53 3 -53\n18 -16 38 -36 18 -56 -2 -36", "3 40 2 40 2 41 3 41\n22 39 13 48 4 39 13 30", "21 26 21 44 3 44 3 26\n-20 38 -32 26 -20 14 -8 26", "0 7 3 7 3 10 0 10\n3 9 -17 29 -37 9 -17 -11", "3 21 3 18 6 18 6 21\n-27 18 -11 2 5 18 -11 34", "-29 13 -39 13 -39 3 -29 3\n-36 -4 -50 -18 -36 -32 -22 -18", "3 -26 -2 -26 -2 -21 3 -21\n-5 -37 -16 -26 -5 -15 6 -26", "3 9 -1 9 -1 13 3 13\n-9 17 -1 9 -9 1 -17 9", "48 8 43 8 43 3 48 3\n31 -4 43 8 55 -4 43 -16", "-3 1 3 1 3 -5 -3 -5\n20 -22 3 -5 20 12 37 -5", "14 3 14 -16 -5 -16 -5 3\n14 2 15 1 14 0 13 1", "-10 12 -10 -1 3 -1 3 12\n1 10 -2 7 -5 10 -2 13", "39 21 21 21 21 3 39 3\n27 3 47 -17 27 -37 7 -17", "3 1 3 17 -13 17 -13 1\n17 20 10 27 3 20 10 13", "15 -18 3 -18 3 -6 15 -6\n29 -1 16 -14 3 -1 16 12", "41 -6 41 3 32 3 32 -6\n33 3 35 5 33 7 31 5", "7 35 3 35 3 39 7 39\n23 15 3 35 23 55 43 35", "19 19 35 19 35 3 19 3\n25 -9 16 -18 7 -9 16 0", "-20 3 -20 9 -26 9 -26 3\n-19 4 -21 2 -19 0 -17 2", "13 3 22 3 22 -6 13 -6\n26 3 22 -1 18 3 22 7", "-4 -8 -4 -15 3 -15 3 -8\n-10 5 -27 -12 -10 -29 7 -12", "3 15 7 15 7 19 3 19\n-12 30 -23 19 -12 8 -1 19", "-12 3 5 3 5 -14 -12 -14\n-14 22 5 3 24 22 5 41", "-37 3 -17 3 -17 -17 -37 -17\n-9 -41 9 -23 -9 -5 -27 -23", "3 57 3 45 -9 45 -9 57\n8 50 21 37 8 24 -5 37", "42 3 42 -6 33 -6 33 3\n42 4 41 3 40 4 41 5", "3 59 3 45 -11 45 -11 59\n-2 50 -8 44 -2 38 4 44", "-51 3 -39 3 -39 15 -51 15\n-39 14 -53 0 -39 -14 -25 0", "-7 -15 -7 3 11 3 11 -15\n15 -1 22 -8 15 -15 8 -8", "3 -39 14 -39 14 -50 3 -50\n17 -39 5 -27 -7 -39 5 -51", "91 -27 91 29 35 29 35 -27\n59 39 95 3 59 -33 23 3", "-81 -60 -31 -60 -31 -10 -81 -10\n-58 -68 -95 -31 -58 6 -21 -31", "78 -59 78 -2 21 -2 21 -59\n48 1 86 -37 48 -75 10 -37", "-38 -26 32 -26 32 44 -38 44\n2 -27 -44 19 2 65 48 19", "73 -54 73 -4 23 -4 23 -54\n47 1 77 -29 47 -59 17 -29", "-6 -25 46 -25 46 27 -6 27\n21 -43 -21 -1 21 41 63 -1", "-17 -91 -17 -27 -81 -27 -81 -91\n-48 -21 -12 -57 -48 -93 -84 -57", "-7 16 43 16 43 66 -7 66\n18 -7 -27 38 18 83 63 38", "-46 11 16 11 16 73 -46 73\n-18 -8 -67 41 -18 90 31 41", "-33 -64 25 -64 25 -6 -33 -6\n-5 -74 -51 -28 -5 18 41 -28", "99 -100 100 -100 100 -99 99 -99\n99 -99 100 -98 99 -97 98 -98", "-100 -100 -100 -99 -99 -99 -99 -100\n-10 -10 -9 -9 -10 -8 -11 -9", "-4 3 -3 3 -3 4 -4 4\n0 -4 4 0 0 4 -4 0", "0 0 10 0 10 10 0 10\n11 9 13 7 15 9 13 11", "1 1 1 6 6 6 6 1\n5 8 8 11 11 8 8 5", "99 99 99 100 100 100 100 99\n-100 0 0 100 100 0 0 -100", "0 0 0 2 2 2 2 0\n5 1 9 5 5 9 1 5", "3 2 3 3 4 3 4 2\n0 4 4 0 0 -4 -4 0", "0 0 2 0 2 2 0 2\n4 1 7 4 4 7 1 4", "3 6 3 8 5 8 5 6\n2 9 4 11 6 9 4 7", "0 0 10 0 10 10 0 10\n-1 5 5 -1 11 5 5 11", "0 0 1 0 1 1 0 1\n3 0 6 3 3 6 0 3", "3 7 4 7 4 6 3 6\n0 0 10 10 20 0 10 -10", "0 0 0 1 1 1 1 0\n0 3 3 6 6 3 3 0", "0 0 0 4 4 4 4 0\n3 6 7 10 11 6 7 2", "0 0 0 1 1 1 1 0\n0 10 10 0 20 10 10 20"], "outputs": ["YES", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	54	codeforces
b82293c0815f13d9f04492522106193c	Cows and Sequence	Bessie and the cows are playing with sequences and need your help. They start with a sequence, initially containing just the number 0, and perform n operations. Each operation is one of the following: 1. Add the integer xi to the first ai elements of the sequence. 1. Append an integer ki to the end of the sequence. (And hence the size of the sequence increases by 1) 1. Remove the last element of the sequence. So, the size of the sequence decreases by one. Note, that this operation can only be done if there are at least two elements in the sequence. After each operation, the cows would like to know the average of all the numbers in the sequence. Help them! The first line contains a single integer n (1<=≤<=n<=≤<=2·105) — the number of operations. The next n lines describe the operations. Each line will start with an integer ti (1<=≤<=ti<=≤<=3), denoting the type of the operation (see above). If ti<==<=1, it will be followed by two integers ai,<=xi (\|xi\|<=≤<=103; 1<=≤<=ai). If ti<==<=2, it will be followed by a single integer ki (\|ki\|<=≤<=103). If ti<==<=3, it will not be followed by anything. It is guaranteed that all operations are correct (don't touch nonexistent elements) and that there will always be at least one element in the sequence. Output n lines each containing the average of the numbers in the sequence after the corresponding operation. The answer will be considered correct if its absolute or relative error doesn't exceed 10<=-<=6. Sample Input 5 2 1 3 2 3 2 1 3 6 2 1 1 2 20 2 2 1 2 -3 3 3 Sample Output 0.500000 0.000000 1.500000 1.333333 1.500000 0.500000 20.500000 14.333333 12.333333 17.500000 17.000000	{"inputs": ["5\n2 1\n3\n2 3\n2 1\n3", "6\n2 1\n1 2 20\n2 2\n1 2 -3\n3\n3", "1\n1 1 1", "1\n2 1", "2\n2 1\n1 2 1", "5\n2 1\n1 2 1\n2 1\n2 1\n1 2 1", "5\n1 1 7\n1 1 7\n1 1 7\n2 5\n1 2 2", "5\n1 1 -48\n1 1 19\n1 1 -35\n2 -67\n1 2 -13", "1\n1 1 0", "1\n2 0", "5\n2 -980\n1 2 -156\n2 641\n2 -253\n2 -514"], "outputs": ["0.500000\n0.000000\n1.500000\n1.333333\n1.500000", "0.500000\n20.500000\n14.333333\n12.333333\n17.500000\n17.000000", "1.000000", "0.500000", "0.500000\n1.500000", "0.500000\n1.500000\n1.333333\n1.250000\n1.750000", "7.000000\n14.000000\n21.000000\n13.000000\n15.000000", "-48.000000\n-29.000000\n-64.000000\n-65.500000\n-78.500000", "0.000000", "0.000000", "-490.000000\n-646.000000\n-217.000000\n-226.000000\n-283.600000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	22	codeforces
b85848958f173f58de6def1bf136ec8e	A Heap of Heaps	Andrew skipped lessons on the subject 'Algorithms and Data Structures' for the entire term. When he came to the final test, the teacher decided to give him a difficult task as a punishment. The teacher gave Andrew an array of n numbers a1, ..., an. After that he asked Andrew for each k from 1 to n<=-<=1 to build a k-ary heap on the array and count the number of elements for which the property of the minimum-rooted heap is violated, i.e. the value of an element is less than the value of its parent. Andrew looked up on the Wikipedia that a k-ary heap is a rooted tree with vertices in elements of the array. If the elements of the array are indexed from 1 to n, then the children of element v are elements with indices k(v<=-<=1)<=+<=2, ..., kv<=+<=1 (if some of these elements lie outside the borders of the array, the corresponding children are absent). In any k-ary heap every element except for the first one has exactly one parent; for the element 1 the parent is absent (this element is the root of the heap). Denote p(v) as the number of the parent of the element with the number v. Let's say that for a non-root element v the property of the heap is violated if av<=<<=ap(v). Help Andrew cope with the task! The first line contains a single integer n (2<=≤<=n<=≤<=2·105). The second line contains n space-separated integers a1, ..., an (<=-<=109<=≤<=ai<=≤<=109). in a single line print n<=-<=1 integers, separate the consecutive numbers with a single space — the number of elements for which the property of the k-ary heap is violated, for k<==<=1, 2, ..., n<=-<=1. Sample Input 5 1 5 4 3 2 6 2 2 2 2 2 2 Sample Output 3 2 1 0 0 0 0 0 0	{"inputs": ["5\n1 5 4 3 2", "6\n2 2 2 2 2 2", "2\n0 0", "2\n1 2", "2\n10 -1", "5\n934 235 171 111 197", "100\n0 1 1 1 0 0 0 2 1 2 2 1 2 2 2 0 0 2 1 2 0 1 1 0 2 0 1 2 2 0 2 0 1 0 1 2 0 2 1 1 0 1 0 1 0 0 1 2 2 2 2 1 1 1 0 2 1 0 0 0 0 0 1 0 2 0 1 0 0 2 0 2 2 1 0 2 2 0 2 0 2 1 2 1 1 1 0 2 1 0 2 1 1 2 1 2 0 1 2 2", "2\n-492673762 -496405053", "100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0"], "outputs": ["3 2 1 0", "0 0 0 0 0", "0", "0", "1", "3 4 4 4", "36 29 38 33 35 33 34 31 28 21 21 21 17 14 17 18 21 22 23 24 24 25 25 26 25 25 25 25 24 24 23 23 22 22 22 21 21 21 21 20 20 19 19 18 17 17 17 17 17 17 17 17 17 16 16 16 15 14 13 12 11 11 10 10 9 9 8 7 7 6 6 6 6 5 5 5 4 4 3 3 3 3 3 3 3 2 2 2 1 1 1 1 1 1 1 0 0 0 0", "1", "0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
b8647a7e2926935660a06e9ef1fce9ea	Declined Finalists	This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, though. Initially the top 25 contestants are invited to come onsite. Each eligible contestant must either accept or decline the invitation. Whenever a contestant declines, the highest ranked contestant not yet invited is invited to take the place of the one that declined. This continues until 25 contestants have accepted invitations. After the qualifying round completes, you know K of the onsite finalists, as well as their qualifying ranks (which start at 1, there are no ties). Determine the minimum possible number of contestants that declined the invitation to compete onsite in the final round. The first line of input contains K (1<=≤<=K<=≤<=25), the number of onsite finalists you know. The second line of input contains r1,<=r2,<=...,<=rK (1<=≤<=ri<=≤<=106), the qualifying ranks of the finalists you know. All these ranks are distinct. Print the minimum possible number of contestants that declined the invitation to compete onsite. Sample Input 25 2 3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 28 5 16 23 8 15 4 3 14 15 92 Sample Output 3 0 67	{"inputs": ["25\n2 3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 28", "5\n16 23 8 15 4", "3\n14 15 92", "1\n1000000", "25\n1000000 999999 999998 999997 999996 999995 999994 999993 999992 999991 999990 999989 999988 999987 999986 999985 999984 999983 999982 999981 999980 999979 999978 999977 999976", "25\n13 15 24 2 21 18 9 4 16 6 10 25 20 11 23 17 8 3 1 12 5 19 22 14 7", "10\n17 11 7 13 18 12 14 5 16 2", "22\n22 14 23 20 11 21 4 12 3 8 7 9 19 10 13 17 15 1 5 18 16 2", "21\n6 21 24 3 10 23 14 2 26 12 8 1 15 13 9 5 19 20 4 16 22", "1\n1", "2\n100 60", "4\n999 581 787 236", "6\n198 397 732 1234 309 827", "11\n6494 3961 1858 4351 8056 780 7720 6211 1961 8192 3621", "14\n18809 9534 11652 6493 8929 9370 4125 23888 16403 3559 23649 19243 14289 17852", "18\n24939 35558 47058 70307 26221 12866 3453 40422 47557 36322 40698 64060 10825 77777 48645 26124 4859 64222", "24\n633483 654321 122445 481150 347578 37803 525083 151084 211073 358699 339420 452023 219553 119727 74852 66750 371279 405099 618894 649977 235337 607819 81649 649804", "25\n58115 794098 753382 484882 238434 674285 690118 858677 196185 173301 349729 918792 600745 636016 122678 366783 137179 377098 917081 369620 449039 379412 503678 1000000 292099", "2\n26 27", "3\n40 30 35", "2\n46 45", "3\n1 25 90", "5\n14 15 16 30 92", "2\n1000 1001", "25\n3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 28 2"], "outputs": ["3", "0", "67", "999975", "999975", "0", "0", "0", "1", "0", "75", "974", "1209", "8167", "23863", "77752", "654296", "999975", "2", "15", "21", "65", "67", "976", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	279	codeforces
b86e30843c84440849b6b0560eb93808	st-Spanning Tree	You are given an undirected connected graph consisting of n vertices and m edges. There are no loops and no multiple edges in the graph. You are also given two distinct vertices s and t, and two values ds and dt. Your task is to build any spanning tree of the given graph (note that the graph is not weighted), such that the degree of the vertex s doesn't exceed ds, and the degree of the vertex t doesn't exceed dt, or determine, that there is no such spanning tree. The spanning tree of the graph G is a subgraph which is a tree and contains all vertices of the graph G. In other words, it is a connected graph which contains n<=-<=1 edges and can be obtained by removing some of the edges from G. The degree of a vertex is the number of edges incident to this vertex. The first line of the input contains two integers n and m (2<=≤<=n<=≤<=200<=000, 1<=≤<=m<=≤<=min(400<=000,<=n·(n<=-<=1)<=/<=2)) — the number of vertices and the number of edges in the graph. The next m lines contain the descriptions of the graph's edges. Each of the lines contains two integers u and v (1<=≤<=u,<=v<=≤<=n, u<=≠<=v) — the ends of the corresponding edge. It is guaranteed that the graph contains no loops and no multiple edges and that it is connected. The last line contains four integers s, t, ds, dt (1<=≤<=s,<=t<=≤<=n, s<=≠<=t, 1<=≤<=ds,<=dt<=≤<=n<=-<=1). If the answer doesn't exist print "No" (without quotes) in the only line of the output. Otherwise, in the first line print "Yes" (without quotes). In the each of the next (n<=-<=1) lines print two integers — the description of the edges of the spanning tree. Each of the edges of the spanning tree must be printed exactly once. You can output edges in any order. You can output the ends of each edge in any order. If there are several solutions, print any of them. Sample Input 3 3 1 2 2 3 3 1 1 2 1 1 7 8 7 4 1 3 5 4 5 7 3 2 2 4 6 1 1 2 6 4 1 4 Sample Output Yes 3 2 1 3 Yes 1 3 5 7 3 2 7 4 2 4 6 1	{"inputs": ["3 3\n1 2\n2 3\n3 1\n1 2 1 1", "7 8\n7 4\n1 3\n5 4\n5 7\n3 2\n2 4\n6 1\n1 2\n6 4 1 4", "10 15\n4 1\n5 10\n2 1\n5 7\n9 2\n4 6\n6 7\n9 1\n6 9\n8 4\n8 3\n9 8\n3 9\n2 3\n7 10\n10 1 2 3", "10 10\n1 3\n10 3\n6 1\n2 7\n1 7\n1 9\n9 5\n2 10\n10 8\n4 3\n9 5 2 4", "4 4\n1 4\n4 2\n1 3\n4 3\n3 4 3 3", "3 2\n3 1\n2 3\n1 2 1 1", "2 1\n1 2\n1 2 1 1", "3 3\n2 3\n1 2\n1 3\n2 3 1 1", "2 1\n2 1\n1 2 1 1", "3 3\n3 1\n3 2\n2 1\n1 3 1 1", "2 1\n2 1\n2 1 1 1", "5 6\n4 1\n3 2\n1 2\n1 3\n5 1\n3 4\n5 4 1 1", "44 63\n19 38\n36 18\n3 11\n30 44\n24 31\n1 8\n28 38\n38 30\n14 24\n36 34\n32 38\n39 34\n17 38\n35 22\n5 43\n20 10\n22 10\n9 39\n42 22\n20 32\n14 6\n38 42\n40 38\n1 7\n36 15\n3 37\n36 10\n36 33\n12 38\n33 23\n10 43\n26 36\n35 44\n16 20\n9 36\n3 36\n1 2\n36 27\n21 36\n36 13\n25 37\n29 30\n36 31\n5 28\n31 20\n35 41\n16 36\n36 25\n8 14\n17 39\n42 28\n34 5\n41 38\n1 36\n15 24\n3 16\n14 1\n44 23\n6 26\n30 4\n30 23\n38 36\n5 11\n25 4 12 10", "10 16\n6 1\n1 10\n6 5\n5 7\n5 2\n4 1\n1 3\n5 8\n1 8\n1 7\n4 5\n9 1\n10 5\n9 5\n3 5\n1 2\n1 5 4 5", "2 1\n1 2\n1 2 1 1", "2 1\n2 1\n1 2 1 1", "3 2\n2 1\n3 1\n1 2 1 1", "3 2\n2 1\n3 1\n1 2 2 1", "3 2\n2 1\n3 1\n1 2 1 2", "3 2\n2 1\n3 1\n3 2 1 1", "10 15\n3 2\n9 3\n9 4\n7 3\n9 1\n5 9\n9 8\n7 5\n5 2\n4 3\n6 8\n7 9\n9 10\n9 6\n5 6\n5 9 1 3", "6 11\n1 5\n4 2\n5 2\n6 2\n4 6\n6 1\n3 5\n5 6\n1 2\n1 4\n1 3\n5 1 1 1", "5 6\n3 1\n5 1\n3 5\n4 5\n1 2\n3 2\n1 3 1 1", "15 15\n6 2\n7 5\n14 11\n8 10\n13 10\n10 9\n3 14\n9 6\n3 1\n5 6\n1 15\n2 12\n11 4\n2 3\n11 9\n9 2 2 2", "5 5\n1 3\n1 4\n1 5\n2 3\n2 4\n1 2 2 2", "23 32\n20 22\n17 21\n22 5\n11 13\n14 22\n1 16\n6 3\n8 5\n16 10\n10 22\n7 17\n21 1\n12 1\n14 19\n17 19\n12 17\n15 18\n9 19\n11 23\n12 2\n1 17\n14 4\n13 9\n23 1\n11 20\n20 16\n2 6\n7 23\n16 6\n18 14\n23 10\n5 3\n12 6 9 9", "14 18\n6 9\n9 7\n6 10\n14 9\n5 9\n9 3\n3 1\n2 13\n13 8\n1 8\n11 3\n10 5\n12 5\n5 8\n13 7\n4 11\n2 5\n9 11\n8 3 2 2", "5 7\n1 3\n4 2\n5 1\n4 3\n2 3\n4 5\n1 2\n1 4 2 2", "24 34\n21 22\n10 6\n22 5\n16 9\n18 11\n11 6\n24 6\n6 1\n18 2\n19 1\n21 14\n16 24\n13 18\n6 20\n17 18\n3 2\n21 3\n3 10\n14 16\n3 23\n6 13\n8 20\n1 9\n16 22\n22 1\n13 17\n12 4\n6 4\n5 3\n9 13\n23 15\n21 6\n21 7\n6 19\n4 6 2 3", "27 30\n17 27\n14 24\n1 17\n20 15\n15 21\n16 19\n6 13\n12 20\n3 16\n10 25\n7 26\n12 25\n17 26\n24 17\n2 6\n22 27\n22 9\n5 16\n3 25\n20 11\n23 24\n26 22\n11 13\n20 8\n17 11\n6 4\n22 25\n26 18\n9 6\n3 11\n19 16 5 20", "30 32\n17 28\n7 28\n8 3\n15 25\n30 18\n2 12\n7 23\n15 29\n8 14\n7 24\n13 2\n9 1\n26 29\n9 21\n18 13\n22 6\n9 15\n23 30\n17 26\n9 26\n17 16\n5 2\n7 8\n7 5\n17 20\n29 10\n21 4\n5 19\n5 11\n29 6\n24 1\n24 27\n7 27 4 9", "17 27\n12 11\n5 12\n12 17\n7 14\n4 14\n17 8\n7 9\n15 13\n4 3\n13 17\n11 5\n15 8\n14 17\n8 13\n16 7\n8 3\n1 6\n8 7\n12 9\n7 11\n14 15\n3 7\n8 4\n7 2\n8 14\n14 10\n15 1\n15 6 2 3"], "outputs": ["Yes\n3 2\n1 3", "Yes\n1 3\n5 7\n3 2\n7 4\n2 4\n6 1", "Yes\n5 7\n9 2\n4 6\n6 7\n6 9\n8 4\n8 3\n7 10\n1 2", "Yes\n1 3\n10 3\n6 1\n2 7\n1 7\n10 8\n4 3\n1 9\n9 5", "Yes\n2 4\n1 3\n3 4", "Yes\n3 2\n1 3", "Yes\n1 2", "Yes\n1 3\n2 1", "Yes\n1 2", "Yes\n2 3\n1 2", "Yes\n2 1", "Yes\n3 2\n1 2\n3 4\n5 1", "Yes\n19 38\n36 18\n3 11\n30 44\n24 31\n1 8\n28 38\n38 30\n14 24\n36 34\n32 38\n39 34\n17 38\n35 22\n5 43\n20 10\n22 10\n9 39\n42 22\n20 32\n14 6\n40 38\n1 7\n36 15\n3 37\n36 10\n36 33\n12 38\n33 23\n10 43\n26 36\n16 20\n3 36\n1 2\n36 27\n21 36\n36 13\n29 30\n36 31\n35 41\n8 14\n37 25\n4 30", "Yes\n2 1\n3 1\n4 1\n6 5\n7 5\n8 5\n9 5\n10 5\n1 6", "Yes\n1 2", "Yes\n1 2", "No", "Yes\n3 1\n1 2", "No", "Yes\n1 2\n3 1", "No", "No", "No", "No", "Yes\n5 1\n3 2\n4 2\n1 3", "Yes\n20 22\n17 21\n22 5\n11 13\n14 22\n1 16\n8 5\n16 10\n10 22\n7 17\n21 1\n14 19\n15 18\n9 19\n11 23\n14 4\n13 9\n18 14\n5 3\n2 12\n17 12\n6 2", "Yes\n6 9\n9 7\n6 10\n14 9\n5 9\n2 13\n12 5\n13 7\n4 11\n9 11\n1 8\n11 3\n8 5", "Yes\n2 3\n3 1\n5 4\n1 5", "Yes\n21 22\n22 5\n16 9\n18 11\n18 2\n19 1\n21 14\n16 24\n13 18\n17 18\n3 2\n21 3\n3 10\n14 16\n3 23\n8 20\n1 9\n23 15\n21 7\n24 6\n12 4\n20 6\n4 6", "Yes\n17 27\n14 24\n1 17\n20 15\n15 21\n6 13\n12 20\n10 25\n7 26\n12 25\n17 26\n24 17\n2 6\n22 27\n22 9\n3 25\n20 11\n23 24\n11 13\n20 8\n17 11\n6 4\n26 18\n5 16\n3 16\n19 16", "Yes\n17 28\n8 3\n15 25\n30 18\n2 12\n15 29\n8 14\n13 2\n9 1\n26 29\n9 21\n18 13\n22 6\n9 15\n23 30\n17 26\n17 16\n5 2\n17 20\n29 10\n21 4\n5 19\n5 11\n29 6\n24 1\n23 7\n8 7\n28 7\n27 24", "Yes\n12 11\n5 12\n12 17\n7 14\n4 14\n17 8\n7 9\n4 3\n13 17\n14 17\n16 7\n7 2\n14 10\n14 15\n1 6\n15 1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
b8a883f6d70b75a151dc0664da41aa54	Counting Rectangles is Fun	There is an n<=×<=m rectangular grid, each cell of the grid contains a single integer: zero or one. Let's call the cell on the i-th row and the j-th column as (i,<=j). Let's define a "rectangle" as four integers a,<=b,<=c,<=d (1<=≤<=a<=≤<=c<=≤<=n; 1<=≤<=b<=≤<=d<=≤<=m). Rectangle denotes a set of cells of the grid {(x,<=y) :<= a<=≤<=x<=≤<=c,<=b<=≤<=y<=≤<=d}. Let's define a "good rectangle" as a rectangle that includes only the cells with zeros. You should answer the following q queries: calculate the number of good rectangles all of which cells are in the given rectangle. There are three integers in the first line: n, m and q (1<=≤<=n,<=m<=≤<=40,<=1<=≤<=q<=≤<=3·105). Each of the next n lines contains m characters — the grid. Consider grid rows are numbered from top to bottom, and grid columns are numbered from left to right. Both columns and rows are numbered starting from 1. Each of the next q lines contains a query — four integers that describe the current rectangle, a, b, c, d (1<=≤<=a<=≤<=c<=≤<=n; 1<=≤<=b<=≤<=d<=≤<=m). For each query output an answer — a single integer in a separate line. Sample Input 5 5 5 00101 00000 00001 01000 00001 1 2 2 4 4 5 4 5 1 2 5 2 2 2 4 5 4 2 5 3 4 7 5 0000100 0000010 0011000 0000000 1 7 2 7 3 1 3 1 2 3 4 5 1 2 2 7 2 2 4 7 Sample Output 10 1 7 34 5 3 1 16 27 52	{"inputs": ["5 5 5\n00101\n00000\n00001\n01000\n00001\n1 2 2 4\n4 5 4 5\n1 2 5 2\n2 2 4 5\n4 2 5 3", "4 7 5\n0000100\n0000010\n0011000\n0000000\n1 7 2 7\n3 1 3 1\n2 3 4 5\n1 2 2 7\n2 2 4 7", "10 10 10\n0010001010\n0011011010\n0100001110\n0010100000\n0000100011\n0100000001\n0000010100\n1000000010\n0000010000\n0110010000\n1 1 4 6\n2 6 3 10\n1 6 3 9\n6 5 8 5\n2 3 6 8\n4 7 5 8\n3 1 9 5\n2 5 4 10\n2 3 3 6\n7 4 9 5", "10 10 10\n0001000111\n1101000111\n1100101111\n1011101011\n1011110101\n1110101110\n1101101111\n1111111100\n0110101110\n1011101011\n6 3 7 9\n2 6 8 7\n9 7 10 8\n3 1 5 9\n1 6 9 10\n6 3 8 8\n1 6 9 10\n5 6 8 10\n8 8 10 8\n9 6 9 10", "3 2 8\n01\n00\n00\n3 2 3 2\n1 1 2 1\n2 1 3 1\n2 2 3 2\n1 1 2 2\n1 1 1 2\n1 1 3 1\n1 1 2 2", "2 3 8\n000\n001\n1 1 2 2\n1 3 2 3\n2 2 2 3\n1 1 2 2\n2 3 2 3\n2 1 2 2\n1 2 1 3\n1 2 2 2"], "outputs": ["10\n1\n7\n34\n5", "3\n1\n16\n27\n52", "42\n5\n5\n6\n79\n9\n151\n27\n12\n18", "5\n12\n1\n12\n29\n5\n29\n9\n1\n2", "1\n3\n3\n3\n5\n1\n6\n5", "9\n1\n1\n9\n0\n3\n3\n3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
b8bf78afb79fadde1f00b79f93ba318c	none	Карта звёздного неба представляет собой прямоугольное поле, состоящее из n строк по m символов в каждой строке. Каждый символ — это либо «.» (означает пустой участок неба), либо «» (означает то, что в этом месте на небе есть звезда). Новое издание карты звёздного неба будет напечатано на квадратных листах, поэтому требуется найти минимально возможную сторону квадрата, в который могут поместиться все звезды. Границы искомого квадрата должны быть параллельны сторонам заданного прямоугольного поля. В первой строке входных данных записаны два числа n* и m (1<=≤<=n,<=m<=≤<=1000) — количество строк и столбцов на карте звездного неба. В следующих n строках задано по m символов. Каждый символ — это либо «.» (пустой участок неба), либо «» (звезда). Гарантируется, что на небе есть хотя бы одна звезда. Выведите одно число — минимально возможную сторону квадрата, которым можно накрыть все звезды. Sample Input 4 4 .... ... ...* ..** 1 3 . 2 1 . * Sample Output 3 3 1	{"inputs": ["4 4\n....\n...\n...\n..*", "1 3\n.", "2 1\n.\n", "1 1\n", "1 2\n.", "1 2\n.", "1 2\n", "2 1\n.\n", "2 1\n\n.", "2 1\n\n", "5 3\n..\n.*\n..\n...\n..", "1 1\n", "1 2\n.", "1 2\n", "1 3\n.", "1 3\n.", "1 4\n..", "1 4\n..", "1 5\n..*", "1 5\n...", "2 1\n\n.", "2 1\n\n", "2 2\n.\n..", "2 2\n.\n.", "2 3\n..\n*.", "2 3\n..\n..", "2 4\n.*\n..", "2 5\n..*\n...", "2 5\n.....\n...", "3 1\n\n\n", "3 1\n\n.\n", "3 2\n..\n..\n*", "3 2\n.\n.\n..", "3 3\n..\n.\n", "3 4\n...\n....\n...", "3 5\n.....\n....\n....", "4 1\n.\n.\n\n", "4 1\n\n.\n\n.", "4 2\n.\n.\n.\n*", "4 2\n.\n..\n..\n.", "4 3\n..\n...\n...\n..", "4 4\n...\n...\n...\n**.", "4 4\n....\n...\n....\n...", "5 1\n\n\n.\n.\n.", "5 1\n\n.\n.\n.\n", "5 2\n.\n\n\n..\n*", "5 2\n.\n..\n..\n..\n.", "5 3\n...\n*\n..\n.\n.", "5 3\n..\n...\n...\n...\n..", "5 4\n.\n...\n...\n...\n..", "5 4\n....\n...\n....\n....\n...", "5 5\n....\n....\n....\n....\n...", "2 2\n\n", "2 2\n.\n.", "2 2\n.\n.", "2 2\n\n..", "2 2\n..\n", "2 2\n.\n.", "2 2\n.\n.", "2 2\n.\n..", "2 2\n.\n..", "2 2\n..\n.", "2 2\n..\n.", "2 2\n.\n", "2 2\n.\n", "2 2\n\n.", "2 2\n\n."], "outputs": ["3", "3", "1", "1", "1", "1", "2", "1", "1", "2", "5", "1", "1", "2", "2", "3", "2", "4", "4", "4", "1", "2", "1", "2", "2", "3", "3", "5", "3", "3", "3", "2", "2", "3", "3", "2", "2", "3", "4", "4", "4", "4", "3", "2", "5", "5", "5", "4", "5", "5", "4", "5", "2", "2", "2", "2", "2", "2", "2", "1", "1", "1", "1", "2", "2", "2", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	8	codeforces
b8d8b73277f7749e7852f8884ff19b71	Subtractions	You've got two numbers. As long as they are both larger than zero, they go through the same operation: subtract the lesser number from the larger one. If they equal substract one number from the another. For example, one operation transforms pair (4,17) to pair (4,13), it transforms (5,5) to (0,5). You've got some number of pairs (ai,<=bi). How many operations will be performed for each of them? The first line contains the number of pairs n (1<=<=≤<=<=n<=<=≤<=<=1000). Then follow n lines, each line contains a pair of positive integers ai,<=bi (1<=<=≤<=<=ai,<=<=bi<=<=≤<=<=109). Print the sought number of operations for each pair on a single line. Sample Input 2 4 17 7 987654321 Sample Output 8 141093479	{"inputs": ["2\n4 17\n7 987654321", "10\n7 987654321\n7 987654321\n7 987654321\n7 987654321\n7 987654321\n7 987654321\n7 987654321\n7 987654321\n7 987654321\n7 987654321", "1\n536870912 32", "20\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999\n1000000000 999999999", "3\n1000000000 1\n1000000000 1\n1 100000000"], "outputs": ["8\n141093479", "141093479\n141093479\n141093479\n141093479\n141093479\n141093479\n141093479\n141093479\n141093479\n141093479", "16777216", "1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000", "1000000000\n1000000000\n100000000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	242	codeforces
b8de50a62a5672e6b2de556a0385efe3	none	Note that girls in Arpa’s land are really attractive. Arpa loves overnight parties. In the middle of one of these parties Mehrdad suddenly appeared. He saw n pairs of friends sitting around a table. i-th pair consisted of a boy, sitting on the ai-th chair, and his girlfriend, sitting on the bi-th chair. The chairs were numbered 1 through 2n in clockwise direction. There was exactly one person sitting on each chair. There were two types of food: Kooft and Zahre-mar. Now Mehrdad wonders, was there any way to serve food for the guests such that: - Each person had exactly one type of food, - No boy had the same type of food as his girlfriend, - Among any three guests sitting on consecutive chairs, there was two of them who had different type of food. Note that chairs 2n and 1 are considered consecutive. Find the answer for the Mehrdad question. If it was possible, find some arrangement of food types that satisfies the conditions. The first line contains an integer n (1<=<=≤<=<=n<=<=≤<=<=105) — the number of pairs of guests. The i-th of the next n lines contains a pair of integers ai and bi (1<=<=≤<=ai,<=bi<=≤<=<=2n) — the number of chair on which the boy in the i-th pair was sitting and the number of chair on which his girlfriend was sitting. It's guaranteed that there was exactly one person sitting on each chair. If there is no solution, print -1. Otherwise print n lines, the i-th of them should contain two integers which represent the type of food for the i-th pair. The first integer in the line is the type of food the boy had, and the second integer is the type of food the girl had. If someone had Kooft, print 1, otherwise print 2. If there are multiple solutions, print any of them. Sample Input 3 1 4 2 5 3 6 Sample Output 1 2 2 1 1 2	{"inputs": ["3\n1 4\n2 5\n3 6", "6\n3 2\n5 11\n7 12\n6 9\n8 4\n1 10", "19\n30 27\n6 38\n10 28\n20 5\n14 18\n32 2\n36 29\n12 1\n31 24\n15 4\n35 11\n3 7\n21 17\n25 19\n16 8\n23 22\n37 33\n13 9\n34 26", "4\n4 2\n6 8\n5 1\n3 7", "17\n11 12\n17 22\n34 7\n3 1\n5 24\n18 20\n27 30\n16 33\n23 21\n19 4\n2 15\n29 28\n9 8\n13 25\n6 10\n32 26\n31 14", "19\n10 7\n9 17\n21 30\n36 8\n14 11\n25 24\n1 23\n38 33\n4 20\n3 37\n27 5\n28 19\n22 2\n6 34\n12 15\n31 32\n35 13\n16 29\n18 26", "17\n17 31\n11 23\n34 22\n24 8\n4 1\n7 14\n20 27\n3 19\n12 26\n32 25\n28 18\n16 29\n21 9\n6 2\n33 30\n5 13\n10 15", "6\n2 7\n5 9\n12 8\n1 4\n3 6\n10 11", "8\n10 3\n2 16\n14 13\n5 15\n1 7\n11 8\n6 4\n12 9", "4\n2 8\n3 5\n4 7\n1 6", "2\n2 3\n1 4", "15\n16 22\n4 17\n27 3\n23 24\n18 20\n15 21\n9 7\n2 28\n29 19\n8 30\n14 10\n6 26\n25 11\n12 1\n13 5", "10\n19 6\n8 2\n15 18\n17 14\n16 7\n20 10\n5 1\n13 3\n9 12\n11 4", "9\n12 7\n10 15\n16 14\n2 4\n1 17\n6 9\n8 3\n13 5\n11 18", "7\n3 14\n7 4\n13 10\n11 8\n6 1\n5 9\n2 12", "6\n2 11\n7 1\n12 8\n4 10\n3 9\n5 6", "8\n13 6\n10 5\n1 12\n11 15\n7 16\n4 14\n9 2\n8 3", "8\n16 5\n10 15\n8 11\n2 14\n6 4\n7 3\n1 13\n9 12", "7\n10 14\n4 6\n1 11\n7 2\n9 8\n5 13\n3 12", "5\n2 5\n10 9\n1 6\n3 8\n4 7", "8\n14 2\n7 9\n15 6\n13 11\n12 16\n10 5\n8 1\n3 4", "5\n4 6\n5 1\n2 3\n7 8\n9 10", "23\n46 21\n17 3\n27 38\n34 43\n7 6\n8 37\n22 4\n16 42\n36 32\n12 9\n10 45\n26 2\n13 24\n23 29\n18 15\n33 30\n31 5\n11 25\n1 14\n44 39\n19 20\n35 28\n41 40", "26\n8 10\n52 21\n2 33\n18 34\n30 51\n5 19\n22 32\n36 28\n42 16\n13 49\n11 17\n31 39\n43 37\n50 15\n29 20\n35 46\n47 23\n3 1\n44 7\n9 27\n6 48\n40 24\n26 14\n45 4\n12 25\n41 38", "20\n34 12\n9 6\n5 3\n13 26\n18 15\n16 22\n7 14\n17 37\n38 40\n4 2\n11 23\n21 8\n10 36\n30 33\n28 19\n29 31\n39 20\n35 24\n25 32\n1 27", "17\n3 14\n34 22\n24 9\n16 17\n6 30\n33 12\n5 10\n21 8\n32 2\n26 23\n31 27\n19 15\n29 4\n7 18\n25 13\n20 28\n1 11", "24\n30 4\n41 1\n2 11\n22 42\n29 43\n7 14\n16 6\n40 5\n27 34\n46 33\n17 10\n21 39\n28 31\n19 32\n23 20\n25 48\n12 9\n47 37\n38 3\n44 8\n36 18\n13 26\n24 15\n45 35", "15\n21 14\n25 5\n7 28\n2 6\n8 27\n29 18\n9 15\n4 26\n12 1\n19 16\n17 20\n24 10\n11 23\n13 22\n30 3"], "outputs": ["1 2\n2 1\n1 2", "1 2\n1 2\n2 1\n2 1\n1 2\n1 2", "1 2\n2 1\n2 1\n2 1\n1 2\n1 2\n1 2\n2 1\n2 1\n1 2\n2 1\n1 2\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1", "1 2\n1 2\n2 1\n2 1", "1 2\n1 2\n2 1\n2 1\n2 1\n2 1\n1 2\n2 1\n2 1\n2 1\n2 1\n1 2\n1 2\n1 2\n1 2\n2 1\n1 2", "1 2\n2 1\n2 1\n2 1\n1 2\n2 1\n1 2\n1 2\n2 1\n1 2\n2 1\n1 2\n1 2\n2 1\n1 2\n1 2\n1 2\n1 2\n2 1", "1 2\n1 2\n2 1\n1 2\n2 1\n1 2\n1 2\n1 2\n2 1\n1 2\n1 2\n2 1\n2 1\n1 2\n1 2\n2 1\n2 1", "2 1\n1 2\n1 2\n1 2\n1 2\n1 2", "1 2\n2 1\n2 1\n1 2\n1 2\n2 1\n2 1\n1 2", "2 1\n2 1\n1 2\n1 2", "2 1\n1 2", "2 1\n2 1\n2 1\n1 2\n2 1\n1 2\n1 2\n2 1\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n2 1", "2 1\n1 2\n2 1\n2 1\n1 2\n1 2\n2 1\n2 1\n1 2\n1 2", "1 2\n2 1\n2 1\n2 1\n1 2\n2 1\n1 2\n2 1\n2 1", "2 1\n2 1\n2 1\n2 1\n2 1\n1 2\n2 1", "2 1\n2 1\n2 1\n2 1\n1 2\n1 2", "1 2\n2 1\n1 2\n1 2\n2 1\n1 2\n1 2\n1 2", "1 2\n1 2\n1 2\n2 1\n1 2\n2 1\n1 2\n2 1", "2 1\n1 2\n1 2\n1 2\n1 2\n1 2\n2 1", "2 1\n2 1\n1 2\n1 2\n2 1", "1 2\n1 2\n2 1\n2 1\n2 1\n1 2\n2 1\n1 2", "2 1\n2 1\n2 1\n1 2\n1 2", "2 1\n1 2\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n1 2\n1 2\n1 2\n1 2\n1 2\n2 1", "2 1\n1 2\n2 1\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n2 1\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n1 2\n2 1\n2 1\n2 1\n2 1", "1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n2 1\n2 1\n1 2\n1 2\n1 2\n2 1\n1 2\n1 2\n2 1\n2 1\n2 1\n1 2\n1 2", "1 2\n1 2\n1 2\n2 1\n1 2\n2 1\n2 1\n1 2\n1 2\n1 2\n2 1\n2 1\n1 2\n1 2\n2 1\n1 2\n1 2", "1 2\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n1 2\n1 2\n2 1\n1 2\n1 2\n2 1\n1 2\n1 2\n2 1\n2 1\n2 1\n2 1\n2 1\n1 2\n2 1\n2 1\n1 2", "1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n1 2\n1 2\n2 1\n2 1\n2 1\n1 2\n1 2\n1 2\n1 2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
b8e4040e30b7e2f49655da687a4e31d4	Bash's Big Day	Bash has set out on a journey to become the greatest Pokemon master. To get his first Pokemon, he went to Professor Zulu's Lab. Since Bash is Professor Zulu's favourite student, Zulu allows him to take as many Pokemon from his lab as he pleases. But Zulu warns him that a group of k<=><=1 Pokemon with strengths {s1,<=s2,<=s3,<=...,<=sk} tend to fight among each other if gcd(s1,<=s2,<=s3,<=...,<=sk)<==<=1 (see notes for gcd definition). Bash, being smart, does not want his Pokemon to fight among each other. However, he also wants to maximize the number of Pokemon he takes from the lab. Can you help Bash find out the maximum number of Pokemon he can take? Note: A Pokemon cannot fight with itself. The input consists of two lines. The first line contains an integer n (1<=≤<=n<=≤<=105), the number of Pokemon in the lab. The next line contains n space separated integers, where the i-th of them denotes si (1<=≤<=si<=≤<=105), the strength of the i-th Pokemon. Print single integer — the maximum number of Pokemons Bash can take. Sample Input 3 2 3 4 5 2 3 4 6 7 Sample Output 2 3	{"inputs": ["3\n2 3 4", "5\n2 3 4 6 7", "3\n5 6 4", "8\n41 74 4 27 85 39 100 36", "6\n89 20 86 81 62 23", "71\n23 84 98 8 14 4 42 56 83 87 28 22 32 50 5 96 90 1 59 74 77 88 71 38 62 36 85 97 99 6 81 20 49 57 66 9 45 41 29 68 35 19 27 76 78 72 55 25 46 48 26 53 39 31 94 34 63 37 64 16 79 24 82 17 12 3 89 61 80 30 10", "95\n72 38 75 62 87 30 11 65 35 16 73 23 18 48 19 4 22 42 14 60 49 83 59 15 51 27 80 97 37 100 64 81 54 71 52 20 5 98 78 86 26 55 25 57 36 3 8 74 82 21 29 1 76 2 79 61 39 9 89 77 70 63 56 28 92 53 31 45 93 47 67 99 58 12 84 44 32 34 69 40 13 7 66 68 17 85 6 90 33 91 94 24 46 10 50", "44\n39706 21317 26213 55086 10799 31825 29024 6565 96535 11412 14642 91901 41932 24538 81351 53861 63403 34199 82286 32594 29684 42753 16857 73821 71085 36306 70080 11233 21023 8551 85406 95390 92375 52675 77938 46265 74855 5229 5856 66713 65730 24525 84078 20684", "35\n45633 86983 46174 48399 33926 51395 76300 6387 48852 82808 28694 79864 4482 35982 21956 76522 19656 74518 28480 71481 25700 46815 14170 95705 8535 96993 29029 8898 97637 62710 14615 22864 69849 27068 68557", "1\n1", "10\n10 7 9 8 3 3 10 7 3 3", "9\n10 10 6 10 9 1 8 3 5", "7\n9 4 2 3 3 9 8", "1\n4", "6\n1623 45906 37856 34727 27156 12598", "30\n83172 59163 67334 83980 5932 8773 77649 41428 62789 28159 17183 10199 41496 59500 14614 10468 54886 64679 42382 57021 50499 95643 77239 61434 16181 30505 59152 55972 18265 70566", "23\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 22 16 2 13 16", "46\n12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 12553 15 1 18 28 20 6 31 16 5 23 21 38 3 11 18 11 3 25 33", "43\n8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8831 8 23 40 33 11 5 21 16 19 15 41 30 28 31 5 32 16 5 38 11 21 34", "25\n58427 26687 48857 46477 7039 25423 58757 48119 38113 40637 22391 48337 4157 10597 8167 19031 64613 70913 69313 18047 17159 77491 13499 70949 24107", "10\n1 1 1 1 1 1 1 1 1 1", "2\n3 6", "5\n1 1 1 1 1", "5\n3 3 3 3 3", "3\n1 1 1", "2\n541 541", "2\n1 1", "2\n99989 99989", "3\n3 9 27", "2\n1009 1009", "4\n1 1 1 1", "6\n2 10 20 5 15 25", "3\n3 3 6", "3\n457 457 457", "2\n34 17", "3\n12 24 3", "10\n99991 99991 99991 99991 99991 99991 99991 99991 99991 99991", "2\n1009 2018", "3\n3 3 3", "7\n6 9 12 15 21 27 33", "3\n2 1 1", "2\n557 557", "3\n1 1 2", "5\n2 2 101 101 101", "2\n122 3721", "2\n49201 98402", "2\n88258 44129", "2\n7919 47514", "5\n1 2 1 1 1", "2\n2 2", "5\n1 1 1 1 2", "3\n10007 20014 30021", "4\n10 10 5 5", "2\n6 9", "3\n6 12 9", "2\n14 7", "2\n199 199", "3\n49999 49999 99998", "5\n1009 1009 1009 1009 1009", "3\n17 17 17", "2\n503 1509", "3\n49999 99998 99998", "2\n28657 28657", "3\n121 22 33", "2\n10079 20158", "2\n6 15", "4\n6 6 6 3", "2\n991 1982", "3\n20362 30543 50905", "2\n443 886", "4\n3 7 7 21", "3\n3 6 9", "2\n217 31", "6\n10 10 10 5 5 5", "4\n49441 25225 9081 4036", "2\n4 9", "2\n18 27", "2\n13 26", "4\n6 6 6 15"], "outputs": ["2", "3", "2", "4", "3", "38", "48", "19", "20", "1", "5", "5", "4", "1", "4", "15", "22", "27", "21", "1", "1", "2", "1", "5", "1", "2", "1", "2", "3", "2", "1", "5", "3", "3", "2", "3", "10", "2", "3", "7", "1", "2", "1", "3", "2", "2", "2", "2", "1", "2", "1", "3", "4", "2", "3", "2", "2", "3", "5", "3", "2", "3", "2", "3", "2", "2", "4", "2", "3", "2", "3", "3", "2", "6", "4", "1", "2", "2", "4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	39	codeforces
b8ec3437ad5a9b841daa2d404ddece70	Chat Servers Outgoing Traffic	Polycarp is working on a new project called "Polychat". Following modern tendencies in IT, he decided, that this project should contain chat as well. To achieve this goal, Polycarp has spent several hours in front of his laptop and implemented a chat server that can process three types of commands: - Include a person to the chat ('Add' command). - Remove a person from the chat ('Remove' command). - Send a message from a person to all people, who are currently in the chat, including the one, who sends the message ('Send' command). Now Polycarp wants to find out the amount of outgoing traffic that the server will produce while processing a particular set of commands. Polycarp knows that chat server sends no traffic for 'Add' and 'Remove' commands. When 'Send' command is processed, server sends l bytes to each participant of the chat, where l is the length of the message. As Polycarp has no time, he is asking for your help in solving this problem. Input file will contain not more than 100 commands, each in its own line. No line will exceed 100 characters. Formats of the commands will be the following: - +<name> for 'Add' command. - -<name> for 'Remove' command. - <sender_name>:<message_text> for 'Send' command. <name> and <sender_name> is a non-empty sequence of Latin letters and digits. <message_text> can contain letters, digits and spaces, but can't start or end with a space. <message_text> can be an empty line. It is guaranteed, that input data are correct, i.e. there will be no 'Add' command if person with such a name is already in the chat, there will be no 'Remove' command if there is no person with such a name in the chat etc. All names are case-sensitive. Print a single number — answer to the problem. Sample Input +Mike Mike:hello +Kate +Dmitry -Dmitry Kate:hi -Kate +Mike -Mike +Mike Mike:Hi I am here -Mike +Kate -Kate Sample Output 9 14	{"inputs": ["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate", "+Mike\n-Mike\n+Mike\nMike:Hi I am here\n-Mike\n+Kate\n-Kate", "+Dmitry\n+Mike\nDmitry:All letters will be used\nDmitry:qwertyuiopasdfghjklzxcvbnm QWERTYUIOPASDFGHJKLZXCVBNM\nDmitry:And digits too\nDmitry:1234567890 0987654321\n-Dmitry", "+Dmitry\n+Mike\n+Kate\nDmitry:", "+Dmitry\nDmitry:No phrases with spaces at the beginning and at the end\n+Mike\nDmitry:spaces spaces\n-Dmitry", "+XqD\n+aT537\nXqD:x6ZPjMR1DDKG2\nXqD:lLCriywPnB\n-XqD", "+8UjgAJ\n8UjgAJ:02hR7UBc1tqqfL\n-8UjgAJ\n+zdi\n-zdi", "+6JPKkgXDrA\n+j6JHjv70An\n+QGtsceK0zJ\n6JPKkgXDrA:o4\n+CSmwi9zDra\nQGtsceK0zJ:Zl\nQGtsceK0zJ:0\nj6JHjv70An:7\nj6JHjv70An:B\nQGtsceK0zJ:OO", "+1aLNq9S7uLV\n-1aLNq9S7uLV\n+O9ykq3xDJv\n-O9ykq3xDJv\n+54Yq1xJq14F\n+0zJ5Vo0RDZ\n-54Yq1xJq14F\n-0zJ5Vo0RDZ\n+lxlH7sdolyL\n-lxlH7sdolyL", "+qlHEc2AuYy\nqlHEc2AuYy:YYRwD0 edNZgpE nGfOguRWnMYpTpGUVM aXDKGXo1Gv1tHL9\nqlHEc2AuYy:yvh3GsPcImqrvoUcBNQcP6ezwpU0 xAVltaKZp94VKiNao\nqlHEc2AuYy:zuCO6Opey L eu7lTwysaSk00zjpv zrDfbt8l hpHfu\n+pErDMxgVgh\nqlHEc2AuYy:I1FLis mmQbZtd8Ui7y 1vcax6yZBMhVRdD6Ahlq7MNCw\nqlHEc2AuYy:lz MFUNJZhlqBYckHUDlNhLiEkmecRh1o0t7alXBvCRVEFVx\npErDMxgVgh:jCyMbu1dkuEj5TzbBOjyUhpfC50cL8R900Je3R KxRgAI dT\nqlHEc2AuYy:62b47eabo2hf vSUD7KioN ZHki6WB6gh3u GKv5rgwyfF\npErDMxgVgh:zD5 9 ympl4wR gy7a7eAGAn5xVdGP9FbL6hRCZAR6O4pT6zb", "+adabacaba0", "+acabadab\n+caba0aba", "+dabaca\n-dabaca\n+aba0ab", "+cab\n+abac\n-abac\n+baca", "+cabadabac\n-cabadabac\n+abacaba1ab\n-abacaba1ab\n+ba0abaca", "+adabacaba\n-adabacaba\n+aca\naca:caba\n-aca\n+bacaba\n-bacaba\n+aba\n-aba\n+bad", "+acabadab\n-acabadab\n+aba0abacab\n+baca\n+abacaba0ab\n-baca\n-abacaba0ab\n-aba0abacab\n+cab\n-cab\n+abacabada\n-abacabada\n+badabaca\n-badabaca\n+badaba", "+badabac\nbadabac:abacabad\n-badabac\n+0ab\n-0ab\n+dabacab\n-dabacab\n+a0ab\n-a0ab\n+0abaca\n-0abaca\n+dabac\n-dabac\n+abaca\n-abaca\n+bacabada\n-bacabada\n+aca\n-aca\n+abadabaca\n-abadabaca\n+acaba\n-acaba\n+abacabadab\n-abacabadab"], "outputs": ["9", "14", "224", "0", "86", "46", "14", "34", "0", "615", "0", "0", "0", "0", "0", "4", "0", "8"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	219	codeforces
b8fffd9ad83f41df8f97739b5e939e71	Make a Permutation!	Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n. Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (replace) minimum number of elements in his array in such a way that his array becomes a permutation (i.e. each of the integers from 1 to n was encountered in his array exactly once). If there are multiple ways to do it he wants to find the lexicographically minimal permutation among them. Thus minimizing the number of changes has the first priority, lexicographical minimizing has the second priority. In order to determine which of the two permutations is lexicographically smaller, we compare their first elements. If they are equal — compare the second, and so on. If we have two permutations x and y, then x is lexicographically smaller if xi<=<<=yi, where i is the first index in which the permutations x and y differ. Determine the array Ivan will obtain after performing all the changes. The first line contains an single integer n (2<=≤<=n<=≤<=200<=000) — the number of elements in Ivan's array. The second line contains a sequence of integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=n) — the description of Ivan's array. In the first line print q — the minimum number of elements that need to be changed in Ivan's array in order to make his array a permutation. In the second line, print the lexicographically minimal permutation which can be obtained from array with q changes. Sample Input 4 3 2 2 3 6 4 5 6 3 2 1 10 6 8 4 6 7 1 6 3 4 5 Sample Output 2 1 2 4 3 0 4 5 6 3 2 1 3 2 8 4 6 7 1 9 3 10 5	{"inputs": ["4\n3 2 2 3", "6\n4 5 6 3 2 1", "10\n6 8 4 6 7 1 6 3 4 5", "6\n5 5 5 6 4 6", "50\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", "50\n1 1 2 1 1 1 1 1 1 1 1 1 2 1 2 1 1 2 1 1 1 1 1 1 1 1 1 2 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "50\n2 4 1 2 3 7 2 2 1 1 3 4 2 12 4 3 2 1 2 5 1 3 3 7 9 6 10 5 7 1 4 3 6 2 3 12 1 3 2 6 2 2 2 4 1 6 1 3 7 13", "50\n26 46 50 31 47 40 25 47 41 47 31 30 50 40 46 44 26 48 37 19 28 19 50 22 42 38 47 22 44 44 35 30 50 45 49 34 19 37 36 32 50 29 50 42 34 49 40 50 8 50", "20\n15 18 20 6 19 13 20 17 20 16 19 17 17 19 16 12 14 19 20 20", "50\n48 37 47 50 46 43 42 46 36 40 45 41 40 50 35 49 37 42 44 45 49 44 31 47 45 49 48 41 45 45 48 20 34 43 43 41 47 50 41 48 38 48 43 48 46 48 32 37 47 45", "26\n26 26 23 25 22 26 26 24 26 26 25 18 25 22 24 24 24 24 24 26 26 25 24 26 26 23", "50\n50 50 50 49 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 49 50 49 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 49", "50\n50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50", "50\n4 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 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4", "50\n18 42 38 38 38 50 50 38 49 49 38 38 42 18 49 49 49 49 18 50 18 38 38 49 49 50 49 42 38 49 42 38 38 49 38 49 50 49 49 49 18 49 18 38 42 50 42 49 18 49", "50\n4 50 27 48 32 32 37 33 18 24 38 6 32 17 1 46 36 16 10 9 9 25 26 40 28 2 1 5 15 50 2 4 18 39 42 46 25 3 10 42 37 23 28 41 33 45 25 11 13 18", "50\n39 49 43 21 22 27 28 41 35 6 31 9 4 39 27 27 7 41 9 28 43 37 20 47 28 37 8 46 23 14 50 48 21 47 9 31 9 37 34 17 15 17 18 16 29 6 43 33 16 17", "2\n1 2", "2\n2 1", "2\n1 1", "2\n2 2", "3\n1 1 1", "3\n2 2 2", "3\n3 3 3", "3\n1 2 2", "3\n2 1 3", "3\n3 2 1", "3\n2 2 3", "3\n3 1 3", "3\n2 2 1", "3\n3 1 2"], "outputs": ["2\n1 2 4 3 ", "0\n4 5 6 3 2 1 ", "3\n2 8 4 6 7 1 9 3 10 5 ", "3\n1 2 5 3 4 6 ", "49\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 ", "48\n1 3 2 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 ", "39\n2 4 1 8 3 7 11 14 15 16 17 18 19 12 20 21 22 23 24 5 25 26 27 28 9 6 10 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 13 ", "25\n1 2 3 4 5 6 25 7 41 9 31 10 11 12 46 13 26 48 14 15 28 16 17 18 20 38 47 22 21 44 35 30 23 45 24 27 19 37 36 32 33 29 39 42 34 49 40 43 8 50 ", "10\n15 18 1 6 2 13 3 4 5 7 8 9 17 10 16 12 14 19 11 20 ", "31\n1 2 3 4 5 6 7 8 36 9 10 11 40 12 35 13 14 42 15 16 17 44 31 18 19 49 21 22 23 24 25 20 34 26 27 28 29 50 41 30 38 33 43 39 46 48 32 37 47 45 ", "20\n1 2 3 4 5 6 7 8 9 10 11 18 12 22 13 14 15 16 17 19 20 25 24 21 26 23 ", "48\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 50 49 ", "49\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 ", "49\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 ", "45\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 19 18 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 43 44 45 38 42 50 46 47 48 49 ", "17\n4 7 27 48 8 12 14 19 18 24 38 6 32 17 1 20 36 16 10 9 21 22 26 40 28 2 29 5 15 50 30 31 34 39 35 46 25 3 43 42 37 23 44 41 33 45 47 11 13 49 ", "20\n1 49 2 3 22 5 10 11 35 6 12 9 4 39 13 27 7 41 19 24 25 26 20 30 28 32 8 46 23 14 50 48 21 47 36 31 38 37 34 17 15 40 18 16 29 42 43 33 44 45 ", "0\n1 2 ", "0\n2 1 ", "1\n1 2 ", "1\n1 2 ", "2\n1 2 3 ", "2\n1 2 3 ", "2\n1 2 3 ", "1\n1 2 3 ", "0\n2 1 3 ", "0\n3 2 1 ", "1\n1 2 3 ", "1\n2 1 3 ", "1\n2 3 1 ", "0\n3 1 2 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	31	codeforces
b90159b3b2c41c91a4086c3dd7b577d5	Vladik and Memorable Trip	Vladik often travels by trains. He remembered some of his trips especially well and I would like to tell you about one of these trips: Vladik is at initial train station, and now n people (including Vladik) want to get on the train. They are already lined up in some order, and for each of them the city code ai is known (the code of the city in which they are going to). Train chief selects some number of disjoint segments of the original sequence of people (covering entire sequence by segments is not necessary). People who are in the same segment will be in the same train carriage. The segments are selected in such way that if at least one person travels to the city x, then all people who are going to city x should be in the same railway carriage. This means that they can’t belong to different segments. Note, that all people who travel to the city x, either go to it and in the same railway carriage, or do not go anywhere at all. Comfort of a train trip with people on segment from position l to position r is equal to XOR of all distinct codes of cities for people on the segment from position l to position r. XOR operation also known as exclusive OR. Total comfort of a train trip is equal to sum of comfort for each segment. Help Vladik to know maximal possible total comfort. First line contains single integer n (1<=≤<=n<=≤<=5000) — number of people. Second line contains n space-separated integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=5000), where ai denotes code of the city to which i-th person is going. The output should contain a single integer — maximal possible total comfort. Sample Input 6 4 4 2 5 2 3 9 5 1 3 1 5 2 4 2 5 Sample Output 14 9	{"inputs": ["6\n4 4 2 5 2 3", "9\n5 1 3 1 5 2 4 2 5", "5\n1558 4081 3591 1700 3232", "10\n3838 1368 4825 2068 4755 2048 1342 4909 2837 4854", "10\n4764 4867 2346 1449 1063 2002 2577 2089 1566 614", "10\n689 3996 3974 4778 1740 3481 2916 2744 294 1376", "100\n1628 4511 4814 3756 4625 1254 906 1033 2420 2622 2640 3225 3570 2925 465 2093 4614 2856 4004 4254 2292 2026 415 2777 905 4452 4737 529 4571 3221 2064 2495 420 1291 493 4073 3207 1217 3463 3047 3627 1783 1723 3586 800 2403 4378 4373 535 64 4014 346 2597 2502 3667 2904 3153 1061 3104 1847 4741 315 1212 501 4504 3947 842 2388 2868 3430 1018 560 2840 4477 2903 2810 3600 4352 1106 1102 4747 433 629 2043 1669 2695 436 403 650 530 1318 1348 4677 3245 2426 1056 702 203 1132 4471", "100\n2554 1060 1441 4663 301 3629 1245 3214 4623 4909 4283 1596 959 687 2981 1105 122 3820 3205 488 3755 2998 3243 3621 2707 3771 1302 2611 4545 2737 762 173 2513 2204 2433 4483 3095 2620 3265 4215 3085 947 425 144 659 1660 3295 2315 2281 2617 1887 2931 3494 2762 559 3690 3590 3826 3438 2203 101 1316 3688 3532 819 1069 2573 3127 3894 169 547 1305 2085 4753 4292 2116 1623 960 4809 3694 1047 501 1193 4987 1179 1470 647 113 4223 2154 3222 246 3321 1276 2340 1561 4477 665 2256 626", "100\n931 4584 2116 3004 3813 62 2819 2998 2080 4906 3198 2443 2952 3793 1958 3864 3985 3169 3134 4011 4525 995 4163 308 4362 1148 4906 3092 1647 244 1370 1424 2753 84 2997 1197 2606 425 3501 2606 683 4747 3884 4787 2166 3017 3080 4303 3352 1667 2636 3994 757 2388 870 1788 988 1303 0 1230 1455 4213 2113 2908 871 1997 3878 4604 1575 3385 236 847 2524 3937 1803 2678 4619 1125 3108 1456 3017 1532 3845 3293 2355 2230 4282 2586 2892 4506 3132 4570 1872 2339 2166 3467 3080 2693 1925 2308", "100\n5 1085 489 2096 1610 108 4005 3869 1826 4145 2450 2546 2719 1030 4443 4222 1 2205 2407 4303 4588 1549 1965 4465 2560 2459 1814 1641 148 728 3566 271 2186 696 1952 4262 2088 4023 4594 1437 4700 2531 1707 1702 1413 4391 4162 3309 1606 4116 1287 1410 3336 2128 3978 1002 552 64 1192 4980 4569 3212 1163 2457 3661 2296 2147 391 550 2540 707 101 4805 2608 4785 4898 1595 1043 4406 3865 1716 4044 1756 4456 1319 4350 4965 2876 4320 4409 3177 671 2596 4308 2253 2962 830 4179 800 1782", "100\n702 1907 2292 1953 2421 1300 2092 1904 3691 1861 4472 1379 1811 2583 529 3977 4735 997 856 4545 2354 2581 1692 2563 4104 763 1645 4080 3967 3705 4261 448 4854 1903 4449 2768 4214 4815 185 3404 3538 199 4548 4608 46 4673 4406 3379 3790 3567 1139 1236 2755 2242 3723 2118 2716 4824 2770 595 274 840 261 1576 3188 2720 637 4071 2737 2585 4964 4184 120 1622 884 1555 4681 4269 2404 3511 4972 3840 66 4100 1528 1340 1119 2641 1183 3908 1363 28 401 4319 3408 2077 3454 1689 8 3946", "100\n4 3 5 5 2 0 4 0 1 5 1 2 5 5 2 0 2 3 0 0 0 5 4 4 3 0 5 5 4 0 4 4 1 2 0 4 3 5 4 3 5 1 1 0 0 4 2 0 5 0 1 5 3 3 4 5 1 2 2 5 0 3 3 1 2 0 1 3 0 4 5 4 4 1 5 3 0 2 3 4 1 5 5 0 5 0 0 3 2 1 4 3 4 1 4 5 3 0 5 3", "100\n0 0 0 0 0 1 1 0 1 0 1 0 1 0 0 1 0 0 1 1 0 0 1 0 1 1 1 1 1 1 1 0 1 1 1 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 1 0 1 1 0 0 1 0 0 0 1 1 1 1 1 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1 1 0 0 1 1 0", "100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "100\n5 1 12 15 10 0 5 7 12 13 3 11 13 10 0 5 3 1 3 13 1 11 2 6 9 15 8 3 13 3 0 4 11 10 12 10 9 3 13 15 10 11 7 10 1 15 0 7 7 8 12 2 5 2 4 11 7 1 16 14 10 6 14 2 4 15 10 8 6 10 2 7 5 15 9 8 15 6 7 1 5 7 1 15 9 11 2 0 8 12 8 9 4 7 11 2 5 13 12 8", "100\n8 16 16 2 5 7 9 12 14 15 5 11 0 5 9 12 15 13 4 15 10 11 13 2 2 15 15 16 10 7 4 14 9 5 4 10 4 16 2 6 11 0 3 14 12 14 9 5 0 8 11 15 2 14 2 0 3 5 4 4 8 15 14 6 14 5 0 14 12 15 0 15 15 14 2 14 13 7 11 7 2 4 13 11 8 16 9 1 10 13 8 2 7 12 1 14 16 11 15 7", "100\n4 9 4 13 18 17 13 10 28 11 29 32 5 23 14 32 20 17 25 0 18 30 10 17 27 2 13 8 1 20 8 13 6 5 16 1 27 27 24 16 2 18 24 1 0 23 10 21 7 3 21 21 18 27 31 28 10 17 26 27 3 0 6 0 30 9 3 0 3 30 8 3 23 21 18 27 10 16 30 4 1 9 3 8 2 5 20 23 16 22 9 7 11 9 12 30 17 27 14 17", "100\n6 25 23 14 19 5 26 28 5 14 24 2 19 32 4 12 32 12 9 29 23 10 25 31 29 10 3 30 29 13 32 27 13 19 2 24 30 8 11 5 25 32 13 9 28 28 27 1 8 24 15 11 8 6 30 16 29 13 6 11 3 0 8 2 6 9 29 26 11 30 7 21 16 31 23 3 29 18 26 9 26 15 0 31 19 0 0 21 24 15 0 5 19 21 18 32 32 29 5 32", "100\n11 4 31 11 59 23 62 21 49 40 21 1 56 51 22 53 37 28 43 27 15 39 39 33 3 28 60 52 58 21 16 11 10 61 26 59 23 51 26 32 40 21 43 56 55 0 44 48 16 7 26 37 61 19 44 15 63 11 58 62 48 14 38 3 27 50 47 6 46 23 50 16 64 19 45 18 15 30 20 45 50 61 50 57 38 60 61 46 42 39 22 52 7 36 57 23 33 46 29 6", "100\n60 30 6 15 23 15 25 34 55 53 27 23 51 4 47 61 57 62 44 22 18 42 33 29 50 37 62 28 16 4 52 37 33 58 39 36 17 21 59 59 28 26 35 15 37 13 35 29 29 8 56 26 23 18 10 1 3 61 30 11 50 42 48 11 17 47 26 10 46 49 9 29 4 28 40 12 62 33 8 13 26 52 40 30 34 40 40 27 55 42 15 53 53 5 12 47 21 9 23 25", "100\n10 19 72 36 30 38 116 112 65 122 74 62 104 82 64 52 119 109 2 86 114 105 56 12 3 52 35 48 99 68 98 18 68 117 7 76 112 2 57 39 43 2 93 45 1 128 112 90 21 91 61 6 4 53 83 72 120 72 82 111 108 48 12 83 70 78 116 33 22 102 59 31 72 111 33 6 19 91 30 108 110 22 10 93 55 92 20 20 98 10 119 58 17 60 33 4 29 110 127 100", "100\n83 54 28 107 75 48 55 68 7 33 31 124 22 54 24 83 8 3 10 58 39 106 50 110 17 91 119 87 126 29 40 4 50 44 78 49 41 79 82 6 34 61 80 19 113 67 104 50 15 60 65 97 118 7 48 64 81 5 23 105 64 122 95 25 97 124 97 33 61 20 89 77 24 9 20 84 30 69 12 3 50 122 75 106 41 19 126 112 10 91 42 11 66 20 74 16 120 70 52 43", "100\n915 7 282 162 24 550 851 240 39 302 538 76 131 150 104 848 507 842 32 453 998 990 1002 225 887 1005 259 199 873 87 258 318 837 511 663 1008 861 516 445 426 335 743 672 345 320 461 650 649 612 9 1017 113 169 722 643 253 562 661 879 522 524 878 600 894 312 1005 283 911 322 509 836 261 424 976 68 606 661 331 830 177 279 772 573 1017 157 250 42 478 582 23 847 119 359 198 839 761 54 1003 270 900", "100\n139 827 953 669 78 369 980 770 945 509 878 791 550 555 324 682 858 771 525 673 751 746 848 534 573 613 930 135 390 958 60 614 728 444 1018 463 445 662 632 907 536 865 465 974 137 973 386 843 326 314 555 910 258 429 560 559 274 307 409 751 527 724 485 276 18 45 1014 13 321 693 910 397 664 513 110 915 622 76 433 84 704 975 653 716 292 614 218 50 482 620 410 557 862 388 348 1022 663 580 987 149", "100\n2015 1414 748 1709 110 1094 441 1934 273 1796 451 902 610 914 1613 255 1838 963 1301 1999 393 948 161 510 485 1544 1742 19 12 1036 2007 1394 1898 532 1403 1390 2004 1016 45 675 1264 1696 1511 1523 1335 1997 688 1778 1939 521 222 92 1014 155 135 30 543 1449 229 976 382 654 1827 1158 570 64 1353 1672 295 1573 23 1368 728 597 1263 213 991 1673 1360 183 1256 1539 459 1480 374 1779 1541 858 1470 653 979 342 381 179 388 247 655 198 1762 1249", "100\n1928 445 1218 1164 1501 1284 973 1503 1132 1999 2046 1259 1604 1279 1044 684 89 733 1431 1133 1141 1954 181 76 997 187 1088 1265 1721 2039 1724 1986 308 402 1777 751 97 484 880 14 936 876 1226 1105 110 1587 588 363 169 296 1087 1490 1640 1378 433 1684 293 153 492 2040 1229 1754 950 1573 771 1052 366 382 88 186 1340 1212 1195 2005 36 2001 248 72 1309 1371 1381 653 1972 1503 571 1490 278 1590 288 183 949 361 1162 639 2003 1271 254 796 987 159", "100\n3108 2117 3974 3127 3122 796 1234 1269 1723 3313 3522 869 3046 557 334 3085 557 2528 1028 169 2203 595 388 2435 408 2712 2363 2088 2064 1185 3076 2073 2717 492 775 3351 3538 3050 85 3495 2335 1124 2891 3108 284 1123 500 502 808 3352 3988 1318 222 3452 3896 1024 2789 2480 1958 2976 1358 1225 3007 1817 1672 3667 1511 1147 2803 2632 3439 3066 3864 1942 2526 3574 1179 3375 406 782 3866 3157 3396 245 2401 2378 1258 684 2400 2809 3375 1225 1345 3630 2760 2546 1761 3138 2539 1616", "100\n1599 2642 1471 2093 3813 329 2165 254 3322 629 3286 2332 279 3756 1167 2607 2499 2411 2626 4040 2406 3468 1617 118 2083 2789 1571 333 1815 2600 2579 572 3193 249 1880 2226 1722 1771 3475 4038 951 2942 1135 3348 2785 1947 1937 108 3861 307 3052 2060 50 837 1107 2383 2633 2280 1122 1726 2800 522 714 2322 661 554 2444 3534 1440 2229 718 3311 1834 462 2348 3444 692 17 2866 347 2655 58 483 2298 1074 2163 3007 1858 2435 998 1506 707 1287 3821 2486 1496 3819 3529 1310 3926"], "outputs": ["14", "9", "14162", "32844", "23337", "25988", "238706", "233722", "227685", "251690", "254107", "1", "1", "0", "16", "16", "145", "51", "598", "656", "2946", "3126", "45323", "50598", "96427", "93111", "194223", "194571"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	12	codeforces
b93fdbb19a50d95418de5887b98a8017	Sasha and Sticks	It's one more school day now. Sasha doesn't like classes and is always bored at them. So, each day he invents some game and plays in it alone or with friends. Today he invented one simple game to play with Lena, with whom he shares a desk. The rules are simple. Sasha draws n sticks in a row. After that the players take turns crossing out exactly k sticks from left or right in each turn. Sasha moves first, because he is the inventor of the game. If there are less than k sticks on the paper before some turn, the game ends. Sasha wins if he makes strictly more moves than Lena. Sasha wants to know the result of the game before playing, you are to help him. The first line contains two integers n and k (1<=≤<=n,<=k<=≤<=1018, k<=≤<=n) — the number of sticks drawn by Sasha and the number k — the number of sticks to be crossed out on each turn. If Sasha wins, print "YES" (without quotes), otherwise print "NO" (without quotes). You can print each letter in arbitrary case (upper of lower). Sample Input 1 1 10 4 Sample Output YES NO	{"inputs": ["1 1", "10 4", "251656215122324104 164397544865601257", "963577813436662285 206326039287271924", "1000000000000000000 1", "253308697183523656 25332878317796706", "669038685745448997 501718093668307460", "116453141993601660 87060381463547965", "766959657 370931668", "255787422422806632 146884995820359999", "502007866464507926 71266379084204128", "257439908778973480 64157133126869976", "232709385 91708542", "252482458300407528 89907711721009125", "6 2", "6 3", "6 4", "6 5", "6 6", "258266151957056904 30153168463725364", "83504367885565783 52285355047292458", "545668929424440387 508692735816921376", "547321411485639939 36665750286082900", "548973893546839491 183137237979822911", "544068082 193116851", "871412474 749817171", "999999999 1247", "851941088 712987048", "559922900 418944886", "293908937 37520518", "650075786 130049650", "1000000000 1000000000", "548147654663723363 107422751713800746", "828159210 131819483", "6242634 4110365", "458601973 245084155", "349593257 18089089", "814768821 312514745", "697884949 626323363", "667011589 54866795", "1000000000000000000 2", "1000000000000000000 3", "1000000000000000000 4", "999999999999999 1", "17 4", "2 2", "1000000000000000 2", "12 4", "6 1", "2 1", "10000000005 1", "10000000000000009 2", "12457895452123 1", "999999999999999999 9", "1000000000000 3", "13099714659575475 6549849616514894", "100000000000000001 1", "825175814723458 324", "20 4", "100000176877 4", "100000 3", "946744073709551614 10"], "outputs": ["YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	350	codeforces
b9435cb564d17c1f2aae1353c4f988ab	Hobbits' Party	Everyone knows that hobbits love to organize all sorts of parties and celebrations. There are n hobbits living in the Shire. They decided to organize the Greatest Party (GP) that would last for several days. Next day the hobbits wrote a guest list, some non-empty set containing all the inhabitants of the Shire. To ensure that everybody enjoy themselves and nobody gets bored, for any two days (say, days A and B) of the GP there existed at least one hobbit, invited to come on day A and on day B. However, to ensure that nobody has a row, for any three different days A, B, C there shouldn't be a hobbit invited on days A, B and C. The Shire inhabitants are keen on keeping the GP going for as long as possible. Your task is given number n, to indicate the GP's maximum duration and the guest lists for each day. The first line contains an integer n (3<=≤<=n<=≤<=10000), representing the number of hobbits. In the first output line print a number k — the maximum duration of GP in days. Then on k lines print the guest lists, (the guests should be separated by spaces). Print each guest list on the single line. Each list can contain an arbitrary positive number of hobbits. The hobbits are numbered with integers from 1 to n. Sample Input 4 5 Sample Output 3 1 2 1 3 2 3 3 1 2 1 3 2 3	{"inputs": ["4", "5", "6", "7", "8", "9", "10", "11", "14", "15", "16", "20", "21", "44", "45", "189", "190", "191", "209", "210", "230", "231", "251", "252", "253", "254", "255", "3", "9000", "9100", "9200", "9300", "9400", "9500", "9600", "9700", "9800", "9900", "9998", "9999", "10000", "9868", "9869", "9870", "9871", "9377"], "outputs": ["3\n1 2 \n1 3 \n2 3 ", "3\n1 2 \n1 3 \n2 3 ", "4\n1 2 3 \n1 4 5 \n2 4 6 \n3 5 6 ", "4\n1 2 3 \n1 4 5 \n2 4 6 \n3 5 6 ", "4\n1 2 3 \n1 4 5 \n2 4 6 \n3 5 6 ", "4\n1 2 3 \n1 4 5 \n2 4 6 \n3 5 6 ", "5\n1 2 3 4 \n1 5 6 7 \n2 5 8 9 \n3 6 8 10 \n4 7 9 10 ", "5\n1 2 3 4 \n1 5 6 7 \n2 5 8 9 \n3 6 8 10 \n4 7 9 10 ", "5\n1 2 3 4 \n1 5 6 7 \n2 5 8 9 \n3 6 8 10 \n4 7 9 10 ", "6\n1 2 3 4 5 \n1 6 7 8 9 \n2 6 10 11 12 \n3 7 10 13 14 \n4 8 11 13 15 \n5 9 12 14 15 ", "6\n1 2 3 4 5 \n1 6 7 8 9 \n2 6 10 11 12 \n3 7 10 13 14 \n4 8 11 13 15 \n5 9 12 14 15 ", "6\n1 2 3 4 5 \n1 6 7 8 9 \n2 6 10 11 12 \n3 7 10 13 14 \n4 8 11 13 15 \n5 9 12 14 15 ", "7\n1 2 3 4 5 6 \n1 7 8 9 10 11 \n2 7 12 13 14 15 \n3 8 12 16 17 18 \n4 9 13 16 19 20 \n5 10 14 17 19 21 \n6 11 15 18 20 21 ", "9\n1 2 3 4 5 6 7 8 \n1 9 10 11 12 13 14 15 \n2 9 16 17 18 19 20 21 \n3 10 16 22 23 24 25 26 \n4 11 17 22 27 28 29 30 \n5 12 18 23 27 31 32 33 \n6 13 19 24 28 31 34 35 \n7 14 20 25 29 32 34 36 \n8 15 21 26 30 33 35 36 ", "10\n1 2 3 4 5 6 7 8 9 \n1 10 11 12 13 14 15 16 17 \n2 10 18 19 20 21 22 23 24 \n3 11 18 25 26 27 28 29 30 \n4 12 19 25 31 32 33 34 35 \n5 13 20 26 31 36 37 38 39 \n6 14 21 27 32 36 40 41 42 \n7 15 22 28 33 37 40 43 44 \n8 16 23 29 34 38 41 43 45 \n9 17 24 30 35 39 42 44 45 ", "19\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 \n1 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 \n2 19 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 \n3 20 36 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 \n4 21 37 52 67 68 69 70 71 72 73 74 75 76 77 78 79 80 \n5 22 38 53 67 81 82 83 84 85 86 87 88 89 90 91 92 93 \n6 23 39 54 68 81 94 95 96 97 98 99 100 101 102 103 104 105 \n7 24 40 55 69 82 94 106 107 108 109 110 111 112 113 114 115 116 \n8 25 41 56 70 83 95 106 117 118 119 120 121 122 123 124 12...", "20\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 \n1 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 \n2 20 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 \n3 21 38 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 \n4 22 39 55 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 \n5 23 40 56 71 86 87 88 89 90 91 92 93 94 95 96 97 98 99 \n6 24 41 57 72 86 100 101 102 103 104 105 106 107 108 109 110 111 112 \n7 25 42 58 73 87 100 113 114 115 116 117 118 119 120 121 122 123 124 \n8 26 43 59 74 88 101 113 ...", "20\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 \n1 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 \n2 20 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 \n3 21 38 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 \n4 22 39 55 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 \n5 23 40 56 71 86 87 88 89 90 91 92 93 94 95 96 97 98 99 \n6 24 41 57 72 86 100 101 102 103 104 105 106 107 108 109 110 111 112 \n7 25 42 58 73 87 100 113 114 115 116 117 118 119 120 121 122 123 124 \n8 26 43 59 74 88 101 113 ...", "20\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 \n1 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 \n2 20 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 \n3 21 38 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 \n4 22 39 55 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 \n5 23 40 56 71 86 87 88 89 90 91 92 93 94 95 96 97 98 99 \n6 24 41 57 72 86 100 101 102 103 104 105 106 107 108 109 110 111 112 \n7 25 42 58 73 87 100 113 114 115 116 117 118 119 120 121 122 123 124 \n8 26 43 59 74 88 101 113 ...", "21\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 \n1 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 \n2 21 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 \n3 22 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 \n4 23 41 58 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 \n5 24 42 59 75 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 \n6 25 43 60 76 91 106 107 108 109 110 111 112 113 114 115 116 117 118 119 \n7 26 44 61 77 92 106 120 121 122 123 124 125 126 127 128 129 130 131...", "21\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 \n1 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 \n2 21 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 \n3 22 40 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 \n4 23 41 58 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 \n5 24 42 59 75 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 \n6 25 43 60 76 91 106 107 108 109 110 111 112 113 114 115 116 117 118 119 \n7 26 44 61 77 92 106 120 121 122 123 124 125 126 127 128 129 130 131...", "22\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 \n1 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 \n2 22 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 \n3 23 42 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 \n4 24 43 61 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 \n5 25 44 62 79 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 \n6 26 45 63 80 96 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 \n7 27 46 64 81 97 112 127 128 129 130 131...", "22\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 \n1 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 \n2 22 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 \n3 23 42 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 \n4 24 43 61 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 \n5 25 44 62 79 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 \n6 26 45 63 80 96 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 \n7 27 46 64 81 97 112 127 128 129 130 131...", "22\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 \n1 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 \n2 22 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 \n3 23 42 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 \n4 24 43 61 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 \n5 25 44 62 79 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 \n6 26 45 63 80 96 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 \n7 27 46 64 81 97 112 127 128 129 130 131...", "23\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 \n1 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 \n2 23 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 \n3 24 44 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 \n4 25 45 64 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 \n5 26 46 65 83 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 \n6 27 47 66 84 101 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 \n7 28 48 67 ...", "23\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 \n1 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 \n2 23 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 \n3 24 44 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 \n4 25 45 64 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 \n5 26 46 65 83 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 \n6 27 47 66 84 101 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 \n7 28 48 67 ...", "23\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 \n1 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 \n2 23 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 \n3 24 44 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 \n4 25 45 64 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 \n5 26 46 65 83 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 \n6 27 47 66 84 101 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 \n7 28 48 67 ...", "3\n1 2 \n1 3 \n2 3 ", "134\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 \n1 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "135\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 \n1 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "136\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 \n1 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "136\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 \n1 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "137\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 \n1 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "138\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 \n1 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "139\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 \n1 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "139\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 \n1 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "140\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 \n1 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "141\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 \n1 141 142 143 144 145 146 147 148 149 150 151 152 15...", "141\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 \n1 141 142 143 144 145 146 147 148 149 150 151 152 15...", "141\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 \n1 141 142 143 144 145 146 147 148 149 150 151 152 15...", "141\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 \n1 141 142 143 144 145 146 147 148 149 150 151 152 15...", "140\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 \n1 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "140\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 \n1 140 141 142 143 144 145 146 147 148 149 150 151 152 15...", "141\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 \n1 141 142 143 144 145 146 147 148 149 150 151 152 15...", "141\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 \n1 141 142 143 144 145 146 147 148 149 150 151 152 15...", "137\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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 \n1 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 15..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	8	codeforces
b95a8706627d77a638a45e9ced72df03	none	This is an interactive problem. Natasha is going to fly to Mars. Finally, Natasha sat in the rocket. She flies, flies... but gets bored. She wishes to arrive to Mars already! So she decides to find something to occupy herself. She couldn't think of anything better to do than to calculate the distance to the red planet. Let's define $x$ as the distance to Mars. Unfortunately, Natasha does not know $x$. But it is known that $1 \le x \le m$, where Natasha knows the number $m$. Besides, $x$ and $m$ are positive integers. Natasha can ask the rocket questions. Every question is an integer $y$ ($1 \le y \le m$). The correct answer to the question is $-1$, if $x<y$, $0$, if $x=y$, and $1$, if $x>y$. But the rocket is broken — it does not always answer correctly. Precisely: let the correct answer to the current question be equal to $t$, then, if the rocket answers this question correctly, then it will answer $t$, otherwise it will answer $-t$. In addition, the rocket has a sequence $p$ of length $n$. Each element of the sequence is either $0$ or $1$. The rocket processes this sequence in the cyclic order, that is $1$-st element, $2$-nd, $3$-rd, $\ldots$, $(n-1)$-th, $n$-th, $1$-st, $2$-nd, $3$-rd, $\ldots$, $(n-1)$-th, $n$-th, $\ldots$. If the current element is $1$, the rocket answers correctly, if $0$ — lies. Natasha doesn't know the sequence $p$, but she knows its length — $n$. You can ask the rocket no more than $60$ questions. Help Natasha find the distance to Mars. Assume, that the distance to Mars does not change while Natasha is asking questions. Your solution will not be accepted, if it does not receive an answer $0$ from the rocket (even if the distance to Mars is uniquely determined by the already received rocket's answers). The first line contains two integers $m$ and $n$ ($1 \le m \le 10^9$, $1 \le n \le 30$) — the maximum distance to Mars and the number of elements in the sequence $p$. none Sample Input 5 2 1 -1 -1 1 0 Sample Output 1 2 4 5 3	{"inputs": ["5 2 3\n1 0", "1 1 1\n1", "3 2 3\n1 0", "6 3 5\n1 1 1", "10 4 3\n0 0 1 0", "30 5 16\n0 1 1 1 0", "60 6 21\n1 0 0 1 0 1", "100 7 73\n0 0 0 1 0 1 1", "1000000000 29 958572235\n1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 0 0", "738009704 30 116044407\n0 0 1 1 0 0 1 0 0 0 1 0 0 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1", "300 8 165\n1 1 1 0 0 1 1 0", "600 9 150\n0 0 1 0 1 0 1 0 1", "1000 10 140\n0 0 0 0 1 0 0 0 0 0", "3000 11 1896\n1 0 1 1 0 0 0 0 1 1 1", "6000 12 4679\n1 0 1 1 1 1 1 0 0 0 0 1", "10000 13 4977\n1 0 1 1 0 0 0 1 0 0 1 1 0", "30000 14 60\n1 1 1 0 0 1 0 1 0 0 1 0 0 0", "60000 15 58813\n0 1 1 0 1 1 0 0 0 1 1 1 1 0 1", "100000 16 79154\n1 1 1 0 0 0 0 0 1 1 0 1 0 1 0 1", "300000 17 11107\n1 0 0 0 1 0 0 0 1 1 1 0 0 1 1 1 0", "600000 18 146716\n0 0 0 1 0 0 1 0 0 0 0 0 0 1 0 0 1 1", "1000000 19 418016\n1 0 0 1 0 1 0 0 1 1 0 0 0 1 1 1 1 0 0", "3000000 20 642518\n1 0 0 1 0 1 1 1 1 1 0 0 0 1 0 1 0 1 0 1", "6000000 21 3516807\n0 0 0 1 0 1 0 1 1 0 0 0 0 1 0 1 1 1 0 0 0", "10000000 22 8115129\n1 0 1 0 0 0 0 0 0 1 1 0 1 0 0 0 0 1 1 0 0 1", "30000000 23 10362635\n0 1 0 0 1 1 1 1 0 0 0 1 0 1 1 0 1 1 1 1 0 0 0", "60000000 24 52208533\n1 1 1 0 1 0 0 0 0 0 1 0 0 1 0 1 0 1 1 0 1 1 1 0", "100000000 25 51744320\n0 1 1 1 1 0 1 1 1 1 1 1 0 1 0 1 1 0 0 1 1 0 1 0 1", "300000000 26 264009490\n1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 1 0 1 1 0 1 1 1 0 1 1", "600000000 27 415720732\n1 1 1 1 1 1 0 0 1 1 1 0 1 0 1 1 0 0 1 1 1 1 0 1 0 1 0", "1000000000 28 946835863\n0 0 1 0 1 1 1 0 1 0 1 1 0 1 0 1 1 0 0 0 1 0 1 0 1 1 0 0", "1000000000 29 124919287\n0 0 1 0 0 0 1 0 1 0 0 1 1 0 1 0 1 0 1 1 1 1 0 1 1 0 1 0 0", "1000000000 30 202669473\n1 1 0 1 1 1 0 0 1 0 1 0 1 0 1 0 1 1 0 0 1 1 1 1 1 0 0 0 0 0", "1000000000 13 532121080\n1 1 1 0 1 1 0 0 0 0 1 0 1", "1000000000 27 105669924\n0 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 0 1 1 0 0 1 0 1 1 1 1", "1000000000 11 533994576\n0 0 1 0 1 1 1 1 0 1 0", "1000000000 9 107543421\n1 0 0 1 1 1 1 1 1", "1000000000 23 976059561\n1 0 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 0 0 1 0 0 1", "1000000000 7 549608406\n1 1 1 0 1 1 1", "1000000000 21 123157250\n0 1 1 1 1 1 1 0 0 0 1 1 1 1 0 0 0 1 0 0 1", "1000000000 19 696706094\n0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 0", "1000000000 3 125030747\n0 0 0", "1000000000 17 993546887\n1 0 1 0 1 1 1 1 1 1 0 1 0 1 1 1 1", "1000000000 15 567095731\n1 1 1 0 0 1 1 1 0 1 0 0 1 0 0", "1000000000 29 140644576\n1 1 1 1 1 1 0 1 0 0 0 1 0 1 0 1 1 1 0 1 1 1 0 1 1 0 1 0 0", "1000000000 13 714193420\n0 1 0 0 0 1 0 0 0 0 1 1 1", "1000000000 27 142518072\n0 0 0 1 0 1 1 0 1 0 1 0 0 1 1 0 1 1 1 1 0 1 0 0 1 0 0", "1000000000 25 11034213\n0 0 1 0 1 1 1 0 1 1 1 1 1 0 1 0 1 1 0 0 1 0 1 0 0", "1000000000 9 584583057\n1 1 1 0 0 1 0 0 0", "1000000000 23 863164606\n1 1 0 1 0 1 0 1 0 1 0 0 1 0 0 0 1 1 1 0 0 1 1", "1000000000 21 731680746\n1 1 0 0 1 1 1 1 1 0 0 1 0 1 1 1 1 0 1 0 1", "1000000000 5 305229590\n0 0 1 1 0", "1000000000 3 28521539\n0 0 1", "1000000000 3 602070383\n0 1 1", "1000000000 2 880651931\n1 1", "1000000000 16 749168072\n1 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0", "1000000000 30 322716916\n1 0 1 1 1 1 0 1 1 0 1 0 0 0 1 0 0 0 0 0 1 1 0 0 1 1 1 1 0 0", "1000000000 14 191233057\n0 0 1 0 0 1 1 1 1 0 0 0 1 1", "1000000000 30 1\n1 1 0 1 1 0 0 1 0 1 1 0 0 1 1 1 0 0 1 1 0 0 0 0 0 1 0 0 0 0", "1000000000 30 1\n1 0 1 1 1 1 1 1 0 1 0 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1", "1000000000 30 1\n1 0 1 0 0 0 0 1 1 0 0 1 1 0 1 1 1 0 1 0 1 1 1 0 0 0 1 0 1 1", "1000000000 30 1\n1 0 1 0 0 0 1 1 1 0 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 0 0 1 1 1", "1000000000 30 1\n1 1 0 1 1 1 1 1 0 0 1 1 1 0 1 1 0 0 0 0 0 1 1 0 0 0 1 0 0 0", "1000000000 30 1000000000\n1 1 1 0 0 0 1 1 1 1 0 1 0 0 0 1 1 0 1 1 0 0 0 1 0 0 0 0 1 0", "1000000000 30 1000000000\n1 1 1 0 0 1 1 1 0 0 1 1 0 0 1 1 1 0 1 0 1 1 0 0 1 0 1 1 1 0", "1000000000 30 1000000000\n0 0 1 1 1 0 0 1 0 0 1 1 0 1 0 0 1 0 1 1 1 1 1 1 0 0 1 0 1 1", "1000000000 30 1000000000\n0 0 0 1 1 1 1 1 1 0 1 0 1 0 1 1 0 1 1 0 0 1 0 0 1 0 0 1 0 1", "1000000000 30 1000000000\n0 0 0 1 1 1 0 1 1 0 0 0 1 1 0 0 0 1 0 0 0 0 1 0 0 1 1 0 0 1", "1 30 1\n1 1 1 0 1 0 0 0 0 1 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 0 0 0 1 1", "1 30 1\n1 1 0 0 0 1 1 0 0 0 0 0 1 0 1 0 0 1 0 0 1 0 1 0 0 0 1 1 0 0", "1 30 1\n1 0 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 0 1 1 0 0 1 1 0 1 0 0 0", "1 30 1\n1 0 1 1 1 0 0 0 0 0 0 1 0 0 1 0 1 1 0 1 0 0 0 0 0 1 0 1 0 0", "1 30 1\n1 0 1 1 1 1 1 0 0 0 1 1 0 1 0 1 1 0 0 0 0 0 1 1 1 1 1 0 1 1", "2 1 2\n1", "1000000000 1 1000000000\n1", "10000 1 10000\n1", "1000000000 1 999999999\n1", "100000 2 15\n1 0", "200000 1 110000\n1", "123456789 1 42\n1", "1000000000 1 9\n1", "200000 2 100002\n1 0", "1000000000 3 234567890\n0 1 0", "1000000000 5 321732193\n1 1 0 1 0", "1000000000 1 804289384\n1", "1000000000 2 999999998\n1 0", "1000000000 5 384618761\n0 1 1 0 1", "100000000 1 100\n0", "1000000000 1 804289384\n0", "100000000 1 100000000\n1", "40 1 4\n0", "1000000000 2 999999998\n0 1", "1000000000 1 1000000000\n0", "1000000000 2 255555555\n1 0", "1000000000 2 1000000000\n0 1", "1000000000 1 999999999\n0", "1000000000 2 888888888\n0 1", "1000000000 1 77000000\n1", "1000000000 1 123456789\n1", "10000 1 228\n0", "1000000000 1 12345\n1", "1000000000 1 77000000\n0", "1000000000 1 23333\n0", "1000000000 4 100\n0 1 0 1", "100000000 1 200\n1", "1000000000 3 5\n0 1 0", "1000000000 12 2\n1 1 1 1 1 1 0 0 1 1 1 1", "1000000000 1 5\n0", "100000 2 99999\n0 0", "100000 2 2\n0 1", "1000000 1 91923\n0", "1000000 2 1235\n0 1", "1000000000 1 5\n1", "100000000 2 1234567\n0 1", "1000000000 1 1\n1", "1000000000 4 999999999\n1 0 0 1", "1000000000 4 1000000000\n1 0 1 0", "1000000000 4 1\n1 0 1 0", "1000000000 5 500\n1 1 0 0 1", "1000 1 13\n1", "999999999 2 123456789\n1 0", "1000000000 5 1000000000\n1 1 1 1 1", "1000000000 3 123456789\n1 0 1", "1000000000 1 123\n1", "10 1 9\n1", "1000000000 1 1\n0", "100000000 2 12345678\n0 1", "1000000000 30 1000000000\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", "805306369 30 805306369\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", "1000000000 2 123\n0 1", "1000000000 1 9\n0", "100000 2 90000\n1 0", "1000000000 2 123456789\n1 0", "1000000000 2 804289384\n1 0", "1000000000 30 999999970\n1 0 0 1 1 1 1 0 1 1 0 0 0 0 0 1 0 0 1 1 0 0 0 1 0 1 0 0 0 1"], "outputs": ["3 queries, x=3", "1 queries, x=1", "4 queries, x=3", "5 queries, x=5", "6 queries, x=3", "6 queries, x=16", "11 queries, x=21", "14 queries, x=73", "58 queries, x=958572235", "59 queries, x=116044407", "16 queries, x=165", "19 queries, x=150", "20 queries, x=140", "21 queries, x=1896", "23 queries, x=4679", "26 queries, x=4977", "28 queries, x=60", "27 queries, x=58813", "32 queries, x=79154", "34 queries, x=11107", "37 queries, x=146716", "38 queries, x=418016", "41 queries, x=642518", "43 queries, x=3516807", "42 queries, x=8115129", "48 queries, x=10362635", "46 queries, x=52208533", "50 queries, x=51744320", "54 queries, x=264009490", "56 queries, x=415720732", "58 queries, x=946835863", "59 queries, x=124919287", "58 queries, x=202669473", "42 queries, x=532121080", "57 queries, x=105669924", "38 queries, x=533994576", "39 queries, x=107543421", "53 queries, x=976059561", "36 queries, x=549608406", "49 queries, x=123157250", "47 queries, x=696706094", "33 queries, x=125030747", "46 queries, x=993546887", "45 queries, x=567095731", "58 queries, x=140644576", "43 queries, x=714193420", "52 queries, x=142518072", "54 queries, x=11034213", "35 queries, x=584583057", "53 queries, x=863164606", "51 queries, x=731680746", "35 queries, x=305229590", "31 queries, x=28521539", "32 queries, x=602070383", "30 queries, x=880651931", "46 queries, x=749168072", "58 queries, x=322716916", "43 queries, x=191233057", "1 queries, x=1", "1 queries, x=1", "1 queries, x=1", "1 queries, x=1", "1 queries, x=1", "60 queries, x=1000000000", "60 queries, x=1000000000", "60 queries, x=1000000000", "60 queries, x=1000000000", "60 queries, x=1000000000", "1 queries, x=1", "1 queries, x=1", "1 queries, x=1", "1 queries, x=1", "1 queries, x=1", "2 queries, x=2", "31 queries, x=1000000000", "15 queries, x=10000", "30 queries, x=999999999", "19 queries, x=15", "17 queries, x=110000", "27 queries, x=42", "30 queries, x=9", "19 queries, x=100002", "31 queries, x=234567890", "35 queries, x=321732193", "27 queries, x=804289384", "32 queries, x=999999998", "33 queries, x=384618761", "28 queries, x=100", "27 queries, x=804289384", "28 queries, x=100000000", "6 queries, x=4", "32 queries, x=999999998", "31 queries, x=1000000000", "31 queries, x=255555555", "32 queries, x=1000000000", "30 queries, x=999999999", "31 queries, x=888888888", "31 queries, x=77000000", "27 queries, x=123456789", "14 queries, x=228", "31 queries, x=12345", "31 queries, x=77000000", "31 queries, x=23333", "34 queries, x=100", "27 queries, x=200", "33 queries, x=5", "41 queries, x=2", "31 queries, x=5", "18 queries, x=99999", "18 queries, x=2", "21 queries, x=91923", "22 queries, x=1235", "31 queries, x=5", "28 queries, x=1234567", "1 queries, x=1", "33 queries, x=999999999", "34 queries, x=1000000000", "1 queries, x=1", "34 queries, x=500", "11 queries, x=13", "31 queries, x=123456789", "35 queries, x=1000000000", "29 queries, x=123456789", "29 queries, x=123", "4 queries, x=9", "1 queries, x=1", "28 queries, x=12345678", "60 queries, x=1000000000", "60 queries, x=805306369", "30 queries, x=123", "30 queries, x=9", "18 queries, x=90000", "28 queries, x=123456789", "28 queries, x=804289384", "60 queries, x=999999970"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	27	codeforces
b9622c31d50bf23062fb84ae34d8743b	New Year Book Reading	New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n books numbered by integers from 1 to n. The weight of the i-th (1<=≤<=i<=≤<=n) book is wi. As Jaehyun's house is not large enough to have a bookshelf, he keeps the n books by stacking them vertically. When he wants to read a certain book x, he follows the steps described below. 1. He lifts all the books above book x. 1. He pushes book x out of the stack. 1. He puts down the lifted books without changing their order. 1. After reading book x, he puts book x on the top of the stack. He decided to read books for m days. In the j-th (1<=≤<=j<=≤<=m) day, he will read the book that is numbered with integer bj (1<=≤<=bj<=≤<=n). To read the book, he has to use the process described in the paragraph above. It is possible that he decides to re-read the same book several times. After making this plan, he realized that the total weight of books he should lift during m days would be too heavy. So, he decided to change the order of the stacked books before the New Year comes, and minimize the total weight. You may assume that books can be stacked in any possible order. Note that book that he is going to read on certain step isn't considered as lifted on that step. Can you help him? The first line contains two space-separated integers n (2<=≤<=n<=≤<=500) and m (1<=≤<=m<=≤<=1000) — the number of books, and the number of days for which Jaehyun would read books. The second line contains n space-separated integers w1,<=w2,<=...,<=wn (1<=≤<=wi<=≤<=100) — the weight of each book. The third line contains m space separated integers b1,<=b2,<=...,<=bm (1<=≤<=bj<=≤<=n) — the order of books that he would read. Note that he can read the same book more than once. Print the minimum total weight of books he should lift, which can be achieved by rearranging the order of stacked books. Sample Input 3 5 1 2 3 1 3 2 3 1 Sample Output 12	{"inputs": ["3 5\n1 2 3\n1 3 2 3 1", "3 3\n10 20 30\n1 2 3", "2 2\n10 12\n2 1", "10 10\n61 59 97 16 2 94 57 48 91 93\n2 8 6 5 3 1 3 4 9 10", "50 50\n75 71 23 37 28 23 69 75 5 62 3 11 96 100 13 50 57 51 8 90 4 6 84 27 11 89 95 81 10 62 48 52 69 87 97 95 30 74 21 42 36 64 31 80 81 50 56 53 33 99\n26 30 5 33 35 29 6 15 36 17 32 16 14 1 29 34 22 40 12 42 38 48 39 50 13 47 18 43 10 8 49 45 11 31 21 37 46 28 20 41 2 7 9 24 27 23 3 44 15 14", "50 60\n86 57 45 93 17 12 40 10 47 80 18 80 3 9 6 55 13 99 5 76 4 70 100 55 27 91 71 3 65 93 41 74 80 56 90 50 58 13 71 9 47 52 26 73 72 21 15 81 88 28\n40 32 5 16 49 23 3 17 14 10 1 15 1 21 28 22 13 45 12 25 44 48 46 32 36 43 11 8 49 7 7 35 10 14 39 4 42 10 30 27 1 17 31 15 8 41 44 33 25 26 19 18 29 37 50 6 36 38 47 9", "2 1\n1 2\n1", "2 3\n20 30\n1 1 1", "2 7\n20 30\n1 1 1 2 2 2 2", "2 10\n39 26\n1 1 2 2 2 2 2 2 1 2", "5 1\n16 87 36 16 81\n3"], "outputs": ["12", "40", "12", "2137", "63929", "62514", "0", "0", "20", "104", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	6	codeforces
b97db026ba1258b019779e2780f685b7	Lie or Truth	Vasya has a sequence of cubes and exactly one integer is written on each cube. Vasya exhibited all his cubes in a row. So the sequence of numbers written on the cubes in the order from the left to the right equals to a1,<=a2,<=...,<=an. While Vasya was walking, his little brother Stepan played with Vasya's cubes and changed their order, so now the sequence of numbers written on the cubes became equal to b1,<=b2,<=...,<=bn. Stepan said that he swapped only cubes which where on the positions between l and r, inclusive, and did not remove or add any other cubes (i. e. he said that he reordered cubes between positions l and r, inclusive, in some way). Your task is to determine if it is possible that Stepan said the truth, or it is guaranteed that Stepan deceived his brother. The first line contains three integers n, l, r (1<=≤<=n<=≤<=105, 1<=≤<=l<=≤<=r<=≤<=n) — the number of Vasya's cubes and the positions told by Stepan. The second line contains the sequence a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=n) — the sequence of integers written on cubes in the Vasya's order. The third line contains the sequence b1,<=b2,<=...,<=bn (1<=≤<=bi<=≤<=n) — the sequence of integers written on cubes after Stepan rearranged their order. It is guaranteed that Stepan did not remove or add other cubes, he only rearranged Vasya's cubes. Print "LIE" (without quotes) if it is guaranteed that Stepan deceived his brother. In the other case, print "TRUTH" (without quotes). Sample Input 5 2 4 3 4 2 3 1 3 2 3 4 1 3 1 2 1 2 3 3 1 2 4 2 4 1 1 1 1 1 1 1 1 Sample Output TRUTH LIE TRUTH	{"inputs": ["5 2 4\n3 4 2 3 1\n3 2 3 4 1", "3 1 2\n1 2 3\n3 1 2", "4 2 4\n1 1 1 1\n1 1 1 1", "5 1 3\n2 2 2 1 2\n2 2 2 1 2", "7 1 4\n2 5 5 5 4 3 4\n2 5 5 5 4 3 4", "10 1 10\n6 7 6 1 10 10 9 5 3 9\n7 10 9 6 1 5 9 3 10 6", "1 1 1\n1\n1", "4 3 4\n1 2 3 4\n2 1 3 4", "7 2 4\n1 2 3 4 5 7 6\n1 2 3 4 5 6 7", "5 1 2\n1 2 3 4 5\n1 2 3 5 4", "8 3 6\n5 3 1 1 1 1 3 5\n3 3 1 1 1 1 5 5", "4 2 2\n2 1 2 2\n1 2 2 2"], "outputs": ["TRUTH", "LIE", "TRUTH", "TRUTH", "TRUTH", "TRUTH", "TRUTH", "LIE", "LIE", "LIE", "LIE", "LIE"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	56	codeforces
b9872594d263a975d2c53559931b8334	Little Pony and Expected Maximum	Twilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interested in the dice that were used in the game. The dice has m faces: the first face of the dice contains a dot, the second one contains two dots, and so on, the m-th face contains m dots. Twilight Sparkle is sure that when the dice is tossed, each face appears with probability . Also she knows that each toss is independent from others. Help her to calculate the expected maximum number of dots she could get after tossing the dice n times. A single line contains two integers m and n (1<=≤<=m,<=n<=≤<=105). Output a single real number corresponding to the expected maximum. The answer will be considered correct if its relative or absolute error doesn't exceed 10<=<=-<=4. Sample Input 6 1 6 3 2 2 Sample Output 3.500000000000 4.958333333333 1.750000000000	{"inputs": ["6 1", "6 3", "2 2", "5 4", "5 8", "3 10", "3 6", "1 8", "24438 9", "94444 9", "8 66716", "4 25132", "51520 73331", "54230 31747", "24236 90163", "26946 99523", "50323 7", "53033 3", "55743 5", "59964 79", "1 1", "1 1", "3 1", "1 2", "53513 34040", "100000 100000", "1 100000", "100000 1", "2 100000", "100000 2", "50000 100000", "99999 1111", "99999 99999", "1000 1000", "50000 50000", "88888 88888", "99999 100000", "100000 555", "10000 10000", "100000 5001", "100000 1000"], "outputs": ["3.500000000000", "4.958333333333", "1.750000000000", "4.433600000000", "4.814773760000", "2.982641534996", "2.910836762689", "1.000000000000", "21994.699969310015", "85000.099992058866", "8.000000000000", "4.000000000000", "51519.682650242677", "54228.743352775018", "24235.975171545670", "26945.974480086279", "44033.124988408454", "39775.249995286234", "46452.999992525307", "59214.949890211828", "1.000000000000", "1.000000000000", "2.000000000000", "1.000000000000", "53511.875329020870", "99999.418033254507", "1.000000000000", "50000.499999999935", "2.000000000000", "66667.166665000332", "49999.843487110789", "99909.571915885972", "99998.418033254609", "999.419018443269", "49999.418043215679", "88887.418034499773", "99998.418042461126", "99820.643422392372", "9999.418122897887", "99980.503829474910", "99900.599066768002"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	192	codeforces
b98a21fa072aed9a5f1c1c67eb2c1ce9	Create a Maze	ZS the Coder loves mazes. Your job is to create one so that he can play with it. A maze consists of n<=×<=m rooms, and the rooms are arranged in n rows (numbered from the top to the bottom starting from 1) and m columns (numbered from the left to the right starting from 1). The room in the i-th row and j-th column is denoted by (i,<=j). A player starts in the room (1,<=1) and wants to reach the room (n,<=m). Each room has four doors (except for ones at the maze border), one on each of its walls, and two adjacent by the wall rooms shares the same door. Some of the doors are locked, which means it is impossible to pass through the door. For example, if the door connecting (i,<=j) and (i,<=j<=+<=1) is locked, then we can't go from (i,<=j) to (i,<=j<=+<=1). Also, one can only travel between the rooms downwards (from the room (i,<=j) to the room (i<=+<=1,<=j)) or rightwards (from the room (i,<=j) to the room (i,<=j<=+<=1)) provided the corresponding door is not locked. ZS the Coder considers a maze to have difficulty x if there is exactly x ways of travelling from the room (1,<=1) to the room (n,<=m). Two ways are considered different if they differ by the sequence of rooms visited while travelling. Your task is to create a maze such that its difficulty is exactly equal to T. In addition, ZS the Coder doesn't like large mazes, so the size of the maze and the number of locked doors are limited. Sounds simple enough, right? The first and only line of the input contains a single integer T (1<=≤<=T<=≤<=1018), the difficulty of the required maze. The first line should contain two integers n and m (1<=≤<=n,<=m<=≤<=50) — the number of rows and columns of the maze respectively. The next line should contain a single integer k (0<=≤<=k<=≤<=300) — the number of locked doors in the maze. Then, k lines describing locked doors should follow. Each of them should contain four integers, x1,<=y1,<=x2,<=y2. This means that the door connecting room (x1,<=y1) and room (x2,<=y2) is locked. Note that room (x2,<=y2) should be adjacent either to the right or to the bottom of (x1,<=y1), i.e. x2<=+<=y2 should be equal to x1<=+<=y1<=+<=1. There should not be a locked door that appears twice in the list. It is guaranteed that at least one solution exists. If there are multiple solutions, print any of them. Sample Input 3 4 Sample Output 3 2 0 4 3 3 1 2 2 2 3 2 3 3 1 3 2 3	{"inputs": ["3", "4", "576460752303423488", "576460752303423487", "99999988898898889", "989466010702279111", "1000000000000000000", "1", "2", "201620162016201600", "138944482508455329", "327543848458922240", "516143210114421854", "481370539210112956", "639733286738742273", "604960615834433375", "793559981784900286", "982159343440399900", "170758705095899514", "513930638418673772", "702530000074173386", "891129366024640296", "79728727680139911", "268328089335639525", "297819469440675531", "486418831096175146", "675018197046642056", "863617562997108966", "632172093115904261", "395388853680415542", "583988219630882453", "772587581286382067", "737814910382073169", "926414272037572783", "179277684702417302", "367877050652884212", "333104375453608019", "325030946722146418", "513630312672613328", "53475036382348801", "242074398037848415", "430673763988315325", "619273125643814940", "807872491594281850", "837363867404350560", "25963229059850175", "281442720373954210", "983117125129112380", "171716491079579290", "934933251644090571", "123532617594557481", "312131979250057096", "500731345200524006", "465958670001247812", "718822086961059627", "487376621374822218", "675975978735354536", "864575344685821446", "53174706341321061", "880549474766385254", "69148836421884868", "257748198077384482", "446347564027851393", "634946925683351007", "467765511106458502", "656364872761958116", "621592201857649219", "810191567808116129", "998790929463615743", "762007690028127024", "950607055978593934", "139206417634093549", "104433742434817355", "96360313703355754", "125851689513424465", "314451055463891375", "503050417119390989", "691649783069857899", "880249149020324810", "420093872730060283", "608693234385559897", "797292600336026807", "789219171604565206", "754446496405289013", "7309909070133531", "195909270725633145", "384508636676100056", "349735961476823862", "538335327427290772", "301552087991802053", "490151453942268963", "258705984061064258", "447305350011531169", "635904715961998079", "665396091772066789", "853995453427566404", "42594815083066018", "231194181033532928", "419793542689032543", "183010307548511120", "977109881915691245", "165709243571190859", "354308605226690473", "542907971177157383", "572399346987226094", "760998712937693004", "949598074593192619", "138197440543659529", "326796802199159143", "446665360611696202", "635264726562163113", "823864088217662727", "789091417313353829", "977690778968853444", "230554191633697962", "419153557584164872", "384380882384888679", "572980248335355589", "761579609990855203", "104751543313629461", "293350904969129075", "481950270919595985", "670549632575095600", "859148998525562510", "888640378630598516", "77239735991130835", "265839101941597745", "454438463597097359", "222992998010859950", "986209758575371231", "174809124525838142", "363408486181337756", "552007852131804666", "517235176932528472", "770098593892340287", "958697959842807197", "147297317203339516", "915851851617102107", "104451213272601721", "867667978132080298", "832895302932804104", "21494668883271014", "210094030538770629", "398693396489237539", "428184772299306249", "616784138249773160", "608710709518311559", "797310071173811173", "762537395974534979", "525754160834013556", "789730223053602816", "789730223053602815", "947676267664323379", "315892089221441126", "473838133832161689", "631784178442882252", "999999999999999999", "12345678987654321", "100055128505716009", "981168724994134051", "213025900602118694", "163428781826190151", "149046408559208370", "718882536615471983"], "outputs": ["4 4\n5\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n4 1 4 2", "4 4\n4\n1 2 2 2\n1 3 2 3\n2 1 2 2\n4 1 4 2", "48 48\n233\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 1...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 1...", "46 46\n232\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n...", "50 50\n251\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 1...", "50 50\n240\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 ...", "4 4\n5\n1 2 2 2\n1 3 2 3\n2 1 2 2\n3 1 3 2\n4 1 4 2", "4 4\n4\n1 2 2 2\n1 3 2 3\n2 1 2 2\n3 1 3 2", "48 48\n241\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 ...", "48 48\n244\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11...", "48 48\n231\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12...", "48 48\n231\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13...", "48 48\n231\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 ...", "48 48\n235\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 10 13 10\n12 11...", "48 48\n239\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n1...", "50 50\n252\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n...", "50 50\n240\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n...", "48 48\n232\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n...", "48 48\n233\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 ...", "48 48\n242\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n...", "50 50\n247\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12...", "46 46\n224\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 ...", "48 48\n231\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n1...", "48 48\n237\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 ...", "48 48\n228\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 1...", "50 50\n252\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 1...", "48 48\n227\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 10 13 10\n12...", "48 48\n237\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n1...", "48 48\n231\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13...", "48 48\n231\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 11\n12 ...", "48 48\n231\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13...", "50 50\n251\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 ...", "48 48\n235\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 ...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 ...", "48 48\n230\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 ...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 11\n12...", "48 48\n235\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 11\n12 14...", "46 46\n222\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 ...", "48 48\n227\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n1...", "48 48\n232\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n...", "48 48\n238\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 ...", "50 50\n244\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12...", "50 50\n254\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 ...", "46 46\n228\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 1...", "48 48\n232\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 ...", "50 50\n239\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10...", "48 48\n227\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 1...", "50 50\n248\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 ...", "46 46\n221\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 1...", "48 48\n235\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10...", "48 48\n235\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 10\n12 11 ...", "48 48\n233\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12...", "48 48\n226\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 ...", "48 48\n231\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12...", "48 48\n222\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 1...", "50 50\n244\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 1...", "46 46\n222\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n...", "50 50\n248\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 ...", "46 46\n219\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n...", "48 48\n230\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 11\n12 14...", "48 48\n241\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n...", "48 48\n227\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 11\n1...", "48 48\n235\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n1...", "48 48\n228\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 ...", "50 50\n247\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 1...", "50 50\n244\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 ...", "48 48\n241\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 9 12 10\n12 ...", "50 50\n248\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 1...", "48 48\n239\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 1...", "46 46\n220\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10...", "46 46\n215\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 1...", "46 46\n224\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12...", "48 48\n235\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 ...", "48 48\n232\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 1...", "48 48\n231\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13...", "50 50\n255\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 ...", "48 48\n234\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 ...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 ...", "50 50\n248\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n...", "48 48\n229\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 10\n12 11 13 11\n12 14...", "48 48\n228\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 ...", "44 44\n210\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 10 13 10\n12 11 13 11\n12 14 12 1...", "48 48\n240\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8...", "48 48\n237\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 1...", "48 48\n236\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 10...", "48 48\n231\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13...", "48 48\n235\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 ...", "48 48\n233\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n...", "48 48\n232\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10...", "48 48\n230\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9...", "48 48\n221\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 10\n12 11 13 11\n...", "48 48\n236\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 ...", "50 50\n240\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n1...", "46 46\n216\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 ...", "48 48\n235\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n1...", "48 48\n235\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8...", "48 48\n230\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n...", "50 50\n252\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 1...", "48 48\n232\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 ...", "48 48\n228\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n...", "48 48\n238\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 10...", "50 50\n249\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8...", "48 48\n237\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8...", "48 48\n224\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 10\n12 ...", "48 48\n239\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13...", "48 48\n230\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 9 12 10\n1...", "50 50\n250\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 1...", "48 48\n221\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 11\n12 14 12 15\n12 16 13 16\n12 1...", "50 50\n248\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n...", "48 48\n237\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 ...", "48 48\n237\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 ...", "48 48\n232\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 1...", "48 48\n236\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n...", "48 48\n228\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 10\n12 1...", "46 46\n213\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 10 ...", "48 48\n232\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n...", "48 48\n233\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 1...", "48 48\n241\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 14\n...", "50 50\n248\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 1...", "50 50\n252\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 1...", "46 46\n226\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13...", "48 48\n233\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13...", "48 48\n232\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9...", "48 48\n233\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n...", "50 50\n244\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 1...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 1...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 1...", "48 48\n232\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n...", "48 48\n226\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 1...", "48 48\n239\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 ...", "50 50\n245\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n1...", "48 48\n235\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8...", "50 50\n239\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n...", "46 46\n224\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 1...", "50 50\n243\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 1...", "50 50\n245\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9...", "44 44\n214\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 11\n1...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9...", "48 48\n234\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10...", "48 48\n236\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 ...", "48 48\n234\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 1...", "48 48\n233\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n11 14 12 14\n12 8 12 9\n12 10 13 ...", "50 50\n244\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n...", "48 48\n235\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12...", "48 48\n227\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 10\n12 11 13 11\n...", "50 50\n279\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n...", "48 48\n199\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 13 11\n12 14 12 15\n12 16 13 16\n12 17 13 17\n13...", "50 50\n256\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13...", "48 48\n222\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 10 13 10\n12 11 ...", "48 48\n245\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 ...", "48 48\n222\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 10\n12 1...", "50 50\n241\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n5 8 6 8\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 ...", "44 44\n219\n1 2 2 2\n1 3 2 3\n1 4 2 4\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n...", "46 46\n222\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 1...", "50 50\n243\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n11 14 12 1...", "48 48\n233\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 7 9 8\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n1...", "48 48\n243\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 5 7 6\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 9 11 10\n11 12 11 13\n11 13 12 13\n12 8 12 9\n...", "48 48\n238\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 1 3 2\n3 4 3 5\n3 5 4 5\n3 6 4 6\n4 1 4 2\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 3 6 4\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n9 12 10 12\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n1...", "48 48\n228\n1 2 2 2\n1 3 2 3\n2 1 2 2\n2 4 2 5\n2 6 3 6\n2 7 3 7\n3 4 3 5\n3 5 4 5\n4 2 5 2\n4 3 5 3\n4 6 4 7\n4 8 5 8\n4 9 5 9\n5 3 5 4\n5 6 5 7\n5 7 6 7\n6 2 6 3\n6 4 7 4\n6 5 7 5\n6 8 6 9\n6 10 7 10\n6 11 7 11\n7 2 7 3\n7 8 7 9\n7 9 8 9\n7 10 8 10\n8 4 8 5\n8 5 8 6\n8 6 9 6\n8 7 9 7\n8 10 8 11\n8 12 9 12\n8 13 9 13\n9 4 9 5\n9 10 9 11\n9 11 10 11\n10 6 10 7\n10 7 10 8\n10 8 11 8\n10 9 11 9\n10 12 10 13\n10 14 11 14\n10 15 11 15\n11 6 11 7\n11 12 11 13\n11 13 12 13\n12 8 12 9\n12 9 12 10\n12 10 13 10\n12..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
b9a4afd6adac4ec8d2a946362c08d270	Chloe and pleasant prizes	Generous sponsors of the olympiad in which Chloe and Vladik took part allowed all the participants to choose a prize for them on their own. Christmas is coming, so sponsors decided to decorate the Christmas tree with their prizes. They took n prizes for the contestants and wrote on each of them a unique id (integer from 1 to n). A gift i is characterized by integer ai — pleasantness of the gift. The pleasantness of the gift can be positive, negative or zero. Sponsors placed the gift 1 on the top of the tree. All the other gifts hung on a rope tied to some other gift so that each gift hung on the first gift, possibly with a sequence of ropes and another gifts. Formally, the gifts formed a rooted tree with n vertices. The prize-giving procedure goes in the following way: the participants come to the tree one after another, choose any of the remaining gifts and cut the rope this prize hang on. Note that all the ropes which were used to hang other prizes on the chosen one are not cut. So the contestant gets the chosen gift as well as the all the gifts that hang on it, possibly with a sequence of ropes and another gifts. Our friends, Chloe and Vladik, shared the first place on the olympiad and they will choose prizes at the same time! To keep themselves from fighting, they decided to choose two different gifts so that the sets of the gifts that hang on them with a sequence of ropes and another gifts don't intersect. In other words, there shouldn't be any gift that hang both on the gift chosen by Chloe and on the gift chosen by Vladik. From all of the possible variants they will choose such pair of prizes that the sum of pleasantness of all the gifts that they will take after cutting the ropes is as large as possible. Print the maximum sum of pleasantness that Vladik and Chloe can get. If it is impossible for them to choose the gifts without fighting, print Impossible. The first line contains a single integer n (1<=≤<=n<=≤<=2·105) — the number of gifts. The next line contains n integers a1,<=a2,<=...,<=an (<=-<=109<=≤<=ai<=≤<=109) — the pleasantness of the gifts. The next (n<=-<=1) lines contain two numbers each. The i-th of these lines contains integers ui and vi (1<=≤<=ui,<=vi<=≤<=n, ui<=≠<=vi) — the description of the tree's edges. It means that gifts with numbers ui and vi are connected to each other with a rope. The gifts' ids in the description of the ropes can be given in arbirtary order: vi hangs on ui or ui hangs on vi. It is guaranteed that all the gifts hang on the first gift, possibly with a sequence of ropes and another gifts. If it is possible for Chloe and Vladik to choose prizes without fighting, print single integer — the maximum possible sum of pleasantness they can get together. Otherwise print Impossible. Sample Input 8 0 5 -1 4 3 2 6 5 1 2 2 4 2 5 1 3 3 6 6 7 6 8 4 1 -5 1 1 1 2 1 4 2 3 1 -1 Sample Output 252Impossible	{"inputs": ["8\n0 5 -1 4 3 2 6 5\n1 2\n2 4\n2 5\n1 3\n3 6\n6 7\n6 8", "4\n1 -5 1 1\n1 2\n1 4\n2 3", "1\n-1", "10\n3 2 -4 2 0 3 3 3 3 4\n10 8\n4 2\n4 9\n3 5\n5 2\n7 4\n2 6\n1 8\n10 9", "10\n-1 2 -2 -3 -1 -1 0 -4 -5 -4\n4 6\n6 9\n1 2\n6 2\n7 8\n7 9\n5 10\n6 3\n10 1", "10\n4 -4 2 5 -1 3 -1 1 4 5\n1 8\n7 1\n4 1\n9 6\n1 2\n5 10\n10 1\n9 3\n1 9", "10\n29 -2 39 1 98 98 82 56 5 -2\n3 1\n7 9\n8 9\n7 3\n4 2\n5 10\n6 8\n10 6\n5 4", "10\n-3 0 1 -3 2 1 2 5 3 1\n6 2\n10 3\n10 5\n2 7\n3 4\n8 2\n8 10\n4 9\n1 9", "10\n-5 0 1 -2 2 1 2 1 -1 -3\n10 4\n10 5\n4 1\n3 5\n2 8\n6 7\n9 7\n8 7\n6 3", "10\n2 -4 5 4 -1 -5 -1 -5 3 -1\n8 6\n8 7\n10 2\n6 3\n5 2\n3 9\n10 1\n5 4\n9 4", "10\n-1 2 -5 -5 3 1 -4 0 3 -5\n2 10\n2 6\n8 4\n9 2\n10 7\n1 7\n9 5\n8 3\n9 4", "10\n1 -4 -4 0 1 -3 1 -2 -4 2\n7 1\n7 6\n5 6\n4 2\n2 6\n3 9\n5 9\n10 6\n8 5", "10\n-4 -1 -5 -1 -3 -1 -2 -2 -5 -3\n7 9\n3 6\n1 4\n7 2\n3 10\n8 9\n4 10\n3 5\n6 8", "10\n-21 -17 -16 -45 -93 -77 -73 -12 -81 -33\n9 5\n8 6\n1 10\n9 4\n3 2\n10 4\n3 8\n7 2\n5 6", "10\n-5 -2 -4 -1 -4 -5 -1 -4 -1 -3\n8 6\n7 2\n1 2\n10 4\n9 3\n6 10\n7 9\n5 4\n5 3", "10\n-1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000 -1000000000\n7 8\n5 10\n8 6\n1 5\n7 9\n3 9\n2 10\n2 6\n4 3", "10\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n7 8\n8 3\n3 10\n2 10\n2 4\n9 6\n7 5\n6 5\n9 1", "3\n1 -1000000000 -1000000000\n1 2\n1 3"], "outputs": ["25", "2", "Impossible", "6", "-3", "14", "Impossible", "10", "0", "Impossible", "4", "2", "-4", "Impossible", "Impossible", "Impossible", "Impossible", "-2000000000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
b9ad6ca1fc6d03437f5d46ec93ad89c2	Inna and Sweet Matrix	Inna loves sweets very much. That's why she decided to play a game called "Sweet Matrix". Inna sees an n<=×<=m matrix and k candies. We'll index the matrix rows from 1 to n and the matrix columns from 1 to m. We'll represent the cell in the i-th row and j-th column as (i,<=j). Two cells (i,<=j) and (p,<=q) of the matrix are adjacent if \|i<=-<=p\|<=+<=\|j<=-<=q\|<==<=1. A path is a sequence of the matrix cells where each pair of neighbouring cells in the sequence is adjacent. We'll call the number of cells in the sequence the path's length. Each cell of the matrix can have at most one candy. Initiallly, all the cells are empty. Inna is trying to place each of the k candies in the matrix one by one. For each candy Inna chooses cell (i,<=j) that will contains the candy, and also chooses the path that starts in cell (1,<=1) and ends in cell (i,<=j) and doesn't contain any candies. After that Inna moves the candy along the path from cell (1,<=1) to cell (i,<=j), where the candy stays forever. If at some moment Inna can't choose a path for the candy, she loses. If Inna can place all the candies in the matrix in the described manner, then her penalty equals the sum of lengths of all the paths she has used. Help Inna to minimize the penalty in the game. The first line of the input contains three integers n, m and k (1<=≤<=n,<=m<=≤<=50,<=1<=≤<=k<=≤<=n·m). In the first line print an integer — Inna's minimum penalty in the game. In the next k lines print the description of the path for each candy. The description of the path of the candy that is placed i-th should follow on the i-th line. The description of a path is a sequence of cells. Each cell must be written in the format (i,<=j), where i is the number of the row and j is the number of the column. You are allowed to print extra whitespaces in the line. If there are multiple optimal solutions, print any of them. Please follow the output format strictly! If your program passes the first pretest, then the output format is correct. Sample Input 4 4 4 Sample Output 8 (1,1) (2,1) (2,2) (1,1) (1,2) (1,1) (2,1) (1,1)	{"inputs": ["4 4 4", "1 1 1", "1 50 50", "50 1 50", "50 50 1", "4 4 9", "10 10 10", "10 10 100", "10 10 50", "10 10 25", "10 10 75", "50 50 1000", "50 50 2500", "50 50 1", "50 50 10", "50 50 100", "50 50 500", "50 50 200", "50 50 1000", "50 50 1500", "50 50 2000", "50 50 2499", "30 30 56", "30 30 800", "2 2 3", "1 2 1", "2 50 75", "15 15 150", "50 50 1234", "50 50 2374", "50 50 811"], "outputs": ["8\n(1,1) (2,1) (2,2)\n(1,1) (1,2)\n(1,1) (2,1)\n(1,1)", "1\n(1,1)", "1275\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (1,32) (1,33) (1,34) (1,35) (1,36) (1,37) (1,38) (1,39) (1,40) (1,41) (1,42) (1,43) (1,44) (1,45) (1,46) (1,47) (1,48) (1,49) (1,50)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,2...", "1275\n(1,1) (2,1) (3,1) (4,1) (5,1) (6,1) (7,1) (8,1) (9,1) (10,1) (11,1) (12,1) (13,1) (14,1) (15,1) (16,1) (17,1) (18,1) (19,1) (20,1) (21,1) (22,1) (23,1) (24,1) (25,1) (26,1) (27,1) (28,1) (29,1) (30,1) (31,1) (32,1) (33,1) (34,1) (35,1) (36,1) (37,1) (38,1) (39,1) (40,1) (41,1) (42,1) (43,1) (44,1) (45,1) (46,1) (47,1) (48,1) (49,1) (50,1)\n(1,1) (2,1) (3,1) (4,1) (5,1) (6,1) (7,1) (8,1) (9,1) (10,1) (11,1) (12,1) (13,1) (14,1) (15,1) (16,1) (17,1) (18,1) (19,1) (20,1) (21,1) (22,1) (23,1) (24,1) (25,...", "1\n(1,1)", "26\n(1,1) (1,2) (1,3) (2,3)\n(1,1) (1,2) (2,2) (3,2)\n(1,1) (2,1) (3,1) (4,1)\n(1,1) (1,2) (1,3)\n(1,1) (1,2) (2,2)\n(1,1) (2,1) (3,1)\n(1,1) (1,2)\n(1,1) (2,1)\n(1,1)", "30\n(1,1) (1,2) (1,3) (1,4)\n(1,1) (1,2) (1,3) (2,3)\n(1,1) (1,2) (2,2) (3,2)\n(1,1) (2,1) (3,1) (4,1)\n(1,1) (1,2) (1,3)\n(1,1) (1,2) (2,2)\n(1,1) (2,1) (3,1)\n(1,1) (1,2)\n(1,1) (2,1)\n(1,1)", "1000\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (2,10) (3,10) (4,10) (5,10) (6,10) (7,10) (8,10) (9,10) (10,10)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (2,10) (3,10) (4,10) (5,10) (6,10) (7,10) (8,10) (9,10)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (2,9) (3,9) (4,9) (5,9) (6,9) (7,9) (8,9) (9,9) (10,9)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (2,10) (3,10) (4,10) (5,10) (6,10) (7,10) (8,10)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7...", "335\n(1,1) (1,2) (1,3) (1,4) (1,5) (2,5) (3,5) (4,5) (5,5) (6,5)\n(1,1) (1,2) (1,3) (1,4) (2,4) (3,4) (4,4) (5,4) (6,4) (7,4)\n(1,1) (1,2) (1,3) (2,3) (3,3) (4,3) (5,3) (6,3) (7,3) (8,3)\n(1,1) (1,2) (2,2) (3,2) (4,2) (5,2) (6,2) (7,2) (8,2) (9,2)\n(1,1) (2,1) (3,1) (4,1) (5,1) (6,1) (7,1) (8,1) (9,1) (10,1)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (2,8)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (2,7) (3,7)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6)...", "119\n(1,1) (1,2) (1,3) (1,4) (2,4) (3,4) (4,4)\n(1,1) (1,2) (1,3) (2,3) (3,3) (4,3) (5,3)\n(1,1) (1,2) (2,2) (3,2) (4,2) (5,2) (6,2)\n(1,1) (2,1) (3,1) (4,1) (5,1) (6,1) (7,1)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6)\n(1,1) (1,2) (1,3) (1,4) (1,5) (2,5)\n(1,1) (1,2) (1,3) (1,4) (2,4) (3,4)\n(1,1) (1,2) (1,3) (2,3) (3,3) (4,3)\n(1,1) (1,2) (2,2) (3,2) (4,2) (5,2)\n(1,1) (2,1) (3,1) (4,1) (5,1) (6,1)\n(1,1) (1,2) (1,3) (1,4) (1,5)\n(1,1) (1,2) (1,3) (1,4) (2,4)\n(1,1) (1,2) (1,3) (2,3) (3,3)\n(1,1) (1,2) (2,2) (...", "619\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,6) (3,6) (4,6) (5,6) (6,6) (7,6) (8,6)\n(1,1) (1,2) (1,3) (1,4) (1,5) (2,5) (3,5) (4,5) (5,5) (6,5) (7,5) (8,5) (9,5)\n(1,1) (1,2) (1,3) (1,4) (2,4) (3,4) (4,4) (5,4) (6,4) (7,4) (8,4) (9,4) (10,4)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (2,10) (3,10)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (2,9) (3,9) (4,9)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (2,8) (3,8) (4,8) (5,8)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (2,7...", "29820\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (2,10) (3,10) (4,10) (5,10) (6,10) (7,10) (8,10) (9,10) (10,10) (11,10) (12,10) (13,10) (14,10) (15,10) (16,10) (17,10) (18,10) (19,10) (20,10) (21,10) (22,10) (23,10) (24,10) (25,10) (26,10) (27,10) (28,10) (29,10) (30,10) (31,10) (32,10) (33,10) (34,10) (35,10) (36,10)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (2,9) (3,9) (4,9) (5,9) (6,9) (7,9) (8,9) (9,9) (10,9) (11,9) (12,9) (13,9) (14,9) (15,9) (16,9) (17,9) (18,9) (19,9...", "125000\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (1,32) (1,33) (1,34) (1,35) (1,36) (1,37) (1,38) (1,39) (1,40) (1,41) (1,42) (1,43) (1,44) (1,45) (1,46) (1,47) (1,48) (1,49) (1,50) (2,50) (3,50) (4,50) (5,50) (6,50) (7,50) (8,50) (9,50) (10,50) (11,50) (12,50) (13,50) (14,50) (15,50) (16,50) (17,50) (18,50) (19,50) (20,50) (21,50) (22,50) (2...", "1\n(1,1)", "30\n(1,1) (1,2) (1,3) (1,4)\n(1,1) (1,2) (1,3) (2,3)\n(1,1) (1,2) (2,2) (3,2)\n(1,1) (2,1) (3,1) (4,1)\n(1,1) (1,2) (1,3)\n(1,1) (1,2) (2,2)\n(1,1) (2,1) (3,1)\n(1,1) (1,2)\n(1,1) (2,1)\n(1,1)", "945\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (2,9) (3,9) (4,9) (5,9) (6,9)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (2,8) (3,8) (4,8) (5,8) (6,8) (7,8)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (2,7) (3,7) (4,7) (5,7) (6,7) (7,7) (8,7)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,6) (3,6) (4,6) (5,6) (6,6) (7,6) (8,6) (9,6)\n(1,1) (1,2) (1,3) (1,4) (1,5) (2,5) (3,5) (4,5) (5,5) (6,5) (7,5) (8,5) (9,5) (10,5)\n(1,1) (1,2) (1,3) (1,4) (2,4) (3,4) (4,4) (5,4) (6,4) (7,4) (8,4) (9,4) (10,4) (...", "10544\n(1,1) (1,2) (1,3) (1,4) (2,4) (3,4) (4,4) (5,4) (6,4) (7,4) (8,4) (9,4) (10,4) (11,4) (12,4) (13,4) (14,4) (15,4) (16,4) (17,4) (18,4) (19,4) (20,4) (21,4) (22,4) (23,4) (24,4) (25,4) (26,4) (27,4) (28,4) (29,4)\n(1,1) (1,2) (1,3) (2,3) (3,3) (4,3) (5,3) (6,3) (7,3) (8,3) (9,3) (10,3) (11,3) (12,3) (13,3) (14,3) (15,3) (16,3) (17,3) (18,3) (19,3) (20,3) (21,3) (22,3) (23,3) (24,3) (25,3) (26,3) (27,3) (28,3) (29,3) (30,3)\n(1,1) (1,2) (2,2) (3,2) (4,2) (5,2) (6,2) (7,2) (8,2) (9,2) (10,2) (11,2) (12...", "2670\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (2,10) (3,10) (4,10) (5,10) (6,10) (7,10) (8,10) (9,10) (10,10) (11,10)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (2,9) (3,9) (4,9) (5,9) (6,9) (7,9) (8,9) (9,9) (10,9) (11,9) (12,9)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (2,8) (3,8) (4,8) (5,8) (6,8) (7,8) (8,8) (9,8) (10,8) (11,8) (12,8) (13,8)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (2,7) (3,7) (4,7) (5,7) (6,7) (7,7) (8,7) (9,7) (10,7) (11,7) (12,7) (13,7) (14,...", "29820\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (2,10) (3,10) (4,10) (5,10) (6,10) (7,10) (8,10) (9,10) (10,10) (11,10) (12,10) (13,10) (14,10) (15,10) (16,10) (17,10) (18,10) (19,10) (20,10) (21,10) (22,10) (23,10) (24,10) (25,10) (26,10) (27,10) (28,10) (29,10) (30,10) (31,10) (32,10) (33,10) (34,10) (35,10) (36,10)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (2,9) (3,9) (4,9) (5,9) (6,9) (7,9) (8,9) (9,9) (10,9) (11,9) (12,9) (13,9) (14,9) (15,9) (16,9) (17,9) (18,9) (19,9...", "54820\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (1,32) (1,33) (1,34) (1,35) (1,36) (1,37) (1,38) (1,39) (1,40) (2,40) (3,40) (4,40) (5,40) (6,40) (7,40) (8,40) (9,40) (10,40) (11,40) (12,40) (13,40) (14,40) (15,40) (16,40)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,...", "85544\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (1,32) (1,33) (1,34) (1,35) (1,36) (1,37) (1,38) (1,39) (1,40) (1,41) (1,42) (1,43) (1,44) (1,45) (1,46) (2,46) (3,46) (4,46) (5,46) (6,46) (7,46) (8,46) (9,46) (10,46) (11,46) (12,46) (13,46) (14,46) (15,46) (16,46) (17,46) (18,46) (19,46) (20,46) (21,46) (22,46) (23,46)\n(1,1) (1,2) (1,3) (1,4...", "124901\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (1,32) (1,33) (1,34) (1,35) (1,36) (1,37) (1,38) (1,39) (1,40) (1,41) (1,42) (1,43) (1,44) (1,45) (1,46) (1,47) (1,48) (1,49) (1,50) (2,50) (3,50) (4,50) (5,50) (6,50) (7,50) (8,50) (9,50) (10,50) (11,50) (12,50) (13,50) (14,50) (15,50) (16,50) (17,50) (18,50) (19,50) (20,50) (21,50) (22,50) (2...", "396\n(1,1) (2,1) (3,1) (4,1) (5,1) (6,1) (7,1) (8,1) (9,1) (10,1) (11,1)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (2,9)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (2,8) (3,8)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (2,7) (3,7) (4,7)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,6) (3,6) (4,6) (5,6)\n(1,1) (1,2) (1,3) (1,4) (1,5) (2,5) (3,5) (4,5) (5,5) (6,5)\n(1,1) (1,2) (1,3) (1,4) (2,4) (3,4) (4,4) (5,4) (6,4) (7,4)\n(1,1) (1,...", "21945\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (2,21) (3,21) (4,21) (5,21) (6,21) (7,21) (8,21) (9,21) (10,21) (11,21) (12,21) (13,21) (14,21) (15,21) (16,21) (17,21) (18,21) (19,21) (20,21) (21,21) (22,21) (23,21) (24,21) (25,21) (26,21)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (2,20) (3,20) (4,20) (5,20) (6,20) (7,20) ...", "5\n(1,1) (1,2)\n(1,1) (2,1)\n(1,1)", "1\n(1,1)", "1481\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (1,32) (1,33) (1,34) (1,35) (1,36) (1,37) (1,38)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (1,32) (1,33) (1,34) (1,35) (1,36) (1,3...", "1739\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (2,6) (3,6) (4,6) (5,6) (6,6) (7,6) (8,6) (9,6) (10,6) (11,6) (12,6) (13,6)\n(1,1) (1,2) (1,3) (1,4) (1,5) (2,5) (3,5) (4,5) (5,5) (6,5) (7,5) (8,5) (9,5) (10,5) (11,5) (12,5) (13,5) (14,5)\n(1,1) (1,2) (1,3) (1,4) (2,4) (3,4) (4,4) (5,4) (6,4) (7,4) (8,4) (9,4) (10,4) (11,4) (12,4) (13,4) (14,4) (15,4)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (2,15) (3,15)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9...", "40875\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (2,9) (3,9) (4,9) (5,9) (6,9) (7,9) (8,9) (9,9) (10,9) (11,9) (12,9) (13,9) (14,9) (15,9) (16,9) (17,9) (18,9) (19,9) (20,9) (21,9) (22,9) (23,9) (24,9) (25,9) (26,9) (27,9) (28,9) (29,9) (30,9) (31,9) (32,9) (33,9) (34,9) (35,9) (36,9) (37,9) (38,9) (39,9) (40,9) (41,9) (42,9)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (2,8) (3,8) (4,8) (5,8) (6,8) (7,8) (8,8) (9,8) (10,8) (11,8) (12,8) (13,8) (14,8) (15,8) (16,8) (17,8) (18,8) (19,8) (20,...", "113736\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (1,32) (1,33) (1,34) (1,35) (1,36) (1,37) (1,38) (1,39) (1,40) (1,41) (1,42) (1,43) (1,44) (2,44) (3,44) (4,44) (5,44) (6,44) (7,44) (8,44) (9,44) (10,44) (11,44) (12,44) (13,44) (14,44) (15,44) (16,44) (17,44) (18,44) (19,44) (20,44) (21,44) (22,44) (23,44) (24,44) (25,44) (26,44) (27,44) (28,...", "21780\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (1,31) (2,31) (3,31) (4,31) (5,31) (6,31) (7,31) (8,31) (9,31) (10,31)\n(1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9) (1,10) (1,11) (1,12) (1,13) (1,14) (1,15) (1,16) (1,17) (1,18) (1,19) (1,20) (1,21) (1,22) (1,23) (1,24) (1,25) (1,26) (1,27) (1,28) (1,29) (1,30) (2,30) (3,30) (4,30) (5,30) (6..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
b9b279d1b0b471a11dcd0b7afc2c685e	Searching for Graph	Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill: - the graph contains exactly 2n<=+<=p edges; - the graph doesn't contain self-loops and multiple edges; - for any integer k (1<=≤<=k<=≤<=n), any subgraph consisting of k vertices contains at most 2k<=+<=p edges. A subgraph of a graph is some set of the graph vertices and some set of the graph edges. At that, the set of edges must meet the condition: both ends of each edge from the set must belong to the chosen set of vertices. Your task is to find a p-interesting graph consisting of n vertices. The first line contains a single integer t (1<=≤<=t<=≤<=5) — the number of tests in the input. Next t lines each contains two space-separated integers: n, p (5<=≤<=n<=≤<=24; p<=≥<=0; ) — the number of vertices in the graph and the interest value for the appropriate test. It is guaranteed that the required graph exists. For each of the t tests print 2n<=+<=p lines containing the description of the edges of a p-interesting graph: the i-th line must contain two space-separated integers ai,<=bi (1<=≤<=ai,<=bi<=≤<=n; ai<=≠<=bi) — two vertices, connected by an edge in the resulting graph. Consider the graph vertices numbered with integers from 1 to n. Print the answers to the tests in the order the tests occur in the input. If there are multiple solutions, you can print any of them. Sample Input 1 6 0 Sample Output 1 2 1 3 1 4 1 5 1 6 2 3 2 4 2 5 2 6 3 4 3 5 3 6	{"inputs": ["1\n6 0", "1\n5 0", "5\n6 0\n5 0\n7 0\n8 0\n9 0", "5\n6 1\n5 0\n7 1\n8 1\n9 1", "5\n24 0\n23 0\n22 0\n21 0\n24 1", "5\n24 1\n23 1\n22 1\n21 1\n20 1", "5\n20 0\n19 0\n18 0\n17 0\n16 0", "5\n15 0\n14 0\n13 0\n12 0\n11 0", "5\n10 0\n20 0\n24 0\n19 0\n17 0", "5\n24 0\n23 0\n24 1\n23 1\n22 0", "5\n24 0\n24 0\n24 0\n24 0\n24 0", "5\n23 0\n23 0\n23 0\n23 0\n23 0", "5\n19 1\n18 1\n17 1\n16 1\n15 1", "5\n15 1\n14 1\n13 1\n12 1\n11 1", "5\n24 2\n24 1\n24 0\n23 0\n23 1", "5\n24 10\n23 50\n24 228\n24 200\n23 150", "5\n24 228\n24 228\n24 228\n24 228\n24 228", "5\n20 1\n20 0\n19 0\n20 0\n20 0", "5\n21 1\n19 1\n18 1\n20 1\n17 1", "5\n10 1\n11 1\n12 1\n13 1\n14 1", "1\n24 100"], "outputs": ["1 2\n1 3\n1 4\n1 5\n1 6\n2 3\n2 4\n2 5\n2 6\n3 4\n3 5\n3 6", "1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5", "1 2\n1 3\n1 4\n1 5\n1 6\n2 3\n2 4\n2 5\n2 6\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n2 3\n2 4\n2 5\n2 6\n2 7\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n3 4\n3 5\n3 6", "1 2\n1 3\n1 4\n1 5\n1 6\n2 3\n2 4\n2 5\n2 6\n3 4\n3 5\n3 6\n4 5\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n2 3\n2 4\n2 5\n2 6\n2 7\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n3 4\n3 5\n3 6\n3 7", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 1...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n2 3...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n3 4\n3 5\n...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n2 3\n...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n3 4\n3 5\n3 6\n3 7\n3 8\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n4 5\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n4 18\n4 19\n4 20\n4 21\n4 22\n4 23\n4 24\n5 6\n5 7\n5 8\n5 9\n5...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n3 4\n3 5\n3 6\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n3 4\n3 5\n3 6\n3 7\n1 2\n1 3\n1...", "1 2\n1 3\n1 4\n1 5\n1 6\n1 7\n1 8\n1 9\n1 10\n1 11\n1 12\n1 13\n1 14\n1 15\n1 16\n1 17\n1 18\n1 19\n1 20\n1 21\n1 22\n1 23\n1 24\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 9\n2 10\n2 11\n2 12\n2 13\n2 14\n2 15\n2 16\n2 17\n2 18\n2 19\n2 20\n2 21\n2 22\n2 23\n2 24\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n3 10\n3 11\n3 12\n3 13\n3 14\n3 15\n3 16\n3 17\n3 18\n3 19\n3 20\n3 21\n3 22\n3 23\n3 24\n4 5\n4 6\n4 7\n4 8\n4 9\n4 10\n4 11\n4 12\n4 13\n4 14\n4 15\n4 16\n4 17\n4 18\n4 19\n4 20\n4 21\n4 22\n4 23\n4 24\n5 6\n5 7\n5 8\n5 9\n5..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	62	codeforces
b9b2cf2e122e6b22549b44b01e380445	Vasya and Wrestling	Vasya has become interested in wrestling. In wrestling wrestlers use techniques for which they are awarded points by judges. The wrestler who gets the most points wins. When the numbers of points of both wrestlers are equal, the wrestler whose sequence of points is lexicographically greater, wins. If the sequences of the awarded points coincide, the wrestler who performed the last technique wins. Your task is to determine which wrestler won. The first line contains number n — the number of techniques that the wrestlers have used (1<=≤<=n<=≤<=2·105). The following n lines contain integer numbers ai (\|ai\|<=≤<=109, ai<=≠<=0). If ai is positive, that means that the first wrestler performed the technique that was awarded with ai points. And if ai is negative, that means that the second wrestler performed the technique that was awarded with (<=-<=ai) points. The techniques are given in chronological order. If the first wrestler wins, print string "first", otherwise print "second" Sample Input 5 1 2 -3 -4 3 3 -1 -2 3 2 4 -4 Sample Output second first second	{"inputs": ["5\n1\n2\n-3\n-4\n3", "3\n-1\n-2\n3", "2\n4\n-4", "7\n1\n2\n-3\n4\n5\n-6\n7", "14\n1\n2\n3\n4\n5\n6\n7\n-8\n-9\n-10\n-11\n-12\n-13\n-14", "4\n16\n12\n19\n-98", "5\n-6\n-1\n-1\n5\n3", "11\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1", "1\n-534365", "1\n10253033", "3\n-1\n-2\n3", "8\n1\n-2\n-3\n4\n5\n-6\n-7\n8", "2\n1\n-1", "5\n1\n2\n3\n4\n5", "5\n-1\n-2\n-3\n-4\n-5", "10\n-1\n-2\n-3\n-4\n-5\n5\n4\n3\n2\n1", "131\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n1\n-1\n-1\n-1\n2", "6\n-1\n-2\n-3\n1\n2\n3", "3\n1000000000\n1000000000\n1000000000", "12\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000", "4\n1000000000\n1000000000\n1000000000\n-1000000000", "20\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000", "5\n1000000000\n1000000000\n-1000000000\n-1000000000\n-1000000000", "4\n1\n-1000000000\n-1000000000\n-1000000000", "5\n1000000000\n1000000000\n1000000000\n-1000000000\n-1000000000", "4\n-1\n1000000000\n1000000000\n1000000000", "11\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000\n1000000000", "2\n-4\n4", "3\n-12\n3\n9", "3\n9\n1\n-10", "3\n1\n2\n-3", "4\n55\n5\n-5\n-55", "4\n5\n-1\n1\n-5", "2\n-5\n6", "4\n5\n-4\n3\n-40", "4\n1000000000\n1000000000\n1000000000\n-5", "6\n3\n2\n1\n-3\n-1\n-2", "5\n4\n1\n1\n-3\n-3", "5\n208\n-52\n-52\n-52\n-52", "3\n-100\n-200\n300", "3\n400\n-200\n-200", "3\n208\n-207\n-1", "3\n98888887\n98888888\n-197777775"], "outputs": ["second", "first", "second", "first", "second", "second", "second", "first", "second", "first", "first", "second", "second", "first", "second", "first", "first", "first", "first", "first", "first", "first", "second", "second", "first", "first", "first", "first", "second", "second", "second", "first", "first", "first", "second", "first", "first", "first", "first", "first", "first", "first", "second"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	157	codeforces
b9b4e52303af6ee09e25948b343ce56f	Where Are My Flakes?	One morning the Cereal Guy found out that all his cereal flakes were gone. He found a note instead of them. It turned out that his smart roommate hid the flakes in one of n boxes. The boxes stand in one row, they are numbered from 1 to n from the left to the right. The roommate left hints like "Hidden to the left of the i-th box" ("To the left of i"), "Hidden to the right of the i-th box" ("To the right of i"). Such hints mean that there are no flakes in the i-th box as well. The Cereal Guy wants to know the minimal number of boxes he necessarily needs to check to find the flakes considering all the hints. Or he wants to find out that the hints are contradictory and the roommate lied to him, that is, no box has the flakes. The first line contains two integers n and m (1<=≤<=n<=≤<=1000,<=0<=≤<=m<=≤<=1000) which represent the number of boxes and the number of hints correspondingly. Next m lines contain hints like "To the left of i" and "To the right of i", where i is integer (1<=≤<=i<=≤<=n). The hints may coincide. The answer should contain exactly one integer — the number of boxes that should necessarily be checked or "-1" if the hints are contradictory. Sample Input 2 1 To the left of 2 3 2 To the right of 1 To the right of 2 3 1 To the left of 3 3 2 To the left of 2 To the right of 1 Sample Output 1 1 2 -1	{"inputs": ["2 1\nTo the left of 2", "3 2\nTo the right of 1\nTo the right of 2", "3 1\nTo the left of 3", "3 2\nTo the left of 2\nTo the right of 1", "3 0", "2 2\nTo the left of 2\nTo the left of 2", "5 0", "6 2\nTo the right of 2\nTo the left of 4", "8 6\nTo the right of 3\nTo the left of 4\nTo the left of 4\nTo the right of 1\nTo the right of 5\nTo the left of 6", "459 16\nTo the right of 9\nTo the right of 148\nTo the left of 406\nTo the left of 335\nTo the right of 240\nTo the left of 409\nTo the left of 365\nTo the left of 426\nTo the left of 416\nTo the right of 247\nTo the left of 284\nTo the right of 187\nTo the right of 134\nTo the right of 128\nTo the right of 98\nTo the left of 412", "1000 1\nTo the right of 117", "1000 0", "1 0", "2 0", "1 1\nTo the right of 1", "1 1\nTo the left of 1", "2 1\nTo the right of 2"], "outputs": ["1", "1", "2", "-1", "3", "1", "5", "1", "-1", "36", "883", "1000", "1", "2", "-1", "-1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	46	codeforces
b9ce4117c8187dc8b1c2b57344133486	Case of Fake Numbers	Andrewid the Android is a galaxy-famous detective. He is now investigating a case of frauds who make fake copies of the famous Stolp's gears, puzzles that are as famous as the Rubik's cube once was. Its most important components are a button and a line of n similar gears. Each gear has n teeth containing all numbers from 0 to n<=-<=1 in the counter-clockwise order. When you push a button, the first gear rotates clockwise, then the second gear rotates counter-clockwise, the the third gear rotates clockwise an so on. Besides, each gear has exactly one active tooth. When a gear turns, a new active tooth is the one following after the current active tooth according to the direction of the rotation. For example, if n<==<=5, and the active tooth is the one containing number 0, then clockwise rotation makes the tooth with number 1 active, or the counter-clockwise rotating makes the tooth number 4 active. Andrewid remembers that the real puzzle has the following property: you can push the button multiple times in such a way that in the end the numbers on the active teeth of the gears from first to last form sequence 0,<=1,<=2,<=...,<=n<=-<=1. Write a program that determines whether the given puzzle is real or fake. The first line contains integer n (1<=≤<=n<=≤<=1000) — the number of gears. The second line contains n digits a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=n<=-<=1) — the sequence of active teeth: the active tooth of the i-th gear contains number ai. In a single line print "Yes" (without the quotes), if the given Stolp's gears puzzle is real, and "No" (without the quotes) otherwise. Sample Input 3 1 0 0 5 4 2 1 4 3 4 0 2 3 1 Sample Output Yes Yes No	{"inputs": ["3\n1 0 0", "5\n4 2 1 4 3", "4\n0 2 3 1", "1\n0", "2\n1 0", "5\n2 4 4 1 1", "10\n0 1 2 3 4 5 6 7 8 9", "10\n1 5 1 0 6 1 3 5 9 9", "20\n10 11 12 13 14 15 16 17 18 19 0 1 2 3 4 5 6 7 8 9", "20\n2 15 18 0 3 12 4 16 13 7 17 9 8 2 15 18 19 17 5 8", "50\n38 13 40 15 42 17 44 19 46 21 48 23 0 25 2 27 4 29 6 31 8 33 10 35 12 37 14 39 16 41 18 43 20 45 22 47 24 49 26 1 28 3 30 5 32 7 34 9 36 11", "50\n12 16 9 0 18 36 5 42 28 1 4 43 38 35 14 37 39 13 23 15 37 45 31 38 20 13 18 38 1 13 5 24 35 11 0 44 16 42 8 10 27 3 1 33 33 29 29 33 49 48", "100\n15 86 17 88 19 90 21 92 23 94 25 96 27 98 29 0 31 2 33 4 35 6 37 8 39 10 41 12 43 14 45 16 47 18 49 20 51 22 53 24 55 26 57 28 59 30 61 32 63 34 65 36 67 38 69 40 71 42 73 44 75 46 77 48 79 50 81 52 83 54 85 56 87 58 89 60 91 62 93 64 95 66 97 68 99 70 1 72 3 74 5 76 7 78 9 80 11 82 13 84", "15\n2 14 4 1 6 3 8 5 10 7 12 9 14 11 1", "30\n19 12 21 14 23 16 25 18 27 20 29 22 1 24 3 26 5 28 7 0 9 2 11 4 13 6 15 8 17 10", "50\n27 24 29 26 31 28 33 30 35 32 37 34 39 36 41 38 43 40 45 42 47 44 49 46 1 48 3 0 5 2 7 4 9 6 11 8 13 10 15 12 17 14 19 16 21 18 23 20 25 22", "50\n23 19 25 45 22 37 49 22 36 16 30 19 21 4 46 28 39 19 24 12 22 36 41 46 34 40 11 46 29 10 6 21 30 29 6 5 49 45 13 39 34 17 44 45 28 34 7 43 15 25", "100\n95 6 97 8 99 10 1 12 3 14 5 16 7 18 9 20 11 22 13 24 15 26 17 28 19 30 21 32 23 34 25 36 27 38 29 40 31 42 33 44 35 46 37 48 39 50 41 52 43 54 45 56 47 58 49 60 51 62 53 64 55 66 57 68 59 70 61 72 63 74 65 76 67 78 69 80 71 82 73 84 75 86 77 88 79 90 81 92 83 94 85 96 87 98 89 0 91 2 93 4", "100\n20 45 10 74 41 81 78 74 91 17 21 65 89 63 7 44 97 3 1 89 87 44 32 10 44 73 73 88 62 77 96 59 4 8 55 1 82 52 63 11 59 53 9 47 29 73 38 44 36 24 72 61 24 11 38 6 91 4 0 65 37 58 20 56 70 87 54 42 79 45 46 73 7 85 43 76 69 35 72 79 38 6 8 0 49 39 32 24 28 54 8 43 98 65 50 20 22 23 2 85", "100\n79 74 22 11 73 70 33 50 9 81 17 14 23 44 4 90 20 22 19 94 66 80 70 42 22 82 49 42 36 7 90 91 80 33 26 52 6 77 30 94 99 6 46 84 96 40 89 2 88 65 80 93 5 60 25 15 32 26 68 85 62 74 69 55 84 0 85 91 23 43 84 94 25 65 28 92 16 0 7 83 48 74 15 20 5 97 34 42 99 97 18 39 21 23 95 77 42 17 32 94", "100\n74 27 76 29 78 31 80 33 82 35 84 37 86 39 88 41 90 43 92 45 94 47 96 49 98 51 0 53 2 55 4 57 6 59 8 61 10 63 12 65 14 67 16 69 18 71 20 73 22 75 24 77 26 79 28 81 30 83 32 85 34 87 36 89 38 91 40 93 42 95 44 97 46 99 48 1 50 3 52 5 54 7 56 9 58 11 60 13 62 15 64 17 66 19 68 21 70 23 72 25", "2\n0 0", "2\n0 1", "2\n1 0", "2\n1 1", "3\n0 1 1", "3\n0 2 2", "4\n0 1 2 2", "3\n1 1 0"], "outputs": ["Yes", "Yes", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "Yes", "No", "Yes", "Yes", "Yes", "Yes", "No", "Yes", "No", "No", "Yes", "No", "Yes", "Yes", "No", "No", "No", "No", "No"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	18	codeforces
b9e45bc4775a8d7761b45f8ab27508bc	Прокат велосипедов	Как известно, в теплую погоду многие жители крупных городов пользуются сервисами городского велопроката. Вот и Аркадий сегодня будет добираться от школы до дома, используя городские велосипеды. Школа и дом находятся на одной прямой улице, кроме того, на той же улице есть n точек, где можно взять велосипед в прокат или сдать его. Первый велопрокат находится в точке x1 километров вдоль улицы, второй — в точке x2 и так далее, n-й велопрокат находится в точке xn. Школа Аркадия находится в точке x1 (то есть там же, где и первый велопрокат), а дом — в точке xn (то есть там же, где и n-й велопрокат). Известно, что xi<=<<=xi<=+<=1 для всех 1<=≤<=i<=<<=n. Согласно правилам пользования велопроката, Аркадий может брать велосипед в прокат только на ограниченное время, после этого он должен обязательно вернуть его в одной из точек велопроката, однако, он тут же может взять новый велосипед, и отсчет времени пойдет заново. Аркадий может брать не более одного велосипеда в прокат одновременно. Если Аркадий решает взять велосипед в какой-то точке проката, то он сдаёт тот велосипед, на котором он до него доехал, берёт ровно один новый велосипед и продолжает на нём своё движение. За отведенное время, независимо от выбранного велосипеда, Аркадий успевает проехать не больше k километров вдоль улицы. Определите, сможет ли Аркадий доехать на велосипедах от школы до дома, и если да, то какое минимальное число раз ему необходимо будет взять велосипед в прокат, включая первый велосипед? Учтите, что Аркадий не намерен сегодня ходить пешком. В первой строке следуют два целых числа n и k (2<=≤<=n<=≤<=1<=000, 1<=≤<=k<=≤<=100<=000) — количество велопрокатов и максимальное расстояние, которое Аркадий может проехать на одном велосипеде. В следующей строке следует последовательность целых чисел x1,<=x2,<=...,<=xn (0<=≤<=x1<=<<=x2<=<<=...<=<<=xn<=≤<=100<=000) — координаты точек, в которых находятся велопрокаты. Гарантируется, что координаты велопрокатов заданы в порядке возрастания. Если Аркадий не сможет добраться от школы до дома только на велосипедах, выведите -1. В противном случае, выведите минимальное количество велосипедов, которые Аркадию нужно взять в точках проката. Sample Input 4 4 3 6 8 10 2 9 10 20 12 3 4 6 7 9 10 11 13 15 17 18 20 21 Sample Output 2 -1 6	{"inputs": ["4 4\n3 6 8 10", "2 9\n10 20", "12 3\n4 6 7 9 10 11 13 15 17 18 20 21", "2 1\n11164 11165", "3 7\n45823 45825 45829", "2 100000\n0 100000", "50 15001\n1269 1580 5431 5916 6642 14145 15760 19922 20589 22062 24138 33454 33505 35916 37012 42577 43140 49457 54720 55188 56205 56639 56870 57997 58379 59088 59297 61805 61861 63005 64013 68848 71182 71497 72715 73008 75616 76042 76614 80690 83089 85033 86408 92392 92763 93833 95085 95815 97152 99379", "5 7\n6219 6222 6229 6231 6236", "10 448\n78449 78573 78599 78742 78748 78759 78853 79091 79298 79324", "20 19191\n11272 12386 14108 24663 24932 26547 29656 44677 45436 45654 48562 62367 71049 71238 78182 84042 88736 92026 96836 99343", "2 100000\n1 100000", "2 99999\n0 100000", "2 2\n1 3", "2 2\n1 2", "2 2\n1 4", "10 1\n1 2 3 4 5 6 7 8 9 10"], "outputs": ["2", "-1", "6", "1", "1", "1", "8", "3", "3", "6", "1", "-1", "1", "1", "-1", "9"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	103	codeforces
b9ea26d8fd625c2e46bc6f4fbe356598	George and Round	George decided to prepare a Codesecrof round, so he has prepared m problems for the round. Let's number the problems with integers 1 through m. George estimates the i-th problem's complexity by integer bi. To make the round good, he needs to put at least n problems there. Besides, he needs to have at least one problem with complexity exactly a1, at least one with complexity exactly a2, ..., and at least one with complexity exactly an. Of course, the round can also have problems with other complexities. George has a poor imagination. It's easier for him to make some already prepared problem simpler than to come up with a new one and prepare it. George is magnificent at simplifying problems. He can simplify any already prepared problem with complexity c to any positive integer complexity d (c<=≥<=d), by changing limits on the input data. However, nothing is so simple. George understood that even if he simplifies some problems, he can run out of problems for a good round. That's why he decided to find out the minimum number of problems he needs to come up with in addition to the m he's prepared in order to make a good round. Note that George can come up with a new problem of any complexity. The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=3000) — the minimal number of problems in a good round and the number of problems George's prepared. The second line contains space-separated integers a1,<=a2,<=...,<=an (1<=≤<=a1<=<<=a2<=<<=...<=<<=an<=≤<=106) — the requirements for the complexity of the problems in a good round. The third line contains space-separated integers b1,<=b2,<=...,<=bm (1<=≤<=b1<=≤<=b2...<=≤<=bm<=≤<=106) — the complexities of the problems prepared by George. Print a single integer — the answer to the problem. Sample Input 3 5 1 2 3 1 2 2 3 3 3 5 1 2 3 1 1 1 1 1 3 1 2 3 4 1 Sample Output 0 2 3	{"inputs": ["3 5\n1 2 3\n1 2 2 3 3", "3 5\n1 2 3\n1 1 1 1 1", "3 1\n2 3 4\n1", "29 100\n20 32 41 67 72 155 331 382 399 412 465 470 484 511 515 529 616 637 679 715 733 763 826 843 862 903 925 979 989\n15 15 15 17 18 19 19 20 21 21 22 24 25 26 26 27 28 31 32 32 37 38 38 39 39 40 41 42 43 43 45 45 46 47 49 49 50 50 50 51 52 53 53 55 56 57 59 59 59 60 60 62 62 63 63 64 64 64 66 67 69 69 70 70 72 72 73 74 75 76 77 78 80 80 81 81 83 83 83 84 86 86 86 86 87 88 89 91 91 91 92 93 94 94 96 97 97 97 98 98"], "outputs": ["0", "2", "3", "24"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	225	codeforces
b9ec62d47e98670266215b759dd020f0	Sagheer and Nubian Market	On his trip to Luxor and Aswan, Sagheer went to a Nubian market to buy some souvenirs for his friends and relatives. The market has some strange rules. It contains n different items numbered from 1 to n. The i-th item has base cost ai Egyptian pounds. If Sagheer buys k items with indices x1,<=x2,<=...,<=xk, then the cost of item xj is axj<=+<=xj·k for 1<=≤<=j<=≤<=k. In other words, the cost of an item is equal to its base cost in addition to its index multiplied by the factor k. Sagheer wants to buy as many souvenirs as possible without paying more than S Egyptian pounds. Note that he cannot buy a souvenir more than once. If there are many ways to maximize the number of souvenirs, he will choose the way that will minimize the total cost. Can you help him with this task? The first line contains two integers n and S (1<=≤<=n<=≤<=105 and 1<=≤<=S<=≤<=109) — the number of souvenirs in the market and Sagheer's budget. The second line contains n space-separated integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=105) — the base costs of the souvenirs. On a single line, print two integers k, T — the maximum number of souvenirs Sagheer can buy and the minimum total cost to buy these k souvenirs. Sample Input 3 11 2 3 5 4 100 1 2 5 6 1 7 7 Sample Output 2 11 4 54 0 0	{"inputs": ["3 11\n2 3 5", "4 100\n1 2 5 6", "1 7\n7", "1 7\n5", "1 1\n1", "4 33\n4 3 2 1", "86 96\n89 48 14 55 5 35 7 79 49 70 74 18 64 63 35 93 63 97 90 77 33 11 100 75 60 99 54 38 3 6 55 1 7 64 56 90 21 76 35 16 61 78 38 78 93 21 89 1 58 53 34 77 56 37 46 59 30 5 85 1 52 87 84 99 97 9 15 66 29 60 17 16 59 23 88 93 32 2 98 89 63 42 9 86 70 80", "9 2727\n73 41 68 90 51 7 20 48 69", "35 792600\n61 11 82 29 3 50 65 60 62 86 83 78 15 82 7 77 38 87 100 12 93 86 96 79 14 58 60 47 94 39 36 23 69 93 18", "63 47677090\n53 4 59 68 6 12 47 63 28 93 9 53 61 63 53 70 77 63 49 76 70 23 4 40 4 34 24 70 42 83 84 95 11 46 38 83 26 85 34 29 67 96 3 62 97 7 42 65 49 45 50 54 81 74 83 59 10 87 95 87 89 27 3", "88 631662736\n93 75 25 7 6 55 92 23 22 32 4 48 61 29 91 79 16 18 18 9 66 9 57 62 3 81 48 16 21 90 93 58 30 8 31 47 44 70 34 85 52 71 58 42 99 53 43 54 96 26 6 13 38 4 13 60 1 48 32 100 52 8 27 99 66 34 98 45 19 50 37 59 31 56 58 70 61 14 100 66 74 85 64 57 92 89 7 92", "12 12\n1232 1848 2048 4694 5121 3735 9968 4687 2040 6033 5839 2507", "37 5271\n368 6194 4856 8534 944 4953 2085 5350 788 7772 9786 1321 4310 4453 7078 9912 5799 4066 5471 5079 5161 9773 1300 5474 1202 1353 9499 9694 9020 6332 595 7619 1271 7430 1199 3127 8867", "65 958484\n9597 1867 5346 637 6115 5833 3318 6059 4430 9169 8155 7895 3534 7962 9900 9495 5694 3461 5370 1945 1724 9264 3475 618 3421 551 8359 6889 1843 6716 9216 2356 1592 6265 2945 6496 4947 2840 9057 6141 887 4823 4004 8027 1993 1391 796 7059 5500 4369 4012 4983 6495 8990 3633 5439 421 1129 6970 8796 7826 1200 8741 6555 5037", "90 61394040\n2480 6212 4506 829 8191 797 5336 6722 3178 1007 5849 3061 3588 6684 5983 5452 7654 5321 660 2569 2809 2179 679 4858 6887 2580 6880 6120 4159 5542 4999 8703 2386 8221 7046 1229 1662 4542 7089 3548 4298 1973 1854 2473 5507 241 359 5248 7907 5201 9624 4596 1723 2622 4800 4716 693 961 7402 9004 7994 8048 6590 5866 7502 3304 4331 5218 6906 1016 5342 6644 2205 5823 8525 4839 1914 2651 3940 7751 3489 4178 7234 6640 7602 9765 8559 7819 5827 163", "14 891190480\n1424 3077 9632 6506 4568 9650 5534 1085 6934 9340 2867 367 7075 618", "39 43\n22166 81842 15513 80979 39645 60168 96994 13493 12904 79871 49910 45356 93691 51829 18226 34288 11525 41944 40433 67295 30123 1081 55623 22279 75814 82316 2963 39329 38223 8445 43202 61912 15122 86367 37200 68113 57194 38541 49641", "67 8824\n75515 67590 86373 34191 3446 27408 31581 24727 40005 23718 39738 30960 4786 51040 32590 80454 14335 47173 20079 41204 67289 58347 88969 88396 37681 43963 13886 85690 12259 14732 42036 62620 15011 41890 20150 59469 62104 30136 47163 19790 25699 27453 36151 52914 52684 20503 78622 81082 94500 55756 94030 54764 72763 37830 13210 64559 53600 87998 80472 19001 83769 79700 88794 10161 99980 95184 74439", "16 56532535\n84567 85265 99012 62115 58908 10120 27355 90226 17191 35588 43807 6327 89157 71156 16253 22387", "42 818723640\n57019 99450 43192 25131 80678 41786 52490 34454 51620 56132 41773 94622 23949 11597 96944 51420 44164 85727 72959 26622 1838 36302 99335 35572 92734 10651 22293 97601 38634 24066 81870 10904 5825 71968 2377 61198 3104 4191 97851 99920 65295 1385"], "outputs": ["2 11", "4 54", "0 0", "1 6", "0 0", "3 27", "3 71", "9 872", "35 24043", "63 130272", "88 348883", "0 0", "5 4252", "65 468998", "90 795634", "14 70147", "0 0", "2 8268", "16 821610", "42 2094569"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	135	codeforces
b9ffc730bfcf1d8951e5290a7cc2ca24	Divisibility by 25	You are given an integer $n$ from $1$ to $10^{18}$ without leading zeroes. In one move you can swap any two adjacent digits in the given number in such a way that the resulting number will not contain leading zeroes. In other words, after each move the number you have cannot contain any leading zeroes. What is the minimum number of moves you have to make to obtain a number that is divisible by $25$? Print -1 if it is impossible to obtain a number that is divisible by $25$. The first line contains an integer $n$ ($1 \le n \le 10^{18}$). It is guaranteed that the first (left) digit of the number $n$ is not a zero. If it is impossible to obtain a number that is divisible by $25$, print -1. Otherwise print the minimum number of moves required to obtain such number. Note that you can swap only adjacent digits in the given number. Sample Input 5071 705 1241367 Sample Output 4 1 -1	{"inputs": ["5071", "705", "1241367", "7501", "507", "17010", "52231", "50267", "574196831896431419", "1", "10", "123456123450", "1000000000000000000", "100000000000762582", "123456789987654321", "213716413141380147", "5284691", "750000000000000001", "101", "275257725752725722", "50932", "50272", "25", "52", "57", "75", "50", "71", "500111117", "50011117", "1002", "521", "50011111112", "50000111111112", "250070000011111111", "502727272727272727", "500044444444442", "2057", "700777111111222222", "50001111312", "700272727272727272", "700777711111222222", "20029292929292929", "257025702570257025", "5001111117", "227782777298772774", "205727272727272727", "50011112", "500272727272727272", "222772277289624486", "5002727272727272", "200000000222222222"], "outputs": ["4", "1", "-1", "2", "2", "1", "6", "5", "33", "-1", "-1", "0", "0", "2", "5", "-1", "11", "2", "-1", "3", "5", "5", "0", "1", "1", "0", "0", "-1", "10", "9", "2", "3", "12", "17", "16", "18", "17", "1", "30", "13", "30", "30", "28", "0", "11", "-1", "15", "9", "19", "-1", "17", "18"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
ba27c1ae25a9c6f3a632edc8ad96ab06	none	Santa Claus has Robot which lives on the infinite grid and can move along its lines. He can also, having a sequence of m points p1,<=p2,<=...,<=pm with integer coordinates, do the following: denote its initial location by p0. First, the robot will move from p0 to p1 along one of the shortest paths between them (please notice that since the robot moves only along the grid lines, there can be several shortest paths). Then, after it reaches p1, it'll move to p2, again, choosing one of the shortest ways, then to p3, and so on, until he has visited all points in the given order. Some of the points in the sequence may coincide, in that case Robot will visit that point several times according to the sequence order. While Santa was away, someone gave a sequence of points to Robot. This sequence is now lost, but Robot saved the protocol of its unit movements. Please, find the minimum possible length of the sequence. The first line of input contains the only positive integer n (1<=≤<=n<=≤<=2·105) which equals the number of unit segments the robot traveled. The second line contains the movements protocol, which consists of n letters, each being equal either L, or R, or U, or D. k-th letter stands for the direction which Robot traveled the k-th unit segment in: L means that it moved to the left, R — to the right, U — to the top and D — to the bottom. Have a look at the illustrations for better explanation. The only line of input should contain the minimum possible length of the sequence. Sample Input 4 RURD 6 RRULDD 26 RRRULURURUULULLLDLDDRDRDLD 3 RLL 4 LRLR Sample Output 2 2 7 2 4	{"inputs": ["4\nRURD", "6\nRRULDD", "26\nRRRULURURUULULLLDLDDRDRDLD", "3\nRLL", "4\nLRLR", "5\nLRDLR", "10\nDDRDUULUDD", "1\nD"], "outputs": ["2", "2", "7", "2", "4", "4", "3", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	107	codeforces
ba4d78b29a18d60849c1647760ddd911	Arpa and a game with Mojtaba	Mojtaba and Arpa are playing a game. They have a list of n numbers in the game. In a player's turn, he chooses a number pk (where p is a prime number and k is a positive integer) such that pk divides at least one number in the list. For each number in the list divisible by pk, call it x, the player will delete x and add to the list. The player who can not make a valid choice of p and k loses. Mojtaba starts the game and the players alternatively make moves. Determine which one of players will be the winner if both players play optimally. The first line contains a single integer n (1<=≤<=n<=≤<=100) — the number of elements in the list. The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the elements of the list. If Mojtaba wins, print "Mojtaba", otherwise print "Arpa" (without quotes). You can print each letter in any case (upper or lower). Sample Input 4 1 1 1 1 4 1 1 17 17 4 1 1 17 289 5 1 2 3 4 5 Sample Output Arpa Mojtaba Arpa Arpa	{"inputs": ["4\n1 1 1 1", "4\n1 1 17 17", "4\n1 1 17 289", "5\n1 2 3 4 5", "10\n10 14 16 9 17 13 12 4 6 10", "10\n13 13 18 3 8 9 19 12 20 14", "10\n10 18 16 10 8 20 8 4 4 2", "10\n1 4 15 1 16 14 7 17 11 8", "10\n9 19 4 1 20 7 19 18 11 11", "100\n80 35 113 179 195 92 143 152 125 55 68 121 71 147 172 153 87 68 143 133 32 153 177 173 183 100 59 55 63 189 63 44 78 15 143 105 62 98 22 8 197 119 77 108 85 79 56 160 149 157 39 129 70 79 118 15 110 17 157 81 184 1 160 126 35 108 15 28 63 128 24 132 179 160 104 164 49 76 30 148 144 38 112 10 65 109 68 142 35 174 89 118 24 46 171 35 53 169 154 18", "100\n62 159 35 165 55 25 182 120 76 176 86 188 122 23 12 142 44 156 173 105 95 83 87 128 166 163 144 157 30 198 31 13 99 197 57 114 34 42 173 15 197 61 160 8 138 104 43 199 52 19 56 40 65 152 64 166 106 88 192 107 6 156 46 36 87 92 65 123 43 124 199 140 164 114 157 64 177 2 115 141 179 194 125 67 160 62 83 32 44 101 193 166 99 162 192 120 112 28 51 56", "100\n10 30 91 164 105 103 4 116 77 36 118 158 136 161 28 35 119 148 16 47 116 18 13 124 103 96 132 119 160 147 128 98 143 96 130 129 133 45 37 133 192 22 35 4 75 89 110 54 147 2 64 66 123 136 12 183 161 118 50 131 39 147 143 16 43 146 98 42 191 155 96 18 169 176 170 102 172 9 130 62 22 32 121 153 24 150 100 102 1 52 2 76 147 139 72 10 21 37 157 23", "100\n199 89 78 3 1 171 187 132 20 81 88 51 7 175 181 92 75 196 71 17 200 27 117 112 182 51 43 64 189 136 130 24 125 87 38 185 198 6 175 63 178 65 33 91 22 6 180 100 21 11 164 1 101 26 1 97 71 76 65 163 3 27 81 110 114 38 160 42 90 65 189 181 198 66 3 152 83 125 84 72 181 193 75 197 184 161 192 181 38 172 88 106 112 6 67 120 85 181 148 88", "100\n44 188 149 152 200 131 152 1 15 101 15 64 51 48 5 189 65 105 90 143 60 54 82 149 66 89 191 182 46 92 51 19 77 88 175 192 89 4 135 126 89 68 116 92 159 71 160 97 200 89 109 100 120 95 183 85 187 125 93 65 101 51 172 65 195 4 108 123 152 30 9 88 33 124 91 28 49 79 78 2 30 169 115 198 130 16 165 120 163 121 45 31 107 83 47 164 200 112 83 59", "21\n128 32 131072 16 64 536870912 4 524288 33554432 16384 8 256 1048576 2048 2 32768 268435456 1 16777216 8388608 134217728", "13\n134217728 32768 536870912 524288 16777216 16384 1048576 33554432 8388608 268435456 512 131072 2048", "29\n2 2097152 67108864 262144 1 16384 4096 4 65536 256 1024 8388608 16 4194304 134217728 64 512 33554432 8 128 268435456 524288 32 2048 32768 8192 131072 16777216 1048576", "6\n9 5 1 1 8 1", "26\n1 48828125 81 59049 256 16 9 3 6561 2048 512 128 1024 2 25 3125 390625 177147 1 19683 64 32 1 4 15625 9765625", "15\n2048 5 1 19683 9765625 3125 177147 125 2187 48828125 6561 512 1 1 390625", "1\n984711052", "1\n270983380", "1\n887864471", "1\n234923095", "1\n877739788", "1\n534306180", "1\n365210472", "1\n616751420", "19\n1 2048 1048576 524288 16 128 32 2 16384 131072 32768 4 33554432 134217728 268435456 8 8388608 536870912 16777216", "59\n1953125 14348907 823543 11 64 1048576 9765625 16777216 19487171 2187 5 117649 40353607 48828125 531441 5764801 729 49 32768 371293 43046721 1771561 1 25 13 4826809 1 6561 2197 536870912 62748517 524288 4782969 128 59049 177147 16384 1 27 19683 9 1594323 1331 33554432 129140163 1 2048 268435456 1 8388608 625 131072 343 3 2401 1 390625 134217728 4", "53\n131072 64 1594323 49 25 129140163 4 729 1771561 1 1331 33554432 531441 128 4782969 16777216 2187 32768 19487171 48828125 134217728 59049 16384 6561 1048576 1 3 9 177147 9765625 1 390625 11 27 1953125 5 19683 2401 2048 117649 524288 343 40353607 1 43046721 8388608 5764801 14348907 625 823543 268435456 1 536870912", "55\n1 161051 121 14641 4782969 177147 5 1771561 1594323 1953125 524288 5764801 9765625 49 1 390625 823543 128 2187 268435456 8388608 117649 1048576 59049 43046721 2048 16777216 2401 536870912 4 19487171 9 40353607 14348907 33554432 131072 3 16384 27 134217728 1 64 32768 1 531441 48828125 19683 625 343 1331 25 129140163 729 6561 1", "34\n1 64 390625 33554432 9 1 524288 387420489 536870912 8388608 2048 244140625 129140163 59049 4 16384 9765625 43046721 131072 2187 48828125 1 25 16777216 1048576 268435456 19683 32768 4782969 81 5 128 3 134217728", "44\n390625 16807 7 1 131072 536870912 43046721 125 2187 134217728 32768 19487171 16384 2401 5 16777216 524288 343 1048576 9765625 244140625 33554432 81 4782969 59049 1331 129140163 387420489 282475249 1 48828125 2048 1 1 25 11 40353607 3 268435456 19683 214358881 9 1 8388608", "51\n33554432 268435456 25 9765625 1 536870912 5 8 1 27 32768 121 19683 40353607 1 128 4782969 1 4 3 8388608 161051 2187 282475249 1048576 2 3125 16807 387420489 1771561 11 625 16 43046721 214358881 16384 16777216 59049 32 343 134217728 390625 2048 1 9 524288 244140625 131072 7 48828125 129140163", "55\n5 1 161051 343 134217728 4782969 131072 815730721 1 16384 40353607 2187 3 16807 16 2197 8388608 59049 282475249 244140625 1 7 387420489 390625 9 268435456 1 214358881 1771561 121 524288 27 11 48828125 33554432 32768 169 25 625 8 16777216 9765625 128 129140163 43046721 2048 536870912 2 3125 19683 1048576 4 1 1 32", "52\n169 8388608 48828125 32768 387420489 1 214358881 815730721 8 4782969 16384 27 390625 1 268435456 2187 40353607 59049 15625 282475249 536870912 125 2197 1 121 134217728 19683 1 32 1 625 3 244140625 2 524288 131072 25 9765625 43046721 7 1771561 16777216 1048576 9 16807 343 161051 11 2048 33554432 1 129140163", "63\n16807 1 1419857 59049 1 2187 6859 1 33554432 129140163 11 1 16777216 3 9765625 1331 2197 268435456 2 169 390625 343 1048576 536870912 19683 125 16384 27 40353607 815730721 32 130321 43046721 524288 17 8388608 7 4782969 15625 282475249 134217728 1 25 4913 9 19 131072 244140625 625 2476099 1 2048 214358881 32768 1 24137569 48828125 387420489 8 19487171 361 1 47045881", "38\n524288 27 131072 256 64 15625 729 2048 1048576 387420489 4782969 1 33554432 625 16777216 32768 4 243 9 1 9765625 390625 1 19683 8388608 16384 59049 8 48828125 536870912 244140625 134217728 2 5 129140163 25 43046721 268435456", "56\n49 24137569 1048576 16384 4782969 2 4913 1 59049 16777216 625 121 1 19683 19487171 524288 43046721 1419857 125 13 282475249 15625 1 1 1 131072 2476099 9765625 2197 390625 19 6859 268435456 536870912 243 32768 40353607 8 2401 1024 1 17 2187 129140163 47045881 25 387420489 1 244140625 33554432 214358881 815730721 8388608 48828125 134217728 1"], "outputs": ["Arpa", "Mojtaba", "Arpa", "Arpa", "Mojtaba", "Mojtaba", "Mojtaba", "Arpa", "Mojtaba", "Mojtaba", "Mojtaba", "Mojtaba", "Mojtaba", "Mojtaba", "Mojtaba", "Mojtaba", "Mojtaba", "Arpa", "Arpa", "Arpa", "Mojtaba", "Mojtaba", "Mojtaba", "Arpa", "Mojtaba", "Mojtaba", "Mojtaba", "Mojtaba", "Arpa", "Arpa", "Arpa", "Mojtaba", "Arpa", "Mojtaba", "Arpa", "Arpa", "Arpa", "Arpa", "Arpa", "Arpa"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
ba5f27a8af10e0175f956f2fcf748134	Grandma Laura and Apples	Grandma Laura came to the market to sell some apples. During the day she sold all the apples she had. But grandma is old, so she forgot how many apples she had brought to the market. She precisely remembers she had n buyers and each of them bought exactly half of the apples she had at the moment of the purchase and also she gave a half of an apple to some of them as a gift (if the number of apples at the moment of purchase was odd), until she sold all the apples she had. So each buyer took some integral positive number of apples, but maybe he didn't pay for a half of an apple (if the number of apples at the moment of the purchase was odd). For each buyer grandma remembers if she gave a half of an apple as a gift or not. The cost of an apple is p (the number p is even). Print the total money grandma should have at the end of the day to check if some buyers cheated her. The first line contains two integers n and p (1<=≤<=n<=≤<=40,<=2<=≤<=p<=≤<=1000) — the number of the buyers and the cost of one apple. It is guaranteed that the number p is even. The next n lines contains the description of buyers. Each buyer is described with the string half if he simply bought half of the apples and with the string halfplus if grandma also gave him a half of an apple as a gift. It is guaranteed that grandma has at least one apple at the start of the day and she has no apples at the end of the day. Print the only integer a — the total money grandma should have at the end of the day. Note that the answer can be too large, so you should use 64-bit integer type to store it. In C++ you can use the long long integer type and in Java you can use long integer type. Sample Input 2 10 half halfplus 3 10 halfplus halfplus halfplus Sample Output 15 55	{"inputs": ["2 10\nhalf\nhalfplus", "3 10\nhalfplus\nhalfplus\nhalfplus", "10 328\nhalf\nhalfplus\nhalfplus\nhalf\nhalfplus\nhalf\nhalf\nhalf\nhalfplus\nhalfplus", "1 2\nhalfplus", "5 6\nhalf\nhalf\nhalfplus\nhalf\nhalfplus", "10 2\nhalfplus\nhalfplus\nhalfplus\nhalf\nhalfplus\nhalf\nhalfplus\nhalf\nhalfplus\nhalfplus", "20 6\nhalf\nhalfplus\nhalfplus\nhalfplus\nhalf\nhalf\nhalfplus\nhalf\nhalfplus\nhalfplus\nhalfplus\nhalf\nhalf\nhalfplus\nhalfplus\nhalf\nhalfplus\nhalfplus\nhalfplus\nhalfplus", "30 68\nhalf\nhalf\nhalf\nhalfplus\nhalfplus\nhalf\nhalf\nhalf\nhalf\nhalf\nhalf\nhalf\nhalf\nhalfplus\nhalfplus\nhalf\nhalfplus\nhalf\nhalfplus\nhalf\nhalfplus\nhalfplus\nhalfplus\nhalf\nhalf\nhalf\nhalfplus\nhalf\nhalfplus\nhalfplus", "40 562\nhalfplus\nhalfplus\nhalfplus\nhalfplus\nhalfplus\nhalfplus\nhalfplus\nhalfplus\nhalf\nhalf\nhalf\nhalfplus\nhalf\nhalf\nhalfplus\nhalf\nhalfplus\nhalf\nhalfplus\nhalf\nhalfplus\nhalf\nhalfplus\nhalfplus\nhalfplus\nhalfplus\nhalfplus\nhalf\nhalf\nhalfplus\nhalf\nhalfplus\nhalfplus\nhalf\nhalf\nhalfplus\nhalf\nhalf\nhalfplus\nhalfplus"], "outputs": ["15", "55", "258300", "1", "114", "1703", "6056877", "59847312584", "486750560068982"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	80	codeforces
ba60028702652ff2df427b79f2f6558d	Functions again	Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arriving, they found that citizens are worried about maximum values of the Main Uzhlyandian Function f, which is defined as follows: In the above formula, 1<=≤<=l<=<<=r<=≤<=n must hold, where n is the size of the Main Uzhlyandian Array a, and \|x\| means absolute value of x. But the heroes skipped their math lessons in school, so they asked you for help. Help them calculate the maximum value of f among all possible values of l and r for the given array a. The first line contains single integer n (2<=≤<=n<=≤<=105) — the size of the array a. The second line contains n integers a1,<=a2,<=...,<=an (-109<=≤<=ai<=≤<=109) — the array elements. Print the only integer — the maximum value of f. Sample Input 5 1 4 2 3 1 4 1 5 4 7 Sample Output 36	{"inputs": ["5\n1 4 2 3 1", "4\n1 5 4 7", "8\n16 14 12 10 8 100 50 0", "2\n1 1", "50\n-5 -9 0 44 -10 37 34 -49 11 -22 -26 44 8 -13 23 -46 34 12 -24 2 -40 -15 -28 38 -40 -42 -42 7 -43 5 2 -11 10 43 9 49 -13 36 2 24 46 50 -15 -26 -6 -6 8 4 -44 -3", "100\n23 64 60 -45 -36 -64 -59 15 -75 69 -30 -7 -20 17 -77 58 93 -76 -98 -22 -31 16 -50 6 -20 -85 1 64 -88 -8 -15 -6 -57 25 91 10 2 -90 74 -66 -42 73 28 49 -85 59 96 79 -25 49 -59 -89 -75 12 -96 -33 -65 -8 -100 -81 17 99 -91 -5 7 -21 1 85 63 86 -26 85 -31 11 -75 35 -82 15 98 93 -55 66 70 36 -38 8 92 -63 -5 60 -78 -7 -22 -1 4 54 36 16 32 -20", "3\n0 0 0", "3\n0 1 -1", "5\n1000000000 0 0 1000000000 -1000000000", "2\n1000000000 -1000000000", "4\n1000000000 0 0 -1000000000", "4\n1 0 1 0", "5\n0 10 20 30 40", "2\n-1000000000 1000000000", "2\n1 2", "9\n1000000000 0 0 1000000000 1000000000 0 0 1000000000 1000000000", "16\n-1000000000 1000000000 1000000000 -1000000000 -1000000000 1000000000 1000000000 -1000000000 -1000000000 1000000000 1000000000 -1000000000 -1000000000 1000000000 1000000000 -1000000000", "6\n1000000000 0 0 1000000000 1000000000 0", "17\n1000000000 0 0 1000000000 1000000000 0 0 1000000000 1000000000 0 0 1000000000 1000000000 0 0 1000000000 1000000000", "11\n1000000000 0 1 1000000000 999999999 1 0 1000000000 999999999 1 1000000000", "4\n1000000000 -1000000000 -1000000000 1000000000", "10\n1000000000 -1000000000 -1000000000 1000000000 1000000000 -1000000000 -1000000000 1000000000 1000000000 -1000000000"], "outputs": ["3", "6", "92", "0", "208", "632", "0", "2", "2000000000", "2000000000", "2000000000", "1", "10", "2000000000", "1", "4000000000", "16000000000", "3000000000", "8000000000", "4999999991", "4000000000", "10000000000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	112	codeforces
ba61328e541f4203d3920b0fb7fb0ea3	Wormhouse	Arnie the Worm has finished eating an apple house yet again and decided to move. He made up his mind on the plan, the way the rooms are located and how they are joined by corridors. He numbered all the rooms from 1 to n. All the corridors are bidirectional. Arnie wants the new house to look just like the previous one. That is, it should have exactly n rooms and, if a corridor from room i to room j existed in the old house, it should be built in the new one. We know that during the house constructing process Arnie starts to eat an apple starting from some room and only stops when he eats his way through all the corridors and returns to the starting room. It is also known that Arnie eats without stopping. That is, until Arnie finishes constructing the house, he is busy every moment of his time gnawing a new corridor. Arnie doesn't move along the already built corridors. However, gnawing out corridors in one and the same order any time you change a house is a very difficult activity. That's why Arnie, knowing the order in which the corridors were located in the previous house, wants to gnaw corridors in another order. It is represented as a list of rooms in the order in which they should be visited. The new list should be lexicographically smallest, but it also should be strictly lexicographically greater than the previous one. Help the worm. The first line contains two integers n and m (3<=≤<=n<=≤<=100,<=3<=≤<=m<=≤<=2000). It is the number of rooms and corridors in Arnie's house correspondingly. The next line contains m<=+<=1 positive integers that do not exceed n. They are the description of Arnie's old path represented as a list of rooms he visited during the gnawing. It is guaranteed that the last number in the list coincides with the first one. The first room described in the list is the main entrance, that's why Arnie should begin gnawing from it. You may assume that there is no room which is connected to itself and there is at most one corridor between any pair of rooms. However, it is possible to find some isolated rooms which are disconnected from others. Print m<=+<=1 positive integers that do not exceed n. Those numbers are the description of the new path, according to which Arnie should gnaw out his new house. If it is impossible to find new path you should print out No solution. The first number in your answer should be equal to the last one. Also it should be equal to the main entrance. Sample Input 3 3 1 2 3 1 3 3 1 3 2 1 Sample Output 1 3 2 1 No solution	{"inputs": ["3 3\n1 2 3 1", "3 3\n1 3 2 1", "4 4\n1 2 4 3 1", "6 7\n3 2 4 1 6 5 1 3", "8 12\n4 6 5 1 4 3 1 8 3 7 8 5 4", "5 6\n3 4 1 2 5 1 3", "7 9\n3 2 7 3 5 1 2 6 1 3", "6 7\n1 5 6 1 4 3 2 1", "4 3\n1 2 3 1", "10 40\n10 3 8 4 10 2 8 1 2 6 3 5 7 6 10 8 9 7 8 5 4 9 1 3 7 2 5 10 9 2 4 3 9 6 5 1 4 6 1 7 10", "30 100\n8 2 27 15 3 14 2 4 11 28 3 19 20 21 5 27 29 19 25 12 3 29 8 11 18 19 6 7 27 18 25 21 7 16 29 15 7 3 9 12 15 14 11 27 9 18 12 2 6 15 25 16 8 7 12 19 1 12 11 19 28 14 24 18 1 28 21 27 30 8 23 13 19 22 12 6 29 24 23 17 28 29 13 26 6 11 15 22 1 8 13 18 28 20 1 29 12 26 14 4 8", "50 120\n14 38 15 28 2 20 8 33 29 8 45 42 41 44 28 19 3 10 48 34 45 25 22 19 23 34 37 9 20 4 15 10 16 38 40 26 16 27 10 28 47 4 16 39 31 18 26 9 17 36 44 17 49 21 45 28 12 1 17 48 1 38 11 20 12 3 34 19 18 14 35 25 3 24 16 43 6 5 13 15 20 50 27 44 11 7 46 17 10 34 40 47 12 7 14 20 23 48 20 3 40 12 27 17 33 39 49 6 40 30 47 18 13 10 40 18 21 22 43 27 14", "100 100\n96 23 25 62 34 30 85 15 26 61 59 87 34 99 60 41 52 73 63 84 50 89 42 29 87 99 19 94 84 43 82 90 41 100 60 61 99 49 26 3 97 5 24 34 51 59 69 61 11 41 72 60 33 36 18 29 82 53 18 80 52 98 38 32 56 95 55 79 32 80 37 64 45 13 62 80 70 29 1 58 88 24 79 68 41 80 12 72 52 39 64 19 54 56 70 58 19 3 83 62 96"], "outputs": ["1 3 2 1 ", "No solution", "1 3 4 2 1 ", "No solution", "4 6 5 1 4 3 1 8 7 3 8 5 4 ", "3 4 1 5 2 1 3 ", "3 2 7 3 5 1 6 2 1 3 ", "1 6 5 1 2 3 4 1 ", "1 3 2 1 ", "10 3 8 4 10 2 8 1 2 6 3 5 7 6 10 8 9 7 8 5 4 9 1 3 7 2 5 10 9 2 4 3 9 6 5 1 6 4 1 7 10 ", "8 2 27 15 3 14 2 4 11 28 3 19 20 21 5 27 29 19 25 12 3 29 8 11 18 19 6 7 27 18 25 21 7 16 29 15 7 3 9 12 15 14 11 27 9 18 12 2 6 15 25 16 8 7 12 19 1 12 11 19 28 14 24 18 1 28 21 27 30 8 23 13 19 22 12 6 29 24 23 17 28 29 13 26 6 11 15 22 1 20 28 18 13 8 1 29 12 26 14 4 8 ", "14 38 15 28 2 20 8 33 29 8 45 42 41 44 28 19 3 10 48 34 45 25 22 19 23 34 37 9 20 4 15 10 16 38 40 26 16 27 10 28 47 4 16 39 31 18 26 9 17 36 44 17 49 21 45 28 12 1 17 48 1 38 11 20 12 3 34 19 18 14 35 25 3 24 16 43 6 5 13 15 20 50 27 44 11 7 46 17 10 34 40 47 12 7 14 20 23 48 20 3 40 12 27 17 33 39 49 6 40 30 47 18 40 10 13 18 21 22 43 27 14 ", "96 23 25 62 34 30 85 15 26 61 59 87 34 99 60 41 52 73 63 84 50 89 42 29 87 99 19 94 84 43 82 90 41 100 60 61 99 49 26 3 97 5 24 34 51 59 69 61 11 41 72 60 33 36 18 29 82 53 18 80 52 98 38 32 56 95 55 79 32 80 37 64 45 13 62 80 70 29 1 58 88 24 79 68 41 80 12 72 52 39 64 19 58 70 56 54 19 3 83 62 96 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
ba6e2b6a7239ac8f2e8a5c94037059f3	Special Task	Special Agent Smart Beaver works in a secret research department of ABBYY. He's been working there for a long time and is satisfied with his job, as it allows him to eat out in the best restaurants and order the most expensive and exotic wood types there. The content special agent has got an important task: to get the latest research by British scientists on the English Language. These developments are encoded and stored in a large safe. The Beaver's teeth are strong enough, so the authorities assured that upon arriving at the place the beaver won't have any problems with opening the safe. And he finishes his aspen sprig and leaves for this important task. Of course, the Beaver arrived at the location without any problems, but alas. He can't open the safe with his strong and big teeth. At this point, the Smart Beaver get a call from the headquarters and learns that opening the safe with the teeth is not necessary, as a reliable source has sent the following information: the safe code consists of digits and has no leading zeroes. There also is a special hint, which can be used to open the safe. The hint is string s with the following structure: - if si = "?", then the digit that goes i-th in the safe code can be anything (between 0 to 9, inclusively); - if si is a digit (between 0 to 9, inclusively), then it means that there is digit si on position i in code; - if the string contains letters from "A" to "J", then all positions with the same letters must contain the same digits and the positions with distinct letters must contain distinct digits. - The length of the safe code coincides with the length of the hint. For example, hint "?JGJ9" has such matching safe code variants: "51919", "55959", "12329", "93539" and so on, and has wrong variants such as: "56669", "00111", "03539" and "13666". After receiving such information, the authorities change the plan and ask the special agents to work quietly and gently and not to try to open the safe by mechanical means, and try to find the password using the given hint. At a special agent school the Smart Beaver was the fastest in his platoon finding codes for such safes, but now he is not in that shape: the years take their toll ... Help him to determine the number of possible variants of the code to the safe, matching the given hint. After receiving this information, and knowing his own speed of entering codes, the Smart Beaver will be able to determine whether he will have time for tonight's show "Beavers are on the trail" on his favorite TV channel, or he should work for a sleepless night... The first line contains string s — the hint to the safe code. String s consists of the following characters: ?, 0-9, A-J. It is guaranteed that the first character of string s doesn't equal to character 0. The input limits for scoring 30 points are (subproblem A1): - 1<=≤<=\|s\|<=≤<=5. The input limits for scoring 100 points are (subproblems A1+A2): - 1<=≤<=\|s\|<=≤<=105. Here \|s\| means the length of string s. Print the number of codes that match the given hint. Sample Input AJ 1?AA Sample Output 81 100	{"inputs": ["AJ", "1?AA", "?", "7", "A", "BBB?", "BC??", "CC", "CB?", "B??C?", "BB?C?", "?BCB?", "?C", "??C?C", "???2", "9???", "GJH2?", "7I9G4", "JG50?", "CDEFG"], "outputs": ["81", "100", "9", "1", "9", "90", "8100", "9", "810", "81000", "8100", "8100", "90", "9000", "900", "1000", "6480", "90", "810", "27216"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	53	codeforces
baddb954f5f204cdf827de7b355fa03f	Dima and Lisa	Dima loves representing an odd number as the sum of multiple primes, and Lisa loves it when there are at most three primes. Help them to represent the given number as the sum of at most than three primes. More formally, you are given an odd numer n. Find a set of numbers pi (1<=≤<=i<=≤<=k), such that 1. 1<=≤<=k<=≤<=31. pi is a prime1. The numbers pi do not necessarily have to be distinct. It is guaranteed that at least one possible solution exists. The single line contains an odd number n (3<=≤<=n<=<<=109). In the first line print k (1<=≤<=k<=≤<=3), showing how many numbers are in the representation you found. In the second line print numbers pi in any order. If there are multiple possible solutions, you can print any of them. Sample Input 27 Sample Output 3 5 11 11	{"inputs": ["27", "3", "25", "9", "91", "57", "31", "555", "700000001", "5", "7", "11", "13", "15", "17", "19", "21", "23", "29", "79", "99", "27", "55", "79", "585", "245", "793", "133", "681", "981399", "867773", "654141", "202985", "784533", "370359", "396831", "492211", "838347", "1098945", "1313565", "1349631", "1357299", "1357323", "1357329", "1388581", "5275", "9515", "7847", "7077", "9531", "7865", "9675", "8909", "7147", "8487", "436273289", "649580445", "944193065", "630045387", "931103229", "950664039", "996104777", "997255617", "999962901", "999995529", "999995339", "999998367", "999999891", "999999935", "999999755", "999999759", "999999191", "999999999", "409449117", "882499837", "765615965", "648732093", "826815517", "4898941", "182982365", "66098493", "539149213", "655957385", "199999581", "199998345", "199991935", "199986207", "499991589", "499984689", "499984159", "499966179", "999995529", "999995085", "999991817", "999991797", "999991791", "748859699", "323845235", "462409937", "618047403", "501148647", "998017623", "436273289", "999999965", "5", "1000037", "989898987", "999999999", "100000003"], "outputs": ["3\n2 2 23", "1\n3", "2\n2 23", "2\n2 7", "2\n2 89", "3\n2 2 53", "1\n31", "3\n3 5 547", "1\n700000001", "1\n5", "1\n7", "1\n11", "1\n13", "2\n2 13", "1\n17", "1\n19", "2\n2 19", "1\n23", "1\n29", "1\n79", "2\n2 97", "3\n2 2 23", "2\n2 53", "1\n79", "3\n3 5 577", "3\n2 2 241", "3\n3 3 787", "2\n2 131", "3\n2 2 677", "2\n2 981397", "1\n867773", "3\n3 11 654127", "3\n2 2 202981", "3\n3 17 784513", "3\n19 79 370261", "3\n19 79 396733", "3\n19 79 492113", "3\n19 79 838249", "3\n19 79 1098847", "3\n19 79 1313467", "3\n19 79 1349533", "3\n19 79 1357201", "3\n13 109 1357201", "3\n19 109 1357201", "3\n19 79 1388483", "2\n2 5273", "3\n2 2 9511", "3\n3 3 7841", "3\n3 5 7069", "3\n3 7 9521", "3\n5 7 7853", "3\n3 11 9661", "3\n3 13 8893", "3\n5 13 7129", "3\n3 17 8467", "3\n3 277 436273009", "3\n3 271 649580171", "3\n7 251 944192807", "3\n11 239 630045137", "3\n3 223 931103003", "3\n3 197 950663839", "3\n7 173 996104597", "3\n7 157 997255453", "3\n19 109 999962773", "3\n19 79 999995431", "3\n5 43 999995291", "3\n5 23 999998339", "3\n3 5 999999883", "3\n3 3 999999929", "3\n2 2 999999751", "2\n2 999999757", "1\n999999191", "3\n3 59 999999937", "3\n2 2 409449113", "3\n3 3 882499831", "3\n5 23 765615937", "3\n3 11 648732079", "3\n3 11 826815503", "2\n2 4898939", "3\n5 13 182982347", "3\n3 41 66098449", "1\n539149213", "3\n3 13 655957369", "3\n19 79 199999483", "3\n19 79 199998247", "3\n19 79 199991837", "3\n19 79 199986109", "3\n19 79 499991491", "3\n19 79 499984591", "3\n19 79 499984061", "3\n19 79 499966081", "3\n19 79 999995431", "3\n19 79 999994987", "3\n11 137 999991669", "3\n19 109 999991669", "3\n13 109 999991669", "3\n3 3 748859693", "3\n3 3 323845229", "3\n2 2 462409933", "3\n3 13 618047387", "3\n2 2 501148643", "2\n2 998017621", "3\n3 277 436273009", "3\n5 23 999999937", "1\n5", "1\n1000037", "3\n2 2 989898983", "3\n3 59 999999937", "3\n3 11 99999989"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
bafeb7c12c0d4cc7009ce0f7dfa473fc	Bear and Colors	Bear Limak has n colored balls, arranged in one long row. Balls are numbered 1 through n, from left to right. There are n possible colors, also numbered 1 through n. The i-th ball has color ti. For a fixed interval (set of consecutive elements) of balls we can define a dominant color. It's a color occurring the biggest number of times in the interval. In case of a tie between some colors, the one with the smallest number (index) is chosen as dominant. There are non-empty intervals in total. For each color, your task is to count the number of intervals in which this color is dominant. The first line of the input contains a single integer n (1<=≤<=n<=≤<=5000) — the number of balls. The second line contains n integers t1,<=t2,<=...,<=tn (1<=≤<=ti<=≤<=n) where ti is the color of the i-th ball. Print n integers. The i-th of them should be equal to the number of intervals where i is a dominant color. Sample Input 4 1 2 1 2 3 1 1 1 Sample Output 7 3 0 0 6 0 0	{"inputs": ["4\n1 2 1 2", "3\n1 1 1", "10\n9 1 5 2 9 2 9 2 1 1", "50\n17 13 19 19 19 34 32 24 24 13 34 17 19 19 7 32 19 13 13 30 19 34 34 28 41 24 24 47 22 34 21 21 30 7 22 21 32 19 34 19 34 22 7 28 6 13 19 30 13 30", "150\n28 124 138 71 71 18 78 136 138 93 145 93 18 15 71 47 47 64 18 72 138 72 18 150 7 71 109 149 18 115 149 149 15 78 124 27 72 124 28 108 138 109 108 111 148 138 78 27 28 150 138 65 15 145 109 47 102 62 28 7 115 108 102 149 150 27 111 64 149 124 13 21 108 64 7 15 72 72 124 47 102 28 109 18 124 28 111 138 7 13 21 62 136 62 13 64 71 7 130 47 77 65 71 148 15 93 64 65 28 65 13 78 78 47 115 138 28 115 72 136 124 145 150 62 105 78 71 102 109 150 27 130 62 7 93 72 93 62 7 124 72 21 62 18 62 7 108 78 148 149", "1\n1", "2\n2 1"], "outputs": ["7 3 0 0 ", "6 0 0 ", "18 30 0 0 1 0 0 0 6 0 ", "0 0 0 0 0 22 40 0 0 0 0 0 98 0 0 0 5 0 675 0 165 9 0 61 0 0 0 5 0 6 0 4 0 183 0 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 ", "0 0 0 0 0 0 1863 0 0 0 0 0 604 0 97 0 0 1026 0 0 12 0 0 0 0 0 208 2982 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 67 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1400 0 158 371 0 0 0 0 0 92 296 0 0 0 0 1 199 0 0 0 0 0 0 0 0 0 0 0 0 0 0 48 0 0 0 0 0 0 0 0 151 0 0 1 0 0 230 37 0 6 0 0 0 44 0 0 0 0 0 0 0 0 174 0 0 0 0 0 2 0 0 0 0 0 4 0 729 0 0 0 0 0 0 4 0 0 4 486 29 ", "1 ", "2 1 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	11	codeforces
bb1e3bb6c310b0882dcd8872d6ac76d1	Games	Manao works on a sports TV. He's spent much time watching the football games of some country. After a while he began to notice different patterns. For example, each team has two sets of uniforms: home uniform and guest uniform. When a team plays a game at home, the players put on the home uniform. When a team plays as a guest on somebody else's stadium, the players put on the guest uniform. The only exception to that rule is: when the home uniform color of the host team matches the guests' uniform, the host team puts on its guest uniform as well. For each team the color of the home and guest uniform is different. There are n teams taking part in the national championship. The championship consists of n·(n<=-<=1) games: each team invites each other team to its stadium. At this point Manao wondered: how many times during the championship is a host team going to put on the guest uniform? Note that the order of the games does not affect this number. You know the colors of the home and guest uniform for each team. For simplicity, the colors are numbered by integers in such a way that no two distinct colors have the same number. Help Manao find the answer to his question. The first line contains an integer n (2<=≤<=n<=≤<=30). Each of the following n lines contains a pair of distinct space-separated integers hi, ai (1<=≤<=hi,<=ai<=≤<=100) — the colors of the i-th team's home and guest uniforms, respectively. In a single line print the number of games where the host team is going to play in the guest uniform. Sample Input 3 1 2 2 4 3 4 4 100 42 42 100 5 42 100 5 2 1 2 1 2 Sample Output 1 5 0	{"inputs": ["3\n1 2\n2 4\n3 4", "4\n100 42\n42 100\n5 42\n100 5", "2\n1 2\n1 2", "7\n4 7\n52 55\n16 4\n55 4\n20 99\n3 4\n7 52", "10\n68 42\n1 35\n25 70\n59 79\n65 63\n46 6\n28 82\n92 62\n43 96\n37 28", "30\n10 39\n89 1\n78 58\n75 99\n36 13\n77 50\n6 97\n79 28\n27 52\n56 5\n93 96\n40 21\n33 74\n26 37\n53 59\n98 56\n61 65\n42 57\n9 7\n25 63\n74 34\n96 84\n95 47\n12 23\n34 21\n71 6\n27 13\n15 47\n64 14\n12 77", "30\n46 100\n87 53\n34 84\n44 66\n23 20\n50 34\n90 66\n17 39\n13 22\n94 33\n92 46\n63 78\n26 48\n44 61\n3 19\n41 84\n62 31\n65 89\n23 28\n58 57\n19 85\n26 60\n75 66\n69 67\n76 15\n64 15\n36 72\n90 89\n42 69\n45 35", "2\n46 6\n6 46", "29\n8 18\n33 75\n69 22\n97 95\n1 97\n78 10\n88 18\n13 3\n19 64\n98 12\n79 92\n41 72\n69 15\n98 31\n57 74\n15 56\n36 37\n15 66\n63 100\n16 42\n47 56\n6 4\n73 15\n30 24\n27 71\n12 19\n88 69\n85 6\n50 11", "23\n43 78\n31 28\n58 80\n66 63\n20 4\n51 95\n40 20\n50 14\n5 34\n36 39\n77 42\n64 97\n62 89\n16 56\n8 34\n58 16\n37 35\n37 66\n8 54\n50 36\n24 8\n68 48\n85 33", "13\n76 58\n32 85\n99 79\n23 58\n96 59\n72 35\n53 43\n96 55\n41 78\n75 10\n28 11\n72 7\n52 73", "18\n6 90\n70 79\n26 52\n67 81\n29 95\n41 32\n94 88\n18 58\n59 65\n51 56\n64 68\n34 2\n6 98\n95 82\n34 2\n40 98\n83 78\n29 2", "18\n6 90\n100 79\n26 100\n67 100\n29 100\n100 32\n94 88\n18 58\n59 65\n51 56\n64 68\n34 2\n6 98\n95 82\n34 2\n40 98\n83 78\n29 100", "30\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1", "30\n100 99\n58 59\n56 57\n54 55\n52 53\n50 51\n48 49\n46 47\n44 45\n42 43\n40 41\n38 39\n36 37\n34 35\n32 33\n30 31\n28 29\n26 27\n24 25\n22 23\n20 21\n18 19\n16 17\n14 15\n12 13\n10 11\n8 9\n6 7\n4 5\n2 3", "15\n9 3\n2 6\n7 6\n5 10\n9 5\n8 1\n10 5\n2 8\n4 5\n9 8\n5 3\n3 8\n9 8\n4 10\n8 5", "15\n2 1\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n1 2\n2 1\n2 1\n2 1\n1 2\n2 1\n2 1\n1 2", "25\n2 1\n1 2\n1 2\n1 2\n2 1\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n1 2\n2 1\n1 2\n2 1\n2 1\n2 1\n2 1\n1 2", "25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\n6 91\n57 54\n2 57\n57 91\n73 91\n57 23\n91 57\n2 73\n91 2\n23 6\n2 73\n23 6", "28\n31 66\n31 91\n91 31\n97 66\n31 66\n31 66\n66 91\n91 31\n97 31\n91 97\n97 31\n66 31\n66 97\n91 31\n31 66\n31 66\n66 31\n31 97\n66 97\n97 31\n31 91\n66 91\n91 66\n31 66\n91 66\n66 31\n66 31\n91 97", "29\n78 27\n50 68\n24 26\n68 43\n38 78\n26 38\n78 28\n28 26\n27 24\n23 38\n24 26\n24 43\n61 50\n38 78\n27 23\n61 26\n27 28\n43 23\n28 78\n43 27\n43 78\n27 61\n28 38\n61 78\n50 26\n43 27\n26 78\n28 50\n43 78", "29\n80 27\n69 80\n27 80\n69 80\n80 27\n80 27\n80 27\n80 69\n27 69\n80 69\n80 27\n27 69\n69 27\n80 69\n27 69\n69 80\n27 69\n80 69\n80 27\n69 27\n27 69\n27 80\n80 27\n69 80\n27 69\n80 69\n69 80\n69 80\n27 80", "30\n19 71\n7 89\n89 71\n21 7\n19 21\n7 89\n19 71\n89 8\n89 21\n19 8\n21 7\n8 89\n19 89\n7 21\n19 8\n19 7\n7 19\n8 21\n71 21\n71 89\n7 19\n7 19\n21 7\n21 19\n21 19\n71 8\n21 8\n71 19\n19 71\n8 21", "30\n44 17\n44 17\n44 17\n17 44\n44 17\n44 17\n17 44\n17 44\n17 44\n44 17\n44 17\n44 17\n44 17\n44 17\n17 44\n17 44\n17 44\n44 17\n44 17\n17 44\n44 17\n44 17\n44 17\n17 44\n17 44\n44 17\n17 44\n44 17\n44 17\n44 17", "22\n78 92\n15 92\n92 78\n78 80\n92 16\n24 80\n92 16\n16 92\n78 16\n24 78\n80 78\n92 80\n16 80\n80 78\n15 78\n92 16\n24 15\n24 80\n80 16\n16 80\n92 80\n24 80", "24\n9 83\n90 31\n83 3\n83 3\n21 31\n83 3\n32 31\n12 21\n31 21\n90 32\n32 21\n12 9\n12 31\n9 83\n83 12\n32 3\n32 83\n90 31\n9 32\n31 21\n83 90\n32 21\n21 3\n32 9", "30\n67 21\n85 39\n85 87\n21 39\n66 85\n10 95\n10 21\n87 85\n82 21\n67 21\n95 10\n21 39\n82 21\n21 66\n66 39\n95 30\n67 85\n66 82\n85 82\n21 66\n10 39\n67 10\n21 85\n10 82\n85 95\n10 85\n21 39\n85 39\n39 10\n95 67", "4\n8 7\n8 7\n7 8\n7 8", "6\n1 2\n1 2\n1 2\n1 2\n1 2\n2 1", "12\n1 2\n1 2\n1 2\n1 2\n1 2\n1 2\n2 1\n2 1\n2 1\n2 1\n2 1\n2 1", "4\n1 2\n1 2\n2 1\n2 1"], "outputs": ["1", "5", "0", "6", "1", "6", "4", "2", "10", "6", "0", "1", "8", "450", "0", "20", "108", "312", "96", "210", "73", "277", "154", "418", "74", "59", "100", "8", "10", "72", "8"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	925	codeforces
bb4f21e3fb5d468b2df9010b6f3af889	Last Chance	Having read half of the book called "Storm and Calm" on the IT lesson, Innocentius was absolutely determined to finish the book on the maths lessons. All was fine until the math teacher Ms. Watkins saw Innocentius reading fiction books instead of solving equations of the fifth degree. As during the last maths class Innocentius suggested the algorithm of solving equations of the fifth degree in the general case, Ms. Watkins had no other choice but to give him a new task. The teacher asked to write consecutively (without spaces) all words from the "Storm and Calm" in one long string s. She thought that a string is good if the number of vowels in the string is no more than twice more than the number of consonants. That is, the string with v vowels and c consonants is good if and only if v<=≤<=2c. The task Innocentius had to solve turned out to be rather simple: he should find the number of the longest good substrings of the string s. The only input line contains a non-empty string s consisting of no more than 2·105 uppercase and lowercase Latin letters. We shall regard letters "a", "e", "i", "o", "u" and their uppercase variants as vowels. Print on a single line two numbers without a space: the maximum length of a good substring and the number of good substrings with this length. If no good substring exists, print "No solution" without the quotes. Two substrings are considered different if their positions of occurrence are different. So if some string occurs more than once, then it should be counted more than once. Sample Input Abo OEIS auBAAbeelii AaaBRAaaCAaaDAaaBRAaa EA Sample Output 3 1 3 1 9 3 18 4 No solution	{"inputs": ["Abo", "OEIS", "auBAAbeelii", "AaaBRAaaCAaaDAaaBRAaa", "EA", "BBBAABAABAABBBB", "b", "AABAABAABAA", "aaaaaaa", "AAAAAAABBB", "aabaaaaaaaaaaaaaaab", "aaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaab", "aaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaabaaaaab", "uAuuaAEuuoEaEUuUiuAeieaeaeuOoAIAueeIAIEEoeieAaooiiioAuIUEAUuIeuuOOoUAUIouAOaOOOauiIIaeAUoUEuOUuOiAIi", "SHDXWFgvsdFRQBWmfbMZjRfkrbMxRbSDzLLVDnRhmvDGFjzZBXCmLtZWwZyCfWdlGHXdgckbkMysxknLcckvHjZyfknrWkCHCyqN", "RAXidopIqEpUTaKAyeWaBoFodoXARotaWaMaJUKEMUwaVIqesOFANoBiguXEJEgoGAdegAdULAHEbAwUTURuHuKOkafeKAjOqiPA", "IgwLknyWcuHzTWGUsaXmQBCvjOJTcYNfXRtbgXMYJzRDgFZTWB", "oAvWmeQiIpqIAHDVxeuAiWXEcRJecOaerRaoICxeISEEOXOoxiAqPuoZIIIWetgRSAcUADAfdEoATYSaAACAnMDsteqvTHuetEIS", "eEijaiUeefuYpqEUUAmoUAEpiuaDaOOORuaOuaolEOXeAooEinIOwoUUIwukOAbiAOueceUEIOuyzOuDAoiEUImweEhAIIouEfAeepaiAEexiaEiuSiUueaEeEaieeBEiMoEOROZIUIAuoEUHeIEOhUhIeEOOiIehIuaEoELauUeEUIuEiAauUOOeuiXaERAEoOqiaGu", "DaABYAOivguEueXufuoUeoiLiuEuEIeZAdoPgaUIIrUtoodAALPESiUaEbqitAphOIIEAogrjUBZLnIALGbazIermGEiAAdDAOFaaizopuUuuEugOHsXTAelFxAyZXWQXiEEKkGiIVdUmwiThDOiEyiuOEaiIAAjEQyaEuOiUGOuuzvaIEUEAhXEuOliOeEkJuJaUaszUKePiQuwXSuoQYEeUOgOeuyvOwhUuitEEKDVOaUaoiaIyiAEkyXeuiEkUorUYCaOXEAiUYPnUMaURebouLUOiOojcOeODaaIeEeuukDvpiIkeNuaEaUAhYILuaieUyIUAVuaeSvUgbIiQuiatOUFeUIuCaVIePixujxaeiexTviwJrtReKlaJogeuDTrLAUSapeHoahVaOFROEfHOIeIiIkdvpcauuTRiSVoUaaiOoqUOAuuybEuJLRieGojUoZIIgiiJmEoerPNaEQTEUapOeecnZOAlEaUEUoiIfwLeEOA", "a", "ab", "ba", "bb", "xooooooxxx", "deeeed", "aaaabaaaab", "aaaaabaaaaa", "baaaab", "baaabaa", "ddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeed", "bbbbbbbbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbb"], "outputs": ["3 1", "3 1", "9 3", "18 4", "No solution", "15 1", "1 1", "9 3", "No solution", "9 1", "3 4", "3 61", "3 28", "No solution", "100 1", "100 1", "50 1", "100 1", "24 1", "500 1", "No solution", "2 1", "2 1", "2 1", "10 1", "6 1", "6 1", "3 3", "6 1", "6 1", "12 1", "48 1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
bb53026b93847d7813469885cb9da1cf	Helga Hufflepuff's Cup	Harry, Ron and Hermione have figured out that Helga Hufflepuff's cup is a horcrux. Through her encounter with Bellatrix Lestrange, Hermione came to know that the cup is present in Bellatrix's family vault in Gringott's Wizarding Bank. The Wizarding bank is in the form of a tree with total n vaults where each vault has some type, denoted by a number between 1 to m. A tree is an undirected connected graph with no cycles. The vaults with the highest security are of type k, and all vaults of type k have the highest security. There can be at most x vaults of highest security. Also, if a vault is of the highest security, its adjacent vaults are guaranteed to not be of the highest security and their type is guaranteed to be less than k. Harry wants to consider every possibility so that he can easily find the best path to reach Bellatrix's vault. So, you have to tell him, given the tree structure of Gringotts, the number of possible ways of giving each vault a type such that the above conditions hold. The first line of input contains two space separated integers, n and m — the number of vaults and the number of different vault types possible. (1<=≤<=n<=≤<=105,<=1<=≤<=m<=≤<=109). Each of the next n<=-<=1 lines contain two space separated integers ui and vi (1<=≤<=ui,<=vi<=≤<=n) representing the i-th edge, which shows there is a path between the two vaults ui and vi. It is guaranteed that the given graph is a tree. The last line of input contains two integers k and x (1<=≤<=k<=≤<=m,<=1<=≤<=x<=≤<=10), the type of the highest security vault and the maximum possible number of vaults of highest security. Output a single integer, the number of ways of giving each vault a type following the conditions modulo 109<=+<=7. Sample Input 4 2 1 2 2 3 1 4 1 2 3 3 1 2 1 3 2 1 3 1 1 2 1 3 1 1 Sample Output 1 13 0	{"inputs": ["4 2\n1 2\n2 3\n1 4\n1 2", "3 3\n1 2\n1 3\n2 1", "3 1\n1 2\n1 3\n1 1", "3 1000000000\n2 3\n3 1\n585430050 9", "4 50000\n2 1\n4 2\n2 3\n42169 9", "15 100000\n9 7\n15 13\n1 13\n14 5\n6 10\n5 12\n4 14\n4 6\n8 3\n8 2\n9 3\n10 15\n11 8\n10 3\n16283 7"], "outputs": ["1", "13", "0", "91592837", "542369366", "770195687"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
bb6533d1cf6db1f3d3ef4bc882371c7c	none	An expedition group flew from planet ACM-1 to Earth in order to study the bipedal species (its representatives don't even have antennas on their heads!). The flying saucer, on which the brave pioneers set off, consists of three sections. These sections are connected by a chain: the 1-st section is adjacent only to the 2-nd one, the 2-nd one — to the 1-st and the 3-rd ones, the 3-rd one — only to the 2-nd one. The transitions are possible only between the adjacent sections. The spacecraft team consists of n aliens. Each of them is given a rank — an integer from 1 to n. The ranks of all astronauts are distinct. The rules established on the Saucer, state that an alien may move from section a to section b only if it is senior in rank to all aliens who are in the segments a and b (besides, the segments a and b are of course required to be adjacent). Any alien requires exactly 1 minute to make a move. Besides, safety regulations require that no more than one alien moved at the same minute along the ship. Alien A is senior in rank to alien B, if the number indicating rank A, is more than the corresponding number for B. At the moment the whole saucer team is in the 3-rd segment. They all need to move to the 1-st segment. One member of the crew, the alien with the identification number CFR-140, decided to calculate the minimum time (in minutes) they will need to perform this task. Help CFR-140, figure out the minimum time (in minutes) that all the astronauts will need to move from the 3-rd segment to the 1-st one. Since this number can be rather large, count it modulo m. The first line contains two space-separated integers: n and m (1<=≤<=n,<=m<=≤<=109) — the number of aliens on the saucer and the number, modulo which you should print the answer, correspondingly. Print a single number — the answer to the problem modulo m. Sample Input 1 10 3 8 Sample Output 2 2	{"inputs": ["1 10", "3 8", "8 12", "4 84", "9 95", "331358794 820674098", "5 56", "10 22", "8 73", "7 63", "1 57", "6 5", "6 25", "1 39", "3 60", "2 81", "5 35", "8 100", "6 29", "7 90", "1 37", "7 34", "3 49", "1 38", "7 88", "9 30", "333734901 647005907", "140068687 419634856", "725891944 969448805", "792362041 423498933", "108260816 609551797", "593511479 711449475", "853906091 809812670", "549662082 945236243", "296519935 960061928", "854939092 4244941", "519976508 777084731", "264926775 887044705", "602799218 494169337", "880162386 653879733", "868095112 994962872", "622152471 448257864", "523061914 144515354", "596386879 356583466", "592821498 42617080", "647732356 84460643", "451688701 6561", "661983283 9", "474026177 729", "822957727 6561", "286996517 27", "321823343 19683", "422262807 3", "624216668 19683", "514853447 9", "916546405 6561", "238972792 59049", "450526186 6561", "591892483 729", "357780112 9", "528551307 729", "199154351 3", "234899623 6561", "576449056 59049", "508185014 3", "969271595 9", "1 1", "2 9", "3 27", "2 3", "1 3", "3 9", "10 3", "4 81", "1 2", "4 27", "3 1", "3 3"], "outputs": ["2", "2", "8", "80", "17", "2619146", "18", "0", "63", "44", "2", "3", "3", "2", "26", "8", "32", "60", "3", "26", "2", "10", "26", "2", "74", "2", "40746267", "40442298", "599793690", "182386349", "237749529", "641995841", "50540996", "239869294", "171150618", "2105846", "290288763", "448954191", "105935725", "193558859", "606909752", "210299666", "127493116", "134606022", "2923848", "28044795", "6560", "8", "728", "6560", "26", "19682", "2", "19682", "8", "6560", "59048", "6560", "728", "8", "728", "2", "6560", "59048", "2", "8", "0", "8", "26", "2", "2", "8", "2", "80", "0", "26", "0", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	24	codeforces
bb658a7df66938411259566bbf53ad8e	Links and Pearls	A necklace can be described as a string of links ('-') and pearls ('o'), with the last link or pearl connected to the first one. You can remove a link or a pearl and insert it between two other existing links or pearls (or between a link and a pearl) on the necklace. This process can be repeated as many times as you like, but you can't throw away any parts. Can you make the number of links between every two adjacent pearls equal? Two pearls are considered to be adjacent if there is no other pearl between them. Note that the final necklace should remain as one circular part of the same length as the initial necklace. The only line of input contains a string $s$ ($3 \leq \|s\| \leq 100$), representing the necklace, where a dash '-' represents a link and the lowercase English letter 'o' represents a pearl. Print "YES" if the links and pearls can be rejoined such that the number of links between adjacent pearls is equal. Otherwise print "NO". You can print each letter in any case (upper or lower). Sample Input -o-o---o--- -o---o- ooo Sample Output YESYESNOYES	{"inputs": ["-o-o--", "-o---", "-o---o-", "ooo", "---", "--o-o-----o----o--oo-o-----ooo-oo---o--", "-o--o-oo---o-o-o--o-o----oo------oo-----o----o-o-o--oo-o--o---o--o----------o---o-o-oo---o--o-oo-o--", "-ooo--", "---o--", "oo-ooo", "------o-o--o-----o--", "--o---o----------o----o----------o--o-o-----o-oo---oo--oo---o-------------oo-----o-------------o---o", "----------------------------------------------------------------------------------------------------", "-oo-oo------", "---------------------------------o----------------------------oo------------------------------------", "oo--o--o--------oo----------------o-----------o----o-----o----------o---o---o-----o---------ooo---", "--o---oooo--o-o--o-----o----ooooo--o-oo--o------oooo--------------ooo-o-o----", "-----------------------------o--o-o-------", "o-oo-o--oo----o-o----------o---o--o----o----o---oo-ooo-o--o-", "oooooooooo-ooo-oooooo-ooooooooooooooo--o-o-oooooooooooooo-oooooooooooooo", "-----------------o-o--oo------o--------o---o--o----------------oooo-------------ooo-----ooo-----o", "ooo-ooooooo-oo-ooooooooo-oooooooooooooo-oooo-o-oooooooooo--oooooooooooo-oooooooooo-ooooooo", "oo-o-ooooo---oo---o-oo---o--o-ooo-o---o-oo---oo---oooo---o---o-oo-oo-o-ooo----ooo--oo--o--oo-o-oo", "-----o-----oo-o-o-o-o----o---------oo---ooo-------------o----o---o-o", "oo--o-o-o----o-oooo-ooooo---o-oo--o-o--ooo--o--oooo--oo----o----o-o-oooo---o-oooo--ooo-o-o----oo---", "------oo----o----o-oo-o--------o-----oo-----------------------o------------o-o----oo---------", "-o--o--------o--o------o---o-o----------o-------o-o-o-------oo----oo------o------oo--o--", "------------------o----------------------------------o-o-------------", "-------------o----ooo-----o-o-------------ooo-----------ooo------o----oo---", "-------o--------------------o--o---------------o---o--o-----", "------------------------o------------o-----o----------------", "------oo----------o------o-----o---------o------------o----o--o", "------------o------------------o-----------------------o-----------o", "o---o---------------", "----------------------o---o----o---o-----------o-o-----o", "----------------------------------------------------------------------o-o---------------------", "----o---o-------------------------", "o----------------------oo----", "-o-o--o-o--o-----o-----o-o--o-o---oooo-o", "-o-ooo-o--o----o--o-o-oo-----------o-o-", "o-------o-------o-------------", "oo----------------------o--------------o--------------o-----", "-----------------------------------o---------------------o--------------------------", "--o--o----o-o---o--o----o-o--oo-----o-oo--o---o---ooo-o--", "---------------o-o----", "o------ooo--o-o-oo--o------o----ooo-----o-----o-----o-ooo-o---o----oo", "----o----o", "o--o--o--o--o--o--o--o--o--o--o--o--", "o---o---o---o---o----o----o----o---o---o---o", "o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-", "-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o-o", "o----------o----------o----------o----------o----------o----------o----------o----------o----------o", "o---------o---------o---------o---------o---------o---------o---------o---------o", "--------o--------o--------o--------o--------o--------o--------o--------o--------", "o---o----", "---o----o", "-o-", "------oooo", "oo--", "---o", "ooo-", "oooooooo----------", "oooo--", "o-ooooo", "-oo", "ooooo-", "ooo---------", "oo-", "---ooo"], "outputs": ["YES", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	216	codeforces
bb6f8901c7e3ad27813fe9d022d7ed4d	Water The Garden	It is winter now, and Max decided it's about time he watered the garden. The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is located in the bed xi), which, if turned on, start delivering water to neighbouring beds. If the tap on the bed xi is turned on, then after one second has passed, the bed xi will be watered; after two seconds have passed, the beds from the segment [xi<=-<=1,<=xi<=+<=1] will be watered (if they exist); after j seconds have passed (j is an integer number), the beds from the segment [xi<=-<=(j<=-<=1),<=xi<=+<=(j<=-<=1)] will be watered (if they exist). Nothing changes during the seconds, so, for example, we can't say that the segment [xi<=-<=2.5,<=xi<=+<=2.5] will be watered after 2.5 seconds have passed; only the segment [xi<=-<=2,<=xi<=+<=2] will be watered at that moment. Max wants to turn on all the water taps at the same moment, and now he wonders, what is the minimum number of seconds that have to pass after he turns on some taps until the whole garden is watered. Help him to find the answer! The first line contains one integer t — the number of test cases to solve (1<=≤<=t<=≤<=200). Then t test cases follow. The first line of each test case contains two integers n and k (1<=≤<=n<=≤<=200, 1<=≤<=k<=≤<=n) — the number of garden beds and water taps, respectively. Next line contains k integers xi (1<=≤<=xi<=≤<=n) — the location of i-th water tap. It is guaranteed that for each condition xi<=-<=1<=<<=xi holds. It is guaranteed that the sum of n over all test cases doesn't exceed 200. Note that in hacks you have to set t<==<=1. For each test case print one integer — the minimum number of seconds that have to pass after Max turns on some of the water taps, until the whole garden is watered. Sample Input 3 5 1 3 3 3 1 2 3 4 1 1 Sample Output 3 1 4	{"inputs": ["3\n5 1\n3\n3 3\n1 2 3\n4 1\n1", "26\n1 1\n1\n2 1\n2\n2 1\n1\n2 2\n1 2\n3 1\n3\n3 1\n2\n3 2\n2 3\n3 1\n1\n3 2\n1 3\n3 2\n1 2\n3 3\n1 2 3\n4 1\n4\n4 1\n3\n4 2\n3 4\n4 1\n2\n4 2\n2 4\n4 2\n2 3\n4 3\n2 3 4\n4 1\n1\n4 2\n1 4\n4 2\n1 3\n4 3\n1 3 4\n4 2\n1 2\n4 3\n1 2 4\n4 3\n1 2 3\n4 4\n1 2 3 4", "31\n5 1\n5\n5 1\n4\n5 2\n4 5\n5 1\n3\n5 2\n3 5\n5 2\n3 4\n5 3\n3 4 5\n5 1\n2\n5 2\n2 5\n5 2\n2 4\n5 3\n2 4 5\n5 2\n2 3\n5 3\n2 3 5\n5 3\n2 3 4\n5 4\n2 3 4 5\n5 1\n1\n5 2\n1 5\n5 2\n1 4\n5 3\n1 4 5\n5 2\n1 3\n5 3\n1 3 5\n5 3\n1 3 4\n5 4\n1 3 4 5\n5 2\n1 2\n5 3\n1 2 5\n5 3\n1 2 4\n5 4\n1 2 4 5\n5 3\n1 2 3\n5 4\n1 2 3 5\n5 4\n1 2 3 4\n5 5\n1 2 3 4 5", "1\n200 1\n200", "1\n5 1\n5", "1\n177 99\n1 4 7 10 11 13 14 15 16 17 19 21 22 24 25 26 27 28 32 34 35 38 39 40 42 45 46 52 54 55 57 58 59 60 62 64 65 67 70 71 74 77 78 79 80 81 83 84 88 92 93 94 95 100 101 102 104 106 107 108 109 110 112 113 114 115 116 118 122 123 124 125 127 128 129 130 134 135 137 138 139 140 142 146 148 149 154 158 160 161 162 165 166 167 169 171 172 173 176", "1\n69 12\n5 7 10 11 12 18 20 27 28 31 47 67", "1\n74 7\n19 39 40 47 55 57 61", "1\n170 11\n14 18 37 39 80 83 103 112 124 127 131", "1\n200 1\n8", "1\n155 53\n2 3 7 9 10 11 12 20 24 26 28 31 38 39 40 51 53 56 58 63 65 66 69 70 72 74 79 81 83 88 90 92 100 103 104 106 111 113 114 115 116 121 124 126 127 128 133 136 142 143 145 148 150", "1\n161 69\n2 5 8 11 12 13 17 18 23 25 28 29 30 33 34 35 36 38 39 44 45 49 52 53 56 57 58 60 62 70 71 74 76 77 82 83 86 90 94 95 97 104 105 108 109 112 113 118 120 123 126 127 132 135 137 139 140 141 142 143 144 146 147 148 151 152 153 154 161", "1\n8 4\n1 2 3 7", "1\n12 2\n5 12", "1\n13 2\n6 12", "1\n13 2\n8 13", "1\n10 4\n1 2 3 5", "1\n200 2\n50 150", "1\n110 2\n1 110"], "outputs": ["3\n1\n4", "1\n2\n2\n1\n3\n2\n2\n3\n2\n2\n1\n4\n3\n3\n3\n2\n2\n2\n4\n2\n2\n2\n3\n2\n2\n1", "5\n4\n4\n3\n3\n3\n3\n4\n2\n2\n2\n3\n2\n2\n2\n5\n3\n2\n2\n3\n2\n2\n2\n4\n2\n2\n2\n3\n2\n2\n1", "200", "5", "4", "11", "19", "40", "193", "6", "5", "3", "5", "6", "8", "6", "51", "55"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	132	codeforces
bb71d6ab1355a5ce318f88adc38bf033	Little Xor	Little Petya likes arrays that consist of non-negative integers a lot. Recently his mom has presented him one such array consisting of n elements. Petya immediately decided to find there a segment of consecutive elements, such that the xor of all numbers from this segment was maximal possible. Help him with that. The xor operation is the bitwise exclusive "OR", that is denoted as "xor" in Pascal and "^" in C/C++/Java. The first line contains integer n (1<=≤<=n<=≤<=100) — the number of elements in the array. The second line contains the space-separated integers from the array. All numbers are non-negative integers strictly less than 230. Print a single integer — the required maximal xor of a segment of consecutive elements. Sample Input 5 1 2 1 1 2 3 1 2 7 4 4 2 4 8 Sample Output 3 7 14	{"inputs": ["5\n1 2 1 1 2", "3\n1 2 7", "4\n4 2 4 8", "5\n1 1 1 1 1", "16\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15", "20\n1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10", "100\n28 20 67 103 72 81 82 83 7 109 122 30 50 118 83 89 108 82 92 17 97 3 62 12 9 100 14 11 99 106 10 8 60 101 88 119 104 62 76 6 5 57 32 94 60 50 58 97 1 97 107 108 80 24 45 20 112 1 98 106 49 98 25 57 47 90 74 68 14 35 22 10 61 80 10 4 53 13 90 99 57 100 40 84 22 116 60 61 98 57 74 127 61 73 49 51 20 19 56 111", "99\n87 67 4 84 13 20 35 7 11 86 25 1 58 1 74 64 74 86 98 74 72 46 63 78 84 13 60 38 30 45 45 60 9 44 36 70 33 22 82 15 71 7 43 47 23 2 20 49 42 43 54 27 51 51 53 23 27 37 17 66 90 89 61 0 18 20 49 30 84 20 13 32 64 69 56 68 59 10 91 96 43 64 19 10 2 57 62 23 100 39 32 19 95 55 77 19 24 4 77", "1\n100", "2\n1 1", "2\n4 10", "99\n3511 2076 9314 3598 7737 271 4110 4454 5830 8661 8584 8227 2236 2626 1025 3806 3162 2837 6071 9627 1836 7729 6629 4054 9377 3261 1325 8859 3610 7616 5052 9736 1249 6224 7031 6074 4196 8075 4005 5419 5664 8214 4391 731 8714 8622 6122 6976 4057 1770 8025 3778 2792 994 5204 1826 6083 5438 8409 8029 1962 3133 9836 8884 1234 1776 824 1630 6523 2869 9950 8609 5397 1472 7120 5012 6490 5958 8030 7741 5077 2771 7925 9784 9456 8596 6288 8939 4779 4415 3743 5188 5574 9686 1483 4245 4769 4917 1887", "27\n78 918 443 3900 591 12 4 10 1 24 70 88 429 2 3257 65 275 2 258 62 587 625 25 26 853 728 765", "2\n3 1", "2\n3 2", "3\n7 3 1", "3\n1 7 2", "2\n7 1", "4\n1 2 7 1", "3\n10 5 1"], "outputs": ["3", "7", "14", "1", "15", "15", "127", "127", "100", "1", "14", "16383", "4027", "3", "3", "7", "7", "7", "7", "15"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	71	codeforces
bb883e074b47c2bd5d1d4f497d9eb006	Inversions problem	You are given a permutation of n numbers p1,<=p2,<=...,<=pn. We perform k operations of the following type: choose uniformly at random two indices l and r (l<=≤<=r) and reverse the order of the elements pl,<=pl<=+<=1,<=...,<=pr. Your task is to find the expected value of the number of inversions in the resulting permutation. The first line of input contains two integers n and k (1<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=109). The next line contains n integers p1,<=p2,<=...,<=pn — the given permutation. All pi are different and in range from 1 to n. The problem consists of three subproblems. The subproblems have different constraints on the input. You will get some score for the correct submission of the subproblem. The description of the subproblems follows. - In subproblem G1 (3 points), the constraints 1<=≤<=n<=≤<=6, 1<=≤<=k<=≤<=4 will hold. - In subproblem G2 (5 points), the constraints 1<=≤<=n<=≤<=30, 1<=≤<=k<=≤<=200 will hold. - In subproblem G3 (16 points), the constraints 1<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=109 will hold. Output the answer with absolute or relative error no more than 1e<=-<=9. Sample Input 3 1 1 2 3 3 4 1 3 2 Sample Output 0.833333333333333 1.458333333333334	{"inputs": ["3 1\n1 2 3", "3 4\n1 3 2", "6 1\n4 2 5 1 3 6", "6 2\n1 4 6 5 2 3", "4 4\n2 3 1 4", "4 1\n3 4 2 1", "4 3\n3 1 2 4", "4 4\n4 2 3 1", "4 1\n1 2 4 3", "5 4\n4 3 2 5 1", "5 2\n3 1 2 5 4", "5 1\n3 5 1 2 4", "6 1\n5 2 3 4 1 6", "5 2\n4 3 2 1 5", "6 1\n5 3 4 6 2 1", "6 4\n1 2 3 4 5 6", "6 4\n6 5 4 3 2 1", "1 1\n1", "1 4\n1", "2 4\n1 2", "2 4\n2 1", "3 4\n1 2 3"], "outputs": ["0.833333333333333", "1.458333333333334", "6.380952380952381", "6.954648526077097", "2.818400000000000", "4.100000000000000", "2.824000000000000", "3.285600000000000", "1.900000000000000", "5.435950617283950", "4.342222222222222", "5.066666666666666", "7.285714285714286", "4.862222222222222", "10.142857142857142", "6.280675233056186", "8.719324766943814", "0.000000000000000", "0.000000000000000", "0.493827160493827", "0.506172839506173", "1.416666666666667"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
bb9dcfed83c01117e82f8dc14ff02c18	Equalize the Remainders	You are given an array consisting of $n$ integers $a_1, a_2, \dots, a_n$, and a positive integer $m$. It is guaranteed that $m$ is a divisor of $n$. In a single move, you can choose any position $i$ between $1$ and $n$ and increase $a_i$ by $1$. Let's calculate $c_r$ ($0 \le r \le m-1)$ — the number of elements having remainder $r$ when divided by $m$. In other words, for each remainder, let's find the number of corresponding elements in $a$ with that remainder. Your task is to change the array in such a way that $c_0 = c_1 = \dots = c_{m-1} = \frac{n}{m}$. Find the minimum number of moves to satisfy the above requirement. The first line of input contains two integers $n$ and $m$ ($1 \le n \le 2 \cdot 10^5, 1 \le m \le n$). It is guaranteed that $m$ is a divisor of $n$. The second line of input contains $n$ integers $a_1, a_2, \dots, a_n$ ($0 \le a_i \le 10^9$), the elements of the array. In the first line, print a single integer — the minimum number of moves required to satisfy the following condition: for each remainder from $0$ to $m - 1$, the number of elements of the array having this remainder equals $\frac{n}{m}$. In the second line, print any array satisfying the condition and can be obtained from the given array with the minimum number of moves. The values of the elements of the resulting array must not exceed $10^{18}$. Sample Input 6 3 3 2 0 6 10 12 4 2 0 1 2 3 Sample Output 3 3 2 0 7 10 14 0 0 1 2 3	{"inputs": ["6 3\n3 2 0 6 10 12", "4 2\n0 1 2 3", "1 1\n1000000000", "6 3\n3 2 0 6 10 11", "100 25\n6745 2075 7499 7517 1776 5164 2335 2745 4465 1457 7565 2232 2486 9025 8059 9646 8017 7662 9690 3352 2306 366 7422 1073 7169 8966 4506 8225 5614 8628 2908 7452 9625 9332 7097 353 1043 8118 5794 4486 626 971 6731 6618 887 6354 4814 7307 7681 6160 9351 2579 411 3436 5570 2812 2726 4433 3220 577 5891 3861 528 2183 127 5579 6979 4005 9953 5038 9937 4792 3003 9417 8796 1565 11 2596 2486 3494 4464 9568 5512 5565 9822 9820 4848 2889 9527 2249 9860 8236 256 8434 8038 6407 5570 5922 7435 2815"], "outputs": ["3\n3 2 0 7 10 14 ", "0\n0 1 2 3 ", "0\n1000000000 ", "1\n3 2 0 7 10 11 ", "88\n6745 2075 7499 7517 1776 5164 2335 2745 4465 1457 7565 2232 2486 9025 8059 9646 8017 7662 9690 3352 2306 366 7422 1073 7169 8966 4506 8225 5614 8628 2908 7452 9625 9332 7097 353 1043 8118 5794 4486 626 971 6731 6618 887 6354 4814 7307 7681 6160 9351 2579 411 3436 5570 2812 2726 4433 3220 577 5891 3863 528 2183 127 5579 6979 4005 9953 5038 9937 4792 3005 9417 8796 1565 24 2596 2505 3494 4464 9568 5513 5566 9822 9823 4848 2899 9530 2249 9860 8259 259 8434 8038 6408 5573 5922 7435 2819 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	17	codeforces
bbad5c3797c66cec0db1fc0f3434ac7b	Whose sentence is it?	One day, liouzhou_101 got a chat record of Freda and Rainbow. Out of curiosity, he wanted to know which sentences were said by Freda, and which were said by Rainbow. According to his experience, he thought that Freda always said "lala." at the end of her sentences, while Rainbow always said "miao." at the beginning of his sentences. For each sentence in the chat record, help liouzhou_101 find whose sentence it is. The first line of the input contains an integer n (1<=≤<=n<=≤<=10), number of sentences in the chat record. Each of the next n lines contains a sentence. A sentence is a string that contains only Latin letters (A-Z, a-z), underline (_), comma (,), point (.) and space ( ). Its length doesn’t exceed 100. For each sentence, output "Freda's" if the sentence was said by Freda, "Rainbow's" if the sentence was said by Rainbow, or "OMG>.< I don't know!" if liouzhou_101 can’t recognize whose sentence it is. He can’t recognize a sentence if it begins with "miao." and ends with "lala.", or satisfies neither of the conditions. Sample Input 5 I will go to play with you lala. wow, welcome. miao.lala. miao. miao . Sample Output Freda's OMG>.< I don't know! OMG>.< I don't know! Rainbow's OMG>.< I don't know!	{"inputs": ["5\nI will go to play with you lala.\nwow, welcome.\nmiao.lala.\nmiao.\nmiao .", "10\nLpAEKiHVJrzSZqBVSSyY\nYECGBlala.\nUZeGpeM.UCwiHmmA\nqt_,.b_.LSwJtJ.\nFAnXZtHlala.\nmiao.iapelala.\nCFPlbUgObrXLejPNu.F\nZSUfvisiHyrIMjMlala.\nmiao. lala.\nd,IWSeumytrVlala.", "10\nmiao.,taUvXPVlala.\nmiao.txEeId.X_lala.\nLZIeAEd JaeBVlala.\ncKPIsWpwIlala.\nfYp.eSvn,g\nKMx,nFEslala.\nmiao.QtMyxYqiajjuM\nDutxNkCqywgcnCYskcd\ngFLKACjeqfD\n,Ss UmY.wJvcX", "10\nmiao.Plala.\nDVm,VYslala.\nmiao.rlala.\nmiao.,KQNL.fO_.QRc\nUBLCKEUePlala.\nIouS.Alala.\nmiao.lala.\nmiao.rlala.\nEJZwRJeKlala.\nmiao.Olala.", "10\nmiao.grFTpju.jCLRnZ\ng.pVHYA_Usnm\nlloWONolcMFElala.\nAW,n.JJkOTe.Nd\n.bP.HvKlala.\nGziqPGQa,lala.\nmiao.,QkOCH.vFlala.\n.PUtOwImvUsoeh \nmiao.Z,KIds.R\nmiao.,_MDzoaAiJlala.", "10\nmiao.xWfjV\nHFVrGCDQXyZ,Sbm\nLMDS.xVkTCAY.vm\nmiao.lLBglala.\nnl,jRPyClala.\nFYnHoXlala.\nmiao. oxaHE\n.WTrw_mNpOQCa\nHOk..wHYoyMhl\nQX,XpMuPIROM", "10\nJBQqiXlala.\npUNUWQRiMPCXv\nAiLnfNHWznwkC.lala.\nmiao.Dl_Oy\nxJJJkVkdfOzQBH_SmKh\nfgD_IHvdHiorE,W\nmiao.usBKixglala.\nwCpqPUzEtD\nmiao.rlala.\nmiao.JylcGvWlala.", "10\nmiao..FLhPl_Wjslala.\nmiao. tdEGtfdJlala.\nGAzEUlala.\nKCcmOa .aKBlZyYsdu.V\nmiao.lala.\njKylnM,FXK\nmiao.GBWqjGH.v\nmiao.RefxS Cni.\nOxaaEihuHQR_s,\nmiao.a,Axtlala.", "10\nNo.I_aTXlala.\nmiao.JKSCoRZS\nnOBMIlala.\nmiao.nlala.\nmiao._xqxoHIIlala.\nmiao.NJPy SWyiUDWc\nmiao.cCnahFaqqj.Xqp\nnreSMDeXPPYAQxI,W\nAktPajWimdd_qRn\nmiao.QHwKCYlala.", "10\n \n,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ ,.._ \n \nmiao.miao.miao.\nlala.lala.lala.\nlala.miao.\nmiaolala. \nmiao.lala\nmiaolala_\n,.._ abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ", "10\nduClyjMIPsEuWmx_Ce.byVoizYlTM,sF\nuZHsNip_,Mwtg,FZjM_LzPC,_pSvEOyTHfAOvoZXvxCZdgYDTCDdCAoSVZWyxXGcLgWlala.\nEGtJFPAvTEcqjkhaGxdduaQ_rmUzF.WaU, EIuX B,aVzFFpFrxpwADXuayRD azDfj \n_tJqYzXyqc.,u.F,mUYukveBPWnPq,f,dJnPHuBazdnbRHfzwNUdRbheAIjcoaPcnLvocrzcioxCapb R\n.YUBeb_zmwUt.QQuUdQIiOXtqshcsycEe,HLytHlala.\ndJndLqGBHt.GfpN.BgvsbXoLh_DIzAJOtFDmLSCYEztvPcS_GHPxivzV,NPMmSAtfk.Mg.w,A UcCt_lCD.csEzyJJBYtSMkzqiA\nmiao.qlala.\nmiao.FmDlY\nmiao.UQI.aJmnanNvRLskuVaMybDMsOlala.\nmiao.lala.", "10\nmiao.vyscfysAtWcPkpFHdwZqAQ,UPPcjhKQTlala.\nmiao.KESqus DybUuYFoWVpo..LWZh.UqEdUsTHFlKfzqkThAUPklala.\nUNoE vfZIAdxkiWKhsHPfsqRPTNQoHgAxooVLYxRzugHjo jaEHWQFF\nCCmdIwr.UkoiYWK.Z,,ZesMpISTXNgnpYnJaWquCyL,gO\n.JvOayhXK_bgoYbfAtnXg\nbvdSzRrXoGxVgWvdXnsjEnEfxDzIQo_aZVGDGrzwuAMtzVAHioMBx_DHuTxyieGbGuSRNUojOREqxBBxvCgqAOMzwIWT\nMBuaWduZmRaOGyIPzWOsBVeqtDrblAbXxmM_uRfqMvnVlLEuhVKlhidN_aigiXyq,ZEDqQAx\nmiao.wCHVCuVKNePKmIUFLL_lala.\nmiao.iAqstXHUv\n pMO yvPkNtnNwmUCao W,wW.OvIMVaEeVYHmqaniWq.ivlala.", "10\nmiao.\nmiao.jrwLBCpNaDCjyoK.PFzbwWU.h.. wfQquG_P..lala.\nmiao.LGlYdKjw__.Chlala.\nW.wtr qG KDOHj.xWxPbXIXjD_,GJZDaAZ,JBHphsjWJwSKcZAIAi\nmiao.pHsGAZQDWPJQwKC.zHjJituLgp.eUrzObTI.wrpect.FMUJqu,Zuslala.\nmiao.YVlOpXccUA_YU igbsbZbhOVwyYTyOjnWqgiTmxwAuFa.flCHn.,MtVbqxZQl_BGHXWkwijGjuL, ,ezyNlala.\nmiao.xCrVSz.aMv UOSOroDlQxWeBmlWe.FA.ZfUmviMlala.\nxebAlala.\nmiao.qVSxqf vOTlala.\nD.oBUwsLQRgXAoNkQJhQN.w.oMhuvtujnmiwgQYMfjlNTSHh .lSKgI.OEp", "10\nZXXzYlTiQU\nkXE.DdcbOojSaSgjMcFBPubKHefEVAzbi,PDFgSZIz,lala.\nxEfrTCjKhhwBC.UNmJXgTGUdkQeVDlala.\nLfaEw.jvMmuOBWtfoiJNtDIlQAVWNU,xWK_efBBtfkM\nqtBpqKZMWZMX_NKrUAEKYyQcLZWQlqbM\nmiao.PrJEbUtInremuaKRItqXOrfQEjQcAak VQ\nMpGCq awvQaHRvDr uvtVMKsvZI\nmiao.A.RVGu.szCEp.pXQJwL EuTltlN.WradoTvWHJyhcNSoulala.\nmiao.rzlUHzUdxtDRpWRuc,QZwEBfsKKGHMLGtFymPPQdptLFlzZ_ORWqrlfOrlntuDkpXEvz.CxwAsFYUvpnOnFWG\nmiao.VXUoNBwlgBwcna_n.CgAAcKKUuiVA.doOJKHpMdwNwlHAcLpdfN.Awa SthrlEWpUcuOonUTxIQNszYcHDXxnhArrM..A", "10\nmiao.qbxBFzrjtWv.yOk\nDBgi,loApO AACrGnwssCHN\nmiao.LV.wbQEE_V.BSAtdTIHTQOJVJ_nGOthbL,nJvQ.UeWFpsa.GGsK_Uv,HQxHS,AN_bkrolala.\nmiao.tBEqk rIQuByGKhfq_iP.BW,nySZEfrfySEcqnnIzxC,lrjIiivbxlkoVXJFiegGFRn NO,txGPhVBcv.CVhMmNO zlala.\nmiao.aBZWDWxk.wkR ,NyCzGxJnJDqBZpetdUPAmmBZDXl_Tbflala.\nmiao. XN,uMwWm. VqloYr..jTLszlala.\n.rshcgfZ.eZOdMu_RMh\nmiao.ahiwpECEe.lala.\nLeoUSroTekQAMSO__M L_ZEeRD_tUihYvQETFB,RzJmFtFiKrU\nBtygQG_OoFEFBL.KsVWTYbtqtalXoStFCZ RINHda.NuLmlkRB.vAQJFvelbsfoJ.T,M sJn", "10\nYoYBCcaqhXLfvKKf.UYMODTHyPZlala.\ncxgWn J.Q\nmiao.nwH.IHntgKYDhdsjU DMTHXEVRyeJP ZaAecCIBJXuv.YjhEmtbjvjKnK.U,oc,x\nmiao.EcQ.FDtRJgmpAzxhq.RwXBLxjyC,IeMqaFoheMPFCGWBcwUAFnbiwlbz_fcsEGPfJaeryCtFocBNEWTlala.\nmiao.W\nmiao. ZQpIeyCXJSnFgAIzu.THfrmyoogYWQzFqblala.\nmiao.ifzdCwnTDcxpvdr OTC.YqPv.MKDp..utICtAsbfYyGlala.\nmiao.\nmiao.tS.U.wH.s,CxORZJsBAHLi,fXeoDJWVBH\nrcUMpeupOVRKrcIRAvU.rP kgUEfoeXcrFPQOBYG.BNvAQPg.XHMWizhLpZNljXc .LQmVXCi", "10\nlala.\nmiao.milalala.lmmialamiao.la.o.iao.a.ao.\nmialala.o.\nmiao.millala.allala.amiao..miao.miao.lala.ao.miammiao.iao.o.\nmiao.miaomiao..\nlalmiao.amiao..\nmiao.lala.lamiamiaolala..o.lalala.miao..\nmlala.iao.lalamiao..\nlmlala.iao.alalamiao.lmialala.lala.miao.o.alala..lala..lalmiaomiao..lalmiao.a.lalamiao..miao.alala..\nlalllamiao.la.lala.alamiao.lalalala.lala..miao.lamiao.la.lallalamiao..a..a.", "10\nlalllala.ala.lala.a.mmimiao.aomiao.lllala.ala.amiao.la.mialalala.la.o..imiao.miao.amlala.iao.o.\nmilala.alllala.ala.amiao.lamiao..o.\nlala.lalalala..lalalala..\nlala.miao.\nmimiao.ao.lala.\nlalmiao.amlala.iamialala.o.o..\nlalammlala.iaolammiao.imiao.ao.la..iao..\nmiao.mialala.omiao..mlala.iaolala..\nmiamiao.o.llallala.ala.la.miao.ala.miao.mimialmiao.ala.o.alala.miaomiao..olala..\nmialala.lamiao.la.lala.miao.ollala.allala.ala.lmiaommiao.imiao.ao.lallallala.a.miao.a..a..", "10\nlamiao.lamiao.mimiao.ao..\nllala.almiaomiao..lala.miao.a.\nlalala.lala.lalala.lala.lalala..la.\nlalala.la.miao.\nmiao.llalallala.miao.a.la.lala.almimiao.ao.a.\nmiao.mlala.ilala.aomilala.ao..\nmilala.ao.\nmmiao.iao.\nmlala.lala.ialalmiao.alala..olala.lala..\nlala.lmlalalalalala...iao.milala.aommiao.iao..alamiaolallala.milala.ao.a..lalalmiao.a..llala.amiao..", "4\n \n miao. \n lala. \n ", "1\nMiao.", "1\nm", "1\nMiAo.sdsdlala.", "1\nLalA.", "3\n.\nm\nl"], "outputs": ["Freda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!", "OMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nFreda's", "OMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nFreda's\nOMG>.< I don't know!\nFreda's\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nRainbow's\nFreda's\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nOMG>.< I don't know!", "Rainbow's\nOMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nFreda's\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!", "Rainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nFreda's\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!", "Freda's\nOMG>.< I don't know!\nFreda's\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!", "Freda's\nRainbow's\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nFreda's", "Rainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nFreda's\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nRainbow's", "Rainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!", "Freda's\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nRainbow's\nOMG>.< I don't know!", "Freda's\nRainbow's\nOMG>.< I don't know!\nRainbow's\nRainbow's\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nFreda's\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nRainbow's\nRainbow's\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!", "OMG>.< I don't know!", "OMG>.< I don't know!", "Freda's", "OMG>.< I don't know!", "OMG>.< I don't know!\nOMG>.< I don't know!\nOMG>.< I don't know!"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	81	codeforces
bbbbaaae57ce7ca35845708495dd1699	Mishap in Club	Polycarpus just has been out of luck lately! As soon as he found a job in the "Binary Cat" cafe, the club got burgled. All ice-cream was stolen. On the burglary night Polycarpus kept a careful record of all club visitors. Each time a visitor entered the club, Polycarpus put down character "+" in his notes. Similarly, each time a visitor left the club, Polycarpus put character "-" in his notes. We know that all cases of going in and out happened consecutively, that is, no two events happened at the same time. Polycarpus doesn't remember whether there was somebody in the club at the moment when his shift begun and at the moment when it ended. Right now the police wonders what minimum number of distinct people Polycarpus could have seen. Assume that he sees anybody coming in or out of the club. Each person could have come in or out an arbitrary number of times. The only line of the input contains a sequence of characters "+" and "-", the characters are written one after another without any separators. The characters are written in the order, in which the corresponding events occurred. The given sequence has length from 1 to 300 characters, inclusive. Print the sought minimum number of people Sample Input +-+-+ --- Sample Output 1 3	{"inputs": ["+-+-+", "---", "-", "--", "---", "----", "---+", "--+-", "--++", "-+--", "-++", "-++-", "+", "+-", "+--", "+--+", "++--", "-+++--+-++--+-+--+-+", "++-++--+++++-+++++---+++-++-++-", "----+-+--++---++---++-+-----+--", "-+++---+++++++++++++-++-++++++-++-+-+++-", "++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++", "------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------", "++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++-+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++", "++++++++++++++++++++-+++++++++++++++++++++++++++++++++++++++++++++++++++++++-+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++", "+++++++++++++++++++++++++++++++++++++++++-++++++++-++++++++++++-+++++++++++++++++++++++++++++++++++++++++++++++++++++-+++++++++++++++++++++++++-++++++++++++++++++++++++-++++-+++++++++++++-++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++-+++-+++++++++++++++++", "++++-+---+++--++++-++-++++++++-++-++++-++++++-+-+-+++--+-++++++-+++-++-+++-++++-++++-+-+----+++++---++++-+---+++--+++++-+++-+-++++++----+--+++++++++-+--+++-+-+-++++++--+-+-+-+-++--+-+-----++++++-+++-++--+++++++++---+-++++++-++-++++-+--+-++-++++-+-+--++-+--+++-+-++++++++++++-+++-+----++++++++--+-+-++", "+----++-----+----+++--++---+++--+-++++-++---++++++--++++--++-++--++--++----++++---+--+++----++--++--++--+--++++++++--++--+++----+++----++----++-+--+---+--+-++--+--+--+-+--+---++-+-++--+++++-++------+++-++--+--+--+++++++--++-+--+-+--++++-++--+---+-+-++-+-++----+-++++++-+++--+----++-+--++-----+++-++-+", "-+++----+-++--+-+----+--+++++----+---+-++-+---+++--+---++-+-----+----+------+--+----++-++-----+++--+---+-+-----++++------+--+-----++---+---+---+-++------++++--+-+-------------+---+--+-+--------++---+-++---+-----+++--+---+-++-+---+-+---+++--++-----++------+----+---+---+--+-+-++-+---++--------+----++", "----------+-----------------------------------------------------------+-+-------------+--------------------------------------------------------------------------------+--+-----+-+-------------------------------------------+-----------------------------------------------------------------+-----------"], "outputs": ["1", "3", "1", "2", "3", "4", "3", "2", "2", "2", "2", "2", "1", "1", "2", "2", "2", "3", "12", "11", "22", "300", "300", "298", "296", "280", "100", "15", "103", "280"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	40	codeforces
bbd37e23be19f61cce43427551e0e712	The Same Calendar	The girl Taylor has a beautiful calendar for the year y. In the calendar all days are given with their days of week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday and Sunday. The calendar is so beautiful that she wants to know what is the next year after y when the calendar will be exactly the same. Help Taylor to find that year. Note that leap years has 366 days. The year is leap if it is divisible by 400 or it is divisible by 4, but not by 100 ([https://en.wikipedia.org/wiki/Leap_year](https://en.wikipedia.org/wiki/Leap_year)). The only line contains integer y (1000<=≤<=y<=<<=100'000) — the year of the calendar. Print the only integer y' — the next year after y when the calendar will be the same. Note that you should find the first year after y with the same calendar. Sample Input 2016 2000 50501 Sample Output 2044 2028 50507	{"inputs": ["2016", "2000", "50501", "1000", "1900", "1899", "99999", "50000", "99900", "12345", "1004", "2100", "1313", "1872", "2098", "2072", "2002", "1179", "2096", "1096", "1796", "2014", "2006", "1874", "1884", "2342", "2010", "2097", "1072", "1191", "2896", "1797", "1002", "99988", "1788", "1994", "5094", "99996", "3998", "49376"], "outputs": ["2044", "2028", "50507", "1006", "1906", "1905", "100010", "50028", "99906", "12351", "1032", "2106", "1319", "1912", "2110", "2112", "2013", "1190", "2108", "1108", "1808", "2025", "2017", "1885", "1924", "2353", "2021", "2109", "1112", "1202", "2908", "1809", "1013", "100016", "1828", "2005", "5100", "100024", "4009", "49416"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	43	codeforces
bbda5083b762ef3b2b0b127c37da519c	Jumping Jack	Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump will be exactly one longer than the previous one. He can go either left or right with each jump. He wonders how many jumps he needs to reach x. The input data consists of only one integer x (<=-<=109<=≤<=x<=≤<=109). Output the minimal number of jumps that Jack requires to reach x. Sample Input 2 6 0 Sample Output 3 3 0	{"inputs": ["2", "6", "0", "-1000000000", "999961560", "999961561", "999961559", "-488979819", "-865918189", "-278253406", "-87275307", "103702792", "294680891", "485658989", "676637088", "867615187", "-941406715", "-897912263", "-706934164", "-790244010", "16417015", "823078041", "-517744582", "288916443", "-904422532", "-245245154", "561415872", "-779406751", "27254274", "845249034"], "outputs": ["3", "3", "0", "44723", "44720", "44721", "44721", "31273", "41617", "23591", "13213", "14403", "24277", "31166", "36787", "41657", "43393", "42377", "37603", "39755", "5730", "40573", "32179", "24038", "42531", "22147", "33511", "39482", "7383", "41116"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	61	codeforces
bbfbef8cfdb66fcb1844230b423e42e2	XOR and OR	The Bitlandians are quite weird people. They do everything differently. They have a different alphabet so they have a different definition for a string. A Bitlandish string is a string made only of characters "0" and "1". BitHaval (the mayor of Bitland) loves to play with Bitlandish strings. He takes some Bitlandish string a, and applies several (possibly zero) operations to it. In one operation the mayor may take any two adjacent characters of a string, define one of them as x and the other one as y. Then he calculates two values p and q: p<==<=x xor y, q<==<=x or y. Then he replaces one of the two taken characters by p and the other one by q. The xor operation means the bitwise excluding OR operation. The or operation is the bitwise OR operation. So for example one operation can transform string 11 to string 10 or to string 01. String 1 cannot be transformed into any other string. You've got two Bitlandish strings a and b. Your task is to check if it is possible for BitHaval to transform string a to string b in several (possibly zero) described operations. The first line contains Bitlandish string a, the second line contains Bitlandish string b. The strings can have different lengths. It is guaranteed that the given strings only consist of characters "0" and "1". The strings are not empty, their length doesn't exceed 106. Print "YES" if a can be transformed into b, otherwise print "NO". Please do not print the quotes. Sample Input 11 10 1 01 000 101 Sample Output YES NO NO	{"inputs": ["11\n10", "1\n01", "000\n101", "1101\n1111", "11000001\n00000001", "01\n10", "0000\n1110", "010101\n101010", "0\n1", "1\n1", "0\n0", "1\n0", "100\n11111", "1000000000000000000000000000000000000011111111000000000000\n0111111111100000000000111111111000000000000000111111110001", "0000000000000000000000000000000000000000\n00000000000000000000000000000000000000000", "1\n1", "0\n0", "1\n0", "10\n00", "11\n00", "111111111\n100000000"], "outputs": ["YES", "NO", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
bc00254d261298878bf4229043d2b405	Hamburgers	Polycarpus loves hamburgers very much. He especially adores the hamburgers he makes with his own hands. Polycarpus thinks that there are only three decent ingredients to make hamburgers from: a bread, sausage and cheese. He writes down the recipe of his favorite "Le Hamburger de Polycarpus" as a string of letters 'B' (bread), 'S' (sausage) и 'C' (cheese). The ingredients in the recipe go from bottom to top, for example, recipe "ВSCBS" represents the hamburger where the ingredients go from bottom to top as bread, sausage, cheese, bread and sausage again. Polycarpus has nb pieces of bread, ns pieces of sausage and nc pieces of cheese in the kitchen. Besides, the shop nearby has all three ingredients, the prices are pb rubles for a piece of bread, ps for a piece of sausage and pc for a piece of cheese. Polycarpus has r rubles and he is ready to shop on them. What maximum number of hamburgers can he cook? You can assume that Polycarpus cannot break or slice any of the pieces of bread, sausage or cheese. Besides, the shop has an unlimited number of pieces of each ingredient. The first line of the input contains a non-empty string that describes the recipe of "Le Hamburger de Polycarpus". The length of the string doesn't exceed 100, the string contains only letters 'B' (uppercase English B), 'S' (uppercase English S) and 'C' (uppercase English C). The second line contains three integers nb, ns, nc (1<=≤<=nb,<=ns,<=nc<=≤<=100) — the number of the pieces of bread, sausage and cheese on Polycarpus' kitchen. The third line contains three integers pb, ps, pc (1<=≤<=pb,<=ps,<=pc<=≤<=100) — the price of one piece of bread, sausage and cheese in the shop. Finally, the fourth line contains integer r (1<=≤<=r<=≤<=1012) — the number of rubles Polycarpus has. Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier. Print the maximum number of hamburgers Polycarpus can make. If he can't make any hamburger, print 0. Sample Input BBBSSC 6 4 1 1 2 3 4 BBC 1 10 1 1 10 1 21 BSC 1 1 1 1 1 3 1000000000000 Sample Output 2 7 200000000001	{"inputs": ["BBBSSC\n6 4 1\n1 2 3\n4", "BBC\n1 10 1\n1 10 1\n21", "BSC\n1 1 1\n1 1 3\n1000000000000", "B\n1 1 1\n1 1 1\n381", "BSC\n3 5 6\n7 3 9\n100", "BSC\n100 1 1\n100 1 1\n100", "SBBCCSBB\n1 50 100\n31 59 21\n100000", "BBBBCCCCCCCCCCCCCCCCCCCCSSSSBBBBBBBBSS\n100 100 100\n1 1 1\n3628800", "BBBBBBBBBBCCCCCCCCCCCCCCCCCCCCSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS\n10 20 40\n100 100 100\n200", "BBBBBBBBBBCCCCCCCCCCCCCCCCCCCCSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS\n10 20 40\n100 100 100\n2000", "BBBBBBBBBBCCCCCCCCCCCCCCCCCCCCSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS\n10 20 40\n100 100 100\n300", "BBBBBBBBBBCCCCCCCCCCCCCCCCCCCCSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS\n10 20 40\n100 100 100\n300000000", "BBBBBBBBBBCCCCCCCCCCCCCCCCCCCCSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS\n10 20 40\n100 100 100\n914159265358", "SSSSSSSSSSBBBBBBBBBCCCCCCCCCCCCCCCCCCCSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSBB\n31 53 97\n13 17 31\n914159265358", "BBBCSBSBBSSSSCCCCBBCSBBBBSSBBBCBSCCSSCSSCSBSSSCCCCBSCSSBSSSCCCBBCCCSCBCBBCCSCCCCSBBCCBBBBCCCCCCBSSCB\n91 87 17\n64 44 43\n958532915587", "CSSCBBCCCSBSCBBBCSBBBCBSBCSCBCSCBCBSBCBCSSBBSBBCBBBBSCSBBCCBCCBCBBSBSBCSCSBBSSBBCSSBCSCSCCSSBCBBCBSB\n56 34 48\n78 6 96\n904174875419", "CCSCCCSBBBSCBSCSCCSSBBBSSBBBSBBBCBCSSBCSCBBCCCBCBCBCCCSSBSBBCCCCCBBSCBSCBCBBCBBCSSBCSBSSCCSCCSCCBBBS\n33 73 67\n4 56 42\n886653164314", "SBCSSCBBSSBCSSBBBSSBSCBSSSCBBSBBBBCSBCSBSCBSCBSCBSBSSCCCCBSBCCBCBSCCCBSCCBSBBCBSSCCCCSBSBBBSSSBCSCBC\n94 16 85\n14 18 91\n836590091442", "BSCSBSCCSCSSCCCSBCSSBCBBSCCBSCCSSSSSSSSSCCSBSCCBBCBBSBSCCCCBCSBSBSSBBBBBSSBSSCBCCSSBSSSCBBCSBBSBCCCB\n67 54 8\n36 73 37\n782232051273", "CBBCBSBCCSCBSSCCBCSBCSBBSCBBCSCCBSCCSCSBBSSBSBSCBBSBBCSSSSBBBBSBBCBCSBBCBCSSBBCSBSCCSCSBCSCBSCCBBCSC\n71 71 52\n52 88 3\n654400055575", "CBBCBSBCCSCBSSCCBCSBCSBBSCBBCSCCBSCCSCSBBSBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCBBCSC\n100 1 1\n1 17 23\n954400055575", "C\n100 100 100\n1 1 1\n1000000000000", "SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS\n100 100 100\n100 100 100\n1000000000000", "B\n100 100 100\n1 1 1\n1", "SC\n2 1 1\n1 1 1\n100000000000", "B\n100 1 1\n1 1 1\n1000000000000", "BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB\n1 1 1\n100 100 100\n1000000000000", "CC\n1 1 1\n100 100 100\n1", "B\n100 100 100\n1 1 1\n1000000000000", "BSC\n100 100 100\n1 1 1\n1000000000000", "BSC\n100 100 100\n1 1 1\n1"], "outputs": ["2", "7", "200000000001", "382", "10", "51", "370", "95502", "0", "1", "0", "42858", "130594181", "647421579", "191668251", "140968956", "277425898", "217522127", "154164772", "137826467", "1355681897", "1000000000100", "100000001", "101", "50000000001", "1000000000100", "100000000", "0", "1000000000100", "333333333433", "100"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	187	codeforces
bc032e5d3c2c75050a8a48f992de8d6e	Fibonacci Sums	Fibonacci numbers have the following form: Let's consider some non-empty set S<==<={s1,<=s2,<=...,<=sk}, consisting of different Fibonacci numbers. Let's find the sum of values of this set's elements: Let's call the set S a number n's decomposition into Fibonacci sum. It's easy to see that several numbers have several decompositions into Fibonacci sum. For example, for 13 we have 13,<=5<=+<=8,<=2<=+<=3<=+<=8 — three decompositions, and for 16: 3<=+<=13,<=1<=+<=2<=+<=13,<=3<=+<=5<=+<=8,<=1<=+<=2<=+<=5<=+<=8 — four decompositions. By the given number n determine the number of its possible different decompositions into Fibonacci sum. The first line contains an integer t — the number of tests (1<=≤<=t<=≤<=105). Each of the following t lines contains one test. Each test is an integer n (1<=≤<=n<=≤<=1018). Please do not use the %lld specificator to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specificator. For each input data test print a single number on a single line — the answer to the problem. Sample Input 2 13 16 Sample Output 3 4	{"inputs": ["2\n13\n16", "10\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10", "10\n24\n37\n42\n58\n60\n73\n79\n84\n92\n99", "5\n484775665757\n968685776575\n687675666422\n348587665784\n373875686864", "1\n123456789101112", "22\n304056783818718320\n491974210728665289\n187917426909946968\n796030994547383610\n912170329762608884\n983952450306818690\n958440306146823493\n882642089000772193\n728253142723222890\n798004545631811295\n339945818819306128\n550043889183050965\n889989708002357094\n679891637638612257\n420196140727489672\n160500643816367088\n259695496911122585\n420196140727489673\n679891637638612258\n679891637638612256\n491974210728665288\n796030994547383611"], "outputs": ["3\n4", "1\n1\n2\n1\n2\n2\n1\n3\n2\n2", "5\n6\n6\n7\n6\n6\n8\n7\n8\n6", "117120\n155520\n320160\n115920\n84600", "2868360", "433494437\n433494437\n433494437\n433494437\n528734760\n509752320\n470315160\n465835968\n437082800\n425880000\n268435456\n268435456\n268435456\n1\n1\n42\n42\n43\n43\n43\n701408733\n866988874"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
bc4528d68579e1604b5cfcbe0e276380	Candies	After passing a test, Vasya got himself a box of $n$ candies. He decided to eat an equal amount of candies each morning until there are no more candies. However, Petya also noticed the box and decided to get some candies for himself. This means the process of eating candies is the following: in the beginning Vasya chooses a single integer $k$, same for all days. After that, in the morning he eats $k$ candies from the box (if there are less than $k$ candies in the box, he eats them all), then in the evening Petya eats $10\%$ of the candies remaining in the box. If there are still candies left in the box, the process repeats — next day Vasya eats $k$ candies again, and Petya — $10\%$ of the candies left in a box, and so on. If the amount of candies in the box is not divisible by $10$, Petya rounds the amount he takes from the box down. For example, if there were $97$ candies in the box, Petya would eat only $9$ of them. In particular, if there are less than $10$ candies in a box, Petya won't eat any at all. Your task is to find out the minimal amount of $k$ that can be chosen by Vasya so that he would eat at least half of the $n$ candies he initially got. Note that the number $k$ must be integer. The first line contains a single integer $n$ ($1 \leq n \leq 10^{18}$) — the initial amount of candies in the box. Output a single integer — the minimal amount of $k$ that would allow Vasya to eat at least half of candies he got. Sample Input 68 Sample Output 3	{"inputs": ["68", "1", "2", "42", "43", "756", "999999972", "999999973", "1000000000000000000", "6", "3", "4", "5", "66", "67", "1000", "10000", "100500", "1000000", "10000000", "100000000", "123456789", "543212345", "505050505", "777777777", "888888871", "1000000000", "999999999999999973", "999999999999999998", "999999999999999999", "100000000000000000", "540776028375043656", "210364830044445976", "297107279239074256", "773524766411950187", "228684941775227220", "878782039723446310", "615090701338187389", "325990422297859188", "255163492355051023", "276392003308849171", "601", "983", "729", "70", "703", "257", "526", "466", "738", "116", "888888888888888887", "888888888888888888", "888888888888888889", "999999999999999969", "999999999999999970", "999999999999999971", "999999999999999943", "999999999999999944", "999999999999999945", "999999999999999917", "999999999999999918", "999999999999999919", "99999999999999957", "99999999999999958", "99999999999999959", "888888888888888853", "888888888888888854", "888888888888888855"], "outputs": ["3", "1", "1", "1", "2", "29", "39259423", "39259424", "39259424579862572", "1", "1", "1", "1", "2", "3", "39", "392", "3945", "39259", "392594", "3925942", "4846842", "21326204", "19827992", "30535108", "34897266", "39259424", "39259424579862572", "39259424579862572", "39259424579862573", "3925942457986257", "21230555700587649", "8258802179385535", "11664260821414605", "30368137227605772", "8978039224174797", "34500477210660436", "24148106998961343", "12798196397960353", "10017571883647466", "10850991008380891", "23", "38", "29", "3", "28", "10", "20", "18", "29", "5", "34897266293211176", "34897266293211176", "34897266293211176", "39259424579862571", "39259424579862571", "39259424579862572", "39259424579862571", "39259424579862570", "39259424579862571", "39259424579862570", "39259424579862569", "39259424579862570", "3925942457986255", "3925942457986255", "3925942457986256", "34897266293211174", "34897266293211174", "34897266293211175"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	56	codeforces
bc613d8c5d133aa3218104a12bd2c957	Ant colony	Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1<=≤<=i<=≤<=n) has a strength si. In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He chooses two numbers l and r (1<=≤<=l<=≤<=r<=≤<=n) and each pair of ants with indices between l and r (inclusively) will fight. When two ants i and j fight, ant i gets one battle point only if si divides sj (also, ant j gets one battle point only if sj divides si). After all fights have been finished, Mole makes the ranking. An ant i, with vi battle points obtained, is going to be freed only if vi<==<=r<=-<=l, or in other words only if it took a point in every fight it participated. After that, Mole eats the rest of the ants. Note that there can be many ants freed or even none. In order to choose the best sequence, Mole gives you t segments [li,<=ri] and asks for each of them how many ants is he going to eat if those ants fight. The first line contains one integer n (1<=≤<=n<=≤<=105), the size of the ant colony. The second line contains n integers s1,<=s2,<=...,<=sn (1<=≤<=si<=≤<=109), the strengths of the ants. The third line contains one integer t (1<=≤<=t<=≤<=105), the number of test cases. Each of the next t lines contains two integers li and ri (1<=≤<=li<=≤<=ri<=≤<=n), describing one query. Print to the standard output t lines. The i-th line contains number of ants that Mole eats from the segment [li,<=ri]. Sample Input 5 1 3 2 4 2 4 1 5 2 5 3 5 4 5 Sample Output 4 4 1 1	{"inputs": ["5\n1 3 2 4 2\n4\n1 5\n2 5\n3 5\n4 5"], "outputs": ["4\n4\n1\n1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
bc64e74229636684b4bed21608cbda11	Billiard	Consider a [billiard table](https://en.wikipedia.org/wiki/Billiard_table) of rectangular size $n \times m$ with four pockets. Let's introduce a coordinate system with the origin at the lower left corner (see the picture). There is one ball at the point $(x, y)$ currently. Max comes to the table and strikes the ball. The ball starts moving along a line that is parallel to one of the axes or that makes a $45^{\circ}$ angle with them. We will assume that: 1. the angles between the directions of the ball before and after a collision with a side are equal, 1. the ball moves indefinitely long, it only stops when it falls into a pocket, 1. the ball can be considered as a point, it falls into a pocket if and only if its coordinates coincide with one of the pockets, 1. initially the ball is not in a pocket. Note that the ball can move along some side, in this case the ball will just fall into the pocket at the end of the side. Your task is to determine whether the ball will fall into a pocket eventually, and if yes, which of the four pockets it will be. The only line contains $6$ integers $n$, $m$, $x$, $y$, $v_x$, $v_y$ ($1 \leq n, m \leq 10^9$, $0 \leq x \leq n$; $0 \leq y \leq m$; $-1 \leq v_x, v_y \leq 1$; $(v_x, v_y) \neq (0, 0)$) — the width of the table, the length of the table, the $x$-coordinate of the initial position of the ball, the $y$-coordinate of the initial position of the ball, the $x$-component of its initial speed and the $y$-component of its initial speed, respectively. It is guaranteed that the ball is not initially in a pocket. Print the coordinates of the pocket the ball will fall into, or $-1$ if the ball will move indefinitely. Sample Input 4 3 2 2 -1 1 4 4 2 0 1 1 10 10 10 1 -1 0 Sample Output 0 0-1-1	{"inputs": ["4 3 2 2 -1 1", "4 4 2 0 1 1", "10 10 10 1 -1 0", "1000000000 1000000000 1 1000000000 0 1", "2 1 1 0 -1 -1", "4 2 1 2 1 1", "5 3 4 3 1 -1", "15 9 1 1 1 1", "15 9 1 1 -1 -1", "15 9 2 1 1 1", "15 9 2 1 -1 1", "1000000000 999999999 999999998 999999999 -1 -1", "1000000000 999999999 999999998 999999999 -1 1", "15 9 3 2 1 1", "15 9 3 2 1 -1", "4 4 0 1 0 1", "4 4 4 2 0 -1", "1000000000 999999999 999999999 999999999 1 1", "1000000000 999999999 999999998 999999999 1 1", "1000000000 999999999 999999998 999999999 1 -1", "1000000000 999999999 999999998 999999999 0 1", "1000000000 999999999 999999998 999999999 -1 0", "1 99 0 16 -1 1", "6 8 1 1 1 1", "6 10 1 1 1 1", "8 6 7 1 -1 1", "10009 10007 1 1 1 1", "10007 10009 10006 10008 -1 -1", "1000 999 1 998 1 -1", "500 500 250 250 -1 1", "2705444 415131525 949293 337120042 1 -1", "603278410 844534002 499505824 32181172 1 -1", "316347709 122791181 255721626 19148895 -1 1", "226591495 303844168 64300938 148467902 -1 -1", "682138812 116415655 516825996 73682791 -1 1", "305675046 505376350 144451750 295580797 -1 1", "313157692 571680270 238352863 235464142 1 -1", "120717601 973035857 103171773 511250918 -1 1", "41373770 597127671 31867608 404367855 -1 1", "827285013 307724101 775951207 175683367 -1 -1", "110474424 613900860 31471099 442410471 -1 1", "84035810 39157280 10865763 24269978 1 -1", "75744115 329085002 22395692 81831548 -1 1", "20597226 82154419 5899110 71189386 1 1", "550269655 264187669 141601786 53516425 1 -1", "224819588 978615384 68538326 805268586 1 1", "979444430 110858783 607921615 88320790 1 -1", "853950494 911554949 428001551 108479491 1 1", "810387002 412176212 187695958 236085023 1 1", "20877471 722211317 8457280 75966699 -1 -1", "542708351 3475408 103232934 399149 1 1", "30609041 976052297 4229728 158676967 -1 1", "495082283 937762241 250777046 412284609 1 1", "68076815 985943633 40657983 165191148 1 -1", "209408006 202717192 115684862 96677080 -1 -1", "651520659 433737829 645844796 133999548 1 -1", "835624982 341676615 379293679 54053933 1 -1", "943609111 405753192 556398014 348647907 1 -1", "590709848 332238455 546245223 240305069 -1 1", "320049957 92820858 176731509 15650804 1 1", "233140029 827954502 99465884 170396111 1 1", "760904646 962606170 641547160 113696561 -1 1", "584801838 775270595 121061956 644380885 -1 1", "141190266 126518281 76515989 109124404 1 1", "225067174 487662889 175063389 447988824 1 1", "814170008 703690544 6953086 439080555 -1 1", "12671644 216092609 3707378 92213588 1 1", "686521539 766868053 668178904 36804229 1 1", "43760214 59779641 32562470 43565961 -1 1", "281776735 833828834 271604381 491447288 -1 1", "362762211 732244195 63812822 258610562 -1 1", "312319019 933972106 103989975 544805243 1 -1", "142096067 231234738 40134344 206132422 -1 1", "289285219 692430999 249276742 628721059 1 -1", "490696330 492707826 183410939 115542637 -1 -1", "916524063 555774494 499847875 268662592 -1 1", "101123973 722433301 46988094 586973439 -1 1", "808357574 854008109 9323335 342356143 -1 -1", "257447593 468889343 162885112 15431794 1 1", "688226257 305863798 134250684 285725084 -1 -1", "836255310 741706431 648685681 396741892 1 -1", "480678700 670120443 423401724 177051387 1 1", "35550087 590484118 10858303 37118846 1 1", "491475453 334831307 136826756 228553610 1 -1", "172057628 368934073 117631597 83410362 1 1", "611927194 869083092 295778083 541333563 -1 -1", "329666407 901295668 90510437 485008861 1 -1", "978089453 426264909 388420346 53798427 -1 1", "242449067 548221648 24810672 63078584 1 1", "583053442 353408 240939980 17207 -1 1", "10 9 8 9 -1 1", "999999997 999999999 500 500 -1 1", "1000000000 1000000000 999 100 -1 -1", "7 5 2 3 1 0", "11 13 5 7 -1 -1", "500 1000 200 200 1 1", "500 995 1 1 1 1", "1 100 0 1 1 1", "1 100 0 1 1 0", "999999999 999999998 2 3 -1 1", "500000000 499999999 499999999 499999999 1 1"], "outputs": ["0 0", "-1", "-1", "-1", "0 1", "-1", "0 3", "15 9", "0 0", "-1", "15 0", "1000000000 999999999", "1000000000 999999999", "-1", "-1", "0 4", "4 0", "1000000000 0", "0 999999999", "0 999999999", "-1", "0 999999999", "1 99", "0 8", "6 10", "0 0", "10009 10007", "0 0", "1000 999", "0 500", "2705444 415131525", "603278410 844534002", "316347709 0", "0 303844168", "0 116415655", "-1", "-1", "120717601 0", "41373770 597127671", "827285013 307724101", "-1", "-1", "0 0", "0 0", "550269655 0", "224819588 978615384", "979444430 110858783", "853950494 0", "-1", "0 722211317", "542708351 3475408", "30609041 0", "495082283 0", "0 985943633", "209408006 202717192", "0 0", "835624982 0", "943609111 0", "0 0", "-1", "233140029 827954502", "-1", "0 775270595", "0 126518281", "225067174 487662889", "-1", "12671644 0", "686521539 0", "-1", "281776735 833828834", "362762211 732244195", "0 0", "0 231234738", "0 692430999", "490696330 0", "916524063 555774494", "101123973 0", "0 0", "-1", "0 305863798", "-1", "480678700 670120443", "35550087 590484118", "491475453 334831307", "172057628 368934073", "0 869083092", "-1", "0 426264909", "0 548221648", "-1", "10 9", "0 0", "-1", "-1", "0 0", "0 1000", "500 0", "1 100", "-1", "999999999 0", "500000000 0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	5	codeforces
bc675e3dd359f3855d27c61fbbe05bb0	Bear and Strings	The bear has a string s<==<=s1s2... s\|s\| (record \|s\| is the string's length), consisting of lowercase English letters. The bear wants to count the number of such pairs of indices i,<=j (1<=≤<=i<=≤<=j<=≤<=\|s\|), that string x(i,<=j)<==<=sisi<=+<=1... sj contains at least one string "bear" as a substring. String x(i,<=j) contains string "bear", if there is such index k (i<=≤<=k<=≤<=j<=-<=3), that sk<==<=b, sk<=+<=1<==<=e, sk<=+<=2<==<=a, sk<=+<=3<==<=r. Help the bear cope with the given problem. The first line contains a non-empty string s (1<=≤<=\|s\|<=≤<=5000). It is guaranteed that the string only consists of lowercase English letters. Print a single number — the answer to the problem. Sample Input bearbtear bearaabearc Sample Output 6 20	{"inputs": ["bearbtear", "bearaabearc", "pbearbearhbearzqbearjkterasjhy", "pbearjbearbebearnbabcffbearbearwubearjezpiorrbearbearjbdlbearbearqbearjbearwipmsbearoaftrsebearzsnqb", "bear", "a", "be"], "outputs": ["6", "20", "291", "4419", "1", "0", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	145	codeforces
bc6d7c53a34b7bb783f08170fd4f3ffb	Subsequences	For the given sequence with n different elements find the number of increasing subsequences with k<=+<=1 elements. It is guaranteed that the answer is not greater than 8·1018. First line contain two integer values n and k (1<=≤<=n<=≤<=105,<=0<=≤<=k<=≤<=10) — the length of sequence and the number of elements in increasing subsequences. Next n lines contains one integer ai (1<=≤<=ai<=≤<=n) each — elements of sequence. All values ai are different. Print one integer — the answer to the problem. Sample Input 5 2 1 2 3 5 4 Sample Output 7	{"inputs": ["5 2\n1\n2\n3\n5\n4", "1 0\n1", "2 1\n1\n2", "2 1\n2\n1", "3 2\n1\n2\n3", "3 1\n1\n3\n2", "3 1\n2\n1\n3", "3 1\n2\n3\n1", "3 1\n3\n1\n2", "3 2\n3\n2\n1", "10 2\n6\n10\n9\n7\n1\n2\n8\n5\n4\n3", "100 7\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\n73\n74\n75\n76\n77\n78\n79\n80\n81\n82\n83\n84\n85\n86\n87\n88\n89\n90\n91\n92\n93\n94\n95\n96\n97\n98\n99\n100"], "outputs": ["7", "1", "1", "0", "1", "2", "2", "1", "1", "0", "5", "186087894300"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	6	codeforces
bc958cdf56381e768a6fa20968b74312	Congruence Equation	Given an integer $x$. Your task is to find out how many positive integers $n$ ($1 \leq n \leq x$) satisfy $$n \cdot a^n \equiv b \quad (\textrm{mod}\;p),$$ where $a, b, p$ are all known constants. The only line contains four integers $a,b,p,x$ ($2 \leq p \leq 10^6+3$, $1 \leq a,b < p$, $1 \leq x \leq 10^{12}$). It is guaranteed that $p$ is a prime. Print a single integer: the number of possible answers $n$. Sample Input 2 3 5 8 4 6 7 13 233 233 10007 1 Sample Output 2 1 1	{"inputs": ["2 3 5 8", "4 6 7 13", "233 233 10007 1", "338792 190248 339821 152634074578", "629260 663548 739463 321804928248", "656229 20757 818339 523535590429", "1000002 1000002 1000003 1000000000000", "345 2746 1000003 5000000", "802942 824238 836833 605503824329", "1 1 2 880336470888", "2 2 3 291982585081", "699601 39672 1000003 391631540387", "9 1 11 792412106895", "85 535 541 680776274925", "3153 4504 7919 903755230811", "10021 18448 20719 509684975746", "66634 64950 66889 215112576953", "585128 179390 836839 556227387547", "299973 381004 1000003 140225320941", "941641 359143 1000003 851964325687", "500719 741769 1000003 596263138944", "142385 83099 1000003 308002143690", "891986 300056 999983 445202944465", "620328 378284 999983 189501757723", "524578 993938 999979 535629124351", "419620 683571 999979 243073161801", "339138 549930 999883 962863668031", "981603 635385 999233 143056117417", "416133 340425 998561 195227456237", "603835 578057 996323 932597132292", "997998 999323 1000003 999968459613", "997642 996418 999983 999997055535", "812415 818711 820231 999990437063", "994574 993183 1000003 999974679059", "999183 998981 999979 999970875649", "1 1 2 1", "699601 39672 1000003 1", "4 1 5 15", "912896 91931 999983 236754", "154814 35966 269041 1234567", "1 2 5 470854713201", "3 27 29 968042258975", "473 392 541 108827666667", "8 27 29 193012366642", "1302 504 1987 842777827450", "693528 398514 1000003 1000000000000", "533806 514846 1000003 999999999999", "812509 699256 1000003 999999999999", "28361 465012 1000003 1000000000000", "28361 465012 1000003 12693229", "28361 465012 1000003 13271836", "28361 465012 1000003 13271835", "28361 465012 1000003 13421000", "28361 465012 1000003 19609900", "28361 465012 1000003 12693228", "1 1 2 1000000000000", "1 1000002 1000003 1000000000000", "1 44444 1000003 999999999998", "2 1000002 1000003 1000000000000", "2 23333 1000003 1000000000000"], "outputs": ["2", "1", "1", "449263", "434818", "639482", "999998", "4", "723664", "440168235444", "97327528361", "391905", "72037464262", "1258366493", "114124839", "24599907", "3215965", "664796", "140481", "851984", "596056", "307937", "445451", "189574", "535377", "243611", "962803", "143126", "195090", "936103", "999964", "1000007", "1219017", "999965", "999996", "1", "0", "2", "1", "4", "94170942640", "33380767549", "201160200", "6655598851", "424145863", "999995", "999997", "999997", "999996", "1", "2", "1", "4", "9", "0", "500000000000", "999997", "999997", "1000001", "999999"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
bca8f2c3bacf7b7637b3e7c60e95a021	Fly, freebies, fly!	Everyone loves a freebie. Especially students. It is well-known that if in the night before exam a student opens window, opens the student's record-book and shouts loudly three times "Fly, freebie, fly!" — then flown freebie helps him to pass the upcoming exam. In the night before the exam on mathematical analysis n students living in dormitory shouted treasured words. The i-th student made a sacrament at the time ti, where ti is the number of seconds elapsed since the beginning of the night. It is known that the freebie is a capricious and willful lady. That night the freebie was near dormitory only for T seconds. Therefore, if for two students their sacrament times differ for more than T, then the freebie didn't visit at least one of them. Since all students are optimists, they really want to know what is the maximal number of students visited by the freebie can be. The first line of the input contains integer n (1<=≤<=n<=≤<=100), where n — the number of students shouted "Fly, freebie, fly!" The second line contains n positive integers ti (1<=≤<=ti<=≤<=1000). The last line contains integer T (1<=≤<=T<=≤<=1000) — the time interval during which the freebie was near the dormitory. Print a single integer — the largest number of people who will pass exam tomorrow because of the freebie visit. Sample Input 6 4 1 7 8 3 8 1 Sample Output 3	{"inputs": ["6\n4 1 7 8 3 8\n1", "4\n4 2 1 5\n2", "10\n4 7 1 3 8 5 2 1 8 4\n3", "8\n39 49 37 28 40 17 50 2\n10", "2\n1 1\n1", "2\n1 1\n2", "2\n1 1\n1000", "2\n1 2\n2", "2\n450 826\n1000", "3\n3 1 1\n1", "3\n3 1 2\n2", "3\n3 4 3\n1", "3\n3 4 3\n1", "100\n63 69 36 40 74 31 86 42 81 95 60 55 98 98 2 16 84 37 61 47 81 91 85 62 85 32 79 74 65 48 39 60 97 90 59 76 98 73 58 5 16 54 59 42 9 27 95 24 9 6 42 49 64 61 22 27 43 60 39 87 99 57 5 62 48 67 81 36 27 87 41 88 5 33 43 81 82 65 46 52 43 68 85 75 81 99 30 56 67 55 92 4 3 3 66 32 30 45 22 88\n5", "100\n97 29 39 42 68 100 44 54 6 70 17 100 52 85 67 1 43 49 1 47 98 35 5 38 37 73 84 20 13 15 78 65 29 92 20 40 38 11 12 100 24 94 29 92 83 47 25 63 23 85 85 93 61 60 35 40 96 50 19 15 28 19 98 59 42 14 54 65 2 53 38 9 15 69 43 63 63 8 55 12 81 57 69 21 57 11 99 45 23 31 59 2 16 61 43 36 12 39 42 13\n50", "100\n31 1 56 82 96 98 25 41 74 73 8 66 95 50 89 77 98 12 69 45 6 10 48 59 1 77 15 77 9 52 66 8 6 71 39 3 58 73 66 45 8 22 67 83 58 6 96 79 46 43 44 90 13 67 56 32 83 96 93 22 49 10 100 79 99 41 13 71 42 96 89 10 84 95 89 7 18 49 16 54 61 35 25 71 26 68 22 40 68 19 30 51 18 20 12 61 11 23 86 72\n1", "100\n30 74 20 6 3 63 48 45 36 26 33 24 60 71 45 5 19 37 74 100 98 82 67 76 37 46 68 48 56 29 33 19 15 84 76 92 50 53 42 19 5 91 23 38 93 50 39 45 89 17 57 14 86 81 31 6 16 5 80 6 86 49 18 75 30 30 85 94 38 33 50 76 72 32 73 96 28 3 18 20 96 84 89 48 71 64 6 59 87 31 94 24 9 64 15 86 66 11 32 40\n90", "100\n398 82 739 637 913 962 680 125 963 931 311 680 20 530 795 126 881 666 226 323 594 416 176 6 820 317 866 723 831 432 139 706 608 218 963 550 592 544 874 927 763 468 121 424 91 956 42 442 883 66 299 654 964 730 160 615 515 255 709 278 224 223 304 292 41 450 445 556 477 327 647 518 90 470 894 837 655 495 612 113 746 610 751 486 116 933 314 348 736 58 219 429 976 773 678 642 696 522 161 422\n1", "100\n760 621 622 793 66 684 411 813 474 404 304 934 319 411 99 965 722 156 681 400 481 462 571 726 696 244 124 350 403 566 564 641 381 494 703 3 348 213 343 390 27 660 46 591 990 931 477 823 890 21 936 267 282 753 599 269 387 443 622 673 473 745 646 224 911 7 155 880 332 932 51 994 144 666 789 691 323 738 192 372 191 246 903 666 929 252 132 614 11 938 298 286 309 596 210 18 143 760 759 584\n10", "100\n923 357 749 109 685 126 961 437 859 91 985 488 644 777 950 144 479 667 1 535 475 38 843 606 672 333 798 42 595 854 410 914 934 586 329 595 861 321 603 924 434 636 475 395 619 449 336 790 279 931 605 898 276 47 537 935 508 576 168 465 115 884 960 593 883 581 468 426 848 289 525 309 589 106 924 238 829 975 897 373 650 41 952 621 817 46 366 488 924 561 960 449 311 32 517 737 20 765 799 3\n100", "100\n98 63 672 100 254 218 623 415 426 986 920 915 736 795 407 541 382 213 935 743 961 59 660 512 134 935 248 378 739 356 543 714 28 667 602 596 759 791 103 564 225 520 159 542 966 332 983 655 517 273 95 242 593 940 286 236 41 318 941 727 384 225 319 627 982 359 232 769 854 172 643 598 215 231 305 30 347 469 929 919 90 294 739 641 368 270 932 452 234 741 309 234 357 392 707 873 808 398 417 483\n1000", "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\n1", "100\n2 1 1 1 2 2 2 2 2 2 1 1 1 1 2 2 1 1 1 2 2 1 1 1 1 2 1 2 1 2 1 2 1 2 2 2 1 1 2 1 2 2 1 1 2 2 2 2 2 1 1 2 1 1 1 2 1 2 1 2 1 2 1 1 2 1 2 1 2 1 2 1 2 1 1 2 2 1 2 2 1 1 1 2 2 2 1 1 2 2 1 2 2 2 1 2 2 1 2 2\n1", "100\n3 3 1 2 3 3 1 3 3 2 2 2 2 1 2 3 2 1 2 2 2 2 3 2 1 3 3 3 2 1 3 1 2 1 1 2 2 3 2 2 3 1 1 3 1 2 1 3 3 1 1 3 1 3 2 3 3 2 2 2 2 1 1 1 2 1 1 2 1 1 1 1 1 3 2 2 1 3 1 1 3 1 2 2 1 3 1 1 1 1 2 2 2 3 2 2 3 1 1 3\n1", "100\n2 1 3 4 1 1 4 1 3 2 1 4 4 4 4 4 3 2 1 1 2 2 1 3 3 1 1 1 2 3 4 3 1 1 1 4 2 2 2 2 4 1 2 4 2 2 4 3 3 4 1 2 4 1 3 4 1 2 1 2 1 3 3 2 1 1 4 2 1 3 3 2 3 4 1 2 2 4 2 1 4 3 4 3 1 4 3 1 2 3 3 3 2 4 1 1 4 1 2 3\n1", "100\n5 1 3 1 2 3 2 5 5 2 5 1 1 4 1 1 3 5 3 3 3 3 4 4 3 5 4 1 1 3 1 4 2 5 2 5 4 2 3 5 1 3 5 5 5 2 2 5 1 4 1 5 1 5 1 3 3 2 2 4 3 2 1 4 2 5 4 1 2 1 4 3 3 5 4 3 5 5 1 2 4 1 4 2 1 1 2 5 3 3 4 1 3 3 3 5 4 1 1 1\n1", "100\n1 7 8 10 9 4 2 1 6 5 10 6 3 1 10 1 8 4 3 1 7 4 3 7 4 9 1 3 3 5 10 3 7 10 10 10 3 6 2 8 1 3 3 6 2 8 3 7 8 3 4 1 6 4 4 2 10 6 2 10 10 1 7 8 8 1 9 8 7 8 5 2 5 9 2 5 7 10 3 9 8 3 9 4 3 8 6 8 2 8 9 6 7 10 7 9 6 4 4 8\n1", "1\n1\n1", "1\n1\n1000", "1\n849\n1"], "outputs": ["3", "2", "6", "3", "2", "2", "2", "2", "2", "2", "3", "3", "3", "11", "62", "6", "94", "3", "6", "18", "100", "100", "100", "72", "55", "41", "24", "1", "1", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	36	codeforces
bcbdca7bed3cf5b0c900d268a0fbb27e	Casinos and travel	John has just bought a new car and is planning a journey around the country. Country has N cities, some of which are connected by bidirectional roads. There are N<=-<=1 roads and every city is reachable from any other city. Cities are labeled from 1 to N. John first has to select from which city he will start his journey. After that, he spends one day in a city and then travels to a randomly choosen city which is directly connected to his current one and which he has not yet visited. He does this until he can't continue obeying these rules. To select the starting city, he calls his friend Jack for advice. Jack is also starting a big casino business and wants to open casinos in some of the cities (max 1 per city, maybe nowhere). Jack knows John well and he knows that if he visits a city with a casino, he will gamble exactly once before continuing his journey. He also knows that if John enters a casino in a good mood, he will leave it in a bad mood and vice versa. Since he is John's friend, he wants him to be in a good mood at the moment when he finishes his journey. John is in a good mood before starting the journey. In how many ways can Jack select a starting city for John and cities where he will build casinos such that no matter how John travels, he will be in a good mood at the end? Print answer modulo 109<=+<=7. In the first line, a positive integer N (1<=≤<=N<=≤<=100000), the number of cities. In the next N<=-<=1 lines, two numbers a,<= b (1<=≤<=a,<=b<=≤<=N) separated by a single space meaning that cities a and b are connected by a bidirectional road. Output one number, the answer to the problem modulo 109<=+<=7. Sample Input 2 1 2 3 1 2 2 3 Sample Output 4 10	{"inputs": ["2\n1 2", "3\n1 2\n2 3", "4\n1 2\n2 3\n3 4"], "outputs": ["4", "10", "24"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	6	codeforces
bcbfe74a23a31ba03505e0c77eeef23c	Alena And The Heater	"We've tried solitary confinement, waterboarding and listening to Just In Beaver, to no avail. We need something extreme." "Little Alena got an array as a birthday present..." The array b of length n is obtained from the array a of length n and two integers l and r (l<=≤<=r) using the following procedure: b1<==<=b2<==<=b3<==<=b4<==<=0. For all 5<=≤<=i<=≤<=n: - bi<==<=0 if ai,<=ai<=-<=1,<=ai<=-<=2,<=ai<=-<=3,<=ai<=-<=4<=><=r and bi<=-<=1<==<=bi<=-<=2<==<=bi<=-<=3<==<=bi<=-<=4<==<=1 - bi<==<=1 if ai,<=ai<=-<=1,<=ai<=-<=2,<=ai<=-<=3,<=ai<=-<=4<=<<=l and bi<=-<=1<==<=bi<=-<=2<==<=bi<=-<=3<==<=bi<=-<=4<==<=0 - bi<==<=bi<=-<=1 otherwise You are given arrays a and b' of the same length. Find two integers l and r (l<=≤<=r), such that applying the algorithm described above will yield an array b equal to b'. It's guaranteed that the answer exists. The first line of input contains a single integer n (5<=≤<=n<=≤<=105) — the length of a and b'. The second line of input contains n space separated integers a1,<=...,<=an (<=-<=109<=≤<=ai<=≤<=109) — the elements of a. The third line of input contains a string of n characters, consisting of 0 and 1 — the elements of b'. Note that they are not separated by spaces. Output two integers l and r (<=-<=109<=≤<=l<=≤<=r<=≤<=109), conforming to the requirements described above. If there are multiple solutions, output any of them. It's guaranteed that the answer exists. Sample Input 5 1 2 3 4 5 00001 10 -10 -9 -8 -7 -6 6 7 8 9 10 0000111110 Sample Output 6 15 -5 5	{"inputs": ["5\n1 2 3 4 5\n00001", "10\n-10 -9 -8 -7 -6 6 7 8 9 10\n0000111110", "10\n-8 -9 -9 -7 -10 -10 -8 -8 -9 -10\n0000000011", "11\n226 226 226 226 226 227 1000000000 1000000000 228 1000000000 1000000000\n00001111110", "95\n-97 -98 -92 -93 94 96 91 98 95 85 90 86 84 83 81 79 82 79 73 -99 -91 -93 -92 -97 -85 -88 -89 -83 -86 -75 -80 -78 -74 -76 62 68 63 64 69 -71 -70 -72 -69 -71 53 57 60 54 61 -64 -64 -68 -58 -63 -54 -52 -51 -50 -49 -46 -39 -38 -42 -42 48 44 51 45 43 -31 -32 -33 -28 -30 -21 -17 -20 -25 -19 -13 -8 -10 -12 -7 33 34 34 42 32 30 25 29 23 30 20\n00000000000000000000000111111111111111000001111100000111111111111111000001111111111111110000000", "10\n1 4 2 -1 2 3 10 -10 1 3\n0000000000", "10\n10 9 8 7 6 5 4 3 2 1\n0000000001", "10\n10 9 8 7 6 5 4 3 2 1\n0000000011", "10\n6 10 10 4 5 5 6 8 7 7\n0000000111", "10\n6 10 2 1 5 5 9 8 7 7\n0000001111", "10\n6 2 3 4 5 5 9 8 7 7\n0000011111", "10\n-10 -10 -10 -10 -10 10 10 10 10 10\n0000111110", "10\n-8 -9 -7 -8 -10 -7 -7 -7 -8 -8\n0000111111", "10\n-10 -7 -10 -10 7 7 9 7 7 6\n0000000000", "93\n-99 -99 -95 -100 -96 -98 -90 -97 -99 -84 -80 -86 -83 -84 -79 -78 -70 -74 -79 -66 -59 -64 -65 -67 -52 -53 -54 -57 -51 -47 -45 -43 -49 -45 96 97 92 97 94 -39 -42 -36 -32 -36 -30 -30 -29 -28 -24 91 82 85 84 88 76 76 80 76 71 -22 -15 -18 -16 -13 64 63 67 65 70 -8 -3 -4 -7 -8 62 58 59 54 54 1 7 -2 2 7 12 8 16 17 12 50 52 49 43\n000011111111111111111111111111111111110000011111111110000000000111110000011111000001111111111", "99\n-94 -97 -95 -99 94 98 91 95 90 -98 -92 -93 -91 -100 84 81 80 89 89 70 76 79 69 74 -80 -90 -83 -81 -80 64 60 60 60 68 56 50 55 50 57 39 47 47 48 49 37 31 34 38 34 -76 -71 -70 -76 -70 23 21 24 29 22 -62 -65 -63 -60 -61 -56 -51 -54 -58 -59 -40 -43 -50 -43 -42 -39 -33 -39 -39 -33 17 16 19 10 20 -32 -22 -32 -23 -23 1 8 4 -1 3 -12 -17 -12 -20 -12\n000000000000011111000000000011111000000000000000000001111100000111111111111111111110000011111000001", "97\n-93 -92 -90 -97 -96 -92 -97 -99 -97 -89 -91 -84 -84 -81 90 96 90 91 100 -78 -80 -72 -77 -73 79 86 81 89 81 -62 -70 -64 -61 -66 77 73 74 74 69 65 63 68 63 64 -56 -51 -53 -58 -54 62 60 55 58 59 45 49 44 54 53 38 33 33 35 39 27 28 25 30 25 -49 -43 -46 -46 -45 18 21 18 15 20 5 12 4 10 6 -4 -6 0 3 0 -34 -35 -34 -32 -37 -24 -25 -28\n0000111111111111110000011111000001111100000000001111100000000000000000000111110000000000000001111", "99\n-94 -90 -90 -93 94 93 96 96 96 -90 -90 -100 -91 -95 -87 -89 -85 -79 -80 87 87 88 92 92 84 79 84 80 82 73 73 78 78 75 62 67 65 63 68 59 60 55 52 51 42 48 50 42 46 -71 -77 -75 -76 -68 34 40 37 35 33 26 25 24 22 25 -59 -63 -66 -64 -63 11 15 12 12 13 -50 -54 -53 -49 -58 -40 -46 -43 -42 -45 6 3 10 10 1 -32 -31 -29 -38 -36 -22 -28 -24 -28 -26\n000000000000011111111110000000000000000000000000000001111100000000001111100000111111111100000111111", "94\n-97 -94 -91 -98 -92 -98 -92 -96 -92 -85 -91 -81 -91 -85 96 97 100 96 96 87 94 92 88 86 85 -78 -75 -73 -80 -80 75 81 78 84 83 67 64 64 74 72 -66 -63 -68 -64 -68 -66 -55 -60 -59 -57 -60 -51 -47 -45 -47 -49 -43 -36 -40 -42 -38 -40 -25 -32 -35 -28 -33 54 57 55 63 56 63 47 53 44 52 45 48 -21 -21 -17 -20 -14 -18 39 36 33 33 38 42 -4 -12 -3\n0000111111111111110000000000011111000000000011111111111111111111111111100000000000011111100000", "96\n-92 -93 -97 -94 94 91 96 93 93 92 -90 -97 -94 -98 -98 -92 90 88 81 85 89 75 75 73 80 74 74 66 69 66 63 69 56 56 52 53 53 49 47 41 46 50 -91 -86 -89 -83 -88 -81 -79 -77 -72 -79 37 30 35 39 32 25 26 28 27 29 -67 -70 -64 -62 -70 21 15 16 21 19 6 4 5 6 9 4 -7 1 -7 -4 -5 -59 -59 -56 -51 -51 -43 -47 -46 -50 -47 -10 -17 -17\n000000000000001111110000000000000000000000000011111111110000000000111110000000000000000111111111", "98\n-90 -94 -92 -96 -96 -92 -92 -92 -94 -96 99 97 90 94 98 -82 -89 -85 -84 -81 -72 -70 -80 -73 -78 83 83 85 89 83 -69 -68 -60 -66 -67 79 76 78 80 82 73 -57 -49 -50 -53 -53 -48 -40 -46 -46 -41 62 72 65 72 72 -29 -29 -29 -37 -36 -30 -27 -19 -18 -28 -25 -15 -14 -17 -13 -17 -10 59 56 57 53 52 52 41 49 41 45 50 -6 -8 -6 -8 -3 -4 39 40 40 38 31 23 22 27\n00001111111111000001111111111000001111100000011111111110000011111111111111111000000000001111110000", "96\n-100 -99 -100 -95 94 93 94 90 99 83 86 83 86 89 80 82 76 80 75 -100 -99 -95 -92 -91 -98 -90 -83 -84 -84 -85 64 71 70 68 68 74 58 57 61 66 65 63 -76 -81 -72 -74 -72 47 52 56 46 53 -68 -70 -62 -68 -69 35 37 40 43 35 -58 -54 -51 -59 -59 -59 29 24 26 33 31 -45 -42 -49 -40 -49 -48 -30 -34 -35 -31 -32 -37 -22 -21 -20 -28 -21 16 21 13 20 14 -18\n000000000000000000000001111111111100000000000011111000001111100000111111000001111111111111111100", "98\n-99 -98 -95 -90 97 93 96 95 98 98 -94 -92 -99 -92 -91 -87 -83 -84 -87 -88 -90 -79 -79 -82 -77 -76 92 82 91 91 90 91 -69 -72 -65 -68 -65 -58 -59 -63 -56 -57 -59 -53 -55 -45 -51 -52 73 81 75 71 77 72 67 70 60 70 61 64 -34 -41 -41 -41 -37 -39 -36 -33 -36 -36 -33 -36 54 49 53 51 50 -23 -26 -22 -23 -31 -30 43 47 41 40 38 39 33 30 30 34 37 31 -19 -11 -12\n00000000000000111111111111111100000011111111111111110000000000001111111111110000011111100000000000"], "outputs": ["6 1000000000", "-5 5", "-7 1000000000", "227 227", "-27 31", "-1000000000 1000000000", "6 1000000000", "7 1000000000", "9 1000000000", "10 1000000000", "6 1000000000", "-9 9", "-6 1000000000", "-1000000000 1000000000", "8 53", "-11 -2", "-31 14", "-28 0", "-13 32", "-50 14", "-2 30", "-39 12", "-21 37"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	23	codeforces
bcc97263183979d209e5ab6a23185300	Field expansion	In one of the games Arkady is fond of the game process happens on a rectangular field. In the game process Arkady can buy extensions for his field, each extension enlarges one of the field sizes in a particular number of times. Formally, there are n extensions, the i-th of them multiplies the width or the length (by Arkady's choice) by ai. Each extension can't be used more than once, the extensions can be used in any order. Now Arkady's field has size h<=×<=w. He wants to enlarge it so that it is possible to place a rectangle of size a<=×<=b on it (along the width or along the length, with sides parallel to the field sides). Find the minimum number of extensions needed to reach Arkady's goal. The first line contains five integers a, b, h, w and n (1<=≤<=a,<=b,<=h,<=w,<=n<=≤<=100<=000) — the sizes of the rectangle needed to be placed, the initial sizes of the field and the number of available extensions. The second line contains n integers a1,<=a2,<=...,<=an (2<=≤<=ai<=≤<=100<=000), where ai equals the integer a side multiplies by when the i-th extension is applied. Print the minimum number of extensions needed to reach Arkady's goal. If it is not possible to place the rectangle on the field with all extensions, print -1. If the rectangle can be placed on the initial field, print 0. Sample Input 3 3 2 4 4 2 5 4 10 3 3 3 3 5 2 3 5 4 2 5 5 1 2 3 2 2 3 3 4 1 1 3 2 3 2 Sample Output 1 0 -1 3	{"inputs": ["3 3 2 4 4\n2 5 4 10", "3 3 3 3 5\n2 3 5 4 2", "5 5 1 2 3\n2 2 3", "3 4 1 1 3\n2 3 2", "572 540 6 2 12\n2 3 2 2 2 3 3 3 2 2 2 2", "375 905 1 1 17\n2 2 3 3 3 3 3 3 2 2 2 2 3 2 2 2 3", "37 23 4 1 16\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2", "20 19 6 8 18\n3 4 2 3 4 3 2 4 2 2 4 2 4 3 2 4 4 2", "11 11 5 3 11\n4 4 2 4 3 2 2 3 2 2 3", "100000 100000 1 1 100\n2 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 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 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 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2", "642 694 4 7 15\n2 4 2 3 3 4 4 3 3 2 2 4 3 2 2", "100000 100000 1 1 2\n100000 99999", "100000 100000 99999 99999 2\n30000 30000", "41628 25266 1 1 36\n2 2 2 3 2 2 2 2 3 3 2 3 2 3 3 3 3 2 3 2 2 3 3 3 2 2 2 2 2 2 2 2 2 2 2 3", "34640 40496 1 1 107\n2 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 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 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 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2", "32716 43645 4 1 102\n2 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 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 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 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2", "24812 24973 8 4 83\n2 2 2 2 3 3 3 2 4 2 4 3 3 2 2 4 4 3 4 2 2 4 3 2 3 2 3 2 4 4 2 3 3 3 3 4 3 3 2 3 4 4 2 4 4 3 3 4 4 4 4 4 3 4 4 2 3 3 3 2 4 3 2 3 3 2 4 2 2 4 2 3 4 3 2 2 4 2 4 3 2 2 3", "21865 53623 9 7 116\n2 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 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 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 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 2 2 2", "21336 19210 1 1 73\n4 4 3 4 4 2 3 2 4 2 3 2 4 2 4 4 2 3 4 3 4 3 2 3 3 3 2 4 2 2 3 4 2 2 3 3 4 3 3 3 3 4 2 4 2 3 3 4 4 2 4 4 2 3 4 3 4 3 3 4 2 4 4 4 2 2 3 3 2 4 4 2 2", "48490 41653 1 1 53\n2 4 2 3 4 3 4 4 4 3 2 3 4 4 2 2 3 3 3 3 2 4 3 2 2 3 4 3 3 2 2 4 4 4 4 3 4 4 4 2 4 2 2 2 4 2 2 4 2 3 3 2 2", "33817 19277 7 8 192\n2 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 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 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 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 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 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 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2", "63129 28077 1 1 31\n3 3 4 3 2 2 3 4 3 4 4 3 3 2 3 3 4 3 3 3 2 3 2 3 4 2 4 3 4 2 2", "11731 17857 6 7 21\n2 3 2 3 3 2 3 4 3 3 2 3 2 3 4 3 2 4 3 2 2", "82424 40643 9 2 200\n2 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 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 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 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 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 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 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 2 2 2", "1 1 1 1 1\n100000", "100000 100000 1 1 2\n100000 100000", "100000 100000 100000 100000 1\n2", "496 390 6 8 15\n4 2 4 4 2 4 2 3 2 4 3 2 2 2 3", "625 389 1 3 20\n3 2 2 3 4 2 3 2 2 2 3 4 4 4 4 3 4 3 3 3", "154 206 6 1 12\n3 2 3 3 2 3 3 2 3 2 2 2", "405 449 1 5 16\n2 2 2 3 3 2 2 3 2 3 2 2 3 3 3 3", "662 859 2 3 17\n3 2 2 2 3 3 3 2 3 3 2 3 2 2 2 2 2", "255 289 2 2 14\n4 3 3 3 3 4 4 4 3 3 4 3 3 2", "596 688 1 6 19\n3 4 4 2 2 4 2 3 4 2 2 3 3 3 2 2 2 4 3", "133 127 8 8 10\n4 2 3 2 2 3 4 2 3 3", "32804 32321 10 13 34\n3 3 3 2 3 2 2 2 2 3 2 2 2 2 2 3 3 3 2 2 3 3 3 2 2 2 3 3 2 2 2 2 3 2", "95589 93171 13 11 34\n2 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 2 2 2 2 2", "16526 20394 2 2 21\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2", "63481 80094 3 2 200\n2 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 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 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 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 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 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 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 2 2 2", "13801 10319 7 7 30\n2 3 2 2 2 3 2 3 3 2 3 3 3 3 2 2 3 3 2 2 3 2 3 2 3 3 3 2 2 3", "100000 1 1 100000 3\n3 4 100000", "1 100000 100000 1 1\n100000", "100000 100000 1 100000 1\n100000", "100000 100000 100000 1 2\n300 300", "100000 100000 100000 1 2\n100000 100000", "100000 100000 99999 99999 1\n30000", "100000 100000 100000 99999 1\n30000", "100000 100000 99999 100000 1\n30000", "25 24 1 1 4\n4 5 6 5", "100000 100000 1 1 17\n2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59", "65536 78125 1 1 23\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 5 5 5 5 5 5 5", "78125 65536 1 1 23\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 5 5 5 5 5 5 5", "15625 65536 1 1 22\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 5 5 5 5 5 5", "65536 15625 1 1 22\n2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 5 5 5 5 5 5", "39366 39366 1 1 20\n3 3 3 3 3 3 3 3 3 2 3 3 3 3 3 3 3 3 3 2"], "outputs": ["1", "0", "-1", "3", "-1", "14", "9", "2", "2", "34", "8", "-1", "2", "23", "32", "29", "13", "25", "16", "16", "25", "18", "14", "29", "0", "2", "0", "7", "9", "9", "11", "13", "8", "9", "5", "16", "27", "-1", "30", "14", "0", "0", "1", "-1", "1", "-1", "1", "1", "4", "7", "23", "23", "22", "22", "20"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
bcce2d002f657ac7dccfcbef1ce7137d	Average Numbers	You are given a sequence of positive integers a1,<=a2,<=...,<=an. Find all such indices i, that the i-th element equals the arithmetic mean of all other elements (that is all elements except for this one). The first line contains the integer n (2<=≤<=n<=≤<=2·105). The second line contains elements of the sequence a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=1000). All the elements are positive integers. Print on the first line the number of the sought indices. Print on the second line the sought indices in the increasing order. All indices are integers from 1 to n. If the sought elements do not exist, then the first output line should contain number 0. In this case you may either not print the second line or print an empty line. Sample Input 5 1 2 3 4 5 4 50 50 50 50 Sample Output 1 3 4 1 2 3 4	{"inputs": ["5\n1 2 3 4 5", "4\n50 50 50 50", "3\n2 3 1", "2\n4 2", "2\n1 1", "10\n3 3 3 3 3 4 3 3 3 2", "10\n15 7 10 7 7 7 4 4 7 2", "6\n2 2 2 2 2 2", "6\n3 3 3 3 3 3", "4\n6 6 6 7", "2\n1 2", "3\n3 3 4", "5\n7 6 6 6 6", "4\n3 5 5 9", "3\n99 100 99", "4\n5 6 5 5", "6\n1 1 2 1 1 1", "2\n4 5", "4\n1 1 1 2", "3\n1 2 4", "6\n1 1 2 3 3 3", "4\n4 5 5 4", "3\n2 3 5", "3\n2 1 1", "3\n1 1 2", "4\n1 2 3 4", "5\n1 2 3 4 6", "3\n2 2 3", "4\n3 4 5 1", "3\n2 3 2", "3\n3 4 4", "3\n10 5 7", "3\n5 6 5", "4\n1 2 3 7", "5\n2 2 3 3 3", "3\n4 3 6", "3\n1 1 3", "15\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1"], "outputs": ["1\n3 ", "4\n1 2 3 4 ", "1\n1 ", "0", "2\n1 2 ", "8\n1 2 3 4 5 7 8 9 ", "5\n2 4 5 6 9 ", "6\n1 2 3 4 5 6 ", "6\n1 2 3 4 5 6 ", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "15\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	130	codeforces
bcd6a289c4ca64bddbb3a92d687dfda3	Sum of Nestings	Recall that the bracket sequence is considered regular if it is possible to insert symbols '+' and '1' into it so that the result is a correct arithmetic expression. For example, a sequence "(()())" is regular, because we can get correct arithmetic expression insering symbols '+' and '1': "((1+1)+(1+1))". Also the following sequences are regular: "()()()", "(())" and "()". The following sequences are not regular bracket sequences: ")(", "(()" and "())(()". In this problem you are given two integers n and k. Your task is to construct a regular bracket sequence consisting of round brackets with length 2·n with total sum of nesting of all opening brackets equals to exactly k. The nesting of a single opening bracket equals to the number of pairs of brackets in which current opening bracket is embedded. For example, in the sequence "()(())" the nesting of first opening bracket equals to 0, the nesting of the second opening bracket equals to 0 and the nesting of the third opening bracket equal to 1. So the total sum of nestings equals to 1. The first line contains two integers n and k (1<=≤<=n<=≤<=3·105, 0<=≤<=k<=≤<=1018) — the number of opening brackets and needed total nesting. Print the required regular bracket sequence consisting of round brackets. If there is no solution print "Impossible" (without quotes). Sample Input 3 1 4 6 2 5 Sample Output ()(())(((())))Impossible	{"inputs": ["3 1", "4 6", "2 5", "1 0", "2 0", "2 1", "3 0", "10 42", "3 2", "3 3", "4 1", "4 2", "4 0", "4 3", "4 4", "4 5", "20 132", "5 0", "5 1", "5 2", "5 3", "5 4", "5 5", "5 6", "5 7", "5 8", "5 9", "5 10", "5 11", "50 282", "100 4298", "201 19557", "301 43259", "333 3286", "400 14432", "500 12169", "1000 101063", "5001 12502500", "9000 0", "9999 41526212", "299999 2887574325", "299999 24023579789", "299999 26952312018", "299999 8515952136", "299999 35062652872", "299999 21396945540", "299999 43798620158", "300000 0", "300000 0", "300000 4241009937", "300000 6782741206", "300000 1446225055", "300000 12099664325", "300000 18442545357", "300000 41656958056", "300000 42589173119", "300000 39226420886", "300000 40158635949", "300000 37728098779", "300000 43643072541", "300000 44754406973", "300000 44999849986", "10 48", "100 4952", "1000 499505", "5001 12502504", "9999 49985003", "300000 44999850003", "10 46", "100 4955", "1000 499503", "5001 12502503", "9999 49985002", "300000 44999850002", "300000 1000000000000000000", "300000 44999850000", "300000 44999850001", "300000 44999849999", "300000 44999849998", "300000 44999849997", "300000 0", "300000 1", "300000 2", "300000 3", "1 1", "1 2", "1 1000000000000000000", "2 2", "2 3", "300000 14999849999", "2 1000000000000000000", "299999 1000000000000000000"], "outputs": ["()(())", "(((())))", "Impossible", "()", "()()", "(())", "()()()", "(((((((()()())))))))", "(()())", "((()))", "()()(())", "()(()())", "()()()()", "(()()())", "(()(()))", "((()()))", "((((((()(((()()()()()()()()()())))))))))", "()()()()()", "()()()(())", "()()(()())", "()(()()())", "(()()()())", "()((()()))", "(()(()()))", "((()()()))", "((()(())))", "(((()())))", "((((()))))", "Impossible", "()()()()()((()(((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()())))))))", "((((((((((((((((((((((((((((((((((((((((((()((((((((((((((((((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((()(((((((((((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()((((((((()(((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()...", "(((((((((((()(((((((((((((((((((((((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(...", "(((((((((((((((((((()((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()...", "()(((((((((((((((((((((((((((((((((((((((((((((((((((((((()((((((((((((((((((((((((((((((((((((((((((((((((((((()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()()()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()()()()()()()()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(...", "()()()()()()()()()()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()()()()()()()()()()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "Impossible", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(...", "()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()()(...", "Impossible", "Impossible", "Impossible", "Impossible", "Impossible", "()()(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((...", "Impossible", "Impossible"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
bce21ee8b1160c20c0b326ab3867d800	none	Squirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval [0,<=1]. Next, n stones will fall and Liss will escape from the stones. The stones are numbered from 1 to n in order. The stones always fall to the center of Liss's interval. When Liss occupies the interval [k<=-<=d,<=k<=+<=d] and a stone falls to k, she will escape to the left or to the right. If she escapes to the left, her new interval will be [k<=-<=d,<=k]. If she escapes to the right, her new interval will be [k,<=k<=+<=d]. You are given a string s of length n. If the i-th character of s is "l" or "r", when the i-th stone falls Liss will escape to the left or to the right, respectively. Find the sequence of stones' numbers from left to right after all the n stones falls. The input consists of only one line. The only line contains the string s (1<=≤<=\|s\|<=≤<=106). Each character in s will be either "l" or "r". Output n lines — on the i-th line you should print the i-th stone's number from the left. Sample Input llrlr rrlll lrlrr Sample Output 3 5 4 2 1 1 2 5 4 3 2 4 5 3 1	{"inputs": ["llrlr", "rrlll", "lrlrr", "lllrlrllrl", "llrlrrrlrr", "rlrrrllrrr", "lrrlrrllrrrrllllllrr", "rlrrrlrrrllrrllrlrll", "lllrrlrlrllrrrrrllrl", "rrrllrrrlllrlllrlrrr", "rrlllrrrlrrlrrrlllrlrlrrrlllrllrrllrllrrlrlrrllllrlrrrrlrlllrlrrrlrlrllrlrlrrlrrllrrrlrlrlllrrllllrl", "llrlrlllrrllrllllrlrrlrlrrllrlrlrrlrrrrrrlllrrlrrrrrlrrrlrlrlrrlllllrrrrllrrlrlrrrllllrlrrlrrlrlrrll", "llrrrrllrrlllrlrllrlrllllllrrrrrrrrllrrrrrrllrlrrrlllrrrrrrlllllllrrlrrllrrrllllrrlllrrrlrlrrlrlrllr", "lllllrllrrlllrrrllrrrrlrrlrllllrrrrrllrlrllllllrrlrllrlrllrlrrlrlrrlrrrlrrrrllrlrrrrrrrllrllrrlrllrl", "llrlrlrlrlrlrrlllllllrllllrllrrrlllrrllrllrrlllrrlllrlrrllllrrlllrrllrrllllrrlllrlllrrrllrrrrrrllrrl", "l", "r"], "outputs": ["3\n5\n4\n2\n1", "1\n2\n5\n4\n3", "2\n4\n5\n3\n1", "4\n6\n9\n10\n8\n7\n5\n3\n2\n1", "3\n5\n6\n7\n9\n10\n8\n4\n2\n1", "1\n3\n4\n5\n8\n9\n10\n7\n6\n2", "2\n3\n5\n6\n9\n10\n11\n12\n19\n20\n18\n17\n16\n15\n14\n13\n8\n7\n4\n1", "1\n3\n4\n5\n7\n8\n9\n12\n13\n16\n18\n20\n19\n17\n15\n14\n11\n10\n6\n2", "4\n5\n7\n9\n12\n13\n14\n15\n16\n19\n20\n18\n17\n11\n10\n8\n6\n3\n2\n1", "1\n2\n3\n6\n7\n8\n12\n16\n18\n19\n20\n17\n15\n14\n13\n11\n10\n9\n5\n4", "1\n2\n6\n7\n8\n10\n11\n13\n14\n15\n19\n21\n23\n24\n25\n29\n32\n33\n36\n39\n40\n42\n44\n45\n50\n52\n53\n54\n55\n57\n61\n63\n64\n65\n67\n69\n72\n74\n76\n77\n79\n80\n83\n84\n85\n87\n89\n93\n94\n99\n100\n98\n97\n96\n95\n92\n91\n90\n88\n86\n82\n81\n78\n75\n73\n71\n70\n68\n66\n62\n60\n59\n58\n56\n51\n49\n48\n47\n46\n43\n41\n38\n37\n35\n34\n31\n30\n28\n27\n26\n22\n20\n18\n17\n16\n12\n9\n5\n4\n3", "3\n5\n9\n10\n13\n18\n20\n21\n23\n25\n26\n29\n31\n33\n34\n36\n37\n38\n39\n40\n41\n45\n46\n48\n49\n50\n51\n52\n54\n55\n56\n58\n60\n62\n63\n69\n70\n71\n72\n75\n76\n78\n80\n81\n82\n87\n89\n90\n92\n93\n95\n97\n98\n100\n99\n96\n94\n91\n88\n86\n85\n84\n83\n79\n77\n74\n73\n68\n67\n66\n65\n64\n61\n59\n57\n53\n47\n44\n43\n42\n35\n32\n30\n28\n27\n24\n22\n19\n17\n16\n15\n14\n12\n11\n8\n7\n6\n4\n2\n1", "3\n4\n5\n6\n9\n10\n14\n16\n19\n21\n28\n29\n30\n31\n32\n33\n34\n35\n38\n39\n40\n41\n42\n43\n46\n48\n49\n50\n54\n55\n56\n57\n58\n59\n67\n68\n70\n71\n74\n75\n76\n81\n82\n86\n87\n88\n90\n92\n93\n95\n97\n100\n99\n98\n96\n94\n91\n89\n85\n84\n83\n80\n79\n78\n77\n73\n72\n69\n66\n65\n64\n63\n62\n61\n60\n53\n52\n51\n47\n45\n44\n37\n36\n27\n26\n25\n24\n23\n22\n20\n18\n17\n15\n13\n12\n11\n8\n7\n2\n1", "6\n9\n10\n14\n15\n16\n19\n20\n21\n22\n24\n25\n27\n32\n33\n34\n35\n36\n39\n41\n48\n49\n51\n54\n56\n59\n61\n62\n64\n66\n67\n69\n70\n71\n73\n74\n75\n76\n79\n81\n82\n83\n84\n85\n86\n87\n90\n93\n94\n96\n99\n100\n98\n97\n95\n92\n91\n89\n88\n80\n78\n77\n72\n68\n65\n63\n60\n58\n57\n55\n53\n52\n50\n47\n46\n45\n44\n43\n42\n40\n38\n37\n31\n30\n29\n28\n26\n23\n18\n17\n13\n12\n11\n8\n7\n5\n4\n3\n2\n1", "3\n5\n7\n9\n11\n13\n14\n22\n27\n30\n31\n32\n36\n37\n40\n43\n44\n48\n49\n53\n55\n56\n61\n62\n66\n67\n70\n71\n76\n77\n81\n85\n86\n87\n90\n91\n92\n93\n94\n95\n98\n99\n100\n97\n96\n89\n88\n84\n83\n82\n80\n79\n78\n75\n74\n73\n72\n69\n68\n65\n64\n63\n60\n59\n58\n57\n54\n52\n51\n50\n47\n46\n45\n42\n41\n39\n38\n35\n34\n33\n29\n28\n26\n25\n24\n23\n21\n20\n19\n18\n17\n16\n15\n12\n10\n8\n6\n4\n2\n1", "1", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	145	codeforces
bcf965fe41db5c767e712d73903ad8b4	IQ Test	Petya is preparing for IQ test and he has noticed that there many problems like: you are given a sequence, find the next number. Now Petya can solve only problems with arithmetic or geometric progressions. Arithmetic progression is a sequence a1, a1<=+<=d, a1<=+<=2d, ..., a1<=+<=(n<=-<=1)d, where a1 and d are any numbers. Geometric progression is a sequence b1, b2<==<=b1q, ..., bn<==<=bn<=-<=1q, where b1<=≠<=0, q<=≠<=0, q<=≠<=1. Help Petya and write a program to determine if the given sequence is arithmetic or geometric. Also it should found the next number. If the sequence is neither arithmetic nor geometric, print 42 (he thinks it is impossible to find better answer). You should also print 42 if the next element of progression is not integer. So answer is always integer. The first line contains exactly four integer numbers between 1 and 1000, inclusively. Print the required number. If the given sequence is arithmetic progression, print the next progression element. Similarly, if the given sequence is geometric progression, print the next progression element. Print 42 if the given sequence is not an arithmetic or geometric progression. Sample Input 836 624 412 200 1 334 667 1000 Sample Output -12 1333	{"inputs": ["836 624 412 200", "1 334 667 1000", "501 451 400 350", "836 624 412 200", "1 334 667 1000", "11 234 457 680", "640 431 222 13", "1 1 1 1", "1 10 100 1000", "3 18 108 648", "512 384 288 216", "891 297 99 33", "64 160 400 1000", "501 451 400 350", "501 450 400 350", "4 32 48 64", "9 8 7 5", "992 994 998 1000", "2 6 6 8", "2 4 8 8", "2 4 6 14", "2 12 4 14", "2 4 4 2", "1000 100 10 1", "2 9 27 81", "2 4 9 16", "2 4 9 18", "256 64 16 8", "256 385 576 864", "343 147 63 27", "729 648 576 512", "1000 980 960 941", "2 5 10 16", "1 2 3 10", "24 36 54 81", "1 2 4 8", "16 24 36 54", "8 4 2 1", "16 8 4 2", "32 16 8 4", "10 11 12 12", "1 2 10 20", "27 9 3 1", "81 108 144 192", "2 3 4 6", "1000 500 170 40"], "outputs": ["-12", "1333", "42", "-12", "1333", "903", "-196", "1", "10000", "3888", "162", "11", "2500", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "42", "16", "81", "42", "1", "2", "42", "42", "42", "256", "42", "42"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	15	codeforces
bcfaa0ca75d2308244afef49d1cea846	Eight Point Sets	Gerald is very particular to eight point sets. He thinks that any decent eight point set must consist of all pairwise intersections of three distinct integer vertical straight lines and three distinct integer horizontal straight lines, except for the average of these nine points. In other words, there must be three integers x1,<=x2,<=x3 and three more integers y1,<=y2,<=y3, such that x1<=<<=x2<=<<=x3, y1<=<<=y2<=<<=y3 and the eight point set consists of all points (xi,<=yj) (1<=≤<=i,<=j<=≤<=3), except for point (x2,<=y2). You have a set of eight points. Find out if Gerald can use this set? The input consists of eight lines, the i-th line contains two space-separated integers xi and yi (0<=≤<=xi,<=yi<=≤<=106). You do not have any other conditions for these points. In a single line print word "respectable", if the given set of points corresponds to Gerald's decency rules, and "ugly" otherwise. Sample Input 0 0 0 1 0 2 1 0 1 2 2 0 2 1 2 2 0 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 1 1 1 2 1 3 2 1 2 2 2 3 3 1 3 2 Sample Output respectable ugly ugly	{"inputs": ["0 0\n0 1\n0 2\n1 0\n1 2\n2 0\n2 1\n2 2", "0 0\n1 0\n2 0\n3 0\n4 0\n5 0\n6 0\n7 0", "1 1\n1 2\n1 3\n2 1\n2 2\n2 3\n3 1\n3 2", "0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0\n0 0", "1000000 1000000\n1000000 999999\n1000000 999998\n999999 1000000\n999999 999998\n999998 1000000\n999998 999999\n999998 999998", "0 0\n1 0\n0 1\n1 1\n0 2\n1 2\n0 3\n1 3", "0 0\n2 1\n1 0\n0 2\n2 2\n1 0\n2 1\n0 2", "0 0\n2 1\n1 0\n0 2\n2 2\n1 0\n2 1\n0 2", "791649 383826\n10864 260573\n504506 185571\n899991 511500\n503197 876976\n688727 569035\n343255 961333\n439355 759581", "750592 335292\n226387 434036\n299976 154633\n593197 600998\n62014 689355\n566268 571630\n381455 222817\n50555 288617", "716334 42808\n211710 645370\n515258 96837\n14392 766713\n439265 939607\n430602 918570\n845044 187545\n957977 441674", "337873 813442\n995185 863182\n375545 263618\n310042 130019\n358572 560779\n305725 729179\n377381 267545\n41376 312626", "803784 428886\n995691 328351\n211844 386054\n375491 74073\n692402 660275\n366073 536431\n485832 941417\n96032 356022", "999231 584954\n246553 267441\n697080 920011\n173593 403511\n58535 101909\n131124 924182\n779830 204560\n684576 533111", "666888 741208\n685852 578759\n211123 826453\n244759 601804\n670436 748132\n976425 387060\n587850 804554\n430242 805528", "71768 834717\n13140 834717\n13140 991083\n880763 386898\n71768 386898\n880763 991083\n880763 834717\n13140 386898", "941532 913025\n941532 862399\n686271 913025\n686271 862399\n686271 461004\n941532 461004\n908398 862399\n908398 913025", "251515 680236\n761697 669947\n251515 669947\n761697 680236\n251515 476629\n761697 476629\n453296 669947\n453296 476629", "612573 554036\n195039 655769\n472305 655769\n612573 655769\n195039 160740\n472305 160740\n472305 554036\n612573 160740", "343395 788566\n171702 674699\n171702 788566\n971214 788566\n343395 9278\n971214 9278\n343395 674699\n971214 674699", "38184 589856\n281207 447136\n281207 42438\n38184 42438\n38184 447136\n880488 589856\n281207 589856\n880488 42438", "337499 89260\n337499 565883\n603778 89260\n603778 565883\n234246 89260\n603778 17841\n337499 17841\n234246 17841", "180952 311537\n180952 918548\n126568 918548\n180952 268810\n732313 918548\n126568 311537\n126568 268810\n732313 311537", "323728 724794\n265581 165113\n323728 146453\n265581 146453\n591097 146453\n265581 724794\n323728 165113\n591097 165113", "642921 597358\n922979 597358\n127181 616833\n642921 828316\n922979 828316\n127181 597358\n922979 616833\n127181 828316", "69586 260253\n74916 203798\n985457 203798\n74916 943932\n985457 943932\n69586 943932\n985457 260253\n69586 203798", "57930 637387\n883991 573\n57930 573\n57930 499963\n399327 573\n399327 637387\n883991 637387\n883991 499963", "52820 216139\n52820 999248\n290345 216139\n290345 999248\n308639 216139\n308639 999248\n52820 477113\n308639 477113", "581646 464672\n493402 649074\n581646 649074\n214619 649074\n581646 252709\n214619 252709\n214619 464672\n493402 252709", "787948 77797\n421941 615742\n421941 77797\n400523 77797\n400523 111679\n787948 615742\n400523 615742\n787948 111679", "583956 366985\n759621 567609\n756846 567609\n759621 176020\n583956 567609\n583956 176020\n759621 366985\n756846 176020", "0 50000\n0 0\n0 1000000\n50000 0\n50000 1000000\n1000000 0\n1000000 50000\n1000000 1000000", "0 8\n0 9\n0 10\n1 8\n3 8\n3 8\n3 9\n3 10", "0 1\n0 1\n0 2\n1 1\n1 2\n2 1\n2 1\n2 2", "1 2\n1 3\n1 4\n2 2\n2 4\n4 2\n4 2\n4 4", "0 0\n0 1\n0 2\n0 0\n1 2\n2 0\n2 1\n2 2", "0 0\n0 0\n0 0\n1 1\n1 1\n2 2\n2 2\n2 2", "0 0\n0 0\n0 2\n1 1\n1 2\n2 0\n2 1\n2 2", "0 0\n0 1\n0 3\n1 0\n1 3\n2 0\n2 2\n2 3", "0 0\n0 1\n0 2\n1 0\n1 2\n3 0\n3 1\n3 2", "1 1\n1 2\n1 5\n2 1\n2 5\n5 1\n5 2\n5 5", "1 1\n1 2\n1 2\n2 3\n2 1\n3 3\n3 1\n3 3", "0 0\n0 0\n1 0\n0 1\n2 1\n1 2\n2 2\n2 2", "1 1\n1 1\n1 3\n2 1\n2 3\n3 2\n3 2\n3 3", "1 0\n1 0\n1 0\n2 3\n2 3\n3 4\n3 4\n3 4"], "outputs": ["respectable", "ugly", "ugly", "ugly", "respectable", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "respectable", "respectable", "respectable", "respectable", "respectable", "respectable", "respectable", "respectable", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "ugly", "respectable", "respectable", "ugly", "ugly", "ugly", "ugly"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	36	codeforces
bd184280a9f5454d5dab9c2732b3319e	Login Verification	When registering in a social network, users are allowed to create their own convenient login to make it easier to share contacts, print it on business cards, etc. Login is an arbitrary sequence of lower and uppercase latin letters, digits and underline symbols («_»). However, in order to decrease the number of frauds and user-inattention related issues, it is prohibited to register a login if it is similar with an already existing login. More precisely, two logins s and t are considered similar if we can transform s to t via a sequence of operations of the following types: - transform lowercase letters to uppercase and vice versa; - change letter «O» (uppercase latin letter) to digit «0» and vice versa; - change digit «1» (one) to any letter among «l» (lowercase latin «L»), «I» (uppercase latin «i») and vice versa, or change one of these letters to other. For example, logins «Codeforces» and «codef0rces» as well as «OO0OOO00O0OOO0O00OOO0OO_lol» and «OO0OOO0O00OOO0O00OO0OOO_1oI» are considered similar whereas «Codeforces» and «Code_forces» are not. You're given a list of existing logins with no two similar amonst and a newly created user login. Check whether this new login is similar with any of the existing ones. The first line contains a non-empty string s consisting of lower and uppercase latin letters, digits and underline symbols («_») with length not exceeding 50 — the login itself. The second line contains a single integer n (1<=≤<=n<=≤<=1<=000) — the number of existing logins. The next n lines describe the existing logins, following the same constraints as the user login (refer to the first line of the input). It's guaranteed that no two existing logins are similar. Print «Yes» (without quotes), if user can register via this login, i.e. none of the existing logins is similar with it. Otherwise print «No» (without quotes). Sample Input 1_wat 2 2_wat wat_1 000 3 00 ooA oOo _i_ 3 __i_ _1_ I La0 3 2a0 La1 1a0 abc 1 aBc 0Lil 2 LIL0 0Ril Sample Output Yes No No No No Yes	{"inputs": ["1_wat\n2\n2_wat\nwat_1", "000\n3\n00\nooA\noOo", "_i_\n3\n__i_\n_1_\nI", "La0\n3\n2a0\nLa1\n1a0", "abc\n1\naBc", "0Lil\n2\nLIL0\n0Ril", "iloO\n3\niIl0\noIl0\nIooO", "L1il0o1L1\n5\niLLoLL\noOI1Io10il\nIoLLoO\nO01ilOoI\nI10l0o", "ELioO1lOoOIOiLoooi1iolul1O\n7\nOoEIuOIl1ui1010uiooOoi0Oio001L0EoEolO0\nOLIoOEuoE11u1u1iLOI0oO\nuEOuO0uIOOlO01OlEI0E1Oo0IO1LI0uE0LILO0\nEOo0Il11iIOOOIiuOiIiiLOLEOOII001EE\niOoO0LOulioE0OLIIIulli01OoiuOOOoOlEiI0EiiElIIu0\nlE1LOE1Oil\n1u0EOliIiIOl1u110il0l1O0u", "0blo7X\n20\n1oobb6\nXIXIO2X\n2iYI2\n607XXol\n2I6io22\nOl10I\nbXX0Lo\nolOOb7X\n07LlXL\nlXY17\n12iIX2\n7lL70\nbOo11\n17Y6b62\n0O6L7\n1lX2L\n2iYl6lI\n7bXIi1o\niLIY2\n0OIo1X", "lkUL\n25\nIIfL\nokl\nfoo\ni0U\noko\niIoU\nUUv\nvli\nv0Uk\n0Of\niill\n1vkl\nUIf\nUfOO\nlvLO\nUUo0\nIOf1\nlovL\nIkk\noIv\nLvfU\n0UI\nkol\n1OO0\n1OOi", "L1lo\n3\nOOo1\nL1lo\n0lOl", "LIoooiLO\n5\nLIoooiLO\nl0o01I00\n0OOl0lLO01\nil10i0\noiloi", "1i1lQI\n7\nuLg1uLLigIiOLoggu\nLLLgIuQIQIIloiQuIIoIO0l0o000\n0u1LQu11oIuooIl0OooLg0i0IQu1O1lloI1\nQuQgIQi0LOIliLOuuuioLQou1l\nlLIO00QLi01LogOliOIggII1\no0Ll1uIOQl10IL0IILQ\n1i1lQI", "oIzz1\n20\n1TTl0O\nloF0LT\n1lLzo\noi0Ov\nFlIF1zT\nzoITzx\n0TIFlT\nl1vllil\nOviix1F\nLFvI1lL\nLIl0loz\nixz1v\n1i1vFi\nTIFTol\noIzz1\nIvTl0o\nxv1U0O\niiiioF\n1oiLUlO\nxToxv1", "00L0\n25\n0il\nIlkZ\nL0I\n00L0\nBd0\nZLd\n0d1k\nddk\nIdl\nkBd\nkBOL\nZ1lI\nkBL\nLOko\noZ0i\nZ1lO\nLiOk\niBld\nLO0d\ndIo\nZ10\n1k1i\n0o0L\nIoBd\ni0B0", "Z\n1\nz", "0\n1\no", "0\n1\nO", "o\n1\n0", "o\n1\nO", "o\n1\no", "O\n1\no", "O\n1\n0", "1\n1\nl", "1\n1\nL", "1\n1\ni", "1\n1\nI", "1\n1\no", "i\n1\n1", "i\n1\nL", "i\n1\nl", "I\n1\nL", "I\n1\nl", "I\n1\n1", "l\n1\n1", "l\n1\nL", "l\n1\ni", "l\n1\nI", "L\n1\nl", "L\n1\n1", "L\n1\ni", "L\n1\nI"], "outputs": ["Yes", "No", "No", "No", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "Yes", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No", "No"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	193	codeforces
bd2451122914e33f4f8c5309b0ce78a4	Ralph And His Magic Field	Ralph has a magic field which is divided into n<=×<=m blocks. That is to say, there are n rows and m columns on the field. Ralph can put an integer in each block. However, the magic field doesn't always work properly. It works only if the product of integers in each row and each column equals to k, where k is either 1 or -1. Now Ralph wants you to figure out the number of ways to put numbers in each block in such a way that the magic field works properly. Two ways are considered different if and only if there exists at least one block where the numbers in the first way and in the second way are different. You are asked to output the answer modulo 1000000007<==<=109<=+<=7. Note that there is no range of the numbers to put in the blocks, but we can prove that the answer is not infinity. The only line contains three integers n, m and k (1<=≤<=n,<=m<=≤<=1018, k is either 1 or -1). Print a single number denoting the answer modulo 1000000007. Sample Input 1 1 -1 1 3 1 3 3 -1 Sample Output 1 1 16	{"inputs": ["1 1 -1", "1 3 1", "3 3 -1", "2 7 1", "1 1 1", "2 4 -1", "173 69 -1", "110 142 1", "162 162 -1", "49 153 -1", "94 182 1", "106666666 233333333 1", "2 2 1", "146 34 -1", "94 86 -1", "2529756051797760 2682355969139391 -1", "3126690179932000 2474382898739836 -1", "3551499873841921 2512677762780671 -1", "3613456196418270 2872267429531501 1", "2886684369091916 3509787933422130 1", "3536041043537343 2416093514489183 1", "2273134852621270 2798005122439669 1", "2870150496178092 3171485931753811 -1", "999999999999999999 1000000000000000000 1", "987654321987654321 666666666666666666 1", "1 2 -1", "2 1 -1", "1000000000000000000 1 1", "1000000006 100000000000000000 1"], "outputs": ["1", "1", "16", "64", "1", "8", "814271739", "537040244", "394042552", "412796600", "33590706", "121241754", "2", "742752757", "476913727", "0", "917305624", "350058339", "223552863", "341476979", "394974516", "901406364", "0", "102810659", "279028602", "0", "0", "1", "123624987"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	18	codeforces
bd3cadf754cab70e6a2d233db4f043b8	Educational Game	The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the game are fairly simple and are described below. The playing field is a sequence of n non-negative integers ai numbered from 1 to n. The goal of the game is to make numbers a1,<=a2,<=...,<=ak (i.e. some prefix of the sequence) equal to zero for some fixed k (k<=<<=n), and this should be done in the smallest possible number of moves. One move is choosing an integer i (1<=≤<=i<=≤<=n) such that ai<=><=0 and an integer t (t<=≥<=0) such that i<=+<=2t<=≤<=n. After the values of i and t have been selected, the value of ai is decreased by 1, and the value of ai<=+<=2t is increased by 1. For example, let n<==<=4 and a<==<=(1,<=0,<=1,<=2), then it is possible to make move i<==<=3, t<==<=0 and get a<==<=(1,<=0,<=0,<=3) or to make move i<==<=1, t<==<=1 and get a<==<=(0,<=0,<=2,<=2) (the only possible other move is i<==<=1, t<==<=0). You are given n and the initial sequence ai. The task is to calculate the minimum number of moves needed to make the first k elements of the original sequence equal to zero for each possible k (1<=≤<=k<=<<=n). The first input line contains a single integer n. The second line contains n integers ai (0<=≤<=ai<=≤<=104), separated by single spaces. The input limitations for getting 20 points are: - 1<=≤<=n<=≤<=300 The input limitations for getting 50 points are: - 1<=≤<=n<=≤<=2000 The input limitations for getting 100 points are: - 1<=≤<=n<=≤<=105 Print exactly n<=-<=1 lines: the k-th output line must contain the minimum number of moves needed to make the first k elements of the original sequence ai equal to zero. Please do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams, or the %I64d specifier. Sample Input 4 1 0 1 2 8 1 2 3 4 5 6 7 8 Sample Output 1 1 3 1 3 6 10 16 24 40	{"inputs": ["4\n1 0 1 2", "8\n1 2 3 4 5 6 7 8", "5\n4 1 4 7 6", "9\n13 13 7 11 3 9 3 5 5", "30\n8 17 20 15 18 15 20 10 5 13 5 4 15 9 11 14 18 15 7 16 18 9 17 7 10 9 5 13 17 16", "80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 29 33 19 85 92 91 66 83 39 100 53 20 99 11 81 26 41 36 51 21 72 28 100 34 3 24 58 11 85 73 18 4 45 90 99 42 85 26 71 58 49 76 32 88 13 40 98 57 95 20 36 70 66 75 12 54 96", "120\n242 524 420 973 816 432 247 666 134 849 145 366 608 930 613 315 863 628 97 109 65 704 741 314 736 17 872 971 559 648 223 771 171 327 782 837 303 393 292 339 730 834 794 868 540 251 789 893 23 305 116 220 699 863 580 992 861 393 98 253 544 171 336 207 348 496 316 285 286 727 613 616 304 811 592 916 91 554 962 950 475 473 806 510 986 254 290 351 143 710 573 949 256 216 235 246 533 177 12 764 543 689 490 386 849 694 386 693 134 416 293 589 171 76 527 324 782 661 943 134"], "outputs": ["1\n1\n3", "1\n3\n6\n10\n16\n24\n40", "4\n5\n9\n17", "13\n26\n33\n44\n47\n69\n79\n117", "8\n25\n45\n60\n78\n93\n113\n123\n128\n141\n146\n150\n165\n174\n185\n199\n225\n257\n284\n315\n351\n375\n423\n454\n495\n549\n634\n713\n907", "72\n138\n220\n266\n310\n332\n395\n487\n558\n623\n628\n658\n703\n787\n816\n889\n898\n988\n1013\n1032\n1058\n1073\n1085\n1114\n1147\n1166\n1251\n1343\n1434\n1500\n1583\n1622\n1722\n1775\n1795\n1894\n1905\n1986\n2012\n2053\n2089\n2140\n2161\n2233\n2261\n2361\n2395\n2398\n2431\n2579\n2615\n2719\n2818\n2851\n2867\n2941\n3064\n3182\n3309\n3486\n3603\n3740\n3881\n3969\n4250\n4549\n4775\n5037\n5231\n5465\n5627\n5929\n6460\n7029\n7478\n8085\n9075\n10211\n12070", "242\n766\n1186\n2159\n2975\n3407\n3654\n4320\n4454\n5303\n5448\n5814\n6422\n7352\n7965\n8280\n9143\n9771\n9868\n9977\n10042\n10746\n11487\n11801\n12537\n12554\n13426\n14397\n14956\n15604\n15827\n16598\n16769\n17096\n17878\n18715\n19018\n19411\n19703\n20042\n20772\n21606\n22400\n23268\n23808\n24059\n24848\n25741\n25764\n26069\n26185\n26405\n27104\n27967\n28547\n29539\n30400\n30793\n30891\n31144\n31688\n31859\n32195\n32402\n32992\n34012\n34748\n36006\n37108\n38267\n39127\n40409\n40847\n42507\n43244\n44526\n4..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	76	codeforces
bd4762d12fc7e77b0c0d4de102cb8527	Toy Cars	Little Susie, thanks to her older brother, likes to play with cars. Today she decided to set up a tournament between them. The process of a tournament is described in the next paragraph. There are n toy cars. Each pair collides. The result of a collision can be one of the following: no car turned over, one car turned over, both cars turned over. A car is good if it turned over in no collision. The results of the collisions are determined by an n<=×<=n matrix А: there is a number on the intersection of the і-th row and j-th column that describes the result of the collision of the і-th and the j-th car: - <=-<=1: if this pair of cars never collided. <=-<=1 occurs only on the main diagonal of the matrix. - 0: if no car turned over during the collision. - 1: if only the i-th car turned over during the collision. - 2: if only the j-th car turned over during the collision. - 3: if both cars turned over during the collision. Susie wants to find all the good cars. She quickly determined which cars are good. Can you cope with the task? The first line contains integer n (1<=≤<=n<=≤<=100) — the number of cars. Each of the next n lines contains n space-separated integers that determine matrix A. It is guaranteed that on the main diagonal there are <=-<=1, and <=-<=1 doesn't appear anywhere else in the matrix. It is guaranteed that the input is correct, that is, if Aij<==<=1, then Aji<==<=2, if Aij<==<=3, then Aji<==<=3, and if Aij<==<=0, then Aji<==<=0. Print the number of good cars and in the next line print their space-separated indices in the increasing order. Sample Input 3 -1 0 0 0 -1 1 0 2 -1 4 -1 3 3 3 3 -1 3 3 3 3 -1 3 3 3 3 -1 Sample Output 2 1 3 0	{"inputs": ["3\n-1 0 0\n0 -1 1\n0 2 -1", "4\n-1 3 3 3\n3 -1 3 3\n3 3 -1 3\n3 3 3 -1", "1\n-1", "2\n-1 0\n0 -1", "2\n-1 1\n2 -1", "2\n-1 2\n1 -1", "2\n-1 3\n3 -1"], "outputs": ["2\n1 3 ", "0", "1\n1 ", "2\n1 2 ", "1\n2 ", "1\n1 ", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	18	codeforces
bd5208069eb280e2184f0cb0354c9f46	Roman Digits	Let's introduce a number system which is based on a roman digits. There are digits I, V, X, L which correspond to the numbers $1$, $5$, $10$ and $50$ respectively. The use of other roman digits is not allowed. Numbers in this system are written as a sequence of one or more digits. We define the value of the sequence simply as the sum of digits in it. For example, the number XXXV evaluates to $35$ and the number IXI — to $12$. Pay attention to the difference to the traditional roman system — in our system any sequence of digits is valid, moreover the order of digits doesn't matter, for example IX means $11$, not $9$. One can notice that this system is ambiguous, and some numbers can be written in many different ways. Your goal is to determine how many distinct integers can be represented by exactly $n$ roman digits I, V, X, L. The only line of the input file contains a single integer $n$ ($1 \le n \le 10^9$) — the number of roman digits to use. Output a single integer — the number of distinct integers which can be represented using $n$ roman digits exactly. Sample Input 1 2 10 Sample Output 4 10 244	{"inputs": ["1", "2", "10", "1000", "2000", "5000", "10000", "111199", "101232812", "1000000000", "3", "4", "5", "6", "7", "8", "9", "11", "12", "13", "55", "100", "150", "1200", "9999999", "100000000", "500000000", "600000000", "709000900", "999999999", "12", "10", "20", "35", "56", "83", "116", "155", "198", "244", "292", "14"], "outputs": ["4", "10", "244", "48753", "97753", "244753", "489753", "5448504", "4960407541", "48999999753", "20", "35", "56", "83", "116", "155", "198", "292", "341", "390", "2448", "4653", "7103", "58553", "489999704", "4899999753", "24499999753", "29399999753", "34741043853", "48999999704", "341", "244", "733", "1468", "2497", "3820", "5437", "7348", "9455", "11709", "14061", "439"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	61	codeforces
bd719ab213ef0b26f27fe550275da0a6	Bishwock	Bishwock is a chess figure that consists of three squares resembling an "L-bar". This figure can be rotated by 90, 180 and 270 degrees so it can have four possible states: Bishwocks don't attack any squares and can even occupy on the adjacent squares as long as they don't occupy the same square. Vasya has a board with $2\times n$ squares onto which he wants to put some bishwocks. To his dismay, several squares on this board are already occupied by pawns and Vasya can't put bishwocks there. However, pawns also don't attack bishwocks and they can occupy adjacent squares peacefully. Knowing the positions of pawns on the board, help Vasya to determine the maximum amount of bishwocks he can put onto the board so that they wouldn't occupy the same squares and wouldn't occupy squares with pawns. The input contains two nonempty strings that describe Vasya's board. Those strings contain only symbols "0" (zero) that denote the empty squares and symbols "X" (uppercase English letter) that denote the squares occupied by pawns. Strings are nonempty and are of the same length that does not exceed $100$. Output a single integer — the maximum amount of bishwocks that can be placed onto the given board. Sample Input 00 00 00X00X0XXX0 0XXX0X00X00 0X0X0 0X0X0 0XXX0 00000 Sample Output 1402	{"inputs": ["00\n00", "00X00X0XXX0\n0XXX0X00X00", "0X0X0\n0X0X0", "0XXX0\n00000", "0\n0", "0\nX", "X\n0", "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "0000X0XX000X0XXXX0X0XXXX000X0X0XX000XXX0X00XX00XX00X0000XX0XX00X0X00X0X00X0XX000XX00XXXXXXXXXXXXXXX0\nX00XX0XX00XXXX00XXXX00XX0000000000XXX0X00XX0XX00XXX00X00X0XX0000X00XXXXXXX00X00000XXX00XXX00XXX0X0XX", "X\nX", "X0\n00", "0X\n00", "00\nX0", "00\n0X", "XX\nXX", "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00000\n00000", "00000000\nXXXXXXXX", "X00X0XXXX0\nX0XXX0XX00", "00000XX0000000000000\n0X00000XX0000X00X000", "XXX00XXX0XXX0X0XXXXX\nXXX00XXX0XXX0X0XXXXX", "000X00000X00000X00000000000000\n000X00000X00000X00000000000000", "00X0X00000X0X0X00X0X0XXX0000X0\n0000000X00X000X000000000X00000", "000000000000000000000000000000000000000000\n00X000X00X00X0000X0XX000000000X000X0000000", "X0XXX00XX00X0XXXXXXXX0X0X0XX0X0X0XXXXX00X0XXXX00XX000XX0X000XX000XX\n0000000000000000000000000000000000000000000000000000000000000000000", "0000000000000000000000000000X00000000000000XX0X00000X0000000000000000000000000000000000000\n0000000000000000000000000X0000000000000000000000000000000000000000000000000000000000000000", "0000000000000000000000000000000000000X000000000000000000000X0X00000000000000000000000000000\n000000000000000000000000000X0X0000000000000000000000000000000000000000000000000000000000000", "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\nX0X00000000000000000000000000X000000000X0000X00X000000XX000000X0X00000000X000X000000X0000X00", "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXXXXXXX0XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "XXXXXXXXXXXXXXXXXXXXXXX0XXX000XXXX0XXXXXXXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXXX0X0XXXXXXXXXXXXXXXXXX\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00000XX0000000000000000000000000000000000000000000X0000000X0000000000000X0000000000000000X00000\n00000XX0000000000000000000000000000000000000000000X0000000X0000000000000X0000000000000000X00000", "000000000000000X0000000000000000000000000XX0000000000000000X00000000000000000000000X000000000000\n000000000000000X0000000000000000000000000XX0000000000000000X00000000000000000000000X000000000000", "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000X000X0000000000X00000000X00000000000000000000000000000000000000000000000000000000", "000000000000000000X00X000000000000000000000000000000000000000X00000000X0000000X0000000000000000000X0\n000000000000000000X00X000000000000000000000000000000000000000X00000000X0000000X0000000000000000000X0", "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0XX0XXXXXXXXXXXXXXXX0XXXXXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXXX\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0XX0XXXXXXXXXXXXXXXX0XXXXXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXXX", "XXXXXXXXXXX0X00XXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXX00XXXXXXXXX0X0XXX0XX\nXXXXXXXXXXX0X00XXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXX00XXXXXXXXX0X0XXX0XX", "0X0X0\nX0X0X", "X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0\n0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X", "X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0\n0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X", "X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X\n0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0", "0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X\nX0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0", "00000000000000X0000000000000000000000000000000000000000000000000000000000000000000000000000000000000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX00XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX00\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0", "00XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\nX0XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX\nXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX00XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX", "0000000000000000000000000000000000000000000000000000000000X0000000000000000000000000000000000000X000\n0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000XX\n000000000000000000000000000000000X00000000000000000X000000000000000000000000000000000000000000000000", "0000X00X000000X0000X00X00X0000000000X0000000X000X00000X0X000XXX00000000XX0XX000000000000X00000000000\n000000000XX000000X00000X00X00X00000000000000000X0X000XX0000000000000X0X00X0000X0000X000000X0000000XX", "0000000000000000000000000000000000X0000000000000000000000000000000000000000000000000000000000000000\n000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00000000000000000000000000X000000000000000000000000000000000000000000X00000X0000X000000000000000000\n000X0000000000X000000000000000000000X0000000000X0X0000000000000000000X00000000000000000000000000000", "000X00XX0XX0X00X0XX0XXXX00XXX0X00000000XXX0XXXXXXX0X00X00XX00X0XXX00000XXXX0XX00X00XXX00X0X0XXXX000\nXXXXX000X0XXX000XXXXX0XX0000XX0XXX0XXX000XXX00XXXXX00X00XX0000X0XX0XX0XX000X0XX00X00XX00XX00X00XX0X", "X0X0XXXX0XXXXXXXXXX00XXXXXXXXXXXXXXXXXX0XXXXX0XX0X00X0XXXXXXX0X0XXXXXXXXX0X0X0XX0XX0000XXXX00XXX0XX\nXX0XXXXXXX0X0X00XXXX0X000X0XXXXXX0XXX0X0XXXX0XXXXXXXXXXXXXX00XX00XXX0XXXXXXXXXX00XXXX0XXXX0XXXXXXXX", "000\n000", "000000000000000000000\n000000000000000000000", "00000000000000000000000000000000000000\n00000000000000000000000000000000000000", "0000\n00X0", "000\n00X", "X000\nX000", "X0000X000XX00000000000000000000XX000X0000X00X0X00XX000000000000X0000X0X0XX00\n00X00XX00000000X0000000X000X000X0X0X00X000X0X0X0000X0000000X000XX000XX000X00", "0X00\n0000", "0X0\n000", "000000\n000000", "X00X0\n00000", "000\n0X0", "X000\n00X0", "X0000\n00000", "X000X\nX000X", "X0000X\n00000X", "000000000000\n000000000000", "00000\n0000X"], "outputs": ["1", "4", "0", "2", "0", "0", "0", "0", "18", "0", "1", "1", "1", "1", "0", "66", "3", "0", "2", "10", "1", "17", "12", "23", "24", "57", "58", "55", "2", "7", "56", "59", "64", "65", "60", "0", "2", "0", "0", "0", "0", "0", "66", "1", "1", "1", "0", "66", "65", "49", "65", "62", "16", "4", "2", "14", "25", "2", "1", "2", "33", "2", "1", "4", "2", "1", "2", "3", "2", "3", "8", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	64	codeforces
bd87b63d0f16726a4b3413a926b48787	Colliders	By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating several colliders simultaneously could cause, so the colliders were deactivated. In 2312 there was a startling discovery: a collider's activity is safe if and only if all numbers of activated colliders are pairwise relatively prime to each other (two numbers are relatively prime if their greatest common divisor equals 1)! If two colliders with relatively nonprime numbers are activated, it will cause a global collapse. Upon learning this, physicists rushed to turn the colliders on and off and carry out all sorts of experiments. To make sure than the scientists' quickness doesn't end with big trouble, the Large Hadron Colliders' Large Remote Control was created. You are commissioned to write the software for the remote (well, you do not expect anybody to operate it manually, do you?). Initially, all colliders are deactivated. Your program receives multiple requests of the form "activate/deactivate the i-th collider". The program should handle requests in the order of receiving them. The program should print the processed results in the format described below. To the request of "+ i" (that is, to activate the i-th collider), the program should print exactly one of the following responses: - "Success" if the activation was successful. - "Already on", if the i-th collider was already activated before the request. - "Conflict with j", if there is a conflict with the j-th collider (that is, the j-th collider is on, and numbers i and j are not relatively prime). In this case, the i-th collider shouldn't be activated. If a conflict occurs with several colliders simultaneously, you should print the number of any of them. The request of "- i" (that is, to deactivate the i-th collider), should receive one of the following responses from the program: - "Success", if the deactivation was successful. - "Already off", if the i-th collider was already deactivated before the request. You don't need to print quotes in the output of the responses to the requests. The first line contains two space-separated integers n and m (1<=≤<=n,<=m<=≤<=105) — the number of colliders and the number of requests, correspondingly. Next m lines contain numbers of requests, one per line, in the form of either "+ i" (without the quotes) — activate the i-th collider, or "- i" (without the quotes) — deactivate the i-th collider (1<=≤<=i<=≤<=n). Print m lines — the results of executing requests in the above given format. The requests should be processed in the order, in which they are given in the input. Don't forget that the responses to the requests should be printed without quotes. Sample Input 10 10 + 6 + 10 + 5 - 10 - 5 - 6 + 10 + 3 + 6 + 3 Sample Output Success Conflict with 6 Success Already off Success Success Success Success Conflict with 10 Already on	{"inputs": ["10 10\n+ 6\n+ 10\n+ 5\n- 10\n- 5\n- 6\n+ 10\n+ 3\n+ 6\n+ 3", "7 5\n+ 7\n+ 6\n+ 4\n+ 3\n- 7", "10 5\n+ 2\n- 8\n- 4\n- 10\n+ 1", "10 10\n+ 1\n+ 10\n- 1\n- 10\n+ 1\n- 1\n+ 7\n+ 8\n+ 6\n- 7", "15 15\n+ 12\n+ 6\n+ 13\n- 13\n+ 7\n+ 14\n+ 8\n+ 13\n- 13\n+ 15\n+ 4\n+ 10\n+ 11\n+ 2\n- 14", "2 20\n+ 1\n+ 2\n- 2\n+ 2\n- 1\n- 2\n+ 2\n- 2\n+ 2\n+ 1\n- 1\n+ 1\n- 1\n- 2\n+ 1\n- 1\n+ 1\n- 1\n+ 2\n+ 1", "2 20\n- 1\n- 2\n- 1\n- 2\n+ 2\n+ 1\n- 1\n+ 1\n+ 1\n+ 2\n- 2\n+ 1\n- 2\n+ 2\n+ 1\n+ 1\n+ 1\n- 1\n- 1\n- 2", "25 20\n+ 7\n+ 14\n- 7\n+ 11\n+ 15\n+ 10\n+ 20\n- 15\n+ 13\n- 14\n+ 4\n- 11\n- 20\n+ 15\n+ 16\n+ 3\n+ 11\n+ 22\n- 16\n- 22", "50 30\n- 39\n- 2\n+ 37\n- 10\n+ 27\n- 25\n+ 41\n+ 23\n- 36\n+ 49\n+ 5\n- 28\n+ 22\n+ 45\n+ 1\n+ 23\n+ 36\n+ 35\n- 4\n- 28\n- 10\n- 36\n- 38\n- 2\n- 38\n- 38\n- 37\n+ 8\n- 27\n- 28", "50 50\n+ 14\n+ 4\n+ 20\n+ 37\n+ 50\n+ 46\n+ 19\n- 20\n+ 25\n+ 47\n+ 10\n+ 6\n+ 34\n+ 12\n+ 41\n- 47\n+ 9\n+ 22\n+ 28\n- 41\n- 34\n+ 47\n+ 40\n- 12\n+ 42\n- 9\n- 4\n+ 15\n- 15\n+ 27\n+ 8\n+ 38\n+ 9\n+ 4\n+ 17\n- 8\n+ 13\n- 47\n+ 7\n- 9\n- 38\n+ 30\n+ 48\n- 50\n- 7\n+ 41\n+ 34\n+ 23\n+ 11\n+ 16", "100 1\n+ 51", "1 100\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1\n+ 1\n- 1", "100 50\n+ 2\n+ 3\n+ 5\n+ 7\n+ 11\n+ 13\n+ 17\n+ 19\n+ 23\n+ 29\n+ 31\n+ 37\n+ 41\n+ 43\n+ 47\n+ 53\n+ 59\n+ 61\n+ 67\n+ 71\n+ 73\n+ 79\n+ 83\n+ 89\n+ 97\n+ 52\n+ 96\n+ 54\n+ 56\n+ 88\n+ 69\n+ 65\n+ 84\n+ 10\n+ 85\n- 37\n+ 80\n- 53\n+ 25\n- 5\n+ 45\n+ 90\n+ 95\n+ 33\n+ 81\n+ 6\n+ 20\n- 10\n+ 94\n- 61", "100000 1\n+ 12345", "4 2\n+ 2\n+ 4", "100000 2\n+ 57314\n+ 85971", "100000 4\n+ 81799\n+ 81799\n- 81799\n+ 81799"], "outputs": ["Success\nConflict with 6\nSuccess\nAlready off\nSuccess\nSuccess\nSuccess\nSuccess\nConflict with 10\nAlready on", "Success\nSuccess\nConflict with 6\nConflict with 6\nSuccess", "Success\nAlready off\nAlready off\nAlready off\nSuccess", "Success\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nConflict with 8\nSuccess", "Success\nConflict with 12\nSuccess\nSuccess\nSuccess\nConflict with 12\nConflict with 12\nSuccess\nSuccess\nConflict with 12\nConflict with 12\nConflict with 12\nSuccess\nConflict with 12\nAlready off", "Success\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess", "Already off\nAlready off\nAlready off\nAlready off\nSuccess\nSuccess\nSuccess\nSuccess\nAlready on\nAlready on\nSuccess\nAlready on\nAlready off\nSuccess\nAlready on\nAlready on\nAlready on\nSuccess\nAlready off\nSuccess", "Success\nConflict with 7\nSuccess\nSuccess\nSuccess\nConflict with 15\nConflict with 15\nSuccess\nSuccess\nAlready off\nSuccess\nSuccess\nAlready off\nSuccess\nConflict with 4\nConflict with 15\nSuccess\nConflict with 4\nAlready off\nAlready off", "Already off\nAlready off\nSuccess\nAlready off\nSuccess\nAlready off\nSuccess\nSuccess\nAlready off\nSuccess\nSuccess\nAlready off\nSuccess\nConflict with 27\nSuccess\nAlready on\nConflict with 22\nConflict with 5\nAlready off\nAlready off\nAlready off\nAlready off\nAlready off\nAlready off\nAlready off\nAlready off\nSuccess\nConflict with 22\nSuccess\nAlready off", "Success\nConflict with 14\nConflict with 14\nSuccess\nConflict with 14\nConflict with 14\nSuccess\nAlready off\nSuccess\nSuccess\nConflict with 14\nConflict with 14\nConflict with 14\nConflict with 14\nSuccess\nSuccess\nSuccess\nConflict with 14\nConflict with 14\nSuccess\nAlready off\nSuccess\nConflict with 14\nAlready off\nConflict with 14\nSuccess\nAlready off\nConflict with 25\nAlready off\nSuccess\nConflict with 14\nConflict with 14\nConflict with 27\nConflict with 14\nSuccess\nAlready off\nSuccess\nS...", "Success", "Success\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess...", "Success\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nSuccess\nConflict with 2\nConflict with 2\nConflict with 2\nConflict with 2\nConflict with 2\nConflict with 3\nConflict with 5\nConflict with 2\nConflict with 2\nConflict with 5\nSuccess\nConflict with 2\nSuccess\nConflict with 5\nSuccess\nConflict with 3\nConflict with 2\nConflict with 19\nCon...", "Success", "Success\nConflict with 2", "Success\nConflict with 57314", "Success\nAlready on\nSuccess\nSuccess"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	15	codeforces
bd93876715337bec98a7dcf52670749a	Selection of Personnel	One company of IT City decided to create a group of innovative developments consisting from 5 to 7 people and hire new employees for it. After placing an advertisment the company received n resumes. Now the HR department has to evaluate each possible group composition and select one of them. Your task is to count the number of variants of group composition to evaluate. The only line of the input contains one integer n (7<=≤<=n<=≤<=777) — the number of potential employees that sent resumes. Output one integer — the number of different variants of group composition. Sample Input 7 Sample Output 29	{"inputs": ["7", "8", "9", "10", "321", "624", "666", "700", "776", "777"], "outputs": ["29", "92", "246", "582", "66715035255088", "7147161340917624", "11292070960994226", "16017044425409540", "33019955679376860", "33319741730082870"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	22	codeforces
bd9edbfd06ea3a9c193aa506376798d5	Queue at the School	During the break the schoolchildren, boys and girls, formed a queue of n people in the canteen. Initially the children stood in the order they entered the canteen. However, after a while the boys started feeling awkward for standing in front of the girls in the queue and they started letting the girls move forward each second. Let's describe the process more precisely. Let's say that the positions in the queue are sequentially numbered by integers from 1 to n, at that the person in the position number 1 is served first. Then, if at time x a boy stands on the i-th position and a girl stands on the (i<=+<=1)-th position, then at time x<=+<=1 the i-th position will have a girl and the (i<=+<=1)-th position will have a boy. The time is given in seconds. You've got the initial position of the children, at the initial moment of time. Determine the way the queue is going to look after t seconds. The first line contains two integers n and t (1<=≤<=n,<=t<=≤<=50), which represent the number of children in the queue and the time after which the queue will transform into the arrangement you need to find. The next line contains string s, which represents the schoolchildren's initial arrangement. If the i-th position in the queue contains a boy, then the i-th character of string s equals "B", otherwise the i-th character equals "G". Print string a, which describes the arrangement after t seconds. If the i-th position has a boy after the needed time, then the i-th character a must equal "B", otherwise it must equal "G". Sample Input 5 1 BGGBG 5 2 BGGBG 4 1 GGGB Sample Output GBGGB GGBGB GGGB	{"inputs": ["5 1\nBGGBG", "5 2\nBGGBG", "4 1\nGGGB", "2 1\nBB", "2 1\nBG", "6 2\nBBGBBG", "8 3\nBBGBGBGB", "10 3\nBBGBBBBBBG", "22 7\nGBGGBGGGGGBBBGGBGBGBBB", "50 4\nGBBGBBBGGGGGBBGGBBBBGGGBBBGBBBGGBGGBGBBBGGBGGBGGBG", "50 8\nGGGGBGGBGGGBGBBBGGGGGGGGBBGBGBGBBGGBGGBGGGGGGGGBBG", "50 30\nBGGGGGGBGGBGBGGGGBGBBGBBBGGBBBGBGBGGGGGBGBBGBGBGGG", "20 20\nBBGGBGGGGBBBGBBGGGBB", "27 6\nGBGBGBGGGGGGBGGBGGBBGBBBGBB", "46 11\nBGGGGGBGBGGBGGGBBGBBGBBGGBBGBBGBGGGGGGGBGBGBGB", "50 6\nBGGBBBBGGBBBBBBGGBGBGBBBBGBBBBBBGBBBBBBBBBBBBBBBBB", "50 10\nBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB", "50 8\nGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG", "50 10\nBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBGB", "50 13\nGGGBGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG", "1 1\nB", "1 1\nG", "1 50\nB", "1 50\nG", "50 50\nBBBBBBBBGGBBBBBBGBBBBBBBBBBBGBBBBBBBBBBBBBBGBBBBBB", "50 50\nGGBBGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGBBGGGGGGBG", "6 3\nGGBBBG", "26 3\nGBBGBBBBBGGGBGBGGGBGBGGBBG", "46 3\nGGBBGGGGBBGBGBBBBBGGGBGGGBBGGGBBBGGBGGBBBGBGBB", "44 8\nBGBBBBBBBBBGGBBGBGBGGBBBBBGBBGBBBBBBBBBGBBGB", "20 20\nBBGGBGGGGBBBGBBGGGBB", "30 25\nBGGBBGBGGBGBGBBGBGGGGBGBGGBBBB", "17 42\nBBGBGBGGGGGGBBGGG", "30 50\nBGGBBGGGGGGGGBBGGGBBGGBBBGBBGG", "31 33\nBBGGBBGGBGBBBBGGBGBBBGBGGBBGBBB", "2 2\nBG", "8 8\nGGGBGGBB", "34 34\nBGGBBBBGGBBGBGGGGGGBBGGGGGBGGBGGGB", "34 20\nBBBBGBGGGBGGGBGBGGBBBBGGBBGGGBGBBG", "50 50\nBBGBBBBBBBBBBBBGBBBGBBBBBBBGBBBBBBGBBBGBBGBBGBBBGG", "10 10\nGGGGGGGGGG", "10 10\nBBBBBBBBBB", "10 10\nBGBGBGBGBG", "1 1\nB"], "outputs": ["GBGGB", "GGBGB", "GGGB", "BB", "GB", "GBBGBB", "GGBGBBBB", "GBBBBBGBBB", "GGGGGGGGBGGBGGBBBBBBBB", "GGBGBGBGBGBGGGBBGBGBGBGBBBGBGBGBGBGBGBGBGBGBGGBGBB", "GGGGGGGGGGGGBGGBGBGBGBGBGGGGGGBGBGBGBGBGBGGBGGBGBB", "GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGBBBBBBBBBBBBBBBBBBBB", "GGGGGGGGGGBBBBBBBBBB", "GGGGGGGBGBGBGGGGGBGBBBBBBBB", "GGGGGGGGGGGBGGGGGBBGBGBGBGBGBGBGBGBGBGBGBBBBBB", "GGGGBBBBBGBGBGBGBBBGBBBBBBGBBBBBBBBBBBBBBBBBBBBBBB", "BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB", "GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG", "BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBGBBBBBBBBBBB", "GGGGGGGGGGGGGGGGBGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG", "B", "G", "B", "G", "GGGGGBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB", "GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGBBBBB", "GGGBBB", "GGBBBBGBGBGBGGGBGBGGGBGBBB", "GGGGBGBGGGBBBBBGBGBGBGGGBGGBGBGBGBGBGBGBGBBBBB", "GBBGBGBGBGBGBGBBBBGBBGBBBBBBBBBGBBGBBBBBBBBB", "GGGGGGGGGGBBBBBBBBBB", "GGGGGGGGGGGGGGGBBBBBBBBBBBBBBB", "GGGGGGGGGGGBBBBBB", "GGGGGGGGGGGGGGGGGGBBBBBBBBBBBB", "GGGGGGGGGGGGBBBBBBBBBBBBBBBBBBB", "GB", "GGGGGBBB", "GGGGGGGGGGGGGGGGGGGGGBBBBBBBBBBBBB", "GGGGGGGGGGGGGGGGGBBBBBBBBBBBBBBBBB", "GGGGGGGGGGBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB", "GGGGGGGGGG", "BBBBBBBBBB", "GGGGGBBBBB", "B"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	274	codeforces
bda0355b3e14ac689c64b4f8e787b398	Fedor and Essay	After you had helped Fedor to find friends in the «Call of Soldiers 3» game, he stopped studying completely. Today, the English teacher told him to prepare an essay. Fedor didn't want to prepare the essay, so he asked Alex for help. Alex came to help and wrote the essay for Fedor. But Fedor didn't like the essay at all. Now Fedor is going to change the essay using the synonym dictionary of the English language. Fedor does not want to change the meaning of the essay. So the only change he would do: change a word from essay to one of its synonyms, basing on a replacement rule from the dictionary. Fedor may perform this operation any number of times. As a result, Fedor wants to get an essay which contains as little letters «R» (the case doesn't matter) as possible. If there are multiple essays with minimum number of «R»s he wants to get the one with minimum length (length of essay is the sum of the lengths of all the words in it). Help Fedor get the required essay. Please note that in this problem the case of letters doesn't matter. For example, if the synonym dictionary says that word cat can be replaced with word DOG, then it is allowed to replace the word Cat with the word doG. The first line contains a single integer m (1<=≤<=m<=≤<=105) — the number of words in the initial essay. The second line contains words of the essay. The words are separated by a single space. It is guaranteed that the total length of the words won't exceed 105 characters. The next line contains a single integer n (0<=≤<=n<=≤<=105) — the number of pairs of words in synonym dictionary. The i-th of the next n lines contains two space-separated non-empty words xi and yi. They mean that word xi can be replaced with word yi (but not vise versa). It is guaranteed that the total length of all pairs of synonyms doesn't exceed 5·105 characters. All the words at input can only consist of uppercase and lowercase letters of the English alphabet. Print two integers — the minimum number of letters «R» in an optimal essay and the minimum length of an optimal essay. Sample Input 3 AbRb r Zz 4 xR abRb aA xr zz Z xr y 2 RuruRu fedya 1 ruruRU fedor Sample Output 2 6 1 10	{"inputs": ["3\nAbRb r Zz\n4\nxR abRb\naA xr\nzz Z\nxr y", "2\nRuruRu fedya\n1\nruruRU fedor", "1\nffff\n1\nffff r", "2\nYURA YUrA\n1\nyura fedya", "5\nhello my name is fedya\n2\nhello hi\nis i", "5\nawiuegjsrkjshegkjshegseg g soeigjseg www s\n3\nwww s\nawiuegjsrkjshegkjshegseg wwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww\nwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww www", "5\naa bb cc ee ff\n5\naa a\nbb aa\ncc bb\nee cc\nff bb", "7\nraki vezde est awjgkawkgjn ttttt raki raks\n4\nraks rks\nrks raks\nraki raks\nvezde pss", "5\nfedor fedya www awwwwwww a\n5\nr a\nfedor fedr\nwww a\nawwwwwww www\na r", "1\nYURA\n1\nyura lesha", "2\nABBABAABBAABABBABAABABBAABBABAABBAABABBAABBABAABABBABAABBAABABBA ABBABAABBAABABBABAABABBAABBABAABBAABABBAABBABAABABBABAABBAABABA\n2\nABBABAABBAABABBABAABABBAABBABAABBAABABBAABBABAABABBABAABBAABABA neuzaiheshi\nABBABAABBAABABBABAABABBAABBABAABBAABABBAABBABAABABBABAABBAABABBA ABBABAABBAABABBABAABABBAABBABAABBAABABBAABBABAABABBABAABBAABABA", "10\nlalka lolka yura lesha fedya bredor tourist www qqq gruihdrkgjp\n11\nlalka lolka\nlolka lalka\nyura lolka\nlalka poka\nfedya bredor\nbredor yura\ntourist bredor\nwww qqq\nqqq w\nw g\ngruihdrkgjp bredor", "1\nR\n0", "3\nreka greka rak\n11\nrek rak\nrak grek\nreka rak\ngreka reka\nrak reka\nrak greka\ngreka rak\nlol rek\nlol rak\nLO lol\nABA BA", "3\nreka greka rak\n13\nrek rak\nrak grek\nreka rak\ngreka reka\nrak reka\nrak greka\ngreka rak\nlol rek\nlol rak\nlol LO\nABA BA\nLOLKA rak\nrak lol", "1\nr\n0", "5\nfEdOR Is A bAd BoY\n2\nboy boYy\nFeDor fedyaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "1\nyrwlqadsfw\n2\nmnqdxczpyo a\na mnqdxczpyo", "4\nr rr rrr rrrr\n9\nrr rrr\nrrrr rr\nr rr\nr rrrr\nrrr rr\nrrr rrr\nrr rrr\nrr r\nr r"], "outputs": ["2 6", "1 10", "0 4", "0 10", "0 14", "0 13", "0 5", "3 31", "1 12", "0 5", "0 22", "0 35", "1 1", "3 9", "0 6", "1 1", "0 70", "1 10", "4 4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
bdb9dc8c6e0599d351c32f5631a32ceb	Igor and his way to work	Woken up by the alarm clock Igor the financial analyst hurried up to the work. He ate his breakfast and sat in his car. Sadly, when he opened his GPS navigator, he found that some of the roads in Bankopolis, the city where he lives, are closed due to road works. Moreover, Igor has some problems with the steering wheel, so he can make no more than two turns on his way to his office in bank. Bankopolis looks like a grid of n rows and m columns. Igor should find a way from his home to the bank that has no more than two turns and doesn't contain cells with road works, or determine that it is impossible and he should work from home. A turn is a change in movement direction. Igor's car can only move to the left, to the right, upwards and downwards. Initially Igor can choose any direction. Igor is still sleepy, so you should help him. The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=1000) — the number of rows and the number of columns in the grid. Each of the next n lines contains m characters denoting the corresponding row of the grid. The following characters can occur: - "." — an empty cell; - "" — a cell with road works; - "S" — the cell where Igor's home is located; - "T" — the cell where Igor's office is located. It is guaranteed that "S" and "T" appear exactly once each. In the only line print "YES" if there is a path between Igor's home and Igor's office with no more than two turns, and "NO" otherwise. Sample Input 5 5 ..S.. *. T.... . ..... 5 5 S.... . ..... .** ..T.. Sample Output YESNO	{"inputs": ["5 5\nS....\n**.\n.....\n.*\n..T..", "1 2\nST", "3 1\nS\n\nT", "3 3\n..\n...\nTS.", "3 3\nT.\n.\nS", "7 7\n.S.***\n.....\n.**..\n..*.\n..T...\n*...\n*****", "3 3\nT\nS\n**", "2 2\nST\n.", "2 2\nS.\n.T", "2 2\nTS\n.", "2 2\n.T\nS"], "outputs": ["NO", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	16	codeforces
bdbd3d0e9509abf077169578711b6d9d	Cookies	Olga came to visit the twins Anna and Maria and saw that they have many cookies. The cookies are distributed into bags. As there are many cookies, Olga decided that it's no big deal if she steals a bag. However, she doesn't want the sisters to quarrel because of nothing when they divide the cookies. That's why Olga wants to steal a bag with cookies so that the number of cookies in the remaining bags was even, that is, so that Anna and Maria could evenly divide it into two (even 0 remaining cookies will do, just as any other even number). How many ways there are to steal exactly one cookie bag so that the total number of cookies in the remaining bags was even? The first line contains the only integer n (1<=≤<=n<=≤<=100) — the number of cookie bags Anna and Maria have. The second line contains n integers ai (1<=≤<=ai<=≤<=100) — the number of cookies in the i-th bag. Print in the only line the only number — the sought number of ways. If there are no such ways print 0. Sample Input 1 1 10 1 2 2 3 4 4 4 2 2 2 11 2 2 2 2 2 2 2 2 2 2 99 Sample Output 1 8 1	{"inputs": ["1\n1", "10\n1 2 2 3 4 4 4 2 2 2", "11\n2 2 2 2 2 2 2 2 2 2 99", "2\n1 1", "2\n2 2", "2\n1 2", "7\n7 7 7 7 7 7 7", "8\n1 2 3 4 5 6 7 8", "100\n1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2 1 1 1 1 1 2 2 2 2 2", "99\n99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99 100 99", "82\n43 44 96 33 23 42 33 66 53 87 8 90 43 91 40 88 51 18 48 62 59 10 22 20 54 6 13 63 2 56 31 52 98 42 54 32 26 77 9 24 33 91 16 30 39 34 78 82 73 90 12 15 67 76 30 18 44 86 84 98 65 54 100 79 28 34 40 56 11 43 72 35 86 59 89 40 30 33 7 19 44 15", "17\n50 14 17 77 74 74 38 76 41 27 45 29 66 98 38 73 38", "94\n81 19 90 99 26 11 86 44 78 36 80 59 99 90 78 72 71 20 94 56 42 40 71 84 10 85 10 70 52 27 39 55 90 16 48 25 7 79 99 100 38 10 99 56 3 4 78 9 16 57 14 40 52 54 57 70 30 86 56 84 97 60 59 69 49 66 23 92 90 46 86 73 53 47 1 83 14 20 24 66 13 45 41 14 86 75 55 88 48 95 82 24 47 87", "88\n64 95 12 90 40 65 98 45 52 54 79 7 81 25 98 19 68 82 41 53 35 50 5 22 32 21 8 39 8 6 72 27 81 30 12 79 21 42 60 2 66 87 46 93 62 78 52 71 76 32 78 94 86 85 55 15 34 76 41 20 32 26 94 81 89 45 74 49 11 40 40 39 49 46 80 85 90 23 80 40 86 58 70 26 48 93 23 53", "84\n95 9 43 43 13 84 60 90 1 8 97 99 54 34 59 83 33 15 51 26 40 12 66 65 19 30 29 78 92 60 25 13 19 84 71 73 12 24 54 49 16 41 11 40 57 59 34 40 39 9 71 83 1 77 79 53 94 47 78 55 77 85 29 52 80 90 53 77 97 97 27 79 28 23 83 25 26 22 49 86 63 56 3 32", "47\n61 97 76 94 91 22 2 68 62 73 90 47 16 79 44 71 98 68 43 6 53 52 40 27 68 67 43 96 14 91 60 61 96 24 97 13 32 65 85 96 81 77 34 18 23 14 80", "69\n71 1 78 74 58 89 30 6 100 90 22 61 11 59 14 74 27 25 78 61 45 19 25 33 37 4 52 43 53 38 9 100 56 67 69 38 76 91 63 60 93 52 28 61 9 98 8 14 57 63 89 64 98 51 36 66 36 86 13 82 50 91 52 64 86 78 78 83 81", "52\n38 78 36 75 19 3 56 1 39 97 24 79 84 16 93 55 96 64 12 24 1 86 80 29 12 32 36 36 73 39 76 65 53 98 30 20 28 8 86 43 70 22 75 69 62 65 81 25 53 40 71 59", "74\n81 31 67 97 26 75 69 81 11 13 13 74 77 88 52 20 52 64 66 75 72 28 41 54 26 75 41 91 75 15 18 36 13 83 63 61 14 48 53 63 19 67 35 48 23 65 73 100 44 55 92 88 99 17 73 25 83 7 31 89 12 80 98 39 42 75 14 29 81 35 77 87 33 94", "44\n46 56 31 31 37 71 94 2 14 100 45 72 36 72 80 3 38 54 42 98 50 32 31 42 62 31 45 50 95 100 18 17 64 22 18 25 52 56 70 57 43 40 81 28", "22\n28 57 40 74 51 4 45 84 99 12 95 14 92 60 47 81 84 51 31 91 59 42", "59\n73 45 94 76 41 49 65 13 74 66 36 25 47 75 40 23 92 72 11 32 32 8 81 26 68 56 41 8 76 47 96 55 70 11 84 14 83 18 70 22 30 39 28 100 48 11 92 45 78 69 86 1 54 90 98 91 13 17 35", "63\n20 18 44 94 68 57 16 43 74 55 68 24 21 95 76 84 50 50 47 86 86 12 58 55 28 72 86 18 34 45 81 88 3 72 41 9 60 90 81 93 12 6 9 6 2 41 1 7 9 29 81 14 64 80 20 36 67 54 7 5 35 81 22", "28\n49 84 48 19 44 91 11 82 96 95 88 90 71 82 87 25 31 23 18 13 98 45 26 65 35 12 31 14", "61\n34 18 28 64 28 45 9 77 77 20 63 92 79 16 16 100 86 2 91 91 57 15 31 95 10 88 84 5 82 83 53 98 59 17 97 80 76 80 81 3 91 81 87 93 61 46 10 49 6 22 21 75 63 89 21 81 30 19 67 38 77", "90\n41 90 43 1 28 75 90 50 3 70 76 64 81 63 25 69 83 82 29 91 59 66 21 61 7 55 72 49 38 69 72 20 64 58 30 81 61 29 96 14 39 5 100 20 29 98 75 29 44 78 97 45 26 77 73 59 22 99 41 6 3 96 71 20 9 18 96 18 90 62 34 78 54 5 41 6 73 33 2 54 26 21 18 6 45 57 43 73 95 75", "45\n93 69 4 27 20 14 71 48 79 3 32 26 49 30 57 88 13 56 49 61 37 32 47 41 41 70 45 68 82 18 8 6 25 20 15 13 71 99 28 6 52 34 19 59 26", "33\n29 95 48 49 91 10 83 71 47 25 66 36 51 12 34 10 54 74 41 96 89 26 89 1 42 33 1 62 9 32 49 65 78", "34\n98 24 42 36 41 82 28 58 89 34 77 70 76 44 74 54 66 100 13 79 4 88 21 1 11 45 91 29 87 100 29 54 82 78", "29\n91 84 26 84 9 63 52 9 65 56 90 2 36 7 67 33 91 14 65 38 53 36 81 83 85 14 33 95 51", "100\n2 88 92 82 87 100 78 28 84 43 78 32 43 33 97 19 15 52 29 84 57 72 54 13 99 28 82 79 40 70 34 92 91 53 9 88 27 43 14 92 72 37 26 37 20 95 19 34 49 64 33 37 34 27 80 79 9 54 99 68 25 4 68 73 46 66 24 78 3 87 26 52 50 84 4 95 23 83 39 58 86 36 33 16 98 2 84 19 53 12 69 60 10 11 78 17 79 92 77 59", "100\n2 95 45 73 9 54 20 97 57 82 88 26 18 71 25 27 75 54 31 11 58 85 69 75 72 91 76 5 25 80 45 49 4 73 8 81 81 38 5 12 53 77 7 96 90 35 28 80 73 94 19 69 96 17 94 49 69 9 32 19 5 12 46 29 26 40 59 59 6 95 82 50 72 2 45 69 12 5 72 29 39 72 23 96 81 28 28 56 68 58 37 41 30 1 90 84 15 24 96 43", "100\n27 72 35 91 13 10 35 45 24 55 83 84 63 96 29 79 34 67 63 92 48 83 18 77 28 27 49 66 29 88 55 15 6 58 14 67 94 36 77 7 7 64 61 52 71 18 36 99 76 6 50 67 16 13 41 7 89 73 61 51 78 22 78 32 76 100 3 31 89 71 63 53 15 85 77 54 89 33 68 74 3 23 57 5 43 89 75 35 9 86 90 11 31 46 48 37 74 17 77 8", "100\n69 98 69 88 11 49 55 8 25 91 17 81 47 26 15 73 96 71 18 42 42 61 48 14 92 78 35 72 4 27 62 75 83 79 17 16 46 80 96 90 82 54 37 69 85 21 67 70 96 10 46 63 21 59 56 92 54 88 77 30 75 45 44 29 86 100 51 11 65 69 66 56 82 63 27 1 51 51 13 10 3 55 26 85 34 16 87 72 13 100 81 71 90 95 86 50 83 55 55 54", "100\n34 35 99 64 2 66 78 93 20 48 12 79 19 10 87 7 42 92 60 79 5 2 24 89 57 48 63 92 74 4 16 51 7 12 90 48 87 17 18 73 51 58 97 97 25 38 15 97 96 73 67 91 6 75 14 13 87 79 75 3 15 55 35 95 71 45 10 13 20 37 82 26 2 22 13 83 97 84 39 79 43 100 54 59 98 8 61 34 7 65 75 44 24 77 73 88 34 95 44 77", "100\n15 86 3 1 51 26 74 85 37 87 64 58 10 6 57 26 30 47 85 65 24 72 50 40 12 35 91 47 91 60 47 87 95 34 80 91 26 3 36 39 14 86 28 70 51 44 28 21 72 79 57 61 16 71 100 94 57 67 36 74 24 21 89 85 25 2 97 67 76 53 76 80 97 64 35 13 8 32 21 52 62 61 67 14 74 73 66 44 55 76 24 3 43 42 99 61 36 80 38 66", "100\n45 16 54 54 80 94 74 93 75 85 58 95 79 30 81 2 84 4 57 23 92 64 78 1 50 36 13 27 56 54 10 77 87 1 5 38 85 74 94 82 30 45 72 83 82 30 81 82 82 3 69 82 7 92 39 60 94 42 41 5 3 17 67 21 79 44 79 96 28 3 53 68 79 89 63 83 1 44 4 31 84 15 73 77 19 66 54 6 73 1 67 24 91 11 86 45 96 82 20 89", "100\n84 23 50 32 90 71 92 43 58 70 6 82 7 55 85 19 70 89 12 26 29 56 74 30 2 27 4 39 63 67 91 81 11 33 75 10 82 88 39 43 43 80 68 35 55 67 53 62 73 65 86 74 43 51 14 48 42 92 83 57 22 33 24 99 5 27 78 96 7 28 11 15 8 38 85 67 5 92 24 96 57 59 14 95 91 4 9 18 45 33 74 83 64 85 14 51 51 94 29 2", "100\n77 56 56 45 73 55 32 37 39 50 30 95 79 21 44 34 51 43 86 91 39 30 85 15 35 93 100 14 57 31 80 79 38 40 88 4 91 54 7 95 76 26 62 84 17 33 67 47 6 82 69 51 17 2 59 24 11 12 31 90 12 11 55 38 72 49 30 50 42 46 5 97 9 9 30 45 86 23 19 82 40 42 5 40 35 98 35 32 60 60 5 28 84 35 21 49 68 53 68 23", "100\n78 38 79 61 45 86 83 83 86 90 74 69 2 84 73 39 2 5 20 71 24 80 54 89 58 34 77 40 39 62 2 47 28 53 97 75 88 98 94 96 33 71 44 90 47 36 19 89 87 98 90 87 5 85 34 79 82 3 42 88 89 63 35 7 89 30 40 48 12 41 56 76 83 60 80 80 39 56 77 4 72 96 30 55 57 51 7 19 11 1 66 1 91 87 11 62 95 85 79 25", "100\n5 34 23 20 76 75 19 51 17 82 60 13 83 6 65 16 20 43 66 54 87 10 87 73 50 24 16 98 33 28 80 52 54 82 26 92 14 13 84 92 94 29 61 21 60 20 48 94 24 20 75 70 58 27 68 45 86 89 29 8 67 38 83 48 18 100 11 22 46 84 52 97 70 19 50 75 3 7 52 53 72 41 18 31 1 38 49 53 11 64 99 76 9 87 48 12 100 32 44 71", "100\n76 89 68 78 24 72 73 95 98 72 58 15 2 5 56 32 9 65 50 70 94 31 29 54 89 52 31 93 43 56 26 35 72 95 51 55 78 70 11 92 17 5 54 94 81 31 78 95 73 91 95 37 59 9 53 48 65 55 84 8 45 97 64 37 96 34 36 53 66 17 72 48 99 23 27 18 92 84 44 73 60 78 53 29 68 99 19 39 61 40 69 6 77 12 47 29 15 4 8 45", "100\n82 40 31 53 8 50 85 93 3 84 54 17 96 59 51 42 18 19 35 84 79 31 17 46 54 82 72 49 35 73 26 89 61 73 3 50 12 29 25 77 88 21 58 24 22 89 96 54 82 29 96 56 77 16 1 68 90 93 20 23 57 22 31 18 92 90 51 14 50 72 31 54 12 50 66 62 2 34 17 45 68 50 87 97 23 71 1 72 17 82 42 15 20 78 4 49 66 59 10 17", "100\n32 82 82 24 39 53 48 5 29 24 9 37 91 37 91 95 1 97 84 52 12 56 93 47 22 20 14 17 40 22 79 34 24 2 69 30 69 29 3 89 21 46 60 92 39 29 18 24 49 18 40 22 60 13 77 50 39 64 50 70 99 8 66 31 90 38 20 54 7 21 5 56 41 68 69 20 54 89 69 62 9 53 43 89 81 97 15 2 52 78 89 65 16 61 59 42 56 25 32 52", "100\n72 54 23 24 97 14 99 87 15 25 7 23 17 87 72 31 71 87 34 82 51 77 74 85 62 38 24 7 84 48 98 21 29 71 70 84 25 58 67 92 18 44 32 9 81 15 53 29 63 18 86 16 7 31 38 99 70 32 89 16 23 11 66 96 69 82 97 59 6 9 49 80 85 19 6 9 52 51 85 74 53 46 73 55 31 63 78 61 34 80 77 65 87 77 92 52 89 8 52 31", "100\n56 88 8 19 7 15 11 54 35 50 19 57 63 72 51 43 50 19 57 90 40 100 8 92 11 96 30 32 59 65 93 47 62 3 50 41 30 50 72 83 61 46 83 60 20 46 33 1 5 18 83 22 34 16 41 95 63 63 7 59 55 95 91 29 64 60 64 81 45 45 10 9 88 37 69 85 21 82 41 76 42 34 47 78 51 83 65 100 13 22 59 76 63 1 26 86 36 94 99 74", "100\n27 89 67 60 62 80 43 50 28 88 72 5 94 11 63 91 18 78 99 3 71 26 12 97 74 62 23 24 22 3 100 72 98 7 94 32 12 75 61 88 42 48 10 14 45 9 48 56 73 76 70 70 79 90 35 39 96 37 81 11 19 65 99 39 23 79 34 61 35 74 90 37 73 23 46 21 94 84 73 58 11 89 13 9 10 85 42 78 73 32 53 39 49 90 43 5 28 31 97 75", "100\n33 24 97 96 1 14 99 51 13 65 67 20 46 88 42 44 20 49 5 89 98 83 15 40 74 83 58 3 10 79 34 2 69 28 37 100 55 52 14 8 44 94 97 89 6 42 11 28 30 33 55 56 20 57 52 25 75 1 87 42 62 41 37 12 54 85 95 80 42 36 94 96 28 76 54 36 4 17 26 24 62 15 17 79 84 36 92 78 74 91 96 77 54 92 81 91 62 98 37 37", "100\n86 24 61 15 11 85 1 31 47 36 23 36 59 34 3 27 16 29 82 28 58 52 52 66 71 61 98 39 60 20 67 41 67 90 73 29 92 17 70 95 58 98 58 32 21 73 46 56 87 72 80 75 40 27 94 31 59 92 93 37 14 99 96 21 97 23 81 91 52 52 96 94 92 28 38 29 52 16 57 27 17 24 91 21 79 55 96 98 95 94 23 78 79 12 77 35 32 75 100 82", "100\n88 85 41 37 69 21 7 69 36 5 92 26 64 75 22 46 67 20 70 22 62 66 38 24 47 49 68 30 90 31 67 86 86 82 9 51 43 45 48 42 73 44 31 94 45 60 54 66 20 87 11 94 34 32 87 66 56 28 75 39 37 90 72 93 55 72 31 42 30 71 87 61 4 12 12 81 23 61 56 98 71 32 30 33 96 63 92 16 8 78 47 91 47 54 49 3 81 82 41 5", "1\n2", "5\n1 1 3 2 2"], "outputs": ["1", "8", "1", "0", "2", "1", "7", "4", "50", "49", "50", "7", "39", "37", "51", "21", "37", "28", "47", "15", "11", "33", "37", "15", "35", "42", "23", "15", "13", "17", "45", "53", "40", "53", "55", "52", "51", "53", "48", "48", "58", "53", "54", "49", "44", "46", "53", "43", "51", "47", "1", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	729	codeforces
bdc6c256029b80385a04823c5aed31f5	Stages	Natasha is going to fly to Mars. She needs to build a rocket, which consists of several stages in some order. Each of the stages is defined by a lowercase Latin letter. This way, the rocket can be described by the string — concatenation of letters, which correspond to the stages. There are $n$ stages available. The rocket must contain exactly $k$ of them. Stages in the rocket should be ordered by their weight. So, after the stage with some letter can go only stage with a letter, which is at least two positions after in the alphabet (skipping one letter in between, or even more). For example, after letter 'c' can't go letters 'a', 'b', 'c' and 'd', but can go letters 'e', 'f', ..., 'z'. For the rocket to fly as far as possible, its weight should be minimal. The weight of the rocket is equal to the sum of the weights of its stages. The weight of the stage is the number of its letter in the alphabet. For example, the stage 'a 'weighs one ton,' b 'weighs two tons, and' z' — $26$ tons. Build the rocket with the minimal weight or determine, that it is impossible to build a rocket at all. Each stage can be used at most once. The first line of input contains two integers — $n$ and $k$ ($1 \le k \le n \le 50$) – the number of available stages and the number of stages to use in the rocket. The second line contains string $s$, which consists of exactly $n$ lowercase Latin letters. Each letter defines a new stage, which can be used to build the rocket. Each stage can be used at most once. Print a single integer — the minimal total weight of the rocket or -1, if it is impossible to build the rocket at all. Sample Input 5 3 xyabd 7 4 problem 2 2 ab 12 1 abaabbaaabbb Sample Output 2934-11	{"inputs": ["5 3\nxyabd", "7 4\nproblem", "2 2\nab", "12 1\nabaabbaaabbb", "50 13\nqwertyuiopasdfghjklzxcvbnmaaaaaaaaaaaaaaaaaaaaaaaa", "50 14\nqwertyuiopasdfghjklzxcvbnmaaaaaaaaaaaaaaaaaaaaaaaa", "1 1\na", "50 1\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "50 2\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "13 13\nuwgmkyqeiaocs", "13 13\nhzdxpbfvrltnj", "1 1\nn", "10 8\nsmzeblyjqw", "20 20\ntzmvhskkyugkuuxpvtbh", "30 15\nwjzolzzkfulwgioksfxmcxmnnjtoav", "40 30\nxumfrflllrrgswehqtsskefixhcxjrxbjmrpsshv", "50 31\nahbyyoxltryqdmvenemaqnbakglgqolxnaifnqtoclnnqiabpz", "10 7\niuiukrxcml", "38 2\nvjzarfykmrsrvwbwfwldsulhxtykmjbnwmdufa", "12 6\nfwseyrarkwcd", "2 2\nac", "1 1\nc", "2 2\nad", "2 1\nac", "4 3\nadjz", "3 3\naoz", "3 1\nzzz", "2 1\nxz", "5 1\naaddd"], "outputs": ["29", "34", "-1", "1", "169", "-1", "1", "1", "-1", "169", "182", "14", "113", "-1", "-1", "-1", "-1", "99", "5", "61", "4", "3", "5", "1", "15", "42", "26", "24", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	213	codeforces
bdccebbc59ea21c3a871ae1558ed6845	The Sum of the k-th Powers	There are well-known formulas: , , . Also mathematicians found similar formulas for higher degrees. Find the value of the sum modulo 109<=+<=7 (so you should find the remainder after dividing the answer by the value 109<=+<=7). The only line contains two integers n,<=k (1<=≤<=n<=≤<=109,<=0<=≤<=k<=≤<=106). Print the only integer a — the remainder after dividing the value of the sum by the value 109<=+<=7. Sample Input 4 1 4 2 4 3 4 0 Sample Output 10 30 100 4	{"inputs": ["4 1", "4 2", "4 3", "4 0", "10 0", "1 1", "1 0", "1 1000000", "1000000000 0", "100 100", "10000 100", "100 10000", "1000000000 1000000", "1000000 1000000", "999999 1000000", "77674473 447444", "333312494 795258", "761637147 673329", "335185991 514401", "203702132 355473", "1000000000 999935"], "outputs": ["10", "30", "100", "4", "10", "1", "1", "1", "1000000000", "568830579", "352711099", "859998022", "617381606", "997878755", "504760730", "838207299", "393290476", "223778667", "412595240", "229710810", "729344740"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	5	codeforces
bdd1384c3c4e5c12f47e15657aa8931f	Square and Rectangles	You are given n rectangles. The corners of rectangles have integer coordinates and their edges are parallel to the Ox and Oy axes. The rectangles may touch each other, but they do not overlap (that is, there are no points that belong to the interior of more than one rectangle). Your task is to determine if the rectangles form a square. In other words, determine if the set of points inside or on the border of at least one rectangle is precisely equal to the set of points inside or on the border of some square. The first line contains a single integer n (1<=≤<=n<=≤<=5). Next n lines contain four integers each, describing a single rectangle: x1, y1, x2, y2 (0<=≤<=x1<=<<=x2<=≤<=31400,<=0<=≤<=y1<=<<=y2<=≤<=31400) — x1 and x2 are x-coordinates of the left and right edges of the rectangle, and y1 and y2 are y-coordinates of the bottom and top edges of the rectangle. No two rectangles overlap (that is, there are no points that belong to the interior of more than one rectangle). In a single line print "YES", if the given rectangles form a square, or "NO" otherwise. Sample Input 5 0 0 2 3 0 3 3 5 2 0 5 2 3 2 5 5 2 2 3 3 4 0 0 2 3 0 3 3 5 2 0 5 2 3 2 5 5 Sample Output YES NO	{"inputs": ["5\n0 0 2 3\n0 3 3 5\n2 0 5 2\n3 2 5 5\n2 2 3 3", "4\n0 0 2 3\n0 3 3 5\n2 0 5 2\n3 2 5 5", "5\n0 0 10000 20000\n10000 0 15000 19999\n10000 19999 14999 20000\n0 20000 15000 31400\n15000 0 31400 31400", "5\n0 0 10000 20000\n10000 0 15000 19999\n10000 19999 15000 20000\n0 20000 15000 31400\n15000 0 31400 31400", "5\n10359 859 28918 4384\n2895 26520 28918 26882\n2895 26424 28918 26520\n2895 859 10359 4384\n2895 4384 28918 26424", "5\n12750 0 25688 1\n1094 0 12750 1\n0 0 956 1\n956 0 1094 1\n25688 0 31400 1", "4\n18006 16484 25725 31400\n0 0 31400 16484\n29563 16484 31400 31400\n25725 16484 29563 31400", "1\n0 0 31400 31400", "2\n0 0 31400 13313\n0 13313 31400 31400", "3\n0 9388 31400 31400\n26020 0 31400 9388\n0 0 26020 9388", "5\n15164 0 19356 3925\n0 0 15164 31400\n15164 3925 31400 31400\n19356 3278 31400 3925\n19356 0 31400 3278", "5\n20421 5189 23141 12511\n16414 10436 17880 12511\n17880 10436 20421 12511\n15819 10436 16414 12511\n15819 5189 20421 10436", "1\n15819 5189 23141 12511", "3\n12052 12345 12343 18147\n12343 12345 12345 18147\n6543 12345 12052 18147", "5\n12750 0 25688 1\n1094 0 12750 1\n0 0 956 1\n956 0 1094 1\n25688 0 31400 1", "5\n0 7098 1 7460\n0 7460 1 15218\n0 15218 1 31400\n0 4974 1 7098\n0 0 1 4974", "1\n0 0 31400 1", "1\n0 0 1 31400", "5\n0 25169 1 27914\n0 0 1 1366\n0 10763 1 25169\n0 1366 1 10138\n0 27914 1 31400", "1\n0 0 10575 1", "1\n0 3006 1 17592", "1\n123 4819 5819 29511", "3\n123 4819 5819 6612\n123 6612 5819 12692\n123 12692 5819 29511", "5\n3091 4819 5743 13222\n123 13222 5819 29511\n5743 4819 5819 13222\n123 4819 2215 13222\n2215 4819 3091 13222", "5\n8030 7681 8491 7682\n8491 7681 8961 7682\n7666 7681 7963 7682\n7963 7681 8030 7682\n678 7681 7666 7682", "5\n1234 1234 1235 1235\n1238 1234 1239 1235\n1235 1234 1236 1235\n1237 1234 1238 1235\n1236 1234 1237 1235", "5\n20812 5661 27208 5898\n20812 581 29415 5661\n27539 5661 29415 5898\n18961 581 20812 5898\n27208 5661 27539 5898", "1\n31399 31399 31400 31400", "1\n20499 0 31400 22815", "2\n0 1273 26470 9100\n0 16615 31400 31400", "3\n25784 0 31400 20408\n0 20408 31400 20582\n15802 0 18106 20408", "4\n18006 16484 25725 31400\n0 0 31400 16484\n29563 16484 31400 31400\n25725 16484 29563 31400", "5\n26466 0 26474 6206\n10906 0 17073 6321\n19720 0 26356 31400\n0 0 10906 7852\n0 21437 18466 31400", "5\n1338 31399 1525 31400\n1525 31399 2595 31400\n961 31399 1338 31400\n2956 31399 31400 31400\n2595 31399 2956 31400", "5\n1349 0 1391 3766\n1234 0 1238 417\n1391 0 5000 3766\n1234 417 1238 3766\n1238 0 1349 3766", "5\n0 0 100 30000\n100 0 31400 5000\n100 5000 20000 30000\n0 30000 20000 31400\n20000 5000 31400 31400", "5\n0 0 100 30000\n100 0 31400 5000\n100 5000 20000 30000\n0 30000 20000 31000\n20000 5000 31400 31000", "5\n8591 1234 9517 19512\n696 19512 9517 31400\n696 696 8591 19512\n8591 696 31400 1234\n9517 1234 31400 31400", "5\n0 0 1 1\n0 3 1 4\n0 1 1 2\n0 2 1 3\n0 4 1 5", "4\n0 0 1 2\n0 3 1 4\n0 4 1 5\n0 2 1 3", "3\n0 1 1 3\n0 3 1 5\n0 0 1 1", "1\n0 0 1 5", "4\n0 0 2 1\n2 0 3 2\n0 1 1 3\n1 2 3 3", "5\n0 0 2 1\n2 0 3 2\n0 1 1 3\n1 2 3 3\n1 1 2 2", "1\n0 0 1 1", "1\n0 0 31400 31400", "2\n0 0 10000 31400\n10000 0 31400 31400", "2\n0 0 10000 31400\n10000 0 31400 31399", "2\n0 0 1 18\n5 0 6 18", "1\n0 0 1 4", "2\n0 0 2 6\n2 2 4 4", "2\n2 2 3 3\n4 4 6 7", "2\n0 0 1 1\n1 0 2 1", "2\n0 0 1 1\n2 2 3 3", "4\n0 0 1 1\n5 5 6 6\n10 10 11 11\n13 13 14 14", "5\n1 1 3 5\n3 3 5 5\n4 1 5 3\n3 1 4 2\n2 5 3 6", "4\n10 10 11 11\n11 11 12 12\n11 10 12 11\n9 12 10 13", "2\n0 0 2 4\n10 0 12 4", "4\n0 0 1 1\n0 1 1 2\n0 2 1 3\n0 3 1 4", "2\n0 0 1 1\n3 3 4 4", "2\n0 0 3 1\n0 2 3 3", "2\n1 1 5 5\n1 5 5 7", "3\n0 0 1 1\n1 0 3 3\n0 2 1 4", "4\n0 0 10 10\n10 10 20 20\n10 0 20 10\n10 20 11 120", "1\n0 0 1 7", "4\n0 0 4 2\n0 2 3 6\n3 4 6 6\n4 0 6 4", "2\n0 0 1 1\n1 1 2 2", "2\n1 1 2 2\n3 3 4 4"], "outputs": ["YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	10	codeforces
bde75bac39cbfe4af0d371bb6c7c6336	Encryption (easy)	Rebel spy Heidi has just obtained the plans for the Death Star from the Empire and, now on her way to safety, she is trying to break the encryption of the plans (of course they are encrypted – the Empire may be evil, but it is not stupid!). The encryption has several levels of security, and here is how the first one looks. Heidi is presented with a screen that shows her a sequence of integers A and a positive integer p. She knows that the encryption code is a single number S, which is defined as follows: Define the score of X to be the sum of the elements of X modulo p. Heidi is given a sequence A that consists of N integers, and also given an integer p. She needs to split A into 2 parts such that: - Each part contains at least 1 element of A, and each part consists of contiguous elements of A. - The two parts do not overlap. - The total sum S of the scores of those two parts is maximized. This is the encryption code. Output the sum S, which is the encryption code. The first line of the input contains two space-separated integer N and p (2<=≤<=N<=≤<=100<=000, 2<=≤<=p<=≤<=10<=000) – the number of elements in A, and the modulo for computing scores, respectively. The second line contains N space-separated integers which are the elements of A. Each integer is from the interval [1,<=1<=000<=000]. Output the number S as described in the problem statement. Sample Input 4 10 3 4 7 2 10 12 16 3 24 13 9 8 7 5 12 12 Sample Output 16 13	{"inputs": ["4 10\n3 4 7 2", "10 12\n16 3 24 13 9 8 7 5 12 12", "2 2\n9 9", "2 2\n8 8", "5 50\n1 1 1 1 1", "5 50\n100 150 200 100 50"], "outputs": ["16", "13", "2", "0", "5", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	52	codeforces
bdfe2b1e3fe543e13b9b8077113d91f6	Oleg and shares	Oleg the bank client checks share prices every day. There are n share prices he is interested in. Today he observed that each second exactly one of these prices decreases by k rubles (note that each second exactly one price changes, but at different seconds different prices can change). Prices can become negative. Oleg found this process interesting, and he asked Igor the financial analyst, what is the minimum time needed for all n prices to become equal, or it is impossible at all? Igor is busy right now, so he asked you to help Oleg. Can you answer this question? The first line contains two integers n and k (1<=≤<=n<=≤<=105,<=1<=≤<=k<=≤<=109) — the number of share prices, and the amount of rubles some price decreases each second. The second line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the initial prices. Print the only line containing the minimum number of seconds needed for prices to become equal, of «-1» if it is impossible. Sample Input 3 3 12 9 15 2 2 10 9 4 1 1 1000000000 1000000000 1000000000 Sample Output 3-12999999997	{"inputs": ["3 3\n12 9 15", "2 2\n10 9", "4 1\n1 1000000000 1000000000 1000000000", "1 11\n123", "20 6\n38 86 86 50 98 62 32 2 14 62 98 50 2 50 32 38 62 62 8 14", "20 5\n59 54 19 88 55 100 54 3 6 13 99 38 36 71 59 6 64 85 45 54", "100 10\n340 70 440 330 130 120 340 210 440 110 410 120 180 40 50 230 70 110 310 360 480 70 230 120 230 310 470 60 210 60 210 480 290 250 450 440 150 40 500 230 280 250 30 50 310 50 230 360 420 260 330 80 50 160 70 470 140 180 380 190 250 30 220 410 80 310 280 50 20 430 440 180 310 190 190 330 90 190 320 390 170 460 230 30 80 500 470 370 80 500 400 120 220 150 70 120 70 320 260 260", "100 18\n489 42 300 366 473 105 220 448 70 488 201 396 168 281 67 235 324 291 313 387 407 223 39 144 224 233 72 318 229 377 62 171 448 119 354 282 147 447 260 384 172 199 67 326 311 431 337 142 281 202 404 468 38 120 90 437 33 420 249 372 367 253 255 411 309 333 103 176 162 120 203 41 352 478 216 498 224 31 261 493 277 99 375 370 394 229 71 488 246 194 233 13 66 111 366 456 277 360 116 354", "4 2\n1 2 3 4", "3 4\n3 5 5", "3 2\n88888884 88888886 88888888", "2 1\n1000000000 1000000000", "4 2\n1000000000 100000000 100000000 100000000", "2 2\n1000000000 1000000000", "3 3\n3 2 1", "3 4\n3 5 3", "3 2\n1 2 2", "4 2\n2 3 3 2", "3 2\n1 2 4", "3 2\n3 4 4", "3 3\n4 7 10", "4 3\n2 2 5 1", "3 3\n1 3 5", "2 5\n5 9", "2 3\n5 7", "3 137\n1000000000 1000000000 1000000000", "5 1000000000\n1000000000 1000000000 1000000000 1000000000 1000000000", "3 5\n1 2 5", "3 3\n1000000000 1000000000 999999997", "2 4\n5 6", "4 1\n1000000000 1000000000 1000000000 1000000000", "2 3\n5 8", "2 6\n8 16", "5 3\n15 14 9 12 18", "3 3\n1 2 3", "3 3\n3 4 5", "2 5\n8 17", "2 1\n1 2", "1 1\n1000000000", "3 3\n5 3 4", "3 6\n10 14 12", "2 2\n3 5", "3 5\n1 3 4", "4 3\n1 6 6 6", "2 3\n1 8", "3 5\n6 11 17", "2 2\n1 4", "2 4\n6 8", "2 1\n2 3", "4 4\n1 5 8 14", "3 3\n1 5 3", "4 3\n1 2 2 5", "3 2\n1 4 6", "2 3\n6 9", "3 3\n2 3 4", "3 2\n9 10 10", "2 2\n9 12", "2 2\n100000003 100000005", "2 3\n2 4", "3 2\n2 3 5", "3 3\n1 3 4", "10 2\n2 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "3 5\n2 4 5", "2 3\n7 10", "3 10\n10 13 17", "2 3\n1 6", "1 7\n1000000000", "2 4\n3 7", "2 3\n2 5", "20 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "3 3\n7 8 8", "4 10\n1 11 100 11"], "outputs": ["3", "-1", "2999999997", "0", "151", "-1", "2157", "-1", "-1", "-1", "3", "0", "450000000", "0", "-1", "-1", "-1", "-1", "-1", "-1", "3", "-1", "-1", "-1", "-1", "0", "0", "-1", "2", "-1", "0", "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", "4499999991", "-1", "1", "-1", "-1", "0", "1", "1", "0", "-1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	171	codeforces
be28a9f0e51e26043794e8ef4aac3703	Work Group	One Big Software Company has n employees numbered from 1 to n. The director is assigned number 1. Every employee of the company except the director has exactly one immediate superior. The director, of course, doesn't have a superior. We will call person a a subordinates of another person b, if either b is an immediate supervisor of a, or the immediate supervisor of a is a subordinate to person b. In particular, subordinates of the head are all other employees of the company. To solve achieve an Important Goal we need to form a workgroup. Every person has some efficiency, expressed by a positive integer ai, where i is the person's number. The efficiency of the workgroup is defined as the total efficiency of all the people included in it. The employees of the big software company are obsessed with modern ways of work process organization. Today pair programming is at the peak of popularity, so the workgroup should be formed with the following condition. Each person entering the workgroup should be able to sort all of his subordinates who are also in the workgroup into pairs. In other words, for each of the members of the workgroup the number of his subordinates within the workgroup should be even. Your task is to determine the maximum possible efficiency of the workgroup formed at observing the given condition. Any person including the director of company can enter the workgroup. The first line contains integer n (1<=≤<=n<=≤<=2·105) — the number of workers of the Big Software Company. Then n lines follow, describing the company employees. The i-th line contains two integers pi,<=ai (1<=≤<=ai<=≤<=105) — the number of the person who is the i-th employee's immediate superior and i-th employee's efficiency. For the director p1<==<=<=-<=1, for all other people the condition 1<=≤<=pi<=<<=i is fulfilled. Print a single integer — the maximum possible efficiency of the workgroup. Sample Input 7 -1 3 1 2 1 1 1 4 4 5 4 3 5 2 Sample Output 17	{"inputs": ["7\n-1 3\n1 2\n1 1\n1 4\n4 5\n4 3\n5 2", "1\n-1 42", "2\n-1 3\n1 2", "3\n-1 3\n1 1\n1 2", "3\n-1 1\n1 2\n1 3", "3\n-1 3\n1 2\n2 1", "20\n-1 100\n1 10\n2 26\n2 33\n3 31\n2 28\n1 47\n6 18\n6 25\n9 2\n4 17\n6 18\n6 2\n6 30\n13 7\n5 25\n7 11\n11 7\n17 40\n12 43", "20\n-1 100\n1 35\n2 22\n3 28\n3 2\n4 8\n3 17\n2 50\n5 37\n5 25\n4 29\n9 21\n10 16\n10 39\n11 41\n9 28\n9 30\n12 36\n13 26\n19 17", "20\n-1 100\n1 35\n1 22\n1 28\n1 2\n1 8\n1 17\n1 50\n5 37\n1 25\n1 29\n5 21\n4 16\n2 39\n1 41\n3 28\n3 30\n2 36\n2 26\n14 17", "3\n-1 1\n1 42\n1 42", "2\n-1 1\n1 2", "3\n-1 1\n1 2\n2 3", "4\n-1 1\n1 42\n1 42\n1 42", "4\n-1 1\n1 100\n1 100\n1 100"], "outputs": ["17", "42", "3", "6", "6", "3", "355", "459", "548", "85", "2", "3", "126", "300"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
be357e1a04067eead63b9cf1cc2b9af5	Little Frog	Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mounds is one meter. Vasya wants to visit all the mounds in one day; besides, he wants to visit each one exactly once. For that he makes a route plan, to decide the order in which to jump on the mounds. Vasya can pick any mound as the first one. He thinks it boring to jump two times at the same distance. That's why he wants any two jumps on his route to have different lengths. Help Vasya the Frog and make the plan for him. The single line contains a number n (1<=≤<=n<=≤<=104) which is the number of mounds. Print n integers pi (1<=≤<=pi<=≤<=n) which are the frog's route plan. - All the pi's should be mutually different. - All the \|pi–pi<=+<=1\|'s should be mutually different (1<=≤<=i<=≤<=n<=-<=1). If there are several solutions, output any. Sample Input 2 3 Sample Output 1 2 1 3 2	{"inputs": ["2", "3", "4", "5", "6", "1", "9149", "2877", "2956", "3035", "3114", "3193", "3273", "7000", "7079", "4653", "9995", "9996", "9997", "9998", "9999", "10000"], "outputs": ["1 2 ", "1 3 2 ", "1 4 2 3 ", "1 5 2 4 3 ", "1 6 2 5 3 4 ", "1 ", "1 9149 2 9148 3 9147 4 9146 5 9145 6 9144 7 9143 8 9142 9 9141 10 9140 11 9139 12 9138 13 9137 14 9136 15 9135 16 9134 17 9133 18 9132 19 9131 20 9130 21 9129 22 9128 23 9127 24 9126 25 9125 26 9124 27 9123 28 9122 29 9121 30 9120 31 9119 32 9118 33 9117 34 9116 35 9115 36 9114 37 9113 38 9112 39 9111 40 9110 41 9109 42 9108 43 9107 44 9106 45 9105 46 9104 47 9103 48 9102 49 9101 50 9100 51 9099 52 9098 53 9097 54 9096 55 9095 56 9094 57 9093 58 9092 59 9091 60 9090 61 9089 62 9088 63 9087 64 9086 65 9085 ...", "1 2877 2 2876 3 2875 4 2874 5 2873 6 2872 7 2871 8 2870 9 2869 10 2868 11 2867 12 2866 13 2865 14 2864 15 2863 16 2862 17 2861 18 2860 19 2859 20 2858 21 2857 22 2856 23 2855 24 2854 25 2853 26 2852 27 2851 28 2850 29 2849 30 2848 31 2847 32 2846 33 2845 34 2844 35 2843 36 2842 37 2841 38 2840 39 2839 40 2838 41 2837 42 2836 43 2835 44 2834 45 2833 46 2832 47 2831 48 2830 49 2829 50 2828 51 2827 52 2826 53 2825 54 2824 55 2823 56 2822 57 2821 58 2820 59 2819 60 2818 61 2817 62 2816 63 2815 64 2814 65 2813 ...", "1 2956 2 2955 3 2954 4 2953 5 2952 6 2951 7 2950 8 2949 9 2948 10 2947 11 2946 12 2945 13 2944 14 2943 15 2942 16 2941 17 2940 18 2939 19 2938 20 2937 21 2936 22 2935 23 2934 24 2933 25 2932 26 2931 27 2930 28 2929 29 2928 30 2927 31 2926 32 2925 33 2924 34 2923 35 2922 36 2921 37 2920 38 2919 39 2918 40 2917 41 2916 42 2915 43 2914 44 2913 45 2912 46 2911 47 2910 48 2909 49 2908 50 2907 51 2906 52 2905 53 2904 54 2903 55 2902 56 2901 57 2900 58 2899 59 2898 60 2897 61 2896 62 2895 63 2894 64 2893 65 2892 ...", "1 3035 2 3034 3 3033 4 3032 5 3031 6 3030 7 3029 8 3028 9 3027 10 3026 11 3025 12 3024 13 3023 14 3022 15 3021 16 3020 17 3019 18 3018 19 3017 20 3016 21 3015 22 3014 23 3013 24 3012 25 3011 26 3010 27 3009 28 3008 29 3007 30 3006 31 3005 32 3004 33 3003 34 3002 35 3001 36 3000 37 2999 38 2998 39 2997 40 2996 41 2995 42 2994 43 2993 44 2992 45 2991 46 2990 47 2989 48 2988 49 2987 50 2986 51 2985 52 2984 53 2983 54 2982 55 2981 56 2980 57 2979 58 2978 59 2977 60 2976 61 2975 62 2974 63 2973 64 2972 65 2971 ...", "1 3114 2 3113 3 3112 4 3111 5 3110 6 3109 7 3108 8 3107 9 3106 10 3105 11 3104 12 3103 13 3102 14 3101 15 3100 16 3099 17 3098 18 3097 19 3096 20 3095 21 3094 22 3093 23 3092 24 3091 25 3090 26 3089 27 3088 28 3087 29 3086 30 3085 31 3084 32 3083 33 3082 34 3081 35 3080 36 3079 37 3078 38 3077 39 3076 40 3075 41 3074 42 3073 43 3072 44 3071 45 3070 46 3069 47 3068 48 3067 49 3066 50 3065 51 3064 52 3063 53 3062 54 3061 55 3060 56 3059 57 3058 58 3057 59 3056 60 3055 61 3054 62 3053 63 3052 64 3051 65 3050 ...", "1 3193 2 3192 3 3191 4 3190 5 3189 6 3188 7 3187 8 3186 9 3185 10 3184 11 3183 12 3182 13 3181 14 3180 15 3179 16 3178 17 3177 18 3176 19 3175 20 3174 21 3173 22 3172 23 3171 24 3170 25 3169 26 3168 27 3167 28 3166 29 3165 30 3164 31 3163 32 3162 33 3161 34 3160 35 3159 36 3158 37 3157 38 3156 39 3155 40 3154 41 3153 42 3152 43 3151 44 3150 45 3149 46 3148 47 3147 48 3146 49 3145 50 3144 51 3143 52 3142 53 3141 54 3140 55 3139 56 3138 57 3137 58 3136 59 3135 60 3134 61 3133 62 3132 63 3131 64 3130 65 3129 ...", "1 3273 2 3272 3 3271 4 3270 5 3269 6 3268 7 3267 8 3266 9 3265 10 3264 11 3263 12 3262 13 3261 14 3260 15 3259 16 3258 17 3257 18 3256 19 3255 20 3254 21 3253 22 3252 23 3251 24 3250 25 3249 26 3248 27 3247 28 3246 29 3245 30 3244 31 3243 32 3242 33 3241 34 3240 35 3239 36 3238 37 3237 38 3236 39 3235 40 3234 41 3233 42 3232 43 3231 44 3230 45 3229 46 3228 47 3227 48 3226 49 3225 50 3224 51 3223 52 3222 53 3221 54 3220 55 3219 56 3218 57 3217 58 3216 59 3215 60 3214 61 3213 62 3212 63 3211 64 3210 65 3209 ...", "1 7000 2 6999 3 6998 4 6997 5 6996 6 6995 7 6994 8 6993 9 6992 10 6991 11 6990 12 6989 13 6988 14 6987 15 6986 16 6985 17 6984 18 6983 19 6982 20 6981 21 6980 22 6979 23 6978 24 6977 25 6976 26 6975 27 6974 28 6973 29 6972 30 6971 31 6970 32 6969 33 6968 34 6967 35 6966 36 6965 37 6964 38 6963 39 6962 40 6961 41 6960 42 6959 43 6958 44 6957 45 6956 46 6955 47 6954 48 6953 49 6952 50 6951 51 6950 52 6949 53 6948 54 6947 55 6946 56 6945 57 6944 58 6943 59 6942 60 6941 61 6940 62 6939 63 6938 64 6937 65 6936 ...", "1 7079 2 7078 3 7077 4 7076 5 7075 6 7074 7 7073 8 7072 9 7071 10 7070 11 7069 12 7068 13 7067 14 7066 15 7065 16 7064 17 7063 18 7062 19 7061 20 7060 21 7059 22 7058 23 7057 24 7056 25 7055 26 7054 27 7053 28 7052 29 7051 30 7050 31 7049 32 7048 33 7047 34 7046 35 7045 36 7044 37 7043 38 7042 39 7041 40 7040 41 7039 42 7038 43 7037 44 7036 45 7035 46 7034 47 7033 48 7032 49 7031 50 7030 51 7029 52 7028 53 7027 54 7026 55 7025 56 7024 57 7023 58 7022 59 7021 60 7020 61 7019 62 7018 63 7017 64 7016 65 7015 ...", "1 4653 2 4652 3 4651 4 4650 5 4649 6 4648 7 4647 8 4646 9 4645 10 4644 11 4643 12 4642 13 4641 14 4640 15 4639 16 4638 17 4637 18 4636 19 4635 20 4634 21 4633 22 4632 23 4631 24 4630 25 4629 26 4628 27 4627 28 4626 29 4625 30 4624 31 4623 32 4622 33 4621 34 4620 35 4619 36 4618 37 4617 38 4616 39 4615 40 4614 41 4613 42 4612 43 4611 44 4610 45 4609 46 4608 47 4607 48 4606 49 4605 50 4604 51 4603 52 4602 53 4601 54 4600 55 4599 56 4598 57 4597 58 4596 59 4595 60 4594 61 4593 62 4592 63 4591 64 4590 65 4589 ...", "1 9995 2 9994 3 9993 4 9992 5 9991 6 9990 7 9989 8 9988 9 9987 10 9986 11 9985 12 9984 13 9983 14 9982 15 9981 16 9980 17 9979 18 9978 19 9977 20 9976 21 9975 22 9974 23 9973 24 9972 25 9971 26 9970 27 9969 28 9968 29 9967 30 9966 31 9965 32 9964 33 9963 34 9962 35 9961 36 9960 37 9959 38 9958 39 9957 40 9956 41 9955 42 9954 43 9953 44 9952 45 9951 46 9950 47 9949 48 9948 49 9947 50 9946 51 9945 52 9944 53 9943 54 9942 55 9941 56 9940 57 9939 58 9938 59 9937 60 9936 61 9935 62 9934 63 9933 64 9932 65 9931 ...", "1 9996 2 9995 3 9994 4 9993 5 9992 6 9991 7 9990 8 9989 9 9988 10 9987 11 9986 12 9985 13 9984 14 9983 15 9982 16 9981 17 9980 18 9979 19 9978 20 9977 21 9976 22 9975 23 9974 24 9973 25 9972 26 9971 27 9970 28 9969 29 9968 30 9967 31 9966 32 9965 33 9964 34 9963 35 9962 36 9961 37 9960 38 9959 39 9958 40 9957 41 9956 42 9955 43 9954 44 9953 45 9952 46 9951 47 9950 48 9949 49 9948 50 9947 51 9946 52 9945 53 9944 54 9943 55 9942 56 9941 57 9940 58 9939 59 9938 60 9937 61 9936 62 9935 63 9934 64 9933 65 9932 ...", "1 9997 2 9996 3 9995 4 9994 5 9993 6 9992 7 9991 8 9990 9 9989 10 9988 11 9987 12 9986 13 9985 14 9984 15 9983 16 9982 17 9981 18 9980 19 9979 20 9978 21 9977 22 9976 23 9975 24 9974 25 9973 26 9972 27 9971 28 9970 29 9969 30 9968 31 9967 32 9966 33 9965 34 9964 35 9963 36 9962 37 9961 38 9960 39 9959 40 9958 41 9957 42 9956 43 9955 44 9954 45 9953 46 9952 47 9951 48 9950 49 9949 50 9948 51 9947 52 9946 53 9945 54 9944 55 9943 56 9942 57 9941 58 9940 59 9939 60 9938 61 9937 62 9936 63 9935 64 9934 65 9933 ...", "1 9998 2 9997 3 9996 4 9995 5 9994 6 9993 7 9992 8 9991 9 9990 10 9989 11 9988 12 9987 13 9986 14 9985 15 9984 16 9983 17 9982 18 9981 19 9980 20 9979 21 9978 22 9977 23 9976 24 9975 25 9974 26 9973 27 9972 28 9971 29 9970 30 9969 31 9968 32 9967 33 9966 34 9965 35 9964 36 9963 37 9962 38 9961 39 9960 40 9959 41 9958 42 9957 43 9956 44 9955 45 9954 46 9953 47 9952 48 9951 49 9950 50 9949 51 9948 52 9947 53 9946 54 9945 55 9944 56 9943 57 9942 58 9941 59 9940 60 9939 61 9938 62 9937 63 9936 64 9935 65 9934 ...", "1 9999 2 9998 3 9997 4 9996 5 9995 6 9994 7 9993 8 9992 9 9991 10 9990 11 9989 12 9988 13 9987 14 9986 15 9985 16 9984 17 9983 18 9982 19 9981 20 9980 21 9979 22 9978 23 9977 24 9976 25 9975 26 9974 27 9973 28 9972 29 9971 30 9970 31 9969 32 9968 33 9967 34 9966 35 9965 36 9964 37 9963 38 9962 39 9961 40 9960 41 9959 42 9958 43 9957 44 9956 45 9955 46 9954 47 9953 48 9952 49 9951 50 9950 51 9949 52 9948 53 9947 54 9946 55 9945 56 9944 57 9943 58 9942 59 9941 60 9940 61 9939 62 9938 63 9937 64 9936 65 9935 ...", "1 10000 2 9999 3 9998 4 9997 5 9996 6 9995 7 9994 8 9993 9 9992 10 9991 11 9990 12 9989 13 9988 14 9987 15 9986 16 9985 17 9984 18 9983 19 9982 20 9981 21 9980 22 9979 23 9978 24 9977 25 9976 26 9975 27 9974 28 9973 29 9972 30 9971 31 9970 32 9969 33 9968 34 9967 35 9966 36 9965 37 9964 38 9963 39 9962 40 9961 41 9960 42 9959 43 9958 44 9957 45 9956 46 9955 47 9954 48 9953 49 9952 50 9951 51 9950 52 9949 53 9948 54 9947 55 9946 56 9945 57 9944 58 9943 59 9942 60 9941 61 9940 62 9939 63 9938 64 9937 65 9936..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	123	codeforces
be67cd8ea92d99b084fd6081677642af	Tree of Life (easy)	Heidi has finally found the mythical Tree of Life – a legendary combinatorial structure which is said to contain a prophecy crucially needed to defeat the undead armies. On the surface, the Tree of Life is just a regular undirected tree well-known from computer science. This means that it is a collection of n points (called vertices), some of which are connected using n<=-<=1 line segments (edges) so that each pair of vertices is connected by a path (a sequence of one or more edges). To decipher the prophecy, Heidi needs to perform a number of steps. The first is counting the number of lifelines in the tree – these are paths of length 2, i.e., consisting of two edges. Help her! The first line of the input contains a single integer n – the number of vertices in the tree (1<=≤<=n<=≤<=10000). The vertices are labeled with the numbers from 1 to n. Then n<=-<=1 lines follow, each describing one edge using two space-separated numbers a b – the labels of the vertices connected by the edge (1<=≤<=a<=<<=b<=≤<=n). It is guaranteed that the input represents a tree. Print one integer – the number of lifelines in the tree. Sample Input 4 1 2 1 3 1 4 5 1 2 2 3 3 4 3 5 Sample Output 34	{"inputs": ["4\n1 2\n1 3\n1 4", "5\n1 2\n2 3\n3 4\n3 5", "2\n1 2", "3\n2 1\n3 2", "10\n5 1\n1 2\n9 3\n10 5\n6 3\n8 5\n2 7\n2 3\n9 4"], "outputs": ["3", "4", "0", "1", "11"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	24	codeforces
be8d9759934859ff03c9d87c8f9ded2f	Friends	One day Igor K. stopped programming and took up math. One late autumn evening he was sitting at a table reading a book and thinking about something. The following statement caught his attention: "Among any six people there are either three pairwise acquainted people or three pairwise unacquainted people" Igor just couldn't get why the required minimum is 6 people. "Well, that's the same for five people, too!" — he kept on repeating in his mind. — "Let's take, say, Max, Ilya, Vova — here, they all know each other! And now let's add Dima and Oleg to Vova — none of them is acquainted with each other! Now, that math is just rubbish!" Igor K. took 5 friends of his and wrote down who of them is friends with whom. Now he wants to check whether it is true for the five people that among them there are either three pairwise acquainted or three pairwise not acquainted people. The first line contains an integer m (0<=≤<=m<=≤<=10), which is the number of relations of acquaintances among the five friends of Igor's. Each of the following m lines contains two integers ai and bi (1<=≤<=ai,<=bi<=≤<=5;ai<=≠<=bi), where (ai,<=bi) is a pair of acquainted people. It is guaranteed that each pair of the acquaintances is described exactly once. The acquaintance relation is symmetrical, i.e. if x is acquainted with y, then y is also acquainted with x. Print "FAIL", if among those five people there are no either three pairwise acquainted or three pairwise unacquainted people. Otherwise print "WIN". Sample Input 4 1 3 2 3 1 4 5 3 5 1 2 2 3 3 4 4 5 5 1 Sample Output WIN FAIL	{"inputs": ["4\n1 3\n2 3\n1 4\n5 3", "5\n1 2\n2 3\n3 4\n4 5\n5 1", "1\n4 3", "6\n1 3\n2 3\n1 2\n5 3\n4 2\n4 5", "2\n1 3\n2 5", "3\n5 3\n4 3\n4 5", "5\n1 3\n3 2\n2 4\n5 4\n1 5", "7\n1 3\n5 1\n1 4\n2 1\n5 3\n4 5\n2 5", "5\n5 1\n4 1\n2 3\n4 5\n3 1", "0", "10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5", "4\n1 2\n2 3\n3 4\n4 1", "1\n2 1", "1\n2 5", "2\n2 1\n1 5", "2\n4 2\n1 5", "2\n3 4\n5 2", "2\n1 5\n4 3", "3\n4 1\n4 5\n2 1", "3\n5 1\n5 3\n2 5", "3\n1 2\n4 2\n1 3", "3\n3 2\n1 5\n5 3", "3\n1 2\n2 4\n3 2", "3\n2 1\n1 3\n5 4", "4\n4 2\n2 5\n1 4\n4 5", "4\n5 2\n2 4\n5 3\n1 5", "4\n2 5\n1 3\n4 3\n4 2", "4\n1 4\n3 1\n2 3\n1 2", "4\n5 4\n2 3\n1 5\n5 2", "4\n2 5\n5 4\n1 4\n5 3", "4\n2 1\n2 4\n5 1\n4 1", "4\n1 2\n1 5\n4 5\n2 3", "5\n4 1\n2 4\n3 2\n5 3\n1 5", "5\n1 3\n4 1\n5 2\n2 4\n3 5", "5\n3 5\n4 2\n1 3\n2 1\n5 4", "5\n5 2\n1 3\n4 5\n2 1\n3 4", "5\n2 3\n3 5\n1 2\n4 1\n5 4", "5\n1 2\n4 5\n5 3\n3 1\n2 4", "5\n5 3\n3 2\n2 4\n1 5\n4 1", "5\n3 2\n4 1\n2 5\n1 3\n5 4", "5\n3 5\n1 4\n5 1\n2 3\n4 2", "5\n4 2\n5 3\n2 1\n3 4\n1 5", "5\n3 1\n5 1\n4 5\n2 4\n5 3", "5\n5 4\n5 3\n3 1\n1 4\n2 3", "5\n4 1\n3 5\n3 4\n5 4\n5 2", "5\n4 1\n5 2\n3 1\n4 2\n5 1", "5\n2 3\n1 5\n5 3\n2 4\n1 4", "5\n5 4\n5 3\n2 3\n5 2\n5 1", "5\n2 4\n3 4\n1 4\n2 1\n3 2", "5\n2 3\n3 4\n1 3\n4 1\n5 2", "5\n1 2\n2 5\n4 2\n4 3\n3 1", "5\n2 1\n2 5\n4 5\n2 3\n3 5", "5\n4 1\n5 1\n5 4\n4 3\n5 2", "5\n1 3\n2 4\n1 5\n5 2\n4 1", "5\n1 5\n3 5\n2 3\n4 1\n3 1", "5\n5 2\n3 2\n2 1\n4 3\n4 2", "5\n1 3\n4 5\n3 4\n3 5\n5 1", "5\n4 5\n2 5\n5 3\n4 2\n4 1", "5\n2 5\n1 5\n1 3\n3 5\n1 2", "5\n2 4\n1 2\n5 2\n5 3\n4 5", "5\n2 1\n4 5\n5 3\n1 5\n1 4", "5\n1 3\n2 5\n4 2\n3 4\n4 1", "6\n3 2\n2 4\n3 1\n3 5\n5 2\n1 2", "6\n2 1\n5 1\n5 4\n3 5\n3 4\n4 1", "6\n3 1\n1 4\n5 4\n2 1\n4 2\n1 5", "6\n5 1\n5 4\n3 4\n1 3\n1 4\n4 2", "6\n1 3\n5 4\n4 2\n2 1\n4 1\n2 3", "6\n4 3\n5 3\n4 1\n1 3\n1 2\n2 4", "6\n4 1\n3 5\n4 5\n3 1\n4 3\n5 2", "6\n2 1\n1 4\n4 5\n5 2\n1 3\n3 2", "7\n5 1\n3 5\n2 5\n4 5\n2 3\n3 1\n4 3", "7\n5 3\n5 1\n4 2\n4 5\n3 2\n3 4\n1 3", "7\n3 5\n1 4\n5 2\n1 5\n1 3\n4 2\n4 3", "7\n5 1\n5 4\n2 4\n2 3\n3 5\n2 5\n4 1", "7\n1 3\n2 5\n4 3\n2 1\n2 3\n4 5\n2 4", "7\n3 1\n4 5\n3 5\n5 1\n2 4\n1 2\n1 4", "8\n1 5\n3 1\n2 5\n4 2\n2 1\n4 5\n4 3\n4 1", "8\n4 2\n3 1\n4 3\n2 5\n3 2\n4 5\n1 2\n3 5", "8\n2 4\n3 2\n2 5\n3 4\n3 1\n5 1\n4 5\n5 3", "8\n2 3\n1 5\n1 3\n4 5\n2 4\n1 4\n3 5\n3 4", "9\n3 5\n3 2\n1 5\n4 3\n5 4\n1 4\n1 3\n4 2\n5 2", "9\n3 5\n2 5\n5 1\n4 5\n1 3\n3 2\n1 4\n4 3\n4 2", "3\n3 4\n4 5\n5 3", "3\n1 2\n1 3\n4 5", "3\n2 3\n3 5\n2 5"], "outputs": ["WIN", "FAIL", "WIN", "WIN", "WIN", "WIN", "FAIL", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "FAIL", "FAIL", "FAIL", "FAIL", "FAIL", "FAIL", "FAIL", "FAIL", "FAIL", "FAIL", "WIN", "WIN", "WIN", "WIN", "FAIL", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN", "WIN"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	65	codeforces
beb216e4c28803c082eec7de44f0dd98	none	Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive integers whose decimal record contains only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not. Petya has two strings a and b of the same length n. The strings consist only of lucky digits. Petya can perform operations of two types: - replace any one digit from string a by its opposite (i.e., replace 4 by 7 and 7 by 4); - swap any pair of digits in string a. Petya is interested in the minimum number of operations that are needed to make string a equal to string b. Help him with the task. The first and the second line contains strings a and b, correspondingly. Strings a and b have equal lengths and contain only lucky digits. The strings are not empty, their length does not exceed 105. Print on the single line the single number — the minimum number of operations needed to convert string a into string b. Sample Input 47 74 774 744 777 444 Sample Output 1 1 3	{"inputs": ["47\n74", "774\n744", "777\n444", "74747474\n77777777", "444444444444\n777777777777", "4744744447774474447474774\n4477774777444444444777447", "7\n4", "4\n7", "7777777777\n7777777774", "47777777777\n77777777774", "47747477747744447774774444444777444747474747777774\n44777444774477447777444774477777477774444477447777", "44447777447744444777777747477444777444447744444\n47444747774774744474747744447744477747777777447", "4447744774744774744747744774474474444447477477444747477444\n7477477444744774744744774774744474744447744774744477744477", "44747744777777444\n47774747747744777", "44447774444474477747774774477777474774744744477444447777477477744747477774744444744777777777747777477447744774744444747477744744\n77777474477477747774777777474474477444474777477747747777477747747744474474747774747747444777474444744744444477477777747744747477", "774774747744474477447477777447477747477474777477744744747444774474477477747474477447774444774744777\n744477444747477447477777774477447444447747477747477747774477474447474477477474444777444444447474747", "4747447477\n4747444744", "47744447444\n74477447744", "447444777744\n777747744477", "474777477774444\n774747777774477", "47744474447747744777777447\n44744747477474777744777477", "77447447444777777744744747744747774747477774777774447447777474477477774774777\n74777777444744447447474474477747747444444447447774444444747777444747474777447", "7\n7", "444\n444", "77747\n47474"], "outputs": ["1", "1", "3", "4", "12", "8", "1", "1", "1", "1", "14", "13", "14", "6", "37", "27", "3", "4", "6", "4", "7", "28", "0", "0", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	110	codeforces
bec9ea76bca8acdbb8400cd3fe1e396f	The Artful Expedient	Rock... Paper! After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substitute. The game works as follows. A positive integer n is decided first. Both Koyomi and Karen independently choose n distinct positive integers, denoted by x1,<=x2,<=...,<=xn and y1,<=y2,<=...,<=yn respectively. They reveal their sequences, and repeat until all of 2n integers become distinct, which is the only final state to be kept and considered. Then they count the number of ordered pairs (i,<=j) (1<=≤<=i,<=j<=≤<=n) such that the value xi xor yj equals to one of the 2n integers. Here xor means the [bitwise exclusive or](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operation on two integers, and is denoted by operators ^ and/or xor in most programming languages. Karen claims a win if the number of such pairs is even, and Koyomi does otherwise. And you're here to help determine the winner of their latest game. The first line of input contains a positive integer n (1<=≤<=n<=≤<=2<=000) — the length of both sequences. The second line contains n space-separated integers x1,<=x2,<=...,<=xn (1<=≤<=xi<=≤<=2·106) — the integers finally chosen by Koyomi. The third line contains n space-separated integers y1,<=y2,<=...,<=yn (1<=≤<=yi<=≤<=2·106) — the integers finally chosen by Karen. Input guarantees that the given 2n integers are pairwise distinct, that is, no pair (i,<=j) (1<=≤<=i,<=j<=≤<=n) exists such that one of the following holds: xi<==<=yj; i<=≠<=j and xi<==<=xj; i<=≠<=j and yi<==<=yj. Output one line — the name of the winner, that is, "Koyomi" or "Karen" (without quotes). Please be aware of the capitalization. Sample Input 3 1 2 3 4 5 6 5 2 4 6 8 10 9 7 5 3 1 Sample Output Karen Karen	{"inputs": ["3\n1 2 3\n4 5 6", "5\n2 4 6 8 10\n9 7 5 3 1", "1\n1\n2000000", "2\n97153 2000000\n1999998 254", "15\n31 30 29 28 27 26 25 24 23 22 21 20 19 18 17\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15", "30\n79656 68607 871714 1858841 237684 1177337 532141 161161 1111201 527235 323345 1979059 665353 507265 1290761 610606 1238375 743262 106355 1167830 180315 1233029 816465 752968 782570 1499881 1328457 1867240 13948 1302782\n322597 1868510 1958236 1348157 765908 1023636 874300 537124 631783 414906 886318 1931572 1381013 992451 1305644 1525745 716087 83173 303248 1572710 43084 333341 992413 267806 70390 644521 1014900 497068 178940 1920268", "30\n1143673 436496 1214486 1315862 148404 724601 1430740 1433008 1654610 1635673 614673 1713408 1270999 1697 1463796 50027 525482 1659078 688200 842647 518551 877506 1017082 1807856 3280 759698 1208220 470180 829800 1960886\n1312613 1965095 967255 1289012 1950383 582960 856825 49684 808824 319418 1968270 190821 344545 211332 1219388 1773751 1876402 132626 541448 1584672 24276 1053225 1823073 1858232 1209173 1035991 1956373 1237148 1973608 848873", "1\n2\n3", "1\n1048576\n1020000", "3\n9 33 69\n71 74 100", "3\n1 2 3\n9 5 6", "3\n1 7 8\n9 10 20", "3\n1 3 2\n4 5 8", "3\n2 1 100\n3 4 9", "3\n3 1 100\n2 1000 100000", "3\n1 2 5\n3 4 6", "3\n3 1 8\n2 4 17", "3\n1 5 6\n7 8 3", "1\n1\n3", "3\n1 3 10\n2 4 20", "3\n7 8 10\n15 9 11", "3\n5 6 8\n3 100 9", "3\n1 2 3\n4 5 8", "3\n1 2 19\n3 7 30", "3\n1 2 3\n6 7 8", "3\n1 4 55\n2 3 9", "3\n1 100 200\n5 4 500", "1\n6\n7", "3\n1 3 5\n2 4 13", "3\n3 1 100\n2 1000 10000", "3\n1 3 9\n2 4 40", "2\n1 199999\n1935807 2000000", "3\n1 3 8\n2 4 24", "2\n4 1\n7 3", "3\n1 2 4\n3 7 8", "3\n1 6 10000\n2 3 100000"], "outputs": ["Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen", "Karen"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	84	codeforces

Subsets and Splits