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
f12339773992c002ec45b994955d599d	PolandBall and Gifts	It's Christmas time! PolandBall and his friends will be giving themselves gifts. There are n Balls overall. Each Ball has someone for whom he should bring a present according to some permutation p, pi<=≠<=i for all i. Unfortunately, Balls are quite clumsy. We know earlier that exactly k of them will forget to bring their gift. A Ball number i will get his present if the following two constraints will hold: 1. Ball number i will bring the present he should give. 1. Ball x such that px<==<=i will bring his present. What is minimum and maximum possible number of kids who will not get their present if exactly k Balls will forget theirs? The first line of input contains two integers n and k (2<=≤<=n<=≤<=106, 0<=≤<=k<=≤<=n), representing the number of Balls and the number of Balls who will forget to bring their presents. The second line contains the permutation p of integers from 1 to n, where pi is the index of Ball who should get a gift from the i-th Ball. For all i, pi<=≠<=i holds. You should output two values — minimum and maximum possible number of Balls who will not get their presents, in that order. Sample Input 5 2 3 4 1 5 2 10 1 2 3 4 5 6 7 8 9 10 1 Sample Output 2 42 2	{"inputs": ["5 2\n3 4 1 5 2", "10 1\n2 3 4 5 6 7 8 9 10 1", "5 4\n3 1 4 5 2", "3 0\n2 3 1", "4 3\n2 3 4 1", "2 0\n2 1", "2 1\n2 1", "2 2\n2 1", "3 0\n2 3 1", "3 1\n2 3 1", "3 2\n2 3 1", "3 3\n2 3 1", "5 1\n2 3 4 5 1", "6 3\n2 3 1 5 6 4", "9 5\n3 4 5 2 7 8 1 9 6", "6 2\n4 5 6 2 1 3", "2 2\n2 1", "9 2\n8 6 7 5 2 3 1 9 4", "8 2\n2 3 4 5 6 7 8 1", "9 2\n2 3 1 5 6 4 8 9 7", "4 2\n2 1 4 3", "28 24\n18 24 12 27 13 9 28 2 10 4 17 21 16 25 19 7 1 14 20 11 22 6 3 26 23 5 8 15", "24 12\n23 16 1 3 15 19 14 21 18 17 5 7 20 12 24 4 8 10 9 22 6 11 13 2", "26 21\n14 7 2 10 22 24 19 6 17 3 8 4 1 15 23 20 5 12 18 26 25 21 16 9 11 13", "21 17\n2 3 4 13 6 7 8 9 10 11 12 5 14 15 16 17 18 19 20 21 1", "25 4\n2 3 4 5 1 7 8 9 10 6 12 13 14 15 11 17 18 19 20 16 22 23 24 25 21", "24 15\n2 1 4 3 7 5 6 9 8 11 10 14 12 13 17 15 16 19 18 21 20 24 22 23", "100 36\n25 22 57 55 38 95 26 85 60 90 92 51 15 76 45 74 67 35 72 18 44 96 16 46 48 21 99 41 53 13 87 20 81 64 52 30 17 33 4 79 19 10 59 82 54 39 61 14 50 75 70 88 29 2 100 68 73 69 28 36 3 37 77 40 91 93 71 24 7 56 1 42 9 47 31 62 89 83 98 27 43 5 34 66 63 8 97 6 12 94 65 58 78 84 86 80 32 23 11 49", "97 9\n29 67 51 27 85 54 86 38 84 7 2 93 36 81 50 32 31 55 18 77 69 66 26 80 90 10 44 96 17 45 79 87 64 8 13 3 91 12 42 19 37 68 48 30 76 47 53 43 97 94 60 78 88 92 4 39 65 15 33 73 59 23 1 74 9 24 75 40 25 52 95 20 72 34 62 22 56 61 49 21 46 6 89 71 16 63 57 58 82 70 5 35 41 14 28 11 83", "96 30\n74 60 50 24 36 8 12 55 27 53 83 28 21 33 75 78 90 71 96 44 88 57 94 38 86 41 11 58 19 40 54 56 89 72 26 68 52 14 31 10 37 84 7 66 87 47 80 79 51 29 4 18 42 1 2 59 63 34 65 13 92 73 6 46 61 77 70 45 15 95 16 69 49 64 93 81 67 35 39 85 20 25 9 30 82 3 91 17 76 5 22 48 62 32 23 43", "95 53\n2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 39 25 26 27 28 29 30 31 32 33 34 35 36 37 38 24 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 1", "100 9\n2 3 4 5 6 7 8 9 10 1 12 13 14 15 16 17 18 19 20 11 22 23 24 25 26 27 28 29 30 21 32 33 34 35 36 37 38 39 40 31 42 43 44 45 46 47 48 49 50 41 52 53 54 55 56 57 58 59 60 51 62 63 64 65 66 67 68 69 70 61 72 73 74 75 76 77 78 79 80 71 82 83 84 85 86 87 88 89 90 81 92 93 94 95 96 97 98 99 100 91", "93 89\n3 1 2 6 4 5 8 7 10 9 13 11 12 16 14 15 19 17 18 21 20 24 22 23 27 25 26 29 28 32 30 31 34 33 37 35 36 39 38 42 40 41 44 43 46 45 48 47 50 49 52 51 55 53 54 58 56 57 60 59 63 61 62 66 64 65 69 67 68 71 70 74 72 73 77 75 76 80 78 79 83 81 82 85 84 88 86 87 91 89 90 93 92", "7 4\n2 1 4 3 6 7 5"], "outputs": ["2 4", "2 2", "5 5", "0 0", "4 4", "0 0", "2 2", "2 2", "0 0", "2 2", "3 3", "3 3", "2 2", "3 5", "5 9", "2 4", "2 2", "3 4", "3 4", "3 4", "2 4", "25 28", "13 23", "22 26", "18 21", "5 8", "15 24", "37 72", "10 18", "31 60", "54 95", "10 18", "89 93", "4 7"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
f1358e5820183e8ec8f2e3b61ee5ef36	The number on the board	Some natural number was written on the board. Its sum of digits was not less than k. But you were distracted a bit, and someone changed this number to n, replacing some digits with others. It's known that the length of the number didn't change. You have to find the minimum number of digits in which these two numbers can differ. The first line contains integer k (1<=≤<=k<=≤<=109). The second line contains integer n (1<=≤<=n<=<<=10100000). There are no leading zeros in n. It's guaranteed that this situation is possible. Print the minimum number of digits in which the initial number and n can differ. Sample Input 3 11 3 99 Sample Output 1 0	{"inputs": ["3\n11", "3\n99", "10\n5205602270", "70\n3326631213", "200\n1000000010000000000000000000010000000000000001000001000000000000000000000000000000000000000000000000", "500\n1899337170458531693764539600958943248270674811247191310452938511077656066239840703432499357537079035", "700\n9307216756404590162143344901558545760612901767837570518638460182990196397856220673189163417019781185", "900\n7570423817272967027553082464863962024635217372307919506594193055572300657732661146354209508997483330", "18\n900", "23\n12138", "16\n333", "3\n12", "3\n111", "1\n100", "17\n89", "18\n99", "42\n97779", "2\n11", "6\n33", "45\n23456", "3\n21", "2\n2", "108\n199999899899", "6\n222", "1\n1", "9\n9", "5\n5", "27\n888"], "outputs": ["1", "0", "0", "6", "22", "6", "32", "91", "1", "1", "2", "0", "0", "0", "0", "0", "2", "0", "0", "5", "0", "0", "3", "0", "0", "0", "0", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	86	codeforces
f15218a1d52d8afdb6e5afd7f1b1934b	Spy Syndrome 2	After observing the results of Spy Syndrome, Yash realised the errors of his ways. He now believes that a super spy such as Siddhant can't use a cipher as basic and ancient as Caesar cipher. After many weeks of observation of Siddhant’s sentences, Yash determined a new cipher technique. For a given sentence, the cipher is processed as: 1. Convert all letters of the sentence to lowercase. 1. Reverse each of the words of the sentence individually. 1. Remove all the spaces in the sentence. For example, when this cipher is applied to the sentence Kira is childish and he hates losing the resulting string is ariksihsidlihcdnaehsetahgnisol Now Yash is given some ciphered string and a list of words. Help him to find out any original sentence composed using only words from the list. Note, that any of the given words could be used in the sentence multiple times. The first line of the input contains a single integer n (1<=≤<=n<=≤<=10<=000) — the length of the ciphered text. The second line consists of n lowercase English letters — the ciphered text t. The third line contains a single integer m (1<=≤<=m<=≤<=100<=000) — the number of words which will be considered while deciphering the text. Each of the next m lines contains a non-empty word wi (\|wi\|<=≤<=1<=000) consisting of uppercase and lowercase English letters only. It's guaranteed that the total length of all words doesn't exceed 1<=000<=000. Print one line — the original sentence. It is guaranteed that at least one solution exists. If there are multiple solutions, you may output any of those. Sample Input 30 ariksihsidlihcdnaehsetahgnisol 10 Kira hates is he losing death childish L and Note 12 iherehtolleh 5 HI Ho there HeLLo hello Sample Output Kira is childish and he hates losing HI there HeLLo	{"inputs": ["30\nariksihsidlihcdnaehsetahgnisol\n10\nKira\nhates\nis\nhe\nlosing\ndeath\nchildish\nL\nand\nNote", "12\niherehtolleh\n5\nHI\nHo\nthere\nHeLLo\nhello", "71\nbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n8\na\naa\naaa\naaaa\naaaaa\naaaaaa\naaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab", "11\naaaaaaaaaaa\n3\naaaa\naaaaa\naaaaaa", "5\ncbaed\n6\nbc\nea\nab\ncd\nabc\nde", "5\nlehet\n3\nel\nhel\nte", "3\naab\n2\na\nbaa", "3\naab\n2\naa\nbaa", "9\naaaaaaaaa\n2\naa\naaa", "7\nabababc\n2\nba\ncba", "7\nkirkirk\n2\nrik\nkrik"], "outputs": ["Kira is childish and he hates losing ", "HI there HeLLo ", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaab ", "aaaaaa aaaaa ", "abc de ", "hel te ", "baa ", "baa ", "aaa aa aa aa ", "ba ba cba ", "rik krik "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
f16748607c785c0b98dd1acfb1db8b04	Two Seals	One very important person has a piece of paper in the form of a rectangle a<=×<=b. Also, he has n seals. Each seal leaves an impression on the paper in the form of a rectangle of the size xi<=×<=yi. Each impression must be parallel to the sides of the piece of paper (but seal can be rotated by 90 degrees). A very important person wants to choose two different seals and put them two impressions. Each of the selected seals puts exactly one impression. Impressions should not overlap (but they can touch sides), and the total area occupied by them should be the largest possible. What is the largest area that can be occupied by two seals? The first line contains three integer numbers n, a and b (1<=≤<=n,<=a,<=b<=≤<=100). Each of the next n lines contain two numbers xi, yi (1<=≤<=xi,<=yi<=≤<=100). Print the largest total area that can be occupied by two seals. If you can not select two seals, print 0. Sample Input 2 2 2 1 2 2 1 4 10 9 2 3 1 1 5 10 9 11 3 10 10 6 6 7 7 20 5 Sample Output 4 56 0	{"inputs": ["2 2 2\n1 2\n2 1", "4 10 9\n2 3\n1 1\n5 10\n9 11", "3 10 10\n6 6\n7 7\n20 5", "2 1 1\n1 1\n1 1", "2 1 2\n1 1\n1 1", "2 100 100\n100 100\n1 1", "2 100 100\n50 100\n100 50", "2 100 100\n100 100\n87 72", "5 100 100\n100 100\n100 100\n100 100\n100 100\n100 100", "15 50 50\n9 36\n28 14\n77 74\n35 2\n20 32\n83 85\n47 3\n41 50\n21 7\n38 46\n17 6\n79 90\n91 83\n9 33\n24 11", "15 100 100\n100 100\n100 100\n100 100\n42 58\n80 22\n100 100\n100 100\n100 100\n100 100\n100 100\n48 42\n100 100\n100 100\n100 100\n100 100", "30 100 100\n60 34\n29 82\n89 77\n39 1\n100 100\n82 12\n57 87\n93 43\n78 50\n38 55\n37 9\n67 5\n100 100\n100 100\n82 47\n3 71\n100 100\n19 26\n25 94\n89 5\n100 100\n32 1\n100 100\n34 3\n40 99\n100 100\n36 12\n100 100\n100 100\n100 100", "3 100 1\n1 50\n1 60\n1 30", "3 1 60\n1 40\n2 2\n20 1", "4 1 100\n1 25\n25 1\n1 25\n2 100", "1 100 50\n4 20", "2 2 4\n3 1\n2 2", "2 2 4\n2 3\n2 1", "2 4 2\n1 2\n2 3", "2 1 4\n1 2\n1 2", "2 4 5\n2 4\n4 3", "2 1 4\n1 1\n3 3", "6 9 5\n4 5\n6 2\n1 4\n5 6\n3 7\n6 5", "6 8 5\n4 1\n3 3\n5 3\n6 7\n2 2\n5 4", "6 7 5\n6 4\n5 7\n4 7\n5 4\n1 1\n3 6", "6 9 7\n1 2\n1 5\n4 3\n4 7\n3 5\n6 7", "6 5 9\n2 3\n7 4\n1 5\n1 7\n2 5\n7 1", "2 4 2\n2 2\n1 3", "2 3 2\n3 2\n1 1", "6 7 5\n6 6\n4 7\n6 1\n4 1\n4 6\n1 5", "2 2 3\n1 2\n2 3", "2 2 2\n2 1\n1 1", "5 9 7\n6 7\n4 5\n2 7\n4 2\n5 8", "2 11 51\n1 10\n11 50", "5 9 7\n3 8\n7 6\n4 1\n5 8\n7 8", "2 4 6\n4 4\n4 2", "5 9 7\n1 6\n7 9\n1 5\n1 5\n7 3", "5 9 7\n5 2\n6 9\n1 4\n7 7\n6 4", "5 9 7\n6 7\n4 1\n1 2\n4 7\n5 6", "5 9 7\n2 8\n3 8\n2 8\n4 4\n2 2", "2 2 3\n1 4\n2 1", "5 9 7\n4 7\n3 9\n5 4\n3 4\n3 8", "5 9 7\n7 4\n6 9\n4 3\n7 5\n2 3", "2 2 3\n1 2\n2 2", "2 4 3\n2 1\n1 2", "2 4 6\n4 2\n4 4", "2 1 4\n3 2\n3 3"], "outputs": ["4", "56", "0", "0", "2", "0", "10000", "0", "0", "2374", "4452", "8958", "90", "60", "50", "0", "0", "8", "8", "4", "20", "0", "34", "35", "29", "57", "38", "0", "0", "34", "0", "3", "56", "560", "60", "24", "27", "59", "58", "40", "0", "55", "63", "6", "4", "24", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	34	codeforces
f1713e8c1a645361ed6d91822ead2758	Depression	Do you remember a kind cartoon "Beauty and the Beast"? No, no, there was no firing from machine guns or radiation mutants time-travels! There was a beauty named Belle. Once she had violated the Beast's order and visited the West Wing. After that she was banished from the castle... Everybody was upset. The beautiful Belle was upset, so was the Beast, so was Lumiere the candlestick. But the worst thing was that Cogsworth was upset. Cogsworth is not a human, but is the mantel clock, which was often used as an alarm clock. Due to Cogsworth's frustration all the inhabitants of the castle were in trouble: now they could not determine when it was time to drink morning tea, and when it was time for an evening stroll. Fortunately, deep in the basement are lying digital clock showing the time in the format HH:MM. Now the residents of the castle face a difficult task. They should turn Cogsworth's hour and minute mustache hands in such a way, that Cogsworth began to show the correct time. Moreover they need to find turn angles in degrees for each mustache hands. The initial time showed by Cogsworth is 12:00. You can only rotate the hands forward, that is, as is shown in the picture: As since there are many ways too select such angles because of full rotations, choose the smallest angles in the right (non-negative) direction. Note that Cogsworth's hour and minute mustache hands move evenly and continuously. Hands are moving independently, so when turning one hand the other hand remains standing still. The only line of input contains current time according to the digital clock, formatted as HH:MM (00<=≤<=HH<=≤<=23, 00<=≤<=MM<=≤<=59). The mantel clock initially shows 12:00. Pretests contain times of the beginning of some morning TV programs of the Channel One Russia. Print two numbers x and y — the angles of turning the hour and minute hands, respectively (0<=≤<=x,<=y<=<<=360). The absolute or relative error in the answer should not exceed 10<=-<=9. Sample Input 12:00 04:30 08:17 Sample Output 0 0135 180248.5 102	{"inputs": ["12:00", "04:30", "08:17", "07:20", "09:55", "11:59", "01:23", "11:00", "00:00", "12:30", "23:59", "20:00", "23:45", "07:14", "15:15", "16:05", "19:55", "23:58", "14:33", "18:00", "00:24", "19:45", "20:05", "21:13", "08:04", "07:40", "19:12", "06:36", "06:16", "11:49", "18:45", "06:44", "20:45", "17:48", "08:09", "04:12", "21:30", "12:56", "00:43", "02:54", "02:29", "17:24", "14:27", "16:37", "14:40", "01:00", "21:40", "08:47", "11:30", "08:31", "04:11", "19:27", "10:54", "01:20", "12:33", "11:32", "15:36", "23:45", "20:12", "15:28", "00:01", "12:01", "23:01", "00:59", "12:59", "23:00"], "outputs": ["0 0", "135 180", "248.5 102", "220 120", "297.5 330", "359.5 354", "41.5 138", "330 0", "0 0", "15 180", "359.5 354", "240 0", "352.5 270", "217 84", "97.5 90", "122.5 30", "237.5 330", "359 348", "76.5 198", "180 0", "12 144", "232.5 270", "242.5 30", "276.5 78", "242 24", "230 240", "216 72", "198 216", "188 96", "354.5 294", "202.5 270", "202 264", "262.5 270", "174 288", "244.5 54", "126 72", "285 180", "28 336", "21.5 258", "87 324", "74.5 174", "162 144", "73.5 162", "138.5 222", "80 240", "30 0", "290 240", "263.5 282", "345 180", "255.5 186", "125.5 66", "223.5 162", "327 324", "40 120", "16.5 198", "346 192", "108 216", "352.5 270", "246 72", "104 168", "0.5 6", "0.5 6", "330.5 6", "29.5 354", "29.5 354", "330 0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	36	codeforces
f19ce5e43cad559a41626683b26478cf	Indian Summer	Indian summer is such a beautiful time of the year! A girl named Alyona is walking in the forest and picking a bouquet from fallen leaves. Alyona is very choosy — she doesn't take a leaf if it matches the color and the species of the tree of one of the leaves she already has. Find out how many leaves Alyona has picked. The first line contains an integer n (1<=≤<=n<=≤<=100) — the number of leaves Alyona has found. The next n lines contain the leaves' descriptions. Each leaf is characterized by the species of the tree it has fallen from and by the color. The species of the trees and colors are given in names, consisting of no more than 10 lowercase Latin letters. A name can not be an empty string. The species of a tree and the color are given in each line separated by a space. Output the single number — the number of Alyona's leaves. Sample Input 5 birch yellow maple red birch yellow maple yellow maple green 3 oak yellow oak yellow oak yellow Sample Output 4 1	{"inputs": ["5\nbirch yellow\nmaple red\nbirch yellow\nmaple yellow\nmaple green", "3\noak yellow\noak yellow\noak yellow", "5\nxbnbkzn hp\nkaqkl vrgzbvqstu\nj aqidx\nhos gyul\nwefxmh tygpluae", "1\nqvwli hz", "4\nsrhk x\nsrhk x\nqfoe vnrjuab\nqfoe vnrjuab", "4\nsddqllmmpk syded\nfprsq fnenjnaz\nn hdej\nsddqllmmpk syded", "17\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw\njtbctslqq tosqzw", "18\nb d\nrfdb esp\nrfdb esp\nb d\nrfdb esp\nrfdb esp\nb d\nb d\nrfdb esp\nrfdb esp\nb d\nrfdb esp\nb d\nrfdb esp\nb d\nb d\nrfdb esp\nrfdb esp", "13\nsvpzwtwn rykzfdce\nqweiyeck jkreouy\nhk nnli\ntwxrnbbdt vtuv\nxokqjtylly sz\nesdt dbfidjslq\ng ybqgomvw\nxcpfjmf zcqvz\nifajadhj invzueip\nvdemdnxifb hckwebmi\nsdpnhipam wvowzavh\nuqdlfskhgo vunbpghae\ne dtigwnb", "20\nm vkfh\nvptikamead mvx\nitu mf\nklruxckw aqega\nekqkd enjllwol\ncc uybfdh\nimrfdngvo u\ne uh\ntwt jsslcfuogk\nbljwqsag tuqbdn\nqcv q\nasx gzhvwwmajj\nqcv q\nekqkd enjllwol\nasx gzhvwwmajj\nks vv\nkzyfi cn\ncc uybfdh\nitu mf\ncjbjhtbyvk vatwfmux", "2\nab ab\na bab"], "outputs": ["4", "1", "5", "1", "2", "3", "1", "2", "13", "15", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	623	codeforces
f1a35742b0a9a1e287eebb34373efa86	Longest k-Good Segment	The array a with n integers is given. Let's call the sequence of one or more consecutive elements in a segment. Also let's call the segment k-good if it contains no more than k different values. Find any longest k-good segment. As the input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java. The first line contains two integers n,<=k (1<=≤<=k<=≤<=n<=≤<=5·105) — the number of elements in a and the parameter k. The second line contains n integers ai (0<=≤<=ai<=≤<=106) — the elements of the array a. Print two integers l,<=r (1<=≤<=l<=≤<=r<=≤<=n) — the index of the left and the index of the right ends of some k-good longest segment. If there are several longest segments you can print any of them. The elements in a are numbered from 1 to n from left to right. Sample Input 5 5 1 2 3 4 5 9 3 6 5 1 2 3 2 1 4 5 3 1 1 2 3 Sample Output 1 5 3 7 1 1	{"inputs": ["5 5\n1 2 3 4 5", "9 3\n6 5 1 2 3 2 1 4 5", "3 1\n1 2 3", "1 1\n747391", "5 2\n171230 171230 171230 171230 171230", "10 3\n512008 512008 452221 512008 314256 123232 314256 512008 314256 123232", "6 1\n1 1 2 1 1 1", "5 4\n1 2 3 4 0", "5 4\n2 3 4 5 0", "2 2\n0 1", "2 2\n0 0", "5 4\n1 2 3 45 0"], "outputs": ["1 5", "3 7", "1 1", "1 1", "1 5", "4 10", "4 6", "1 4", "1 4", "1 2", "1 2", "1 4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	54	codeforces
f1cdb30715841ea0612c3bcf79aecec7	Wilbur and Swimming Pool	After making bad dives into swimming pools, Wilbur wants to build a swimming pool in the shape of a rectangle in his backyard. He has set up coordinate axes, and he wants the sides of the rectangle to be parallel to them. Of course, the area of the rectangle must be positive. Wilbur had all four vertices of the planned pool written on a paper, until his friend came along and erased some of the vertices. Now Wilbur is wondering, if the remaining n vertices of the initial rectangle give enough information to restore the area of the planned swimming pool. The first line of the input contains a single integer n (1<=≤<=n<=≤<=4) — the number of vertices that were not erased by Wilbur's friend. Each of the following n lines contains two integers xi and yi (<=-<=1000<=≤<=xi,<=yi<=≤<=1000) —the coordinates of the i-th vertex that remains. Vertices are given in an arbitrary order. It's guaranteed that these points are distinct vertices of some rectangle, that has positive area and which sides are parallel to the coordinate axes. Print the area of the initial rectangle if it could be uniquely determined by the points remaining. Otherwise, print <=-<=1. Sample Input 2 0 0 1 1 1 1 1 Sample Output 1 -1	{"inputs": ["2\n0 0\n1 1", "1\n1 1", "1\n-188 17", "1\n71 -740", "4\n-56 -858\n-56 -174\n778 -858\n778 -174", "2\n14 153\n566 -13", "2\n-559 894\n314 127", "1\n-227 -825", "2\n-187 583\n25 13", "2\n-337 451\n32 -395", "4\n-64 -509\n-64 960\n634 -509\n634 960", "2\n-922 -505\n712 -683", "2\n-1000 -1000\n-1000 0", "2\n-1000 -1000\n0 -1000", "4\n-414 -891\n-414 896\n346 -891\n346 896", "2\n56 31\n704 -121", "4\n-152 198\n-152 366\n458 198\n458 366", "3\n-890 778\n-418 296\n-890 296", "4\n852 -184\n852 724\n970 -184\n970 724", "1\n858 -279", "2\n-823 358\n446 358", "2\n-739 -724\n-739 443", "2\n686 664\n686 -590", "3\n-679 301\n240 -23\n-679 -23", "2\n-259 -978\n978 -978", "1\n627 -250", "3\n-281 598\n679 -990\n-281 -990", "2\n-414 -431\n-377 -688", "3\n-406 566\n428 426\n-406 426", "3\n-686 695\n-547 308\n-686 308", "1\n-164 -730", "2\n980 -230\n980 592", "4\n-925 306\n-925 602\n398 306\n398 602", "3\n576 -659\n917 -739\n576 -739", "1\n720 -200", "4\n-796 -330\n-796 758\n171 -330\n171 758", "2\n541 611\n-26 611", "3\n-487 838\n134 691\n-487 691", "2\n-862 -181\n-525 -181", "1\n-717 916", "1\n-841 -121", "4\n259 153\n259 999\n266 153\n266 999", "2\n295 710\n295 254", "4\n137 -184\n137 700\n712 -184\n712 700", "2\n157 994\n377 136", "1\n193 304", "4\n5 -952\n5 292\n553 -952\n553 292", "2\n-748 697\n671 575", "2\n-457 82\n260 -662", "2\n-761 907\n967 907", "3\n-639 51\n-321 -539\n-639 -539", "2\n-480 51\n89 -763", "4\n459 -440\n459 -94\n872 -440\n872 -94", "2\n380 -849\n68 -849", "2\n-257 715\n102 715", "2\n247 -457\n434 -921", "4\n-474 -894\n-474 -833\n-446 -894\n-446 -833", "3\n-318 831\n450 31\n-318 31", "3\n-282 584\n696 488\n-282 488", "3\n258 937\n395 856\n258 856", "1\n-271 -499", "2\n-612 208\n326 -559", "2\n115 730\n562 -546", "2\n-386 95\n-386 750", "3\n0 0\n0 1\n1 0", "3\n0 4\n3 4\n3 1", "3\n1 1\n1 2\n2 1", "3\n1 4\n4 4\n4 1", "3\n1 1\n2 1\n1 2", "3\n0 0\n1 0\n1 1", "3\n0 0\n0 5\n5 0", "3\n0 0\n0 1\n1 1", "4\n0 0\n1 0\n1 1\n0 1", "3\n4 4\n1 4\n4 1", "3\n0 0\n2 0\n2 1", "3\n0 0\n2 0\n0 2", "3\n0 0\n0 1\n5 0", "3\n1 1\n1 3\n3 1", "4\n0 0\n1 0\n0 1\n1 1", "2\n1 0\n2 1", "3\n0 0\n1 0\n0 1", "3\n1 0\n0 0\n0 1", "3\n0 0\n0 5\n5 5", "3\n1 0\n5 0\n5 10", "3\n0 0\n1 0\n1 2", "4\n0 1\n0 0\n1 0\n1 1", "3\n0 0\n2 0\n0 1", "3\n-2 -1\n-1 -1\n-1 -2", "2\n1 0\n0 1", "4\n1 1\n3 3\n3 1\n1 3", "3\n2 1\n1 2\n2 2", "3\n0 0\n0 3\n3 0", "2\n0 3\n3 3", "4\n2 0\n2 8\n5 8\n5 0", "2\n0 999\n100 250", "3\n1 1\n1 5\n5 1", "3\n0 1\n0 0\n1 1", "3\n0 0\n10 0\n0 10", "2\n0 0\n-1 -1", "3\n1 5\n2 2\n2 5", "3\n0 0\n0 1\n2 0", "3\n0 1\n1 0\n0 0", "3\n0 0\n0 -1\n1 -1", "3\n0 1\n1 0\n1 1", "3\n3 5\n3 2\n7 2", "3\n1 2\n1 3\n2 2", "3\n5 0\n0 0\n0 5", "3\n1 0\n1 3\n5 0", "3\n0 0\n0 2\n2 0", "3\n1 1\n0 0\n1 0", "3\n1 2\n1 3\n2 3", "4\n0 0\n0 1\n1 1\n1 0", "2\n-3 0\n3 3", "3\n1 1\n0 1\n1 0", "3\n0 0\n5 0\n5 5", "3\n79 79\n79 158\n158 79", "3\n1 0\n1 -1\n0 0", "3\n1 1\n1 2\n2 2", "3\n0 1\n0 0\n1 0", "3\n2 1\n2 4\n6 1", "3\n5 0\n0 0\n5 5"], "outputs": ["1", "-1", "-1", "-1", "570456", "91632", "669591", "-1", "120840", "312174", "1025362", "290852", "-1", "-1", "1358120", "98496", "102480", "227504", "107144", "-1", "-1", "-1", "-1", "297756", "-1", "-1", "1524480", "9509", "116760", "53793", "-1", "-1", "391608", "27280", "-1", "1052096", "-1", "91287", "-1", "-1", "-1", "5922", "-1", "508300", "188760", "-1", "681712", "173118", "533448", "-1", "187620", "463166", "142898", "-1", "-1", "86768", "1708", "614400", "93888", "11097", "-1", "719446", "570372", "-1", "1", "9", "1", "9", "1", "1", "25", "1", "1", "9", "2", "4", "5", "4", "1", "1", "1", "1", "25", "40", "2", "1", "2", "1", "1", "4", "1", "9", "-1", "24", "74900", "16", "1", "100", "1", "3", "2", "1", "1", "1", "12", "1", "25", "12", "4", "1", "1", "1", "18", "1", "25", "6241", "1", "1", "1", "12", "25"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	130	codeforces
f1e893d735a5a95becb2ba80e08851fe	Matchmaker	Polycarpus has n markers and m marker caps. Each marker is described by two numbers: xi is the color and yi is the diameter. Correspondingly, each cap is described by two numbers: aj is the color and bj is the diameter. Cap (aj,<=bj) can close marker (xi,<=yi) only if their diameters match, that is, bj<==<=yi. Besides, a marker is considered to be beautifully closed, if the cap color and the marker color match, that is, aj<==<=xi. Find the way to close the maximum number of markers. If there are several such ways, then choose the one that has the maximum number of beautifully closed markers. The first input line contains two space-separated integers n and m (1<=≤<=n,<=m<=≤<=105) — the number of markers and the number of caps, correspondingly. Next n lines describe the markers. The i-th line contains two space-separated integers xi, yi (1<=≤<=xi,<=yi<=≤<=1000) — the i-th marker's color and diameter, correspondingly. Next m lines describe the caps. The j-th line contains two space-separated integers aj, bj (1<=≤<=aj,<=bj<=≤<=1000) — the color and diameter of the j-th cap, correspondingly. Print two space-separated integers u,<=v, where u is the number of closed markers and v is the number of beautifully closed markers in the sought optimal way. Remember that you have to find the way to close the maximum number of markers, and if there are several such ways, you should choose the one where the number of beautifully closed markers is maximum. Sample Input 3 4 1 2 3 4 2 4 5 4 2 4 1 1 1 2 2 2 1 2 2 1 3 4 5 1 Sample Output 3 2 1 0	{"inputs": ["3 4\n1 2\n3 4\n2 4\n5 4\n2 4\n1 1\n1 2", "2 2\n1 2\n2 1\n3 4\n5 1", "6 7\n2 1\n2 2\n2 1\n1 1\n2 1\n1 2\n2 2\n2 2\n2 2\n1 2\n2 2\n1 1\n1 2", "6 7\n2 1\n1 1\n2 2\n1 2\n1 1\n1 2\n2 1\n1 1\n1 1\n1 1\n1 2\n2 2\n1 1", "6 7\n2 1\n2 2\n1 1\n1 2\n2 2\n1 2\n1 2\n1 1\n1 2\n2 2\n2 2\n2 2\n1 1", "6 7\n1 1\n1 1\n1 2\n1 2\n2 2\n1 2\n2 1\n2 1\n2 1\n2 1\n1 1\n1 1\n1 2", "6 2\n1 1\n2 1\n1 1\n1 1\n1 2\n1 1\n2 2\n1 2", "3 3\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "1 1\n1 1\n1 1", "1 1\n1 1\n2 2", "1 1\n1 1\n1 2", "1 1\n1 2\n2 2", "1 5\n1 1\n2 2\n1 1\n2 1\n1 2\n1 1"], "outputs": ["3 2", "1 0", "3 3", "5 5", "6 5", "3 3", "1 1", "3 3", "1 1", "0 0", "0 0", "1 0", "1 1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	21	codeforces
f1f9f715455d8c3f24e570cb59b1a3cb	Rats	Rats have bred to hundreds and hundreds in the basement of the store, owned by Vasily Petrovich. Vasily Petrovich may have not noticed their presence, but they got into the habit of sneaking into the warehouse and stealing food from there. Vasily Petrovich cannot put up with it anymore, he has to destroy the rats in the basement. Since mousetraps are outdated and do not help, and rat poison can poison inattentive people as well as rats, he chose a radical way: to blow up two grenades in the basement (he does not have more). In this problem, we will present the shop basement as a rectangular table of n<=×<=m cells. Some of the cells are occupied by walls, and the rest of them are empty. Vasily has been watching the rats and he found out that at a certain time they go to sleep, and all the time they sleep in the same places. He wants to blow up a grenade when this convenient time comes. On the plan of his basement, he marked cells with sleeping rats in them. Naturally, these cells are not occupied by walls. Grenades can only blow up in a cell that is not occupied by a wall. The blast wave from a grenade distributes as follows. We assume that the grenade blast occurs at time 0. During this initial time only the cell where the grenade blew up gets 'clear'. If at time t some cell is clear, then at time t<=+<=1 those side-neighbouring cells which are not occupied by the walls get clear too (some of them could have been cleared before). The blast wave distributes for exactly d seconds, then it dies immediately. Vasily Petrovich wonders, whether he can choose two cells to blast the grenades so as to clear all cells with sleeping rats. Write the program that finds it out. The first line contains three integers n, m and d, separated by single spaces (4<=≤<=n,<=m<=≤<=1000,<=1<=≤<=d<=≤<=8). Next n lines contain the table that represents the basement plan. Each row of the table consists of m characters. Character "X" means that the corresponding cell is occupied by the wall, character "." represents a empty cell, character "R" represents a empty cell with sleeping rats. It is guaranteed that the first and the last row, as well as the first and the last column consist of characters "X". The plan has at least two empty cells. There is at least one cell with sleeping rats. If it is impossible to blow up all cells with sleeping rats, print a single integer -1. Otherwise, print four space-separated integers r1,<=c1,<=r2,<=c2, that mean that one grenade should go off in cell (r1,<=c1), and the other one — in cell (r2,<=c2). Consider the table rows numbered from top to bottom from 1 to n and the table columns — from left to right from 1 to m. As r1 and r2 represent the row numbers, and c1 and c2 represent the column numbers in the table, they should fit the limits: 1<=≤<=r1,<=r2<=≤<=n,<=1<=≤<=c1,<=c2<=≤<=m. It is forbidden to blow a grenade twice in the same cell. The blast waves of the grenades can intersect. It is possible that one grenade blast destroys no rats, and the other one destroys all of them. Sample Input 4 4 1 XXXX XR.X X.RX XXXX 9 14 5 XXXXXXXXXXXXXX X....R...R...X X..R.........X X....RXR..R..X X..R...X.....X XR.R...X.....X X....XXR.....X X....R..R.R..X XXXXXXXXXXXXXX 7 7 1 XXXXXXX X.R.R.X X.....X X..X..X X..R..X X....RX XXXXXXX Sample Output 2 2 2 3 2 3 6 9 -1	{"inputs": ["4 4 1\nXXXX\nXR.X\nX.RX\nXXXX", "9 14 5\nXXXXXXXXXXXXXX\nX....R...R...X\nX..R.........X\nX....RXR..R..X\nX..R...X.....X\nXR.R...X.....X\nX....XXR.....X\nX....R..R.R..X\nXXXXXXXXXXXXXX", "7 7 1\nXXXXXXX\nX.R.R.X\nX.....X\nX..X..X\nX..R..X\nX....RX\nXXXXXXX", "7 7 2\nXXXXXXX\nX.....X\nXRXR..X\nX.....X\nXR...RX\nXX....X\nXXXXXXX", "7 7 3\nXXXXXXX\nX..RR.X\nX.R...X\nX.R...X\nX.R..RX\nX.....X\nXXXXXXX", "7 7 4\nXXXXXXX\nX....RX\nXR.R..X\nX.....X\nX.R...X\nX..R..X\nXXXXXXX", "7 7 5\nXXXXXXX\nX.....X\nX...R.X\nX.....X\nXR.R..X\nX.....X\nXXXXXXX", "7 13 5\nXXXXXXXXXXXXX\nX.R..X..R...X\nX..X......X.X\nX...R..R.X.XX\nXR...RR..R..X\nX..R....R...X\nXXXXXXXXXXXXX", "13 7 5\nXXXXXXX\nX.X..RX\nX.R..RX\nXR....X\nX...R.X\nX....XX\nX.R..RX\nX....RX\nXR.R.XX\nXR.XR.X\nXR....X\nX.....X\nXXXXXXX", "13 15 5\nXXXXXXXXXXXXXXX\nX.............X\nX.R........R..X\nXR.....X...RRRX\nX....R...RRX..X\nX.R..R......R.X\nX...R.....R...X\nX..........XRRX\nX.......RR....X\nX......R......X\nX....X........X\nXX.XR.R....R..X\nXXXXXXXXXXXXXXX", "4 15 5\nXXXXXXXXXXXXXXX\nX......X......X\nX.........R.R.X\nXXXXXXXXXXXXXXX", "19 7 5\nXXXXXXX\nX.R.X.X\nX...R.X\nX...X.X\nX...RRX\nX.....X\nX.....X\nX.....X\nX.....X\nX..RRXX\nX.....X\nX.....X\nX...R.X\nX.....X\nX...R.X\nX..R..X\nX.....X\nX.....X\nXXXXXXX", "10 9 5\nXXXXXXXXX\nXRRRRRRRX\nXRRRRRRRX\nXRRRRRRRX\nXRRRRRRRX\nXRRRRRRRX\nXRRRRRRRX\nXRRRRRRRX\nXRRRRRRRX\nXXXXXXXXX", "10 5 2\nXXXXX\nX..XX\nXR..X\nXRX.X\nX...X\nX.RRX\nXR.RX\nX.R.X\nX...X\nXXXXX", "9 13 1\nXXXXXXXXXXXXX\nXX..X.X..XX.X\nXX..X....X.XX\nX..XRX.X.XXXX\nX...R..X....X\nX...X..X....X\nXX...RX.....X\nX....RX.X..XX\nXXXXXXXXXXXXX", "20 20 4\nXXXXXXXXXXXXXXXXXXXX\nX........X...X..X..X\nX..X.XXXXXX....XX..X\nX.....X.....R.X.X.XX\nX..XX.X..X.X...XXX.X\nXX.....XX.XX....X..X\nX...........X...X.XX\nX...X.......X.XX.XXX\nXX...XXX.X...XX.X..X\nXX.X.......X..X.XX.X\nX...X......X.X.X...X\nX..X.XX..XXX.X.X.X.X\nX...XX.X.XXX.......X\nX.X..X....XXX.X...XX\nX.X...X.......X...XX\nX..X.X......XXX....X\nXX....X.X......X...X\nXX...............X.X\nX....X...X........XX\nXXXXXXXXXXXXXXXXXXXX"], "outputs": ["2 2 2 3", "2 3 6 9", "-1", "3 2 5 4", "2 4 5 3", "2 6 4 2", "3 5 2 2", "2 3 2 8", "2 6 8 2", "-1", "3 11 2 2", "3 3 11 4", "3 4 7 5", "3 2 6 3", "4 5 7 6", "4 13 2 2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
f1facf569ffcf5bc4df80b22352296b4	Xor-Paths	There is a rectangular grid of size $n \times m$. Each cell has a number written on it; the number on the cell ($i, j$) is $a_{i, j}$. Your task is to calculate the number of paths from the upper-left cell ($1, 1$) to the bottom-right cell ($n, m$) meeting the following constraints: - You can move to the right or to the bottom only. Formally, from the cell ($i, j$) you may move to the cell ($i, j + 1$) or to the cell ($i + 1, j$). The target cell can't be outside of the grid. - The xor of all the numbers on the path from the cell ($1, 1$) to the cell ($n, m$) must be equal to $k$ (xor operation is the bitwise exclusive OR, it is represented as '^' in Java or C++ and "xor" in Pascal). Find the number of such paths in the given grid. The first line of the input contains three integers $n$, $m$ and $k$ ($1 \le n, m \le 20$, $0 \le k \le 10^{18}$) — the height and the width of the grid, and the number $k$. The next $n$ lines contain $m$ integers each, the $j$-th element in the $i$-th line is $a_{i, j}$ ($0 \le a_{i, j} \le 10^{18}$). Print one integer — the number of paths from ($1, 1$) to ($n, m$) with xor sum equal to $k$. Sample Input 3 3 11 2 1 5 7 10 0 12 6 4 3 4 2 1 3 3 3 0 3 3 2 3 0 1 1 3 4 1000000000000000000 1 3 3 3 0 3 3 2 3 0 1 1 Sample Output 3 5 0	{"inputs": ["3 3 11\n2 1 5\n7 10 0\n12 6 4", "3 4 2\n1 3 3 3\n0 3 3 2\n3 0 1 1", "3 4 1000000000000000000\n1 3 3 3\n0 3 3 2\n3 0 1 1", "1 1 1000000000000000000\n1000000000000000000", "1 1 1000000000000000000\n999999999999999999", "1 1 1\n1", "1 2 3\n1 2", "1 10 1023\n1 2 4 8 16 32 64 128 256 512", "1 20 1048575\n1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288", "2 1 3\n1\n2", "2 2 7\n1 2\n2 4", "2 10 2047\n1 2 4 8 16 32 64 128 256 512\n2 4 8 16 32 64 128 256 512 1024", "2 20 2097151\n1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288\n2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576", "10 1 1023\n1\n2\n4\n8\n16\n32\n64\n128\n256\n512", "10 2 2047\n1 2\n2 4\n4 8\n8 16\n16 32\n32 64\n64 128\n128 256\n256 512\n512 1024", "10 10 524287\n1 2 4 8 16 32 64 128 256 512\n2 4 8 16 32 64 128 256 512 1024\n4 8 16 32 64 128 256 512 1024 2048\n8 16 32 64 128 256 512 1024 2048 4096\n16 32 64 128 256 512 1024 2048 4096 8192\n32 64 128 256 512 1024 2048 4096 8192 16384\n64 128 256 512 1024 2048 4096 8192 16384 32768\n128 256 512 1024 2048 4096 8192 16384 32768 65536\n256 512 1024 2048 4096 8192 16384 32768 65536 131072\n512 1024 2048 4096 8192 16384 32768 65536 131072 262144", "20 1 1048575\n1\n2\n4\n8\n16\n32\n64\n128\n256\n512\n1024\n2048\n4096\n8192\n16384\n32768\n65536\n131072\n262144\n524288", "20 2 2097151\n1 2\n2 4\n4 8\n8 16\n16 32\n32 64\n64 128\n128 256\n256 512\n512 1024\n1024 2048\n2048 4096\n4096 8192\n8192 16384\n16384 32768\n32768 65536\n65536 131072\n131072 262144\n262144 524288\n524288 1048576", "1 1 982347923479\n1", "1 2 1\n1 1"], "outputs": ["3", "5", "0", "1", "0", "1", "1", "1", "1", "1", "2", "10", "20", "1", "10", "48620", "1", "20", "0", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
f206f390408b8469f5ead1d5a0d4ef6f	Ilya And The Tree	Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex 1. There is an integer number written on each vertex of the tree; the number written on vertex i is equal to ai. Ilya believes that the beauty of the vertex x is the greatest common divisor of all numbers written on the vertices on the path from the root to x, including this vertex itself. In addition, Ilya can change the number in one arbitrary vertex to 0 or leave all vertices unchanged. Now for each vertex Ilya wants to know the maximum possible beauty it can have. For each vertex the answer must be considered independently. The beauty of the root equals to number written on it. First line contains one integer number n — the number of vertices in tree (1<=≤<=n<=≤<=2·105). Next line contains n integer numbers ai (1<=≤<=i<=≤<=n, 1<=≤<=ai<=≤<=2·105). Each of next n<=-<=1 lines contains two integer numbers x and y (1<=≤<=x,<=y<=≤<=n, x<=≠<=y), which means that there is an edge (x,<=y) in the tree. Output n numbers separated by spaces, where i-th number equals to maximum possible beauty of vertex i. Sample Input 2 6 2 1 2 3 6 2 3 1 2 1 3 1 10 Sample Output 6 6 6 6 6 10	{"inputs": ["2\n6 2\n1 2", "3\n6 2 3\n1 2\n1 3", "1\n10", "10\n2 3 4 5 6 7 8 9 10 11\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n4 8\n8 9\n9 10", "4\n6 2 3 2\n1 2\n2 3\n3 4"], "outputs": ["6 6 ", "6 6 6 ", "10 ", "2 3 2 1 1 1 1 1 1 1 ", "6 6 3 2 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
f20f51e123ce54994ea16251d4a30538	Hexadecimal's theorem	Recently, a chaotic virus Hexadecimal advanced a new theorem which will shake the Universe. She thinks that each Fibonacci number can be represented as sum of three not necessary different Fibonacci numbers. Let's remember how Fibonacci numbers can be calculated. F0<==<=0, F1<==<=1, and all the next numbers are Fi<==<=Fi<=-<=2<=+<=Fi<=-<=1. So, Fibonacci numbers make a sequence of numbers: 0, 1, 1, 2, 3, 5, 8, 13, ... If you haven't run away from the PC in fear, you have to help the virus. Your task is to divide given Fibonacci number n by three not necessary different Fibonacci numbers or say that it is impossible. The input contains of a single integer n (0<=≤<=n<=<<=109) — the number that should be represented by the rules described above. It is guaranteed that n is a Fibonacci number. Output three required numbers: a, b and c. If there is no answer for the test you have to print "I'm too stupid to solve this problem" without the quotes. If there are multiple answers, print any of them. Sample Input 3 13 Sample Output 1 1 1 2 3 8	{"inputs": ["3", "13", "0", "1", "2", "1597", "0", "1", "1", "2", "3", "5", "8", "13", "21", "34", "55", "89", "144", "233", "377", "610", "987", "1597", "2584", "4181", "6765", "10946", "17711", "28657", "46368", "75025", "121393", "196418", "317811", "514229", "832040", "1346269", "2178309", "3524578", "5702887", "9227465", "14930352", "24157817", "39088169", "63245986", "102334155", "165580141", "267914296", "433494437", "701408733", "701408733", "102334155", "63245986"], "outputs": ["1 1 1", "2 3 8", "0 0 0", "1 0 0", "1 1 0", "233 377 987", "0 0 0", "1 0 0", "1 0 0", "1 1 0", "1 1 1", "1 1 3", "1 2 5", "2 3 8", "3 5 13", "5 8 21", "8 13 34", "13 21 55", "21 34 89", "34 55 144", "55 89 233", "89 144 377", "144 233 610", "233 377 987", "377 610 1597", "610 987 2584", "987 1597 4181", "1597 2584 6765", "2584 4181 10946", "4181 6765 17711", "6765 10946 28657", "10946 17711 46368", "17711 28657 75025", "28657 46368 121393", "46368 75025 196418", "75025 121393 317811", "121393 196418 514229", "196418 317811 832040", "317811 514229 1346269", "514229 832040 2178309", "832040 1346269 3524578", "1346269 2178309 5702887", "2178309 3524578 9227465", "3524578 5702887 14930352", "5702887 9227465 24157817", "9227465 14930352 39088169", "14930352 24157817 63245986", "24157817 39088169 102334155", "39088169 63245986 165580141", "63245986 102334155 267914296", "102334155 165580141 433494437", "102334155 165580141 433494437", "14930352 24157817 63245986", "9227465 14930352 39088169"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	437	codeforces
f23516b21bb43236372be770896daf03	Martian Clock	Having stayed home alone, Petya decided to watch forbidden films on the Net in secret. "What ungentlemanly behavior!" — you can say that, of course, but don't be too harsh on the kid. In his country films about the Martians and other extraterrestrial civilizations are forbidden. It was very unfair to Petya as he adored adventure stories that featured lasers and robots. Today Petya is watching a shocking blockbuster about the Martians called "R2:D2". What can "R2:D2" possibly mean? It might be the Martian time represented in the Martian numeral system. Petya knows that time on Mars is counted just like on the Earth (that is, there are 24 hours and each hour has 60 minutes). The time is written as "a:b", where the string a stands for the number of hours (from 0 to 23 inclusive), and string b stands for the number of minutes (from 0 to 59 inclusive). The only thing Petya doesn't know is in what numeral system the Martian time is written. Your task is to print the radixes of all numeral system which can contain the time "a:b". The first line contains a single string as "a:b" (without the quotes). There a is a non-empty string, consisting of numbers and uppercase Latin letters. String a shows the number of hours. String b is a non-empty string that consists of numbers and uppercase Latin letters. String b shows the number of minutes. The lengths of strings a and b are from 1 to 5 characters, inclusive. Please note that strings a and b can have leading zeroes that do not influence the result in any way (for example, string "008:1" in decimal notation denotes correctly written time). We consider characters 0, 1, ..., 9 as denoting the corresponding digits of the number's representation in some numeral system, and characters A, B, ..., Z correspond to numbers 10, 11, ..., 35. Print the radixes of the numeral systems that can represent the time "a:b" in the increasing order. Separate the numbers with spaces or line breaks. If there is no numeral system that can represent time "a:b", print the single integer 0. If there are infinitely many numeral systems that can represent the time "a:b", print the single integer -1. Note that on Mars any positional numeral systems with positive radix strictly larger than one are possible. Sample Input 11:20 2A:13 000B:00001 Sample Output 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 220 -1	{"inputs": ["11:20", "2A:13", "000B:00001", "00000:00000", "70:00", "00:21", "02:130", "123:A", "N8HYJ:042JW", "N:7", "00000:00021", "00002:00130", "00394:00321", "0000P:0000E", "0000F:0002G", "0000N:00007", "000G6:000GD", "000B3:00098", "100:0101", "00101:0101", "00001:00001", "00A:00A", "10101:000", "0010:00000", "0033:00202", "0011:124", "00B:0023", "003:25", "0021:00054", "01B:4A", "27:0070", "43:210", "0:10", "Z:0", "0:Z", "Z:Z", "ZZZZZ:ZZZZZ", "0:1Z", "0:0Z", "0:00000", "0:0", "0:10000", "01:010", "1:11", "00Z:01", "1:10", "A:10", "00:10", "00:010", "0Z:00", "00:1A", "00Z:03", "000Z:000Z", "000Z:00A", "001:010", "00:1Z", "00:20", "10:05", "00Z:001", "Z:2", "0:1", "Z:00", "0:1N", "1:60", "Z:01", "000:010", "000Z:00001", "1:10002", "Z:1", "V:V", "000:0010", "0Z:01", "0:1A", "000Z:0001", "24:0000", "1001:1001", "00:0010"], "outputs": ["3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22", "0", "-1", "-1", "0", "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", "4 5 6", "0", "0", "-1", "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", "4 5 6", "0", "0", "17 18 19 20 21", "-1", "0", "0", "2 3 4", "2 3 4", "-1", "-1", "2", "2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23", "4 5", "5 6", "12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28", "6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27", "6 7 8 9 10 11", "12", "8", "5", "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", "0", "-1", "0", "0", "0", "-1", "-1", "-1", "2", "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", "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", "0", "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", "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", "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", "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", "0", "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", "0", "0", "0", "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", "0", "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", "6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23", "0", "0", "-1", "0", "24 25 26 27 28 29 30 31 32 33 34 35 36", "7 8 9", "0", "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", "0", "0", "0", "0", "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", "0", "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", "0", "5 6 7 8 9", "2", "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"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
f2643261d115329182a78ea3b0e7a79f	none	Родители Васи хотят, чтобы он как можно лучше учился. Поэтому если он получает подряд три положительные оценки («четвёрки» или «пятёрки»), они дарят ему подарок. Соответственно, оценки «единица», «двойка» и «тройка» родители Васи считают плохими. Когда Вася получает подряд три хорошие оценки, ему сразу вручают подарок, но для того, чтобы получить ещё один подарок, ему вновь надо получить подряд ещё три хорошие оценки. Например, если Вася получит подряд пять «четвёрок» оценок, а потом «двойку», то ему дадут только один подарок, а вот если бы «четвёрок» было уже шесть, то подарков было бы два. За месяц Вася получил n оценок. Вам предстоит посчитать количество подарков, которые получил Вася. Оценки будут даны именно в том порядке, в котором Вася их получал. В первой строке входных данных следует целое положительное число n (3<=≤<=n<=≤<=1000) — количество оценок, полученных Васей. Во второй строке входных данных следует последовательность из n чисел a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=5) — оценки, полученные Васей. Оценки заданы в том порядке, в котором Вася их получил. Выведите одно целое число — количество подарков, полученных Васей. Sample Input 6 4 5 4 5 4 4 14 1 5 4 5 2 4 4 5 5 4 3 4 5 5 Sample Output 2 3	{"inputs": ["6\n4 5 4 5 4 4", "14\n1 5 4 5 2 4 4 5 5 4 3 4 5 5", "3\n4 5 4", "3\n4 5 1", "4\n5 4 3 5", "10\n4 4 5 4 4 5 5 5 4 4", "20\n5 5 5 4 5 4 5 5 5 5 5 4 4 5 3 4 4 4 5 4", "30\n4 4 5 5 5 4 5 5 4 5 4 4 5 4 4 4 5 4 4 4 5 5 5 5 4 5 5 5 4 4", "40\n5 4 4 5 5 5 1 5 4 4 4 4 4 2 4 4 4 4 4 4 5 4 4 4 5 5 3 4 4 5 5 5 4 4 4 4 4 1 3 4", "50\n4 5 4 4 5 2 4 4 1 3 5 4 4 4 4 5 5 5 5 3 5 4 4 5 5 4 4 4 5 4 4 4 4 4 2 4 5 4 4 4 1 5 4 5 4 5 4 1 4 4", "60\n4 4 5 5 5 4 4 5 4 4 4 4 5 5 4 5 4 2 4 5 5 4 5 4 5 5 5 4 4 5 5 4 4 5 4 5 4 5 4 5 5 5 4 5 5 5 5 4 4 4 5 4 5 5 4 4 4 5 5 5", "70\n5 4 4 4 4 4 5 4 4 5 4 5 4 3 5 5 5 4 4 5 5 4 4 4 4 5 4 4 5 5 4 4 5 4 5 4 5 4 4 4 5 5 4 4 4 4 5 4 4 4 5 5 5 5 4 4 4 1 5 5 4 1 5 5 4 4 5 4 4 5", "80\n5 5 4 4 5 5 4 4 5 4 4 4 5 5 4 4 5 4 5 5 4 4 5 4 4 4 5 5 5 5 5 4 5 5 4 4 4 4 4 5 5 5 1 4 4 5 4 4 5 4 5 5 3 5 5 5 2 4 4 5 5 5 5 5 2 4 5 5 5 4 5 4 4 4 3 4 4 2 5 4", "90\n4 4 4 4 4 5 4 4 5 4 5 5 4 5 5 5 5 5 5 5 5 4 5 5 4 4 4 5 4 5 5 5 5 5 4 5 5 4 5 5 4 4 5 5 4 5 5 4 5 5 5 5 4 5 4 4 5 5 4 3 5 5 5 5 5 5 5 1 5 5 4 4 5 5 4 5 4 5 5 4 4 4 4 4 4 4 5 5 4 5", "100\n4 4 5 5 4 4 5 4 4 4 5 5 4 4 4 4 4 4 4 4 5 4 5 5 5 5 5 5 4 5 5 5 5 4 5 5 4 4 5 4 5 5 3 4 4 4 4 4 5 5 4 5 4 5 4 4 4 4 5 4 4 5 5 5 4 4 5 5 5 4 4 4 4 4 4 5 5 5 4 5 5 5 4 4 4 5 4 5 5 5 4 4 4 4 4 5 4 5 5 5", "110\n5 1 4 4 5 4 4 4 5 4 2 4 4 4 5 5 4 5 5 4 4 4 4 3 5 4 4 4 4 5 2 5 5 4 5 5 4 4 1 4 4 4 4 5 4 5 4 4 4 4 4 4 5 5 4 5 4 4 4 4 5 5 5 4 5 4 1 5 5 5 4 2 4 4 5 5 4 4 4 4 5 5 4 5 4 5 4 4 4 5 5 5 5 5 5 5 4 4 4 5 5 4 4 4 5 5 5 4 5 5", "120\n4 4 4 5 3 4 4 4 5 4 5 5 4 4 4 2 5 4 4 5 4 5 5 5 5 4 4 4 4 4 5 4 5 1 4 4 4 4 5 4 4 5 1 5 5 4 4 4 5 4 5 4 5 5 4 5 4 5 4 5 5 5 4 3 4 4 5 2 4 5 5 5 4 4 4 4 5 5 4 5 4 4 2 2 5 5 3 5 2 5 4 4 4 5 1 4 4 1 4 1 4 5 5 2 4 5 5 4 4 5 5 4 1 5 5 5 5 4 1 5", "130\n5 5 4 2 5 5 5 4 5 4 4 5 5 5 4 5 4 5 4 5 4 5 5 4 5 4 4 4 4 5 5 4 4 5 5 4 5 5 4 4 5 5 5 4 5 4 4 4 4 4 5 5 4 5 4 5 4 5 4 4 4 4 5 4 4 5 5 4 4 5 4 5 4 5 5 4 5 5 5 4 5 4 5 5 5 5 4 5 4 5 4 5 5 5 5 5 5 4 4 4 5 5 5 5 4 4 5 5 5 4 5 5 4 4 4 5 4 5 5 4 5 4 4 4 5 4 4 5 5 4", "140\n4 4 5 5 4 5 4 5 1 5 5 4 4 4 5 2 5 5 5 4 4 5 5 4 5 5 4 4 5 5 4 5 5 5 4 4 5 5 5 4 4 4 5 5 5 5 5 5 5 4 4 4 4 5 5 5 2 5 5 5 5 4 5 4 4 5 4 4 5 4 5 5 5 4 5 5 5 5 4 5 5 4 4 4 4 4 4 3 5 4 3 5 4 4 5 5 4 4 4 4 4 5 4 5 4 4 5 5 4 4 5 4 4 5 4 4 4 4 2 4 5 4 4 4 4 5 5 4 5 5 5 4 5 4 4 5 5 5 5 4", "150\n5 4 5 4 5 5 4 5 4 4 4 4 5 3 4 4 4 5 4 5 5 4 4 4 4 4 5 1 5 5 4 4 1 3 5 4 3 3 4 5 5 5 1 3 5 1 4 4 4 4 4 4 4 3 4 4 4 4 5 4 5 4 5 4 5 5 5 4 5 4 4 4 5 5 5 4 4 5 4 5 4 4 4 1 4 3 4 5 4 3 4 4 4 5 4 5 5 5 5 4 4 4 5 4 4 4 5 3 4 5 5 4 5 4 4 4 4 5 4 5 5 4 4 5 4 4 5 4 5 5 4 4 5 4 5 5 3 4 4 5 4 4 5 5 1 3 5 4 4 5", "160\n5 5 5 5 4 5 4 5 4 5 5 4 4 5 5 4 4 5 4 5 4 4 5 4 4 4 2 4 4 4 1 5 4 5 5 4 4 5 5 4 4 5 4 5 4 4 5 4 5 4 5 4 4 4 4 5 4 5 4 4 5 5 4 4 5 5 5 5 5 5 4 5 4 4 5 5 5 5 4 4 4 4 5 5 5 4 5 5 4 5 4 4 5 4 4 4 4 4 5 4 4 5 4 5 4 4 5 5 5 4 4 5 5 5 5 4 5 4 5 4 4 4 5 5 4 5 5 4 5 4 4 4 4 4 5 4 2 5 4 5 5 5 4 5 4 5 5 4 4 4 4 5 5 4 4 5 4 4 5 5", "170\n4 4 4 4 4 4 4 1 4 4 5 4 5 4 4 4 5 5 4 5 4 5 4 4 4 5 5 5 4 5 4 5 4 5 4 4 5 5 5 5 4 4 4 4 5 4 5 4 4 5 4 5 4 4 5 1 4 5 5 4 4 4 4 5 4 5 5 5 5 4 4 4 4 4 5 5 4 4 4 5 4 5 5 5 3 5 4 4 5 4 5 5 4 4 4 5 5 4 5 5 4 5 5 5 4 4 4 4 4 4 5 5 5 5 4 4 5 4 5 4 5 4 5 4 4 5 5 4 4 4 4 5 5 4 4 5 4 4 5 4 5 4 5 5 5 4 4 2 5 5 5 5 4 2 5 4 4 4 4 4 5 5 5 5 5 5 4 5 4 5", "180\n4 4 4 5 3 4 5 4 5 4 4 4 5 5 4 4 4 4 5 5 5 5 5 5 4 4 4 3 4 1 1 5 4 4 5 4 5 4 5 5 5 5 5 5 4 4 5 1 5 4 5 5 4 4 5 5 4 4 4 5 5 3 4 4 5 5 5 4 4 5 5 5 4 4 5 5 5 5 4 5 4 4 2 4 4 4 5 5 4 5 4 4 5 4 5 5 5 5 5 2 4 5 5 4 4 5 4 5 5 5 4 1 4 5 5 4 4 5 4 5 4 1 3 4 4 4 4 5 5 4 5 4 5 5 5 4 4 4 4 4 1 4 5 5 4 5 5 5 3 5 4 4 2 4 5 4 5 4 5 4 4 5 5 4 4 4 5 4 5 4 4 4 4 4 1 1 4 4 5 4", "190\n4 4 4 4 5 4 4 4 5 5 4 5 5 5 4 4 5 5 5 5 4 5 5 5 5 5 4 4 4 5 4 5 5 5 5 4 5 4 4 4 5 5 5 5 5 4 5 4 4 4 5 5 4 5 5 4 5 5 5 5 5 4 5 4 4 4 5 5 5 4 4 4 4 4 4 4 4 5 4 5 5 4 4 5 4 5 5 4 5 4 5 4 3 5 4 5 4 4 5 5 4 4 4 4 4 4 4 5 5 4 5 4 5 5 4 4 4 5 5 4 4 4 1 4 5 4 5 4 5 5 4 5 4 5 4 4 4 5 5 5 4 5 4 5 4 4 5 4 5 5 5 4 4 4 4 5 4 5 4 5 4 5 4 4 4 5 4 5 5 5 5 4 4 4 5 4 5 4 5 4 5 5 5 4 4 5 5 4 3 4", "200\n4 4 4 4 4 5 4 5 5 4 4 4 4 5 4 4 5 4 4 5 4 4 4 4 4 5 4 4 5 5 5 5 4 4 5 5 4 4 5 5 5 4 4 4 4 5 4 4 4 5 5 4 4 5 5 4 5 5 4 4 5 5 5 4 5 5 4 4 5 5 5 4 5 5 4 4 5 4 5 5 5 4 4 5 5 4 5 5 5 5 4 4 5 5 5 4 5 4 5 5 1 4 4 5 4 5 5 4 5 4 5 5 5 5 4 4 4 4 4 5 4 4 4 4 5 5 4 5 4 5 5 4 5 4 5 5 4 5 5 4 5 4 5 5 4 5 5 5 5 5 5 4 4 4 4 4 5 4 4 5 5 5 4 5 4 5 5 4 3 5 5 4 5 4 4 4 4 4 4 4 4 4 5 4 4 4 4 4 5 4 4 4 5 4 5 4 5 4 4 4", "210\n4 5 5 5 5 5 5 4 4 5 5 4 4 5 5 5 5 5 4 5 5 5 5 4 5 5 5 5 4 4 4 5 5 4 4 5 5 4 5 4 5 4 1 4 5 4 5 4 5 1 4 5 5 4 4 5 4 5 4 5 5 5 5 5 4 4 4 5 5 5 4 5 4 4 4 4 5 4 4 5 5 4 4 4 4 5 4 4 4 4 2 4 4 4 5 5 5 4 5 4 4 5 5 5 4 5 4 4 5 5 4 5 4 4 5 5 5 5 4 4 4 5 5 5 5 1 4 4 5 4 5 4 5 4 4 4 5 5 4 5 4 5 4 4 5 4 5 4 5 5 4 4 5 5 4 4 5 4 4 5 4 4 5 5 5 4 5 5 5 5 4 4 4 4 5 5 5 5 5 5 5 4 4 5 4 5 5 4 4 5 4 4 4 4 5 4 4 5 4 5 4 5 5 5 4 4 5 4 5 5", "220\n4 5 4 4 4 5 5 4 4 5 5 4 5 4 4 4 5 5 5 5 4 4 3 4 4 4 5 4 3 4 5 4 5 4 4 5 4 4 4 4 4 4 4 4 4 5 5 4 1 5 5 4 4 4 5 1 3 4 5 4 1 5 5 1 4 4 5 4 5 5 4 5 4 4 4 4 5 4 2 4 4 5 2 3 5 4 4 4 1 4 3 4 5 4 5 5 5 5 1 5 3 2 5 4 5 4 5 5 4 5 4 4 5 5 4 4 5 5 4 4 5 4 4 4 5 4 4 5 4 4 4 5 5 2 4 5 5 2 5 4 5 2 4 3 4 4 4 4 4 4 4 4 3 5 4 5 4 4 4 5 1 5 4 4 4 2 4 4 4 4 4 5 5 5 1 4 4 4 4 5 5 4 4 4 4 5 3 4 5 4 5 5 4 3 5 4 4 4 4 5 4 5 4 2 4 4 4 5 4 5 5 4 2 4 2 2 5 5 5 2", "230\n4 4 5 5 5 5 5 4 4 4 5 5 5 4 5 4 4 4 5 5 4 5 4 4 5 4 5 4 5 4 4 4 5 4 5 5 5 4 4 4 4 4 4 4 4 4 5 4 5 5 5 5 4 4 5 4 5 5 5 5 5 4 4 4 4 5 5 4 4 5 5 5 4 4 4 5 4 4 4 5 4 4 5 5 5 5 4 4 5 5 4 4 4 4 4 5 5 5 2 4 4 4 5 5 1 5 5 4 5 4 4 4 5 4 5 5 5 4 4 5 5 4 5 5 4 4 4 4 4 4 4 4 5 5 4 5 4 5 4 5 5 4 4 4 4 5 4 4 4 4 5 5 5 4 4 4 5 4 5 4 5 5 4 4 4 5 5 4 4 4 5 5 5 4 4 5 5 5 4 4 4 5 4 5 5 4 5 4 5 5 5 5 4 5 4 4 4 4 5 4 4 4 4 4 4 4 5 4 4 4 4 3 5 4 4 4 4 5 5 5 4 5 5 4 5 4 5 4 5 5", "240\n5 5 4 4 5 4 5 4 5 5 5 4 5 4 4 5 4 5 5 4 5 4 1 4 4 5 4 4 5 4 1 4 4 4 5 4 5 4 5 5 5 4 4 5 4 5 5 5 4 4 4 5 5 4 4 4 5 5 5 5 5 4 4 4 4 4 4 4 4 5 5 4 5 4 4 4 4 4 4 5 4 5 5 4 4 4 5 4 4 5 5 5 4 4 4 5 4 4 4 4 5 4 4 5 4 5 5 5 4 5 4 5 4 4 4 5 1 4 4 4 4 4 5 5 4 5 4 5 5 4 4 5 5 4 4 4 5 4 4 5 5 4 5 5 5 4 5 5 5 5 5 4 4 5 5 5 4 4 4 5 5 5 5 4 4 4 4 4 4 5 5 5 5 3 4 5 4 4 4 4 4 5 5 5 4 5 5 4 5 5 4 4 4 5 4 5 5 4 4 5 5 5 4 5 5 4 5 5 5 5 4 4 5 5 4 5 4 5 3 4 5 5 4 4 4 5 4 5 5 4 4 4 5 5 4 4 4 4 4 5", "250\n4 4 2 5 1 5 5 4 5 4 4 4 4 4 4 5 5 4 4 5 4 5 1 5 5 4 1 5 5 4 5 5 4 4 4 4 5 4 4 5 5 5 5 5 4 5 4 5 5 4 5 4 4 4 4 4 4 5 5 4 5 5 1 4 4 4 5 1 5 3 4 5 4 4 4 4 4 5 5 4 4 4 4 4 5 4 5 5 5 4 4 5 4 4 4 5 5 5 5 4 5 4 5 4 5 5 5 5 4 4 4 4 5 5 5 5 5 5 4 4 3 4 4 5 5 3 5 4 4 4 4 4 4 5 5 5 4 5 4 4 4 2 4 5 5 5 5 5 5 5 4 5 5 4 5 3 5 4 4 5 5 5 5 4 3 5 5 1 5 5 5 5 4 4 5 4 4 4 4 5 4 5 4 4 4 5 5 3 4 5 5 4 4 4 5 4 4 4 4 4 4 4 5 5 4 4 5 4 5 4 4 5 4 4 5 5 5 4 5 4 1 4 4 5 4 4 4 4 5 2 4 4 5 5 5 4 5 4 5 5 5 4 4 4 4 4 4 1 5 5", "7\n4 5 3 4 5 4 1", "9\n4 5 4 3 3 3 4 4 4", "10\n4 5 4 5 4 5 4 5 3 4", "10\n4 3 4 5 4 5 4 5 4 3", "6\n4 5 3 4 5 4", "6\n3 3 3 4 5 5", "11\n5 5 5 5 5 5 5 5 5 5 5", "18\n4 5 4 3 3 3 2 2 2 4 4 4 1 1 1 4 5 4", "8\n4 4 4 4 5 5 5 5", "9\n5 5 5 4 4 4 3 4 4"], "outputs": ["2", "3", "1", "0", "0", "3", "5", "10", "11", "11", "19", "21", "23", "28", "33", "32", "27", "43", "43", "39", "51", "52", "50", "60", "65", "68", "55", "74", "76", "69", "1", "2", "2", "2", "1", "1", "3", "3", "2", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	22	codeforces
f26fc951cce2e4c8216142310433c9ea	Coder	Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (x,<=y), he can move to (or attack) positions (x<=+<=1,<=y), (x–1,<=y), (x,<=y<=+<=1) and (x,<=y–1). Iahub wants to know how many Coders can be placed on an n<=×<=n chessboard, so that no Coder attacks any other Coder. The first line contains an integer n (1<=≤<=n<=≤<=1000). On the first line print an integer, the maximum number of Coders that can be placed on the chessboard. On each of the next n lines print n characters, describing the configuration of the Coders. For an empty cell print an '.', and for a Coder print a 'C'. If there are multiple correct answers, you can print any. Sample Input 2 Sample Output 2 C. .C	{"inputs": ["2", "3", "4", "10", "15", "100", "101", "500", "501", "755", "888", "998", "999", "1000", "1"], "outputs": ["2\nC.\n.C", "5\nC.C\n.C.\nC.C", "8\nC.C.\n.C.C\nC.C.\n.C.C", "50\nC.C.C.C.C.\n.C.C.C.C.C\nC.C.C.C.C.\n.C.C.C.C.C\nC.C.C.C.C.\n.C.C.C.C.C\nC.C.C.C.C.\n.C.C.C.C.C\nC.C.C.C.C.\n.C.C.C.C.C", "113\nC.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C", "5000\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.\n.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.\n.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C...", "5101\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C\n.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C...", "125000\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.\n....", "125501\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C\n...", "285013\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C...", "394272\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C...", "498002\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C...", "499001\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C...", "500000\nC.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C.C...", "1\nC"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	297	codeforces
f28494b1bb4a51fe0632070103000036	Restoring Numbers	Vasya had two arrays consisting of non-negative integers: a of size n and b of size m. Vasya chose a positive integer k and created an n<=×<=m matrix v using the following formula: Vasya wrote down matrix v on a piece of paper and put it in the table. A year later Vasya was cleaning his table when he found a piece of paper containing an n<=×<=m matrix w. He remembered making a matrix one day by the rules given above but he was not sure if he had found the paper with the matrix v from those days. Your task is to find out if the matrix w that you've found could have been obtained by following these rules and if it could, then for what numbers k,<=a1,<=a2,<=...,<=an,<=b1,<=b2,<=...,<=bm it is possible. The first line contains integers n and m (1<=≤<=n,<=m<=≤<=100), separated by a space — the number of rows and columns in the found matrix, respectively. The i-th of the following lines contains numbers wi,<=1,<=wi,<=2,<=...,<=wi,<=m (0<=≤<=wi,<=j<=≤<=109), separated by spaces — the elements of the i-th row of matrix w. If the matrix w could not have been obtained in the manner described above, print "NO" (without quotes) in the single line of output. Otherwise, print four lines. In the first line print "YES" (without quotes). In the second line print an integer k (1<=≤<=k<=≤<=1018). Note that each element of table w should be in range between 0 and k<=-<=1 inclusively. In the third line print n integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=1018), separated by spaces. In the fourth line print m integers b1,<=b2,<=...,<=bm (0<=≤<=bi<=≤<=1018), separated by spaces. Sample Input 2 3 1 2 3 2 3 4 2 2 1 2 2 0 2 2 1 2 2 1 Sample Output YES 1000000007 0 1 1 2 3 YES 3 0 1 1 2 NO	{"inputs": ["2 3\n1 2 3\n2 3 4", "2 2\n1 2\n2 0", "2 2\n1 2\n2 1", "2 2\n2 3\n1 2", "2 2\n2 0\n1 2", "2 2\n2 1\n0 2", "2 2\n0 2\n2 1", "2 3\n1 3 3\n3 0 1", "3 2\n1 3\n3 0\n3 1", "2 3\n3 0 1\n1 3 3", "3 2\n3 0\n3 1\n1 3", "3 2\n3 1\n3 0\n1 3", "3 2\n3 0\n1 3\n3 1", "2 2\n0 1000000000\n1000000000 0", "2 2\n0 1000000000\n1000000000 57", "5 5\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0", "5 5\n65 65 63 66 63\n86 86 84 87 84\n92 92 90 93 90\n75 75 73 76 73\n67 67 65 68 65", "5 5\n260683318 260683321 260683319 260683318 260683319\n207210837 207210840 207210838 207210837 207210838\n83257083 83257086 83257084 83257083 83257084\n142444898 142444901 142444899 142444898 142444899\n129630806 129630809 129630807 129630806 129630807", "1 1\n3", "3 5\n0 0 0 0 0\n0 0 0 0 0\n0 0 0 0 0", "4 1\n42\n23\n77\n19"], "outputs": ["YES\n1000000007\n0 1 \n1 2 3 ", "YES\n3\n0 1 \n1 2 ", "NO", "YES\n1000000007\n0 1000000006 \n2 3 ", "YES\n3\n0 2 \n2 0 ", "YES\n3\n0 1 \n2 1 ", "YES\n3\n0 2 \n0 2 ", "NO", "NO", "NO", "NO", "NO", "NO", "YES\n2000000000\n0 1000000000 \n0 1000000000 ", "YES\n1999999943\n0 1000000000 \n0 1000000000 ", "YES\n1000000007\n0 0 0 0 0 \n0 0 0 0 0 ", "YES\n1000000007\n0 21 27 10 2 \n65 65 63 66 63 ", "YES\n1000000007\n0 946527526 822573772 881761587 868947495 \n260683318 260683321 260683319 260683318 260683319 ", "YES\n1000000007\n0 \n3 ", "YES\n1000000007\n0 0 0 \n0 0 0 0 0 ", "YES\n1000000007\n0 999999988 35 999999984 \n42 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
f2b5de567aac6e94f6ed4a324fabb0a8	Cup Trick	The employees of the F company have lots of ways to entertain themselves. Today they invited a famous magician who shows a trick with plastic cups and a marble. The point is to trick the spectator's attention. Initially, the spectator stands in front of a line of n plastic cups. Then the magician places a small marble under one cup and shuffles the cups. Then the spectator should guess which cup hides the marble. But the head coder of the F company isn't easy to trick. When he saw the performance, he noticed several important facts: - each cup contains a mark — a number from 1 to n; all marks on the cups are distinct; - the magician shuffles the cups in m operations, each operation looks like that: take a cup marked xi, sitting at position yi in the row of cups (the positions are numbered from left to right, starting from 1) and shift it to the very beginning of the cup row (on the first position). When the head coder came home after work he wanted to re-do the trick. Unfortunately, he didn't remember the starting or the final position of the cups. He only remembered which operations the magician performed. Help the coder: given the operations in the order they were made find at least one initial permutation of the cups that can go through the described operations in the given order. Otherwise, state that such permutation doesn't exist. The first line contains integers n and m (1<=≤<=n,<=m<=≤<=106). Each of the next m lines contains a couple of integers. The i-th line contains integers xi, yi (1<=≤<=xi,<=yi<=≤<=n) — the description of the i-th operation of the magician. Note that the operations are given in the order in which the magician made them and the coder wants to make them in the same order. If the described permutation doesn't exist (the programmer remembered wrong operations), print -1. Otherwise, print n distinct integers, each from 1 to n: the i-th number should represent the mark on the cup that initially is in the row in position i. If there are multiple correct answers, you should print the lexicographically minimum one. Sample Input 2 1 2 1 3 2 1 2 1 1 3 3 1 3 2 3 1 3 Sample Output 2 1 2 1 3 -1	{"inputs": ["2 1\n2 1", "3 2\n1 2\n1 1", "3 3\n1 3\n2 3\n1 3", "3 2\n1 1\n3 2", "5 2\n3 3\n3 1", "5 3\n3 1\n4 3\n5 4", "7 3\n4 4\n5 4\n2 4", "10 3\n7 10\n8 7\n5 5", "100 50\n11 28\n11 1\n98 58\n38 27\n24 27\n67 37\n90 48\n91 14\n43 29\n3 64\n24 6\n53 19\n97 65\n13 27\n75 53\n37 82\n69 75\n94 99\n1 26\n95 60\n45 27\n100 82\n71 49\n86 99\n74 58\n88 68\n39 63\n38 23\n22 39\n29 58\n62 83\n62 1\n61 58\n2 30\n41 48\n83 90\n1 17\n73 81\n23 53\n71 16\n43 29\n27 78\n54 48\n6 89\n75 27\n16 93\n81 81\n97 31\n53 32\n15 96", "1 1\n1 1", "2 1\n1 1", "2 1\n1 2", "2 1\n2 1", "2 1\n2 2", "2 2\n1 1\n2 1", "2 2\n1 2\n2 2", "1000000 1\n458596 373648", "5 3\n2 4\n3 5\n5 2", "10 10\n9 1\n6 7\n4 2\n8 7\n3 1\n10 10\n3 5\n6 7\n10 1\n6 6"], "outputs": ["2 1 ", "2 1 3 ", "-1", "1 3 2 ", "1 2 3 4 5 ", "3 1 4 5 2 ", "1 2 5 4 3 6 7 ", "1 2 5 3 4 8 6 9 10 7 ", "2 4 5 7 8 9 10 91 12 45 53 1 14 17 18 19 20 13 22 54 21 25 43 24 38 26 28 11 41 30 31 23 32 33 34 67 35 36 71 40 42 61 44 29 46 47 90 74 48 75 49 50 39 95 51 52 55 98 56 57 88 58 59 3 97 60 63 64 65 27 81 66 68 69 73 70 72 76 62 100 77 37 78 79 80 6 82 83 84 85 16 87 89 15 92 93 96 86 94 99 ", "1 ", "1 2 ", "2 1 ", "2 1 ", "1 2 ", "-1", "2 1 ", "1 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 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155...", "-1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
f2bde5c509c9733a406a6e0eff989a26	Mr. Kitayuta's Colorful Graph	Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting vertex ai and bi. Mr. Kitayuta wants you to process the following q queries. In the i-th query, he gives you two integers — ui and vi. Find the number of the colors that satisfy the following condition: the edges of that color connect vertex ui and vertex vi directly or indirectly. The first line of the input contains space-separated two integers — n and m (2<=≤<=n<=≤<=100,<=1<=≤<=m<=≤<=100), denoting the number of the vertices and the number of the edges, respectively. The next m lines contain space-separated three integers — ai, bi (1<=≤<=ai<=<<=bi<=≤<=n) and ci (1<=≤<=ci<=≤<=m). Note that there can be multiple edges between two vertices. However, there are no multiple edges of the same color between two vertices, that is, if i<=≠<=j, (ai,<=bi,<=ci)<=≠<=(aj,<=bj,<=cj). The next line contains a integer — q (1<=≤<=q<=≤<=100), denoting the number of the queries. Then follows q lines, containing space-separated two integers — ui and vi (1<=≤<=ui,<=vi<=≤<=n). It is guaranteed that ui<=≠<=vi. For each query, print the answer in a separate line. Sample Input 4 5 1 2 1 1 2 2 2 3 1 2 3 3 2 4 3 3 1 2 3 4 1 4 5 7 1 5 1 2 5 1 3 5 1 4 5 1 1 2 2 2 3 2 3 4 2 5 1 5 5 1 2 5 1 5 1 4 Sample Output 2 1 0 1 1 1 1 2	{"inputs": ["4 5\n1 2 1\n1 2 2\n2 3 1\n2 3 3\n2 4 3\n3\n1 2\n3 4\n1 4", "5 7\n1 5 1\n2 5 1\n3 5 1\n4 5 1\n1 2 2\n2 3 2\n3 4 2\n5\n1 5\n5 1\n2 5\n1 5\n1 4", "2 1\n1 2 1\n1\n1 2", "2 3\n1 2 3\n1 2 2\n1 2 1\n1\n1 2", "2 5\n1 2 1\n1 2 2\n1 2 3\n1 2 4\n1 2 5\n1\n1 2"], "outputs": ["2\n1\n0", "1\n1\n1\n1\n2", "1", "3", "5"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	125	codeforces
f2d46ff61caf83aa5c9d524ad3d861b9	Terse princess	«Next please», — the princess called and cast an estimating glance at the next groom. The princess intends to choose the most worthy groom, this is, the richest one. Whenever she sees a groom who is more rich than each of the previous ones, she says a measured «Oh...». Whenever the groom is richer than all previous ones added together, she exclaims «Wow!» (no «Oh...» in this case). At the sight of the first groom the princess stays calm and says nothing. The fortune of each groom is described with an integer between 1 and 50000. You know that during the day the princess saw n grooms, said «Oh...» exactly a times and exclaimed «Wow!» exactly b times. Your task is to output a sequence of n integers t1,<=t2,<=...,<=tn, where ti describes the fortune of i-th groom. If several sequences are possible, output any of them. If no sequence exists that would satisfy all the requirements, output a single number -1. The only line of input data contains three integer numbers n,<=a and b (1<=≤<=n<=≤<=100,<=0<=≤<=a,<=b<=≤<=15,<=n<=><=a<=+<=b), separated with single spaces. Output any sequence of integers t1,<=t2,<=...,<=tn, where ti (1<=≤<=ti<=≤<=50000) is the fortune of i-th groom, that satisfies the given constraints. If no sequence exists that would satisfy all the requirements, output a single number -1. Sample Input 10 2 3 5 0 0 Sample Output 5 1 3 6 16 35 46 4 200 9910 10 6 6 5	{"inputs": ["10 2 3", "5 0 0", "5 2 2", "6 2 2", "10 9 0", "1 0 0", "10 0 9", "42 10 13", "7 3 3", "12 0 0", "19 1 0", "17 2 3", "7 3 1", "19 3 1", "10 4 4", "11 5 4", "8 0 2", "19 5 1", "100 9 0", "2 0 1", "2 1 0", "3 0 2", "3 1 1", "3 2 0", "4 0 0", "4 0 1", "4 0 2", "4 0 3", "4 1 0", "4 2 0", "4 3 0", "4 1 1", "4 1 2", "4 2 1", "100 0 0", "100 0 1", "100 1 0", "100 1 1", "100 2 0", "100 0 2", "16 0 15", "16 15 0", "100 0 15", "100 15 0", "100 11 13", "100 15 15", "100 14 15", "100 15 14", "9 4 4", "100 2 15", "3 1 0", "7 4 0", "5 2 0", "2 0 0", "5 1 0", "10 2 0", "10 7 0", "5 3 0", "10 1 0", "10 5 0", "100 3 0", "100 5 12", "15 10 0"], "outputs": ["1 2 4 8 9 10 10 10 10 10 ", "1 1 1 1 1 ", "1 2 4 5 6 ", "1 2 4 5 6 6 ", "-1", "1 ", "1 2 4 8 16 32 64 128 256 512 ", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 8193 8194 8195 8196 8197 8198 8199 8200 8201 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 8202 ", "1 2 4 8 9 10 11 ", "1 1 1 1 1 1 1 1 1 1 1 1 ", "1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ", "1 2 4 8 9 10 10 10 10 10 10 10 10 10 10 10 10 ", "1 2 3 4 5 5 5 ", "1 2 3 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 ", "1 2 4 8 16 17 18 19 20 20 ", "1 2 4 8 16 17 18 19 20 21 21 ", "1 2 4 4 4 4 4 4 ", "1 2 3 4 5 6 7 7 7 7 7 7 7 7 7 7 7 7 7 ", "1 1 2 3 4 5 6 7 8 9 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 ", "1 2 ", "-1", "1 2 4 ", "1 2 3 ", "-1", "1 1 1 1 ", "1 2 2 2 ", "1 2 4 4 ", "1 2 4 8 ", "1 1 2 2 ", "1 1 2 3 ", "-1", "1 2 3 3 ", "1 2 4 5 ", "1 2 3 4 ", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ", "1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 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 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 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 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ", "1 1 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ", "1 2 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 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 ", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 ", "-1", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 32768 ...", "1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 16 ", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 8193 8194 8195 8196 8197 8198 8199 8200 8201 8202 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 8203 ", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 32769 32770 32771 32772 32773 32774 32775 32776 32777 32778 32779 32780 32781 32782 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 32783 ...", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 32769 32770 32771 32772 32773 32774 32775 32776 32777 32778 32779 32780 32781 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 32782 ...", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 16385 16386 16387 16388 16389 16390 16391 16392 16393 16394 16395 16396 16397 16398 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 16399 ...", "1 2 4 8 16 17 18 19 20 ", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 32769 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 32770 ...", "1 1 2 ", "1 1 2 3 4 5 5 ", "1 1 2 3 3 ", "1 1 ", "1 1 2 2 2 ", "1 1 2 3 3 3 3 3 3 3 ", "1 1 2 3 4 5 6 7 8 8 ", "1 1 2 3 4 ", "1 1 2 2 2 2 2 2 2 2 ", "1 1 2 3 4 5 6 6 6 6 ", "1 1 2 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 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 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 ", "1 2 4 8 16 32 64 128 256 512 1024 2048 4096 4097 4098 4099 4100 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 4101 ", "1 1 2 3 4 5 6 7 8 9 10 11 11 11 11 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
f2de2e39564f4a23db850d2627d473bd	Friends and Subsequences	Mike and !Mike are old childhood rivals, they are opposite in everything they do, except programming. Today they have a problem they cannot solve on their own, but together (with you) — who knows? Every one of them has an integer sequences a and b of length n. Being given a query of the form of pair of integers (l,<=r), Mike can instantly tell the value of while !Mike can instantly tell the value of . Now suppose a robot (you!) asks them all possible different queries of pairs of integers (l,<=r) (1<=≤<=l<=≤<=r<=≤<=n) (so he will make exactly n(n<=+<=1)<=/<=2 queries) and counts how many times their answers coincide, thus for how many pairs is satisfied. How many occasions will the robot count? The first line contains only integer n (1<=≤<=n<=≤<=200<=000). The second line contains n integer numbers a1,<=a2,<=...,<=an (<=-<=109<=≤<=ai<=≤<=109) — the sequence a. The third line contains n integer numbers b1,<=b2,<=...,<=bn (<=-<=109<=≤<=bi<=≤<=109) — the sequence b. Print the only integer number — the number of occasions the robot will count, thus for how many pairs is satisfied. Sample Input 6 1 2 3 2 1 4 6 7 1 2 3 2 3 3 3 3 1 1 1 Sample Output 2 0	{"inputs": ["6\n1 2 3 2 1 4\n6 7 1 2 3 2", "3\n3 3 3\n1 1 1", "17\n714413739 -959271262 714413739 -745891378 926207665 -404845105 -404845105 -959271262 -189641729 -670860364 714413739 -189641729 192457837 -745891378 -670860364 536388097 -959271262\n-417715348 -959271262 -959271262 714413739 -189641729 571055593 571055593 571055593 -417715348 -417715348 192457837 -745891378 536388097 571055593 -189641729 571055593 -670860364", "1\n509658558\n509658558", "1\n509658558\n-544591380", "3\n1 1 1\n2 2 2"], "outputs": ["2", "0", "1", "1", "0", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
f2f920d63727a5da8738e73b9c49da84	Psychos in a Line	There are n psychos standing in a line. Each psycho is assigned a unique integer from 1 to n. At each step every psycho who has an id greater than the psycho to his right (if exists) kills his right neighbor in the line. Note that a psycho might kill and get killed at the same step. You're given the initial arrangement of the psychos in the line. Calculate how many steps are needed to the moment of time such, that nobody kills his neighbor after that moment. Look notes to understand the statement more precise. The first line of input contains integer n denoting the number of psychos, (1<=≤<=n<=≤<=105). In the second line there will be a list of n space separated distinct integers each in range 1 to n, inclusive — ids of the psychos in the line from left to right. Print the number of steps, so that the line remains the same afterward. Sample Input 10 10 9 7 8 6 5 3 4 2 1 6 1 2 3 4 5 6 Sample Output 2 0	{"inputs": ["10\n10 9 7 8 6 5 3 4 2 1", "6\n1 2 3 4 5 6", "6\n6 5 4 3 2 1", "10\n10 7 4 2 5 8 9 6 3 1", "15\n15 9 5 10 7 11 14 6 2 3 12 1 8 13 4", "100\n61 96 25 10 50 71 38 77 76 75 59 100 89 66 6 99 2 13 3 23 91 93 22 92 4 86 90 44 39 31 9 47 28 95 18 54 1 73 94 78 60 20 42 84 97 83 16 81 67 64 74 46 82 5 88 80 14 48 53 79 30 11 62 21 41 70 63 58 51 56 57 17 87 72 27 85 68 49 52 8 12 98 43 37 35 69 55 32 26 40 29 65 19 24 34 33 15 45 36 7", "1\n1", "2\n1 2", "2\n2 1"], "outputs": ["2", "0", "1", "4", "4", "8", "0", "0", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	10	codeforces
f30a23a3a1dd6e38a255a088067f20fc	Chess Placing	You are given a chessboard of size 1<=×<=n. It is guaranteed that n is even. The chessboard is painted like this: "BWBW...BW". Some cells of the board are occupied by the chess pieces. Each cell contains no more than one chess piece. It is known that the total number of pieces equals to . In one step you can move one of the pieces one cell to the left or to the right. You cannot move pieces beyond the borders of the board. You also cannot move pieces to the cells that are already occupied. Your task is to place all the pieces in the cells of the same color using the minimum number of moves (all the pieces must occupy only the black cells or only the white cells after all the moves are made). The first line of the input contains one integer n (2<=≤<=n<=≤<=100, n is even) — the size of the chessboard. The second line of the input contains integer numbers (1<=≤<=pi<=≤<=n) — initial positions of the pieces. It is guaranteed that all the positions are distinct. Print one integer — the minimum number of moves you have to make to place all the pieces in the cells of the same color. Sample Input 6 1 2 6 10 1 2 3 4 5 Sample Output 2 10	{"inputs": ["6\n1 2 6", "10\n1 2 3 4 5", "2\n2", "100\n2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 72 74 76 78 80 82 84 86 88 90 92 94 96 98 100", "100\n93 54 57 61 68 66 70 96 64 82 80 75 69 77 76 94 67 86 90 73 74 58 100 83 92 89 56 99 88 59 95 72 81 51 85 71 97 60 91 63 65 98 79 84 53 62 87 55 52 78", "100\n41 13 29 11 25 15 6 23 28 50 48 17 3 9 44 24 5 19 34 22 33 32 20 16 35 37 4 10 46 2 39 40 47 49 36 42 1 30 43 21 14 7 18 45 31 8 12 26 27 38", "96\n12 58 70 19 65 61 41 46 15 92 64 72 9 26 53 37 2 3 1 40 10 8 94 66 50 34 36 96 47 78 7 57 5 6 17 69 28 88 89 49 55 81 35 22 25 79 86 59", "10\n5 6 7 8 9", "20\n1 2 3 4 5 6 7 8 9 10", "10\n6 7 8 9 10", "10\n9 8 7 6 5", "6\n1 5 6", "12\n1 7 8 9 10 12", "6\n1 4 5", "24\n10 21 15 3 11 4 18 24 16 22 14 9", "20\n3 4 6 7 8 10 11 13 14 17", "10\n10 9 8 1 5", "100\n84 10 26 79 58 93 67 85 7 2 99 4 47 45 75 22 32 82 65 53 63 49 42 52 12 69 86 46 25 76 40 15 13 78 8 81 62 28 60 21 27 80 98 56 3 36 54 16 50 43", "10\n1 7 8 9 10", "10\n1 4 6 8 10", "80\n41 70 18 53 32 79 51 49 21 27 47 65 50 15 62 60 5 40 14 25 64 9 19 58 38 76 66 52 17 34 13 2 80 43 3 42 33 36 6 72", "50\n27 42 41 4 10 45 44 26 49 50 17 28 2 36 18 39 23 12 21 24 19 29 22 40 37", "10\n2 3 4 5 6", "6\n3 5 6", "100\n9 63 62 88 3 67 54 33 79 51 71 80 37 46 43 57 69 17 34 6 18 40 59 83 76 86 8 55 90 89 45 42 28 98 30 38 77 91 73 58 23 61 41 65 64 93 14 44 16 24", "10\n1 6 7 8 9", "6\n3 4 5"], "outputs": ["2", "10", "0", "0", "1225", "1225", "152", "7", "45", "10", "7", "2", "7", "1", "11", "15", "5", "104", "7", "1", "47", "59", "7", "2", "160", "5", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	94	codeforces
f33131958c663e5a2ee1b0463cbe2016	Bus	A bus moves along the coordinate line Ox from the point x<==<=0 to the point x<==<=a. After starting from the point x<==<=0, it reaches the point x<==<=a, immediately turns back and then moves to the point x<==<=0. After returning to the point x<==<=0 it immediately goes back to the point x<==<=a and so on. Thus, the bus moves from x<==<=0 to x<==<=a and back. Moving from the point x<==<=0 to x<==<=a or from the point x<==<=a to x<==<=0 is called a bus journey. In total, the bus must make k journeys. The petrol tank of the bus can hold b liters of gasoline. To pass a single unit of distance the bus needs to spend exactly one liter of gasoline. The bus starts its first journey with a full petrol tank. There is a gas station in point x<==<=f. This point is between points x<==<=0 and x<==<=a. There are no other gas stations on the bus route. While passing by a gas station in either direction the bus can stop and completely refuel its tank. Thus, after stopping to refuel the tank will contain b liters of gasoline. What is the minimum number of times the bus needs to refuel at the point x<==<=f to make k journeys? The first journey starts in the point x<==<=0. The first line contains four integers a, b, f, k (0<=<<=f<=<<=a<=≤<=106, 1<=≤<=b<=≤<=109, 1<=≤<=k<=≤<=104) — the endpoint of the first bus journey, the capacity of the fuel tank of the bus, the point where the gas station is located, and the required number of journeys. Print the minimum number of times the bus needs to refuel to make k journeys. If it is impossible for the bus to make k journeys, print -1. Sample Input 6 9 2 4 6 10 2 4 6 5 4 3 Sample Output 4 2 -1	{"inputs": ["6 9 2 4", "6 10 2 4", "6 5 4 3", "2 2 1 1", "10 4 6 10", "3 1 1 1", "2 1 1 1", "1000000 51923215 2302 10000", "10 11 3 2", "20 50 10 25", "10 10 5 20", "15 65 5 50", "10 19 1 5", "10 19 9 5", "23 46 12 2", "23 46 12 3", "20 20 19 1", "20 23 17 2", "100 70 50 1", "100 70 70 2", "140 480 139 40", "1000000 1000000000 1 1000", "100000 1000000 50000 1000", "1000000 1000000 500000 1000", "1000000 1000000 500000 10000", "1000000 2500000 500000 9999", "1000000 1500000 500000 9999", "1000000 1500000 500000 10000", "1000000 1 1 1", "2 1000000000 1 1", "1000000 1000000000 1 1", "1000000 1 999999 1", "1000000 1000000000 999999 1", "2 1 1 10000", "1000000 1 1 10000", "1000000 1000000000 1 10000", "1000000 1 999999 10000", "2 1000000000 1 10000", "1000000 1000000000 999999 10000", "10000 78393 3000 9999", "1000000 8839233 302200 9999", "900005 3333333 210000 9999", "6 7 4 2", "3 1 2 1", "150 100 1 1", "10 5 6 1", "51 81 36 38", "100 159 80 2"], "outputs": ["4", "2", "-1", "0", "-1", "-1", "1", "199", "-1", "11", "20", "12", "3", "3", "0", "1", "0", "1", "1", "2", "18", "0", "100", "1000", "10000", "4998", "9997", "9998", "-1", "0", "0", "-1", "0", "-1", "-1", "10", "-1", "0", "10", "1428", "1249", "3332", "2", "-1", "-1", "-1", "36", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	31	codeforces
f353ac7a2ae46c10fac90cbe25b2a7fb	Second price auction	Nowadays, most of the internet advertisements are not statically linked to a web page. Instead, what will be shown to the person opening a web page is determined within 100 milliseconds after the web page is opened. Usually, multiple companies compete for each ad slot on the web page in an auction. Each of them receives a request with details about the user, web page and ad slot and they have to respond within those 100 milliseconds with a bid they would pay for putting an advertisement on that ad slot. The company that suggests the highest bid wins the auction and gets to place its advertisement. If there are several companies tied for the highest bid, the winner gets picked at random. However, the company that won the auction does not have to pay the exact amount of its bid. In most of the cases, a second-price auction is used. This means that the amount paid by the company is equal to the maximum of all the other bids placed for this ad slot. Let's consider one such bidding. There are n companies competing for placing an ad. The i-th of these companies will bid an integer number of microdollars equiprobably randomly chosen from the range between Li and Ri, inclusive. In the other words, the value of the i-th company bid can be any integer from the range [Li,<=Ri] with the same probability. Determine the expected value that the winner will have to pay in a second-price auction. The first line of input contains an integer number n (2<=≤<=n<=≤<=5). n lines follow, the i-th of them containing two numbers Li and Ri (1<=≤<=Li<=≤<=Ri<=≤<=10000) describing the i-th company's bid preferences. This problem doesn't have subproblems. You will get 8 points for the correct submission. Output the answer with absolute or relative error no more than 1e<=-<=9. Sample Input 3 4 7 8 10 5 5 3 2 5 3 4 1 6 Sample Output 5.7500000000 3.5000000000	{"inputs": ["3\n4 7\n8 10\n5 5", "3\n2 5\n3 4\n1 6", "5\n1 10000\n1 10000\n1 10000\n1 10000\n1 10000", "2\n1 2\n1 2", "2\n1 3\n1 3", "5\n1 7\n2 5\n3 9\n4 8\n5 6", "5\n17 9999\n19 9992\n1 10000\n6 9\n34 99", "5\n3778 9170\n2657 6649\n4038 9722\n3392 7255\n4890 8961", "5\n2194 6947\n2062 8247\n4481 8430\n3864 9409\n3784 5996", "5\n2906 6249\n659 9082\n2628 8663\n4199 5799\n2678 9558", "5\n659 8346\n2428 8690\n2357 5783\n3528 8580\n2425 7918", "5\n4075 6754\n1024 8762\n504 9491\n1159 6496\n375 9191", "5\n4787 9531\n3133 9597\n1754 9725\n4335 7124\n4269 7752", "5\n1851 8833\n1730 6325\n4901 9327\n4671 9278\n3163 9789", "5\n2563 8898\n2487 7923\n3048 5323\n142 7194\n4760 6061", "5\n979 6674\n1084 8758\n2003 5556\n478 7822\n3654 9623", "5\n4395 5976\n489 5355\n149 5158\n4462 5738\n2548 6658", "5\n3755 7859\n1245 7085\n592 5392\n1285 7892\n1442 7931", "5\n2171 7161\n4842 8682\n4547 9100\n269 9283\n3039 6492", "5\n1 1\n1 1\n2 2\n3 3\n4 4", "2\n1 1\n1 1", "2\n1 10000\n1 9999"], "outputs": ["5.7500000000", "3.5000000000", "6667.1666666646", "1.2500000000", "1.5555555556", "5.9530612245", "5004.6727567145", "6938.4627241727", "6373.5390940730", "6062.1839551640", "6077.3178766816", "5919.6219273821", "7046.2404831920", "7182.4449064090", "5657.2388045241", "5721.9327862568", "5102.0377827659", "5545.5391818827", "6641.5017309461", "3.0000000000", "1.0000000000", "3333.6666666667"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	7	codeforces
f35e9fe9adbb9f6f5fa5aa441e337afe	Ants on a Circle	n ants are on a circle of length m. An ant travels one unit of distance per one unit of time. Initially, the ant number i is located at the position si and is facing in the direction di (which is either L or R). Positions are numbered in counterclockwise order starting from some point. Positions of the all ants are distinct. All the ants move simultaneously, and whenever two ants touch, they will both switch their directions. Note that it is possible for an ant to move in some direction for a half of a unit of time and in opposite direction for another half of a unit of time. Print the positions of the ants after t time units. The first line contains three integers n, m and t (2<=≤<=n<=≤<=3·105,<=2<=≤<=m<=≤<=109,<=0<=≤<=t<=≤<=1018) — the number of ants, the length of the circle and the number of time units. Each of the next n lines contains integer si and symbol di (1<=≤<=si<=≤<=m and di is either L or R) — the position and the direction of the i-th ant at the start. The directions L and R corresponds to the clockwise and counterclockwise directions, respectively. It is guaranteed that all positions si are distinct. Print n integers xj — the position of the j-th ant after t units of time. The ants are numbered from 1 to n in order of their appearing in input. Sample Input 2 4 8 1 R 3 L 4 8 6 6 R 5 L 1 R 8 L 4 8 2 1 R 5 L 6 L 8 R Sample Output 1 3 7 4 2 7 3 3 4 2	{"inputs": ["2 4 8\n1 R\n3 L", "4 8 6\n6 R\n5 L\n1 R\n8 L", "4 8 2\n1 R\n5 L\n6 L\n8 R", "10 10 90\n2 R\n1 R\n3 L\n4 R\n7 L\n8 L\n6 R\n9 R\n5 R\n10 L", "10 20 85\n6 L\n12 R\n2 L\n20 R\n18 L\n8 R\n16 R\n14 L\n10 L\n4 R", "10 20 59\n1 R\n15 L\n7 L\n13 R\n5 R\n17 R\n3 L\n9 R\n11 L\n19 L", "2 2 0\n2 L\n1 R", "2 2 0\n2 L\n1 R", "4 8 6\n6 R\n5 L\n1 R\n8 R"], "outputs": ["1 3", "7 4 2 7", "3 3 4 2", "10 9 1 2 5 6 4 7 3 8", "5 13 1 1 17 9 17 13 9 5", "20 16 8 12 4 16 4 8 12 20", "2 1", "2 1", "7 7 6 4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
f364ca2a099e8d455d001a8fa0bf3be0	Martian Food	Have you ever tasted Martian food? Well, you should. Their signature dish is served on a completely black plate with the radius of R, flat as a pancake. First, they put a perfectly circular portion of the Golden Honduras on the plate. It has the radius of r and is located as close to the edge of the plate as possible staying entirely within the plate. I. e. Golden Honduras touches the edge of the plate from the inside. It is believed that the proximity of the portion of the Golden Honduras to the edge of a plate demonstrates the neatness and exactness of the Martians. Then a perfectly round portion of Pink Guadeloupe is put on the plate. The Guadeloupe should not overlap with Honduras, should not go beyond the border of the plate, but should have the maximum radius. I. e. Pink Guadeloupe should touch the edge of the plate from the inside, and touch Golden Honduras from the outside. For it is the size of the Rose Guadeloupe that shows the generosity and the hospitality of the Martians. Further, the first portion (of the same perfectly round shape) of Green Bull Terrier is put on the plate. It should come in contact with Honduras and Guadeloupe, should not go beyond the border of the plate and should have maximum radius. Each of the following portions of the Green Bull Terrier must necessarily touch the Golden Honduras, the previous portion of the Green Bull Terrier and touch the edge of a plate, but should not go beyond the border. To determine whether a stranger is worthy to touch the food, the Martians ask him to find the radius of the k-th portion of the Green Bull Terrier knowing the radii of a plate and a portion of the Golden Honduras. And are you worthy? The first line contains integer t (1<=≤<=t<=≤<=104) — amount of testcases. Each of the following t lines contain three positive integers: the radii of the plate and a portion of the Golden Honduras R and r (1<=≤<=r<=<<=R<=≤<=104) and the number k (1<=≤<=k<=≤<=104). In the pretests 1<=≤<=k<=≤<=2. Print t lines — the radius of the k-th portion of the Green Bull Terrier for each test. The absolute or relative error of the answer should not exceed 10<=-<=6. Sample Input 2 4 3 1 4 2 2 Sample Output 0.9230769231 0.6666666667	{"inputs": ["2\n4 3 1\n4 2 2", "1\n4 2 2", "1\n7 2 1", "1\n8 7 2", "1\n2 1 1", "1\n1000 999 2", "1\n1000 1 2", "1\n1000 998 1000", "1\n1000 1 1000", "1\n1000 500 123", "1\n1000 999 1", "1\n1000 1 1"], "outputs": ["0.9230769231\n0.6666666667", "0.6666666667", "1.7948717949", "0.9333333333", "0.6666666667", "0.9999959960", "0.2501875781", "0.3993597439", "0.0000010010", "0.0660894852", "0.9999989990", "0.9999989990"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
f391d73d45dd1d927cf8e993cb4dccc5	Balls and Boxes	Little Vasya had n boxes with balls in the room. The boxes stood in a row and were numbered with numbers from 1 to n from left to right. Once Vasya chose one of the boxes, let's assume that its number is i, took all balls out from it (it is guaranteed that this box originally had at least one ball), and began putting balls (one at a time) to the boxes with numbers i<=+<=1, i<=+<=2, i<=+<=3 and so on. If Vasya puts a ball into the box number n, then the next ball goes to box 1, the next one goes to box 2 and so on. He did it until he had no balls left in his hands. It is possible that Vasya puts multiple balls to the same box, and it is also possible that one or more balls will go to the box number i. If i<==<=n, Vasya puts the first ball into the box number 1, then the next ball goes to box 2 and so on. For example, let's suppose that initially Vasya had four boxes, and the first box had 3 balls, the second one had 2, the third one had 5 and the fourth one had 4 balls. Then, if i<==<=3, then Vasya will take all five balls out of the third box and put them in the boxes with numbers: 4,<=1,<=2,<=3,<=4. After all Vasya's actions the balls will lie in the boxes as follows: in the first box there are 4 balls, 3 in the second one, 1 in the third one and 6 in the fourth one. At this point Vasya has completely forgotten the original arrangement of the balls in the boxes, but he knows how they are arranged now, and the number x — the number of the box, where he put the last of the taken out balls. He asks you to help to find the initial arrangement of the balls in the boxes. The first line of the input contains two integers n and x (2<=≤<=n<=≤<=105, 1<=≤<=x<=≤<=n), that represent the number of the boxes and the index of the box that got the last ball from Vasya, correspondingly. The second line contains n space-separated integers a1,<=a2,<=...,<=an, where integer ai (0<=≤<=ai<=≤<=109, ax<=≠<=0) represents the number of balls in the box with index i after Vasya completes all the actions. 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. Print n integers, where the i-th one represents the number of balls in the box number i before Vasya starts acting. Separate the numbers in the output by spaces. If there are multiple correct solutions, you are allowed to print any of them. Sample Input 4 4 4 3 1 6 5 2 3 2 0 2 7 3 3 2 3 1 Sample Output 3 2 5 4 2 1 4 1 6 1 2 3	{"inputs": ["4 4\n4 3 1 6", "5 2\n3 2 0 2 7", "3 3\n2 3 1", "10 3\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "5 4\n0 554459682 978416312 784688178 954779973", "5 2\n1 554459683 978416312 784688178 954779974", "10 8\n994538714 617271264 168716105 915909382 338220996 533154890 507276501 323171960 121635370 33140162", "10 5\n994538715 617271265 168716106 915909383 338220997 533154890 507276501 323171960 121635371 33140163", "15 12\n256121252 531930087 157210108 921323934 786210452 0 962820592 824495629 642702951 556399489 660627699 454443499 406577817 234814732 387536495", "15 8\n256121253 531930088 157210109 921323935 786210453 1 962820593 824495630 642702951 556399489 660627699 454443499 406577818 234814733 387536496", "48 34\n227460647 746912226 53993109 682685525 621533698 666833117 492590398 167395931 678377836 66509684 638633255 713194369 386921920 34175132 704550051 220688091 499436760 495071385 102952101 137372655 0 720974146 209203457 946682102 237312198 943872065 957150897 357568282 367006748 0 730509325 68523190 726721460 85037180 620964625 219537305 396613042 39840356 91947418 566463810 791505982 87036026 446282153 912204581 895882687 284561729 35994526 423462628", "48 19\n227460648 746912227 53993110 682685526 621533699 666833118 492590399 167395932 678377837 66509685 638633256 713194370 386921921 34175133 704550052 220688092 499436761 495071386 102952102 137372655 0 720974146 209203457 946682102 237312198 943872065 957150897 357568282 367006748 0 730509325 68523190 726721460 85037180 620964626 219537306 396613043 39840357 91947419 566463811 791505983 87036027 446282154 912204582 895882688 284561730 35994527 423462629", "10 5\n3 3 3 3 4 3 3 3 3 3", "5 4\n3 1 3 1 3"], "outputs": ["3 2 5 4 ", "2 1 4 1 6 ", "1 2 3 ", "0 0 10000000000 0 0 0 0 0 0 0 ", "3 554459681 978416311 784688177 954779973 ", "6 554459681 978416311 784688177 954779973 ", "961398551 584131101 135575942 882769219 305080833 500014727 474136338 290031797 88495208 331401628 ", "961398551 584131101 135575942 882769219 305080833 500014727 474136338 290031797 88495208 331401635 ", "256121252 531930087 157210108 921323934 786210452 6 962820591 824495628 642702950 556399488 660627698 454443498 406577817 234814732 387536495 ", "256121252 531930087 157210108 921323934 786210452 17 962820591 824495628 642702950 556399488 660627698 454443498 406577817 234814732 387536495 ", "227460647 746912226 53993109 682685525 621533698 666833117 492590398 167395931 678377836 66509684 638633255 713194369 386921920 34175132 704550051 220688091 499436760 495071385 102952101 137372655 0 720974146 209203457 946682102 237312198 943872065 957150897 357568282 367006748 4 730509324 68523189 726721459 85037179 620964625 219537305 396613042 39840356 91947418 566463810 791505982 87036026 446282153 912204581 895882687 284561729 35994526 423462628 ", "227460647 746912226 53993109 682685525 621533698 666833117 492590398 167395931 678377836 66509684 638633255 713194369 386921920 34175132 704550051 220688091 499436760 495071385 102952101 137372655 0 720974146 209203457 946682102 237312198 943872065 957150897 357568282 367006748 37 730509324 68523189 726721459 85037179 620964625 219537305 396613042 39840356 91947418 566463810 791505982 87036026 446282153 912204581 895882687 284561729 35994526 423462628 ", "0 0 0 31 0 0 0 0 0 0 ", "2 0 2 5 2 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	17	codeforces
f3a1a7fd9526cd12c40b83d70cf25ffd	On Sum of Fractions	Let's assume that - v(n) is the largest prime number, that does not exceed n;- u(n) is the smallest prime number strictly greater than n. Find . The first line contains integer t (1<=≤<=t<=≤<=500) — the number of testscases. Each of the following t lines of the input contains integer n (2<=≤<=n<=≤<=109). Print t lines: the i-th of them must contain the answer to the i-th test as an irreducible fraction "p/q", where p,<=q are integers, q<=><=0. Sample Input 2 2 3 Sample Output 1/6 7/30	{"inputs": ["2\n2\n3", "1\n1000000000", "5\n3\n6\n9\n10\n5", "5\n5\n8\n18\n17\n17", "5\n7\n40\n37\n25\n4", "5\n72\n72\n30\n75\n11", "5\n79\n149\n136\n194\n124", "6\n885\n419\n821\n635\n63\n480", "1\n649580447"], "outputs": ["1/6\n7/30", "999999941999999673/1999999887999999118", "7/30\n5/14\n61/154\n9/22\n23/70", "23/70\n59/154\n17/38\n287/646\n287/646", "57/154\n39/82\n1437/3034\n615/1334\n3/10", "71/146\n71/146\n29/62\n5615/11534\n119/286", "6393/13114\n22199/44998\n135/274\n37631/76042\n14121/28702", "781453/1566442\n175559/352798\n674039/1351366\n403199/808942\n3959/8174\n232303/466546", "421954771415489597/843909545429301074"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
f3be2edd00eefa041c20c29eb293b913	Panoramix's Prediction	A prime number is a number which has exactly two distinct divisors: one and itself. For example, numbers 2, 7, 3 are prime, and 1, 6, 4 are not. The next prime number after x is the smallest prime number greater than x. For example, the next prime number after 2 is 3, and the next prime number after 3 is 5. Note that there is exactly one next prime number after each number. So 5 is not the next prime number for 2. One cold April morning Panoramix predicted that soon Kakofonix will break free from his straitjacket, and this will be a black day for the residents of the Gallic countryside. Panoramix's prophecy tells that if some day Asterix and Obelix beat exactly x Roman soldiers, where x is a prime number, and next day they beat exactly y Roman soldiers, where y is the next prime number after x, then it's time to wait for Armageddon, for nothing can shut Kakofonix up while he sings his infernal song. Yesterday the Gauls beat n Roman soldiers and it turned out that the number n was prime! Today their victims were a troop of m Romans (m<=><=n). Determine whether the Gauls should wait for the black day after today's victory of Asterix and Obelix? The first and only input line contains two positive integers — n and m (2<=≤<=n<=<<=m<=≤<=50). It is guaranteed that n is prime. Pretests contain all the cases with restrictions 2<=≤<=n<=<<=m<=≤<=4. Print YES, if m is the next prime number after n, or NO otherwise. Sample Input 3 5 7 11 7 9 Sample Output YESYESNO	{"inputs": ["3 5", "7 11", "7 9", "2 3", "2 4", "3 4", "3 5", "5 7", "7 11", "11 13", "13 17", "17 19", "19 23", "23 29", "29 31", "31 37", "37 41", "41 43", "43 47", "2 5", "2 7", "2 6", "2 11", "3 6", "3 7", "3 9", "5 6", "5 9", "5 11", "5 13", "5 15", "7 8", "7 13", "13 15", "13 17", "19 21", "13 20", "41 49", "43 49", "47 50", "47 49", "47 48", "23 25", "2 50", "31 33"], "outputs": ["YES", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "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"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	706	codeforces
f3befb56bb448c975b4759d7d190e4cb	Counting-out Rhyme	n children are standing in a circle and playing the counting-out game. Children are numbered clockwise from 1 to n. In the beginning, the first child is considered the leader. The game is played in k steps. In the i-th step the leader counts out ai people in clockwise order, starting from the next person. The last one to be pointed at by the leader is eliminated, and the next player after him becomes the new leader. For example, if there are children with numbers [8,<=10,<=13,<=14,<=16] currently in the circle, the leader is child 13 and ai<==<=12, then counting-out rhyme ends on child 16, who is eliminated. Child 8 becomes the leader. You have to write a program which prints the number of the child to be eliminated on every step. The first line contains two integer numbers n and k (2<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=n<=-<=1). The next line contains k integer numbers a1,<=a2,<=...,<=ak (1<=≤<=ai<=≤<=109). Print k numbers, the i-th one corresponds to the number of child to be eliminated at the i-th step. Sample Input 7 5 10 4 11 4 1 3 2 2 5 Sample Output 4 2 5 6 1 3 2	{"inputs": ["7 5\n10 4 11 4 1", "3 2\n2 5", "2 1\n1", "2 1\n2", "2 1\n3", "10 7\n5 10 4 3 8 10 6", "10 8\n12 6 12 15 20 8 17 12", "12 10\n76 58 82 54 97 46 17 40 36 15", "12 6\n76 61 94 15 66 26", "90 10\n1045 8705 6077 3282 1459 9809 383 6206 2674 7274", "100 30\n601771 913885 829106 91674 465657 367068 142461 873149 294276 916519 720701 370006 551782 321506 68525 570684 81178 724855 564907 661130 10112 983124 799801 100639 766045 862312 513021 232094 979480 408554", "3 2\n20148340 81473314", "3 2\n301633543 643389490", "6 5\n532623340 628883728 583960589 690950241 488468353", "6 2\n458995521 294343587", "68 1\n5"], "outputs": ["4 2 5 6 1 ", "3 2 ", "2 ", "1 ", "2 ", "6 8 3 9 2 4 10 ", "3 10 6 8 2 9 4 5 ", "5 9 12 1 3 10 8 11 2 4 ", "5 12 6 2 7 3 ", "56 39 45 20 17 55 14 85 51 33 ", "72 89 16 26 85 73 29 99 63 30 8 46 70 19 100 93 36 54 65 77 17 79 62 64 21 69 42 82 68 1 ", "2 3 ", "2 3 ", "5 3 6 1 4 ", "4 1 ", "6 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	129	codeforces
f3d62dd60c00cd2fd042a33e2c83f89b	Asphalting Roads	City X consists of n vertical and n horizontal infinite roads, forming n<=×<=n intersections. Roads (both vertical and horizontal) are numbered from 1 to n, and the intersections are indicated by the numbers of the roads that form them. Sand roads have long been recognized out of date, so the decision was made to asphalt them. To do this, a team of workers was hired and a schedule of work was made, according to which the intersections should be asphalted. Road repairs are planned for n2 days. On the i-th day of the team arrives at the i-th intersection in the list and if none of the two roads that form the intersection were already asphalted they asphalt both roads. Otherwise, the team leaves the intersection, without doing anything with the roads. According to the schedule of road works tell in which days at least one road will be asphalted. The first line contains integer n (1<=≤<=n<=≤<=50) — the number of vertical and horizontal roads in the city. Next n2 lines contain the order of intersections in the schedule. The i-th of them contains two numbers hi,<=vi (1<=≤<=hi,<=vi<=≤<=n), separated by a space, and meaning that the intersection that goes i-th in the timetable is at the intersection of the hi-th horizontal and vi-th vertical roads. It is guaranteed that all the intersections in the timetable are distinct. In the single line print the numbers of the days when road works will be in progress in ascending order. The days are numbered starting from 1. Sample Input 2 1 1 1 2 2 1 2 2 1 1 1 Sample Output 1 4 1	{"inputs": ["2\n1 1\n1 2\n2 1\n2 2", "1\n1 1", "2\n1 1\n2 2\n1 2\n2 1", "2\n1 2\n2 2\n2 1\n1 1", "3\n2 2\n1 2\n3 2\n3 3\n1 1\n2 3\n1 3\n3 1\n2 1", "3\n1 3\n3 1\n2 1\n1 1\n1 2\n2 2\n3 2\n3 3\n2 3", "4\n1 3\n2 3\n2 4\n4 4\n3 1\n1 1\n3 4\n2 1\n1 4\n4 3\n4 1\n3 2\n1 2\n4 2\n2 2\n3 3", "4\n3 3\n4 2\n2 3\n3 4\n4 4\n1 2\n3 2\n2 2\n1 4\n3 1\n4 1\n2 1\n1 3\n1 1\n4 3\n2 4", "9\n4 5\n2 3\n8 3\n5 6\n9 3\n4 4\n5 4\n4 7\n1 7\n8 4\n1 4\n1 5\n5 7\n7 8\n7 1\n9 9\n8 7\n7 5\n3 7\n6 6\n7 3\n5 2\n3 6\n7 4\n9 6\n5 8\n9 7\n6 3\n7 9\n1 2\n1 1\n6 2\n5 3\n7 2\n1 6\n4 1\n6 1\n8 9\n2 2\n3 9\n2 9\n7 7\n2 8\n9 4\n2 5\n8 6\n3 4\n2 1\n2 7\n6 5\n9 1\n3 3\n3 8\n5 5\n4 3\n3 1\n1 9\n6 4\n3 2\n6 8\n2 6\n5 9\n8 5\n8 8\n9 5\n6 9\n9 2\n3 5\n4 9\n4 8\n2 4\n5 1\n4 6\n7 6\n9 8\n1 3\n4 2\n8 1\n8 2\n6 7\n1 8", "8\n1 1\n1 2\n1 3\n1 4\n1 5\n8 6\n1 7\n1 8\n2 1\n8 5\n2 3\n2 4\n2 5\n2 6\n4 3\n2 2\n3 1\n3 2\n3 3\n3 4\n3 5\n3 6\n5 6\n3 8\n4 1\n4 2\n2 7\n4 4\n8 8\n4 6\n4 7\n4 8\n5 1\n5 2\n5 3\n6 5\n5 5\n3 7\n5 7\n5 8\n6 1\n6 2\n6 3\n6 4\n5 4\n6 6\n6 7\n6 8\n7 1\n7 2\n7 3\n7 4\n7 5\n7 6\n7 7\n7 8\n8 1\n8 2\n8 3\n8 4\n2 8\n1 6\n8 7\n4 5", "9\n9 9\n5 5\n8 8\n3 3\n2 2\n6 6\n4 4\n1 1\n7 7\n8 4\n1 4\n1 5\n5 7\n7 8\n7 1\n1 7\n8 7\n7 5\n3 7\n5 6\n7 3\n5 2\n3 6\n7 4\n9 6\n5 8\n9 7\n6 3\n7 9\n1 2\n4 5\n6 2\n5 3\n7 2\n1 6\n4 1\n6 1\n8 9\n2 3\n3 9\n2 9\n5 4\n2 8\n9 4\n2 5\n8 6\n3 4\n2 1\n2 7\n6 5\n9 1\n8 3\n3 8\n9 3\n4 3\n3 1\n1 9\n6 4\n3 2\n6 8\n2 6\n5 9\n8 5\n4 7\n9 5\n6 9\n9 2\n3 5\n4 9\n4 8\n2 4\n5 1\n4 6\n7 6\n9 8\n1 3\n4 2\n8 1\n8 2\n6 7\n1 8"], "outputs": ["1 4 ", "1 ", "1 2 ", "1 3 ", "1 4 5 ", "1 2 6 ", "1 3 5 14 ", "1 2 9 12 ", "1 2 4 9 10 14 16 32 56 ", "1 6 11 18 28 36 39 56 ", "1 2 3 4 5 6 7 8 9 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	262	codeforces
f3d7158f8e0792de72e5f73a3a3af603	Trip For Meal	Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives in his own house. There are winding paths between each pair of houses. The length of a path between Rabbit's and Owl's houses is a meters, between Rabbit's and Eeyore's house is b meters, between Owl's and Eeyore's house is c meters. For enjoying his life and singing merry songs Winnie-the-Pooh should have a meal n times a day. Now he is in the Rabbit's house and has a meal for the first time. Each time when in the friend's house where Winnie is now the supply of honey is about to end, Winnie leaves that house. If Winnie has not had a meal the required amount of times, he comes out from the house and goes to someone else of his two friends. For this he chooses one of two adjacent paths, arrives to the house on the other end and visits his friend. You may assume that when Winnie is eating in one of his friend's house, the supply of honey in other friend's houses recover (most probably, they go to the supply store). Winnie-the-Pooh does not like physical activity. He wants to have a meal n times, traveling minimum possible distance. Help him to find this distance. First line contains an integer n (1<=≤<=n<=≤<=100) — number of visits. Second line contains an integer a (1<=≤<=a<=≤<=100) — distance between Rabbit's and Owl's houses. Third line contains an integer b (1<=≤<=b<=≤<=100) — distance between Rabbit's and Eeyore's houses. Fourth line contains an integer c (1<=≤<=c<=≤<=100) — distance between Owl's and Eeyore's houses. Output one number — minimum distance in meters Winnie must go through to have a meal n times. Sample Input 3 2 3 1 1 2 3 5 Sample Output 3 0	{"inputs": ["3\n2\n3\n1", "1\n2\n3\n5", "10\n1\n8\n3", "7\n10\n5\n6", "9\n9\n7\n5", "9\n37\n85\n76", "76\n46\n77\n11", "80\n42\n1\n37", "8\n80\n55\n1", "10\n13\n72\n17", "9\n24\n1\n63", "65\n5\n8\n7", "56\n8\n9\n3", "59\n8\n1\n2", "75\n50\n50\n5", "75\n54\n76\n66", "73\n71\n69\n66", "83\n58\n88\n16", "74\n31\n11\n79", "62\n27\n16\n72", "72\n95\n27\n9", "1\n2\n2\n1", "1\n1\n1\n1", "1\n1\n1\n99", "100\n100\n100\n100", "2\n1\n1\n3", "1\n3\n2\n1", "1\n5\n6\n1", "1\n2\n6\n1", "1\n30\n20\n1", "1\n15\n13\n11", "1\n100\n50\n1", "1\n2\n3\n1", "5\n5\n5\n5", "1\n100\n50\n5", "1\n5\n7\n3", "1\n3\n4\n2", "3\n3\n3\n3", "1\n99\n98\n1", "5\n3\n3\n1", "2\n1\n1\n1", "2\n1\n7\n8", "2\n2\n2\n1", "2\n2\n3\n1", "1\n5\n6\n2", "100\n1\n1\n100", "2\n3\n2\n1", "1\n99\n98\n97"], "outputs": ["3", "0", "9", "30", "42", "296", "860", "79", "61", "117", "8", "320", "170", "58", "415", "3996", "4755", "1354", "803", "976", "657", "0", "0", "0", "9900", "1", "0", "0", "0", "0", "0", "0", "0", "20", "0", "0", "0", "6", "0", "6", "1", "1", "2", "2", "0", "99", "2", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	234	codeforces
f3dbac550b76e20c952e310e24ea589c	Spyke Chatting	The R2 company has n employees working for it. The work involves constant exchange of ideas, sharing the stories of success and upcoming challenging. For that, R2 uses a famous instant messaging program Spyke. R2 has m Spyke chats just to discuss all sorts of issues. In each chat, some group of employees exchanges messages daily. An employee can simultaneously talk in multiple chats. If some employee is in the k-th chat, he can write messages to this chat and receive notifications about messages from this chat. If an employee writes a message in the chat, all other participants of the chat receive a message notification. The R2 company is conducting an audit. Now the specialists study effective communication between the employees. For this purpose, they have a chat log and the description of chat structure. You, as one of audit specialists, are commissioned to write a program that will use this data to determine the total number of message notifications received by each employee. The first line contains three space-separated integers n, m and k (2<=≤<=n<=≤<=2·104; 1<=≤<=m<=≤<=10; 1<=≤<=k<=≤<=2·105) — the number of the employees, the number of chats and the number of events in the log, correspondingly. Next n lines contain matrix a of size n<=×<=m, consisting of numbers zero and one. The element of this matrix, recorded in the j-th column of the i-th line, (let's denote it as aij) equals 1, if the i-th employee is the participant of the j-th chat, otherwise the element equals 0. Assume that the employees are numbered from 1 to n and the chats are numbered from 1 to m. Next k lines contain the description of the log events. The i-th line contains two space-separated integers xi and yi (1<=≤<=xi<=≤<=n; 1<=≤<=yi<=≤<=m) which mean that the employee number xi sent one message to chat number yi. It is guaranteed that employee number xi is a participant of chat yi. It is guaranteed that each chat contains at least two employees. Print in the single line n space-separated integers, where the i-th integer shows the number of message notifications the i-th employee receives. Sample Input 3 4 5 1 1 1 1 1 0 1 1 1 1 0 0 1 1 3 1 1 3 2 4 3 2 4 3 4 0 1 1 1 0 1 1 1 1 0 0 0 1 2 2 1 3 1 1 3 Sample Output 3 3 1 0 2 3 0	{"inputs": ["3 4 5\n1 1 1 1\n1 0 1 1\n1 1 0 0\n1 1\n3 1\n1 3\n2 4\n3 2", "4 3 4\n0 1 1\n1 0 1\n1 1 1\n0 0 0\n1 2\n2 1\n3 1\n1 3", "2 1 1\n1\n1\n1 1", "3 3 1\n1 1 1\n1 1 1\n1 1 1\n3 1", "3 2 1\n0 1\n1 0\n1 1\n1 2", "5 5 5\n0 1 1 1 0\n1 1 0 1 1\n1 1 1 1 1\n0 1 1 1 1\n1 0 0 1 1\n4 5\n4 5\n1 3\n5 4\n1 2", "4 5 6\n1 1 1 1 1\n1 1 1 0 1\n1 0 1 1 1\n1 0 1 1 1\n2 3\n2 5\n1 2\n4 5\n4 5\n4 1", "7 6 5\n0 1 0 1 1 1\n0 1 1 0 1 1\n1 0 1 1 1 0\n1 0 1 1 1 1\n1 1 1 1 1 0\n1 1 1 0 1 0\n1 0 1 0 0 0\n4 1\n2 6\n7 3\n7 1\n5 3", "3 3 4\n1 1 1\n0 0 0\n1 1 1\n1 1\n3 1\n3 2\n3 3", "10 1 10\n0\n0\n0\n0\n0\n0\n1\n0\n1\n0\n7 1\n9 1\n9 1\n7 1\n9 1\n9 1\n9 1\n7 1\n9 1\n9 1", "2 1 1\n1\n1\n1 1", "2 1 1\n1\n1\n2 1", "3 1 2\n1\n1\n0\n1 1\n2 1", "3 1 2\n1\n0\n1\n1 1\n3 1", "3 1 2\n0\n1\n1\n2 1\n3 1"], "outputs": ["3 3 1 ", "0 2 3 0 ", "0 1 ", "1 1 0 ", "0 0 1 ", "1 4 5 3 2 ", "5 4 5 2 ", "1 2 4 4 3 4 2 ", "3 0 1 ", "0 0 0 0 0 0 7 0 3 0 ", "0 1 ", "1 0 ", "1 1 0 ", "1 0 1 ", "0 1 1 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	20	codeforces
f42402e6c70bf58ecf9462382be78531	Martian Luck	You know that the Martians use a number system with base k. Digit b (0<=≤<=b<=<<=k) is considered lucky, as the first contact between the Martians and the Earthlings occurred in year b (by Martian chronology). A digital root d(x) of number x is a number that consists of a single digit, resulting after cascading summing of all digits of number x. Word "cascading" means that if the first summing gives us a number that consists of several digits, then we sum up all digits again, and again, until we get a one digit number. For example, d(35047)<==<=d((3<=+<=5<=+<=0<=+<=4)7)<==<=d(157)<==<=d((1<=+<=5)7)<==<=d(67)<==<=67. In this sample the calculations are performed in the 7-base notation. If a number's digital root equals b, the Martians also call this number lucky. You have string s, which consists of n digits in the k-base notation system. Your task is to find, how many distinct substrings of the given string are lucky numbers. Leading zeroes are permitted in the numbers. Note that substring s[i... j] of the string s<==<=a1a2... an (1<=≤<=i<=≤<=j<=≤<=n) is the string aiai<=+<=1... aj. Two substrings s[i1... j1] and s[i2... j2] of the string s are different if either i1<=≠<=i2 or j1<=≠<=j2. The first line contains three integers k, b and n (2<=≤<=k<=≤<=109, 0<=≤<=b<=<<=k, 1<=≤<=n<=≤<=105). The second line contains string s as a sequence of n integers, representing digits in the k-base notation: the i-th integer equals ai (0<=≤<=ai<=<<=k) — the i-th digit of string s. The numbers in the lines are space-separated. Print a single integer — the number of substrings that are lucky numbers. 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 10 5 6 3 2 0 5 6 1 7 6 4 3 5 0 4 257 0 3 0 0 256 Sample Output 513	{"inputs": ["10 5 6\n3 2 0 5 6 1", "7 6 4\n3 5 0 4", "257 0 3\n0 0 256", "2 1 1\n0", "2 0 20\n1 1 1 0 1 1 1 1 0 0 0 0 1 0 0 0 0 1 0 1", "100 29 33\n28 89 23 14 97 97 66 56 55 60 47 29 9 79 26 80 63 78 83 60 41 29 52 10 82 26 47 88 99 75 52 1 31", "3 2 100\n2 0 0 0 0 2 1 1 1 2 0 1 1 1 1 2 0 0 1 0 1 1 2 0 2 0 1 0 1 0 0 2 0 0 0 1 2 0 2 2 0 2 0 2 1 0 1 1 1 1 2 0 0 0 1 0 2 0 2 0 2 1 2 2 1 1 0 1 1 2 1 1 0 0 1 1 2 2 1 2 2 0 1 2 2 1 2 2 0 2 0 2 2 0 2 2 1 2 0 0", "4 2 201\n0 2 0 3 3 0 3 0 1 2 0 1 1 2 0 2 3 1 3 1 1 1 2 1 2 3 0 0 3 1 2 2 0 0 2 3 3 3 3 0 1 2 2 3 2 3 2 2 1 0 1 3 1 3 0 2 1 0 2 0 1 1 1 2 2 1 3 0 0 0 2 1 3 0 0 1 1 3 3 2 1 2 2 1 3 3 1 3 1 3 0 1 0 0 0 2 0 3 0 0 2 3 1 3 1 0 1 3 0 1 3 2 2 1 2 0 2 1 1 0 3 0 1 1 0 1 2 2 3 0 3 0 2 0 2 0 1 2 2 2 1 0 3 2 0 3 0 2 2 1 0 2 1 3 0 2 1 0 2 2 0 3 2 1 2 0 3 1 2 3 1 1 3 2 1 3 3 3 3 1 3 0 2 3 0 1 3 2 3 1 2 3 2 0 3 2 0 1 2 3 0", "5 4 102\n3 2 2 3 3 2 2 0 3 1 2 4 0 1 3 4 3 2 3 0 4 1 0 0 0 0 4 4 1 2 3 3 4 0 1 2 2 3 3 1 3 1 0 0 3 0 4 0 2 4 2 3 0 1 4 3 0 2 3 3 2 2 1 0 1 3 0 3 4 4 4 1 0 1 2 1 4 2 4 4 4 4 4 2 3 3 0 3 0 0 0 4 1 3 0 4 2 1 2 0 3 0", "6 2 203\n3 0 5 1 3 3 0 3 4 0 4 2 4 4 4 4 4 5 0 2 1 0 3 2 5 3 2 3 4 1 5 0 0 4 4 2 0 4 2 0 1 3 4 4 3 2 1 5 1 3 2 0 4 5 2 3 0 4 2 4 5 4 1 2 2 4 1 3 5 5 0 2 5 0 3 5 4 3 4 0 0 3 5 2 4 2 2 5 3 3 3 0 2 5 1 0 0 2 2 1 1 2 4 1 0 5 5 0 5 2 0 3 5 5 3 2 2 0 5 3 2 0 4 0 0 5 5 4 4 0 3 0 4 4 0 4 0 0 2 1 1 4 3 3 0 5 4 4 1 1 5 3 2 2 5 4 0 0 2 3 2 4 3 1 3 0 3 5 0 1 2 2 4 2 3 4 5 4 1 5 5 1 1 1 3 3 2 4 2 0 5 5 1 1 0 3 2 1 3 4 2 1 5", "7 4 104\n4 3 0 6 6 5 3 4 4 5 0 1 2 5 5 1 3 4 1 5 3 5 4 4 2 4 3 5 4 2 2 3 1 1 0 5 4 3 2 5 2 1 3 1 6 4 1 3 0 2 5 2 5 3 3 6 1 2 2 2 4 5 6 0 5 4 5 3 5 3 4 3 1 0 2 4 5 5 5 5 3 3 6 1 6 1 3 6 6 5 3 3 1 3 2 0 4 4 3 3 4 0 5 6", "8 5 205\n5 6 5 0 2 1 1 3 7 2 1 7 7 7 7 6 5 5 0 2 0 7 4 3 0 4 3 6 6 4 1 5 0 3 2 5 2 5 6 3 5 7 6 6 3 4 4 0 0 5 6 4 2 7 4 1 2 1 5 5 1 2 5 2 3 7 2 3 6 2 1 7 3 3 5 5 4 3 0 6 4 4 0 6 2 2 3 3 5 4 2 4 0 2 1 2 7 0 5 1 0 2 4 0 3 6 0 4 2 4 4 1 1 0 5 0 6 6 1 1 1 5 3 3 5 5 4 6 5 0 3 0 7 3 6 4 4 6 6 3 5 7 7 7 7 3 4 3 7 5 7 4 7 4 6 2 7 1 7 7 3 6 4 6 3 7 7 5 6 4 7 3 5 5 0 2 6 4 7 5 6 6 3 2 5 2 5 1 6 7 0 3 3 2 1 4 4 5 7 1 1 1 3 2 3", "9 5 197\n4 3 0 6 2 2 2 7 2 4 8 1 7 4 6 0 1 0 4 2 6 3 6 2 1 8 6 1 5 2 8 3 0 8 3 6 6 2 0 7 3 6 7 4 4 0 4 1 7 8 5 6 5 7 3 1 7 6 7 2 3 4 1 0 5 5 7 3 4 0 8 1 5 3 6 3 7 8 8 1 7 6 1 8 5 6 6 2 1 4 7 3 6 5 0 7 3 1 7 8 4 4 6 0 6 8 4 8 4 8 4 1 4 2 1 5 1 7 5 1 2 3 7 8 0 5 2 0 6 2 2 5 8 3 8 1 5 2 0 4 1 4 8 1 6 3 1 3 2 1 0 3 3 3 0 3 3 1 1 5 2 5 6 4 3 8 1 1 2 3 7 7 3 8 3 4 3 2 4 4 4 7 2 7 5 1 6 4 1 4 4 4 4 8 7 6 6", "11 1 199\n10 1 2 1 6 2 0 1 9 9 0 5 5 4 0 1 8 7 7 5 2 5 6 10 7 1 6 8 0 8 10 9 1 8 1 6 1 3 6 1 9 0 5 3 6 8 7 5 10 1 1 10 1 6 10 8 10 10 9 1 3 10 2 3 8 10 6 1 7 7 10 5 2 2 7 2 0 2 1 8 6 5 9 6 7 10 2 9 1 4 2 4 5 4 1 5 6 1 1 1 5 2 6 8 8 3 8 6 5 4 2 1 6 5 0 6 5 4 3 7 4 7 6 8 6 6 6 4 10 4 6 5 5 7 10 1 9 2 4 8 4 1 7 1 8 3 10 3 4 1 7 9 5 10 7 0 8 5 4 5 2 4 6 6 10 7 1 3 2 3 10 2 6 6 4 0 5 7 7 8 9 7 10 4 2 10 8 7 8 7 3 8 1 4 9 1 9 2 2", "20 15 1\n6", "20 19 2\n16 13", "30 24 30\n7 24 3 20 8 24 0 6 15 22 20 21 16 26 28 6 6 28 19 2 12 22 6 12 15 17 24 13 12 16", "2 0 100\n0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0"], "outputs": ["5", "1", "3", "0", "22", "10", "2451", "6692", "1293", "4130", "938", "2928", "2451", "2051", "0", "0", "20", "331"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
f431895a1a729fdbd0c3ad3f22be56ce	Professor GukiZ and Two Arrays	Professor GukiZ has two arrays of integers, a and b. Professor wants to make the sum of the elements in the array a sa as close as possible to the sum of the elements in the array b sb. So he wants to minimize the value v<==<=\|sa<=-<=sb\|. In one operation professor can swap some element from the array a and some element from the array b. For example if the array a is [5,<=1,<=3,<=2,<=4] and the array b is [3,<=3,<=2] professor can swap the element 5 from the array a and the element 2 from the array b and get the new array a [2,<=1,<=3,<=2,<=4] and the new array b [3,<=3,<=5]. Professor doesn't want to make more than two swaps. Find the minimal value v and some sequence of no more than two swaps that will lead to the such value v. Professor makes swaps one by one, each new swap he makes with the new arrays a and b. The first line contains integer n (1<=≤<=n<=≤<=2000) — the number of elements in the array a. The second line contains n integers ai (<=-<=109<=≤<=ai<=≤<=109) — the elements of the array a. The third line contains integer m (1<=≤<=m<=≤<=2000) — the number of elements in the array b. The fourth line contains m integers bj (<=-<=109<=≤<=bj<=≤<=109) — the elements of the array b. In the first line print the minimal value v<==<=\|sa<=-<=sb\| that can be got with no more than two swaps. The second line should contain the number of swaps k (0<=≤<=k<=≤<=2). Each of the next k lines should contain two integers xp,<=yp (1<=≤<=xp<=≤<=n,<=1<=≤<=yp<=≤<=m) — the index of the element in the array a and the index of the element in the array b in the p-th swap. If there are several optimal solutions print any of them. Print the swaps in order the professor did them. Sample Input 5 5 4 3 2 1 4 1 1 1 1 5 1 2 3 4 5 1 15 5 1 2 3 4 5 4 1 2 3 4 Sample Output 1 2 1 1 4 2 0 0 1 1 3 1	{"inputs": ["5\n5 4 3 2 1\n4\n1 1 1 1", "5\n1 2 3 4 5\n1\n15", "5\n1 2 3 4 5\n4\n1 2 3 4", "1\n-42\n1\n-86", "1\n-21\n10\n-43 6 -46 79 -21 93 -36 -38 -67 1", "10\n87 -92 -67 -100 -88 80 -82 -59 81 -72\n10\n-50 30 30 77 65 92 -60 -76 -29 -15", "6\n1 2 3 4 5 11\n1\n3", "2\n-2 -17\n2\n11 -9"], "outputs": ["1\n2\n1 1\n4 2", "0\n0", "1\n1\n3 1", "44\n0", "1\n1\n1 3", "0\n2\n4 4\n9 6", "7\n1\n6 1", "5\n1\n1 1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
f43a0ddbf858622f14a65dfa900d98f3	Holidays	School holidays come in Berland. The holidays are going to continue for n days. The students of school №N are having the time of their lives and the IT teacher Marina Sergeyevna, who has spent all the summer busy checking the BSE (Berland State Examination) results, has finally taken a vacation break! Some people are in charge of the daily watering of flowers in shifts according to the schedule. However when Marina Sergeyevna was making the schedule, she was so tired from work and so lost in dreams of the oncoming vacation that she perhaps made several mistakes. In fact, it is possible that according to the schedule, on some days during the holidays the flowers will not be watered or will be watered multiple times. Help Marina Sergeyevna to find a mistake. The first input line contains two numbers n and m (1<=≤<=n,<=m<=≤<=100) — the number of days in Berland holidays and the number of people in charge of the watering respectively. The next m lines contain the description of the duty schedule. Each line contains two integers ai and bi (1<=≤<=ai<=≤<=bi<=≤<=n), meaning that the i-th person in charge should water the flowers from the ai-th to the bi-th day inclusively, once a day. The duty shifts are described sequentially, i.e. bi<=≤<=ai<=+<=1 for all i from 1 to n<=-<=1 inclusively. Print "OK" (without quotes), if the schedule does not contain mistakes. Otherwise you have to find the minimal number of a day when the flowers will not be watered or will be watered multiple times, and output two integers — the day number and the number of times the flowers will be watered that day. Sample Input 10 5 1 2 3 3 4 6 7 7 8 10 10 5 1 2 2 3 4 5 7 8 9 10 10 5 1 2 3 3 5 7 7 7 7 10 Sample Output OK 2 2 4 0	{"inputs": ["10 5\n1 2\n3 3\n4 6\n7 7\n8 10", "10 5\n1 2\n2 3\n4 5\n7 8\n9 10", "10 5\n1 2\n3 3\n5 7\n7 7\n7 10", "5 4\n1 1\n2 2\n3 3\n4 5", "100 50\n1 2\n3 3\n4 5\n6 8\n9 10\n11 11\n12 14\n15 15\n16 16\n17 17\n18 18\n19 19\n20 21\n22 23\n24 24\n25 26\n27 30\n31 34\n35 37\n38 38\n39 40\n41 43\n44 46\n47 53\n54 54\n55 55\n56 59\n60 60\n61 61\n62 64\n65 69\n70 72\n73 73\n74 74\n75 76\n77 79\n80 82\n83 83\n84 84\n85 85\n86 86\n87 88\n89 89\n90 90\n91 91\n92 92\n93 93\n94 97\n98 98\n99 100", "50 50\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n7 7\n8 8\n9 9\n10 10\n11 11\n12 12\n13 13\n14 14\n15 15\n16 16\n17 17\n18 18\n19 19\n20 20\n21 21\n22 22\n23 23\n24 24\n25 25\n26 26\n27 27\n28 28\n29 29\n30 30\n31 31\n32 32\n33 33\n34 34\n35 35\n36 36\n37 37\n38 38\n39 39\n40 40\n41 41\n42 42\n43 43\n44 44\n45 45\n46 46\n47 47\n48 48\n49 49\n50 50", "5 1\n1 5", "6 2\n1 5\n6 6", "7 5\n1 1\n2 2\n3 3\n4 4\n5 7", "10 2\n1 2\n3 10", "21 15\n1 1\n2 2\n3 3\n4 5\n6 6\n7 7\n8 8\n9 9\n10 11\n12 12\n13 13\n14 14\n15 17\n18 19\n20 21", "100 7\n1 8\n9 26\n27 28\n29 30\n31 38\n39 95\n96 100", "100 13\n1 4\n5 11\n12 18\n19 24\n25 31\n32 38\n39 39\n40 45\n46 55\n56 69\n70 70\n71 75\n76 100", "100 50\n1 8\n9 12\n13 19\n20 22\n23 27\n28 31\n32 36\n36 40\n40 43\n47 47\n48 51\n51 55\n62 63\n69 77\n77 84\n85 90\n98 99\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100\n100 100", "1 1\n1 1", "10 1\n2 3", "10 9\n1 1\n2 2\n3 4\n6 6\n8 8\n8 10\n10 10\n10 10\n10 10", "27 10\n1 1\n2 3\n4 5\n6 7\n8 9\n10 11\n12 13\n14 15\n16 17\n17 18", "67 15\n1 6\n7 14\n15 16\n17 23\n24 30\n31 34\n35 41\n42 48\n48 56\n56 62\n66 67\n67 67\n67 67\n67 67\n67 67", "68 13\n1 2\n3 11\n12 21\n22 30\n31 38\n39 43\n44 44\n45 46\n47 50\n51 55\n64 68\n68 68\n68 68", "47 45\n1 3\n4 7\n8 11\n12 15\n16 18\n19 23\n24 26\n27 28\n29 31\n32 33\n34 37\n37 40\n45 45\n46 46\n46 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47\n47 47", "5 2\n1 1\n3 3", "5 3\n1 2\n3 3\n3 5", "5 4\n1 2\n3 4\n5 5\n5 5", "10 5\n2 5\n5 6\n7 9\n9 9\n9 10", "20 6\n1 1\n1 1\n1 3\n5 7\n7 13\n14 20", "20 7\n1 3\n4 8\n8 8\n8 8\n8 9\n15 20\n20 20", "20 7\n1 5\n6 8\n10 10\n12 15\n15 16\n16 16\n16 20", "20 13\n1 2\n3 4\n5 7\n7 7\n7 7\n7 9\n10 11\n11 11\n11 12\n12 12\n12 13\n15 18\n19 20", "20 7\n1 3\n4 5\n6 6\n7 11\n12 15\n16 17\n18 19", "20 7\n1 6\n7 9\n10 11\n12 14\n15 19\n19 20\n20 20"], "outputs": ["OK", "2 2", "4 0", "OK", "OK", "OK", "OK", "OK", "OK", "OK", "OK", "OK", "OK", "36 2", "OK", "1 0", "5 0", "17 2", "48 2", "56 0", "37 2", "2 0", "3 2", "5 2", "1 0", "1 3", "8 4", "9 0", "7 4", "20 0", "19 2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	32	codeforces
f43a2e0a33c8f44633805b0dd90f0796	Cupboard and Balloons	A girl named Xenia has a cupboard that looks like an arc from ahead. The arc is made of a semicircle with radius r (the cupboard's top) and two walls of height h (the cupboard's sides). The cupboard's depth is r, that is, it looks like a rectangle with base r and height h<=+<=r from the sides. The figure below shows what the cupboard looks like (the front view is on the left, the side view is on the right). Xenia got lots of balloons for her birthday. The girl hates the mess, so she wants to store the balloons in the cupboard. Luckily, each balloon is a sphere with radius . Help Xenia calculate the maximum number of balloons she can put in her cupboard. You can say that a balloon is in the cupboard if you can't see any part of the balloon on the left or right view. The balloons in the cupboard can touch each other. It is not allowed to squeeze the balloons or deform them in any way. You can assume that the cupboard's walls are negligibly thin. The single line contains two integers r,<=h (1<=≤<=r,<=h<=≤<=107). Print a single integer — the maximum number of balloons Xenia can put in the cupboard. Sample Input 1 1 1 2 2 1 Sample Output 3 5 2	{"inputs": ["1 1", "1 2", "2 1", "2 2", "2 3", "4 1", "5 1", "5 2", "5 3", "5 4", "5 5", "5 6", "5 9", "5 10", "5 11", "674098 1358794", "3983458 7761504", "4841874 9131511", "667586 5534221", "1526002 6904227", "4835362 5823289", "5693778 7001807", "6552194 8371814", "2377906 4774524", "4365659 4738707", "98 1358794", "458 7761504", "874 9131511", "586 5534221", "2 6904227", "1 10000000", "2 10000000", "3 10000000", "4 10000000", "3 9999999", "10000000 866254", "10000000 8660255", "100 50", "100 49", "100 199", "8 7", "10000 9999", "1000000 1999999", "2000000 1999999", "18 16", "100 87", "10 19", "10000 38661"], "outputs": ["3", "5", "2", "3", "4", "1", "1", "1", "2", "2", "3", "3", "4", "5", "5", "5", "5", "5", "17", "10", "3", "3", "3", "5", "3", "27731", "33894", "20897", "18889", "6904228", "20000001", "10000001", "6666667", "5000001", "6666667", "1", "3", "2", "1", "5", "3", "3", "5", "3", "3", "3", "5", "9"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	14	codeforces
f453f02226d9971eb7bbf5becec6b38f	Find Marble	Petya and Vasya are playing a game. Petya's got n non-transparent glasses, standing in a row. The glasses' positions are indexed with integers from 1 to n from left to right. Note that the positions are indexed but the glasses are not. First Petya puts a marble under the glass in position s. Then he performs some (possibly zero) shuffling operations. One shuffling operation means moving the glass from the first position to position p1, the glass from the second position to position p2 and so on. That is, a glass goes from position i to position pi. Consider all glasses are moving simultaneously during one shuffling operation. When the glasses are shuffled, the marble doesn't travel from one glass to another: it moves together with the glass it was initially been put in. After all shuffling operations Petya shows Vasya that the ball has moved to position t. Vasya's task is to say what minimum number of shuffling operations Petya has performed or determine that Petya has made a mistake and the marble could not have got from position s to position t. The first line contains three integers: n,<=s,<=t (1<=≤<=n<=≤<=105; 1<=≤<=s,<=t<=≤<=n) — the number of glasses, the ball's initial and final position. The second line contains n space-separated integers: p1,<=p2,<=...,<=pn (1<=≤<=pi<=≤<=n) — the shuffling operation parameters. It is guaranteed that all pi's are distinct. Note that s can equal t. If the marble can move from position s to position t, then print on a single line a non-negative integer — the minimum number of shuffling operations, needed to get the marble to position t. If it is impossible, print number -1. Sample Input 4 2 1 2 3 4 1 4 3 3 4 1 3 2 4 3 4 1 2 3 4 3 1 3 2 1 3 Sample Output 3 0 -1 -1	{"inputs": ["4 2 1\n2 3 4 1", "4 3 3\n4 1 3 2", "4 3 4\n1 2 3 4", "3 1 3\n2 1 3", "1 1 1\n1", "10 6 7\n10 7 8 1 5 6 2 9 4 3", "10 3 6\n5 6 7 3 8 4 2 1 10 9", "10 10 4\n4 2 6 9 5 3 8 1 10 7", "100 90 57\n19 55 91 50 31 23 60 84 38 1 22 51 27 76 28 98 11 44 61 63 15 93 52 3 66 16 53 36 18 62 35 85 78 37 73 64 87 74 46 26 82 69 49 33 83 89 56 67 71 25 39 94 96 17 21 6 47 68 34 42 57 81 13 10 54 2 48 80 20 77 4 5 59 30 90 95 45 75 8 88 24 41 40 14 97 32 7 9 65 70 100 99 72 58 92 29 79 12 86 43", "100 11 20\n80 25 49 55 22 98 35 59 88 14 91 20 68 66 53 50 77 45 82 63 96 93 85 46 37 74 84 9 7 95 41 86 23 36 33 27 81 39 18 13 12 92 24 71 3 48 83 61 31 87 28 79 75 38 11 21 29 69 44 100 72 62 32 43 30 16 47 56 89 60 42 17 26 70 94 99 4 6 2 73 8 52 65 1 15 90 67 51 78 10 5 76 57 54 34 58 19 64 40 97", "100 84 83\n30 67 53 89 94 54 92 17 26 57 15 5 74 85 10 61 18 70 91 75 14 11 93 41 25 78 88 81 20 51 35 4 62 1 97 39 68 52 47 77 64 3 2 72 60 80 8 83 65 98 21 22 45 7 58 31 43 38 90 99 49 87 55 36 29 6 37 23 66 76 59 79 40 86 63 44 82 32 48 16 50 100 28 96 46 12 27 13 24 9 19 84 73 69 71 42 56 33 34 95", "100 6 93\n74 62 67 81 40 85 35 42 59 72 80 28 79 41 16 19 33 63 13 10 69 76 70 93 49 84 89 94 8 37 11 90 26 52 47 7 36 95 86 75 56 15 61 99 88 12 83 21 20 3 100 17 32 82 6 5 43 25 66 68 73 78 18 77 92 27 23 2 4 39 60 48 22 24 14 97 29 34 54 64 71 57 87 38 9 50 30 53 51 45 44 31 58 91 98 65 55 1 46 96", "100 27 56\n58 18 50 41 33 37 14 87 77 73 61 53 15 8 70 68 45 96 54 78 39 67 51 60 80 12 93 99 20 92 17 79 4 13 62 91 69 29 49 36 98 34 90 35 84 64 38 83 28 89 97 94 9 16 26 48 10 57 23 75 27 88 44 21 72 76 30 43 32 2 71 24 100 1 31 81 42 40 47 55 86 85 66 5 52 22 95 74 11 19 7 82 6 25 56 63 65 59 46 3", "87 42 49\n45 55 24 44 56 72 74 23 4 7 37 67 22 6 58 76 40 36 3 20 26 87 64 75 49 70 62 42 31 1 80 33 25 59 78 27 32 2 41 61 66 28 19 85 15 69 52 77 50 14 16 34 18 43 73 83 11 39 29 9 35 13 81 54 79 21 60 46 71 57 12 17 5 47 38 30 10 84 53 63 68 8 51 65 48 86 82", "2 1 2\n1 2", "2 1 2\n2 1", "2 2 2\n1 2", "2 2 2\n2 1", "2 1 1\n2 1"], "outputs": ["3", "0", "-1", "-1", "0", "-1", "3", "4", "-1", "26", "71", "-1", "20", "-1", "-1", "1", "0", "0", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	222	codeforces
f456a5b7865384e367c56b0d2407ffe7	Composing Of String	Stepan has a set of n strings. Also, he has a favorite string s. Stepan wants to do the following. He will take some strings of his set and write them down one after another. It is possible that he will take some strings more than once, and will not take some of them at all. Your task is to determine the minimum number of strings in the set which Stepan needs to take and write so that the string s appears as a subsequence in the resulting written down string. For example, in the string "abcd" strings "ad", "acd", "abcd" appear as subsequences, and strings "ba", "abdc" don't appear as subsequences. The first line contains the integer n (1<=≤<=n<=≤<=50) — the number of strings in Stepan's set. The next n lines contain n non-empty strings consisting of lowercase letters of the English alphabet. The length of each of these strings does not exceed 50 symbols. It is possible that some strings from Stepan's set are the same. The next line contains the non-empty string s, consisting of lowercase letters of the English alphabet — Stepan's favorite string. The length of this string doesn't exceed 2500 symbols. Print the minimum number of strings which Stepan should take from the set and write them down one after another so that the string s appears as a subsequence in the resulting written down string. Each string from the set should be counted as many times as Stepan takes it from the set. If the answer doesn't exsist, print -1. Sample Input 3 a aa a aaa 4 ab aab aa bb baaab 2 aaa bbb aaacbbb Sample Output 2 3 -1	{"inputs": ["3\na\naa\na\naaa", "4\nab\naab\naa\nbb\nbaaab", "2\naaa\nbbb\naaacbbb", "4\naab\naa\nbb\naba\nbaaab", "2\naaaaaaaa\nabbaaaaaaa\nbbbbbbbbbabbbbbbbbbbbbbbbbbbbbabbbbbbbbbbbbbbbbbbbbbbbbabbbbbabbabbbbbbbbbbbbbbbbbbbabbabbbbababbbbbbbbabbbbb", "1\nlol\nlol"], "outputs": ["2", "3", "-1", "2", "52", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
f469a19052b871efa652018267416bc5	Regular Bracket Sequence	A bracket sequence is called regular if it is possible to obtain correct arithmetic expression by inserting characters «+» and «1» into this sequence. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not. One day Johnny got bracket sequence. He decided to remove some of the brackets from it in order to obtain a regular bracket sequence. What is the maximum length of a regular bracket sequence which can be obtained? Input consists of a single line with non-empty string of «(» and «)» characters. Its length does not exceed 106. Output the maximum possible length of a regular bracket sequence. Sample Input (()))( ((()()) Sample Output 4 6	{"inputs": ["(()))(", "((()())", "(", ")", ")(()(", "))))))(", "()()(()(((", "()))(()((((()(())", "())))((()())())))))())", ")))((((())(()((()((((()()())((", "))()()((()()))())()(((((((())((((((((())()()((())(", "))())))))))())))))()()))()()))))())))))()))))))))))))(()))())(()))))(()))))())))((((()()))))()))()))"], "outputs": ["4", "6", "0", "0", "2", "0", "6", "10", "14", "16", "32", "48"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	207	codeforces
f46e2bd58d7931a2564157375a75ebe5	Pasha and Stick	Pasha has a wooden stick of some positive integer length n. He wants to perform exactly three cuts to get four parts of the stick. Each part must have some positive integer length and the sum of these lengths will obviously be n. Pasha likes rectangles but hates squares, so he wonders, how many ways are there to split a stick into four parts so that it's possible to form a rectangle using these parts, but is impossible to form a square. Your task is to help Pasha and count the number of such ways. Two ways to cut the stick are considered distinct if there exists some integer x, such that the number of parts of length x in the first way differ from the number of parts of length x in the second way. The first line of the input contains a positive integer n (1<=≤<=n<=≤<=2·109) — the length of Pasha's stick. The output should contain a single integer — the number of ways to split Pasha's stick into four parts of positive integer length so that it's possible to make a rectangle by connecting the ends of these parts, but is impossible to form a square. Sample Input 6 20 Sample Output 1 4	{"inputs": ["6", "20", "1", "2", "3", "4", "2000000000", "1924704072", "73740586", "1925088820", "593070992", "1925473570", "629490186", "1980649112", "36661322", "1943590793", "71207034", "1757577394", "168305294", "1934896224", "297149088", "1898001634", "176409698", "1873025522", "5714762", "1829551192", "16269438", "1663283390", "42549941", "1967345604", "854000", "1995886626", "10330019", "1996193634", "9605180", "1996459740", "32691948", "1975903308", "1976637136", "29803038", "1977979692", "1978595336", "27379344", "1979729912", "1980253780", "1980751584", "53224878", "5", "7", "8", "9", "10", "11", "12", "13", "14", "15", "16", "17", "18", "19", "21", "22", "23", "24", "25", "26", "27", "28", "29", "30", "111", "55", "105", "199", "151"], "outputs": ["1", "4", "0", "0", "0", "0", "499999999", "481176017", "18435146", "481272204", "148267747", "481368392", "157372546", "495162277", "9165330", "0", "17801758", "439394348", "42076323", "483724055", "74287271", "474500408", "44102424", "468256380", "1428690", "457387797", "4067359", "415820847", "0", "491836400", "213499", "498971656", "0", "499048408", "2401294", "499114934", "8172986", "493975826", "494159283", "7450759", "494494922", "494648833", "6844835", "494932477", "495063444", "495187895", "13306219", "0", "0", "1", "0", "2", "0", "2", "0", "3", "0", "3", "0", "4", "0", "0", "5", "0", "5", "0", "6", "0", "6", "0", "7", "0", "0", "0", "0", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	381	codeforces
f48a1384754b692e29f1b10ca139a643	none	You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x,<=y), where gcd denotes the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor). What is the minimum number of operations you need to make all of the elements equal to 1? The first line of the input contains one integer n (1<=≤<=n<=≤<=2000) — the number of elements in the array. The second line contains n space separated integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the elements of the array. Print -1, if it is impossible to turn all numbers to 1. Otherwise, print the minimum number of operations needed to make all numbers equal to 1. Sample Input 5 2 2 3 4 6 4 2 4 6 8 3 2 6 9 Sample Output 5 -1 4	{"inputs": ["5\n2 2 3 4 6", "4\n2 4 6 8", "3\n2 6 9", "15\n10 10 10 10 10 10 21 21 21 21 21 21 21 21 21", "12\n10 10 14 14 14 14 14 14 14 14 21 21", "5\n10 10 14 21 21", "9\n10 10 10 10 10 14 14 21 21", "9\n10 10 10 10 10 10 10 10 21", "13\n10 10 10 15 15 15 15 15 15 15 15 21 21", "15\n10 10 10 10 10 10 10 10 10 10 10 10 15 15 21", "4\n1 1 1 1", "1\n3", "2\n1 1", "2\n1000000000 1000000000", "1\n1000000000", "1\n1", "3\n42 15 35", "3\n6 10 15", "4\n2 1 1 1", "5\n2 1 1 1 2", "3\n30 14 21", "3\n15 6 10", "4\n1 1 1 2", "5\n1 1 1 2 2", "4\n2 6 9 1", "6\n2 3 4 1 1 1", "15\n2 6 6 6 3 3 3 15 5 5 5 7 5 5 5", "5\n2 3 2 6 9", "6\n6 15 10 6 15 10"], "outputs": ["5", "-1", "4", "15", "20", "6", "11", "9", "21", "17", "0", "-1", "0", "-1", "-1", "0", "4", "4", "1", "2", "4", "4", "1", "2", "3", "3", "15", "5", "7"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	91	codeforces
f49929c441933b89f099ad18f063b303	Two TVs	Polycarp is a great fan of television. He wrote down all the TV programs he is interested in for today. His list contains n shows, i-th of them starts at moment li and ends at moment ri. Polycarp owns two TVs. He can watch two different shows simultaneously with two TVs but he can only watch one show at any given moment on a single TV. If one show ends at the same moment some other show starts then you can't watch them on a single TV. Polycarp wants to check out all n shows. Are two TVs enough to do so? The first line contains one integer n (1<=≤<=n<=≤<=2·105) — the number of shows. Each of the next n lines contains two integers li and ri (0<=≤<=li<=<<=ri<=≤<=109) — starting and ending time of i-th show. If Polycarp is able to check out all the shows using only two TVs then print "YES" (without quotes). Otherwise, print "NO" (without quotes). Sample Input 3 1 2 2 3 4 5 4 1 2 2 3 2 3 1 2 Sample Output YES NO	{"inputs": ["3\n1 2\n2 3\n4 5", "4\n1 2\n2 3\n2 3\n1 2", "4\n0 1\n1 2\n2 3\n3 4", "3\n1 2\n2 3\n2 4", "3\n0 100\n0 100\n0 100", "1\n0 1000000000", "2\n0 1\n0 1", "3\n2 3\n4 5\n1 6", "5\n1 3\n1 4\n4 10\n5 8\n9 11", "3\n1 2\n1 2\n2 3", "4\n1 100\n10 15\n20 25\n30 35", "3\n1 8\n6 7\n8 11", "5\n1 2\n3 5\n4 7\n8 9\n5 10", "4\n1 7\n2 3\n4 5\n6 7", "4\n1 100\n50 51\n60 90\n51 52", "3\n1 10\n2 9\n3 8", "2\n0 4\n0 4", "2\n0 2\n0 6", "5\n3 4\n21 26\n12 17\n9 14\n15 16", "5\n1 4\n13 15\n11 12\n9 15\n2 5", "4\n16 19\n9 14\n14 15\n15 19", "5\n16 19\n23 29\n3 8\n23 26\n22 23", "5\n19 23\n12 17\n16 21\n20 23\n8 10", "5\n8 10\n4 10\n3 4\n14 15\n17 19", "3\n2 8\n5 7\n6 7", "5\n10 12\n4 6\n21 24\n9 12\n7 13", "5\n0 3\n14 16\n6 8\n5 9\n9 15", "5\n6 12\n23 25\n6 7\n19 25\n10 11", "5\n15 18\n23 24\n23 28\n22 24\n15 19", "4\n1 8\n8 9\n5 7\n1 4", "3\n6 10\n1 9\n2 5", "3\n1 8\n5 6\n6 9", "4\n2 3\n5 9\n8 10\n9 10", "4\n0 8\n6 7\n5 9\n1 4", "3\n6 9\n0 1\n0 2", "5\n0 6\n21 25\n18 19\n0 3\n6 12", "4\n1 5\n6 9\n4 8\n1 3", "2\n2 5\n0 5", "4\n5 8\n11 15\n3 7\n10 14", "3\n12 14\n0 4\n2 3", "4\n4 10\n0 1\n2 10\n0 5", "4\n0 3\n0 1\n2 4\n2 5"], "outputs": ["YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	81	codeforces
f4a2baf1989ae44e47e1d466007d7165	Contest Balloons	One tradition of ACM-ICPC contests is that a team gets a balloon for every solved problem. We assume that the submission time doesn't matter and teams are sorted only by the number of balloons they have. It means that one's place is equal to the number of teams with more balloons, increased by 1. For example, if there are seven teams with more balloons, you get the eight place. Ties are allowed. You should know that it's important to eat before a contest. If the number of balloons of a team is greater than the weight of this team, the team starts to float in the air together with their workstation. They eventually touch the ceiling, what is strictly forbidden by the rules. The team is then disqualified and isn't considered in the standings. A contest has just finished. There are n teams, numbered 1 through n. The i-th team has ti balloons and weight wi. It's guaranteed that ti doesn't exceed wi so nobody floats initially. Limak is a member of the first team. He doesn't like cheating and he would never steal balloons from other teams. Instead, he can give his balloons away to other teams, possibly making them float. Limak can give away zero or more balloons of his team. Obviously, he can't give away more balloons than his team initially has. What is the best place Limak can get? The first line of the standard input contains one integer n (2<=≤<=n<=≤<=300<=000) — the number of teams. The i-th of n following lines contains two integers ti and wi (0<=≤<=ti<=≤<=wi<=≤<=1018) — respectively the number of balloons and the weight of the i-th team. Limak is a member of the first team. Print one integer denoting the best place Limak can get. Sample Input 8 20 1000 32 37 40 1000 45 50 16 16 16 16 14 1000 2 1000 7 4 4 4 4 4 4 4 4 4 4 4 4 5 5 7 14000000003 1000000000000000000 81000000000 88000000000 5000000000 7000000000 15000000000 39000000000 46000000000 51000000000 0 1000000000 0 0 Sample Output 3 2 2	{"inputs": ["8\n20 1000\n32 37\n40 1000\n45 50\n16 16\n16 16\n14 1000\n2 1000", "7\n4 4\n4 4\n4 4\n4 4\n4 4\n4 4\n5 5", "7\n14000000003 1000000000000000000\n81000000000 88000000000\n5000000000 7000000000\n15000000000 39000000000\n46000000000 51000000000\n0 1000000000\n0 0", "2\n100 150\n5 100000", "9\n4 70\n32 56\n32 65\n77 78\n5 29\n72 100\n0 55\n42 52\n66 72", "3\n1 2\n12 19\n25 45", "5\n2 23\n1 13\n3 9\n0 20\n6 7", "10\n19 22\n10 77\n3 52\n16 42\n25 67\n14 42\n44 85\n37 39\n36 62\n6 85", "15\n143 698\n269 879\n100 728\n86 855\n368 478\n174 368\n442 980\n812 825\n121 220\n137 198\n599 706\n423 586\n96 647\n177 439\n54 620", "3\n1000 1000\n1001 1001\n700 1000000", "5\n4 100\n10 11\n10 11\n3 3\n3 3"], "outputs": ["3", "2", "2", "1", "7", "3", "3", "4", "9", "1", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	5	codeforces
f4dc21b1bc1016c05753a806dc7c6a21	Office Keys	There are n people and k keys on a straight line. Every person wants to get to the office which is located on the line as well. To do that, he needs to reach some point with a key, take the key and then go to the office. Once a key is taken by somebody, it couldn't be taken by anybody else. You are to determine the minimum time needed for all n people to get to the office with keys. Assume that people move a unit distance per 1 second. If two people reach a key at the same time, only one of them can take the key. A person can pass through a point with a key without taking it. The first line contains three integers n, k and p (1<=≤<=n<=≤<=1<=000, n<=≤<=k<=≤<=2<=000, 1<=≤<=p<=≤<=109) — the number of people, the number of keys and the office location. The second line contains n distinct integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — positions in which people are located initially. The positions are given in arbitrary order. The third line contains k distinct integers b1,<=b2,<=...,<=bk (1<=≤<=bj<=≤<=109) — positions of the keys. The positions are given in arbitrary order. Note that there can't be more than one person or more than one key in the same point. A person and a key can be located in the same point. Print the minimum time (in seconds) needed for all n to reach the office with keys. Sample Input 2 4 50 20 100 60 10 40 80 1 2 10 11 15 7 Sample Output 50 7	{"inputs": ["2 4 50\n20 100\n60 10 40 80", "1 2 10\n11\n15 7", "2 5 15\n10 4\n29 23 21 22 26", "3 10 1500\n106 160 129\n1333 1532 1181 1091 1656 1698 1291 1741 1242 1163", "5 20 1\n314 316 328 323 321\n30 61 11 83 19 63 97 87 14 79 43 57 75 48 47 95 41 27 8 88", "20 20 1000000000\n911196469 574676950 884047241 984218701 641693148 352743122 616364857 455260052 702604347 921615943 671695009 544819698 768892858 254148055 379968391 65297129 178692403 575557323 307174510 63022600\n1621 106 6866 6420 9307 6985 2741 9477 9837 5909 6757 3085 6139 1876 3726 9334 4321 1531 8534 560", "40 45 1000\n6 55 34 32 20 76 2 84 47 68 31 60 14 70 99 72 21 61 81 79 26 51 96 86 10 1 43 69 87 78 13 11 80 67 50 52 9 29 94 12\n1974 1232 234 28 1456 626 408 1086 1525 1209 1096 940 795 1867 548 1774 1993 1199 1112 1087 1923 1156 876 1715 1815 1027 1658 955 398 910 620 1164 749 996 113 109 500 328 800 826 766 518 1474 1038 1029", "50 55 2000\n9518 9743 9338 9956 9827 9772 9094 9644 9242 9292 9148 9205 9907 9860 9530 9814 9662 9482 9725 9227 9105 9424 9268 9427 9470 9578 9808 9976 9143 9070 9079 9896 9367 9235 9925 9009 9619 9012 9669 9077 9870 9766 9479 9598 9055 9988 9792 9197 9377 9610\n828 656 345 412 69 506 274 994 384 766 587 126 720 227 66 839 997 602 646 955 256 262 243 676 459 83 507 88 559 595 71 154 867 276 487 895 857 888 368 179 813 407 973 780 588 112 815 290 554 230 768 804 974 3 745", "1 1 1\n1\n1000000000", "1 1 1\n1000000000\n1", "1 1 1000000000\n1000000000\n1", "1 1 1000000000\n1\n1000000000", "2 2 4\n3 4\n5 6", "2 2 5\n1 2\n3 1000000000", "1 1 1000000000\n1000000000\n1", "2 2 1\n2 3\n4 100", "2 2 10\n3 12\n1 9", "3 3 1\n1 2 3\n999 1000000000 1", "1 1 1\n1\n1", "1 1 1\n1\n1000000000", "1 1 1000000000\n1000000000\n10", "2 2 7122\n123 456\n1 4444", "1 1 10\n5\n15", "2 4 1000\n1000 999\n1 1000 2 999", "2 2 1000\n10 1010\n1 1001", "1 1 1\n2\n1000000000", "2 2 3\n1 5\n5 1", "2 2 5\n2 3\n4 6", "2 2 10\n5 6\n4 6", "3 4 10\n5 7 9\n6 8 14 4", "1 1 10\n10\n10", "1 1 50\n1\n1000000000", "1 1 42\n666\n1337", "2 2 10\n9 11\n11 8", "3 10 5\n1 2 3\n10000 9999 9998 9997 9996 9995 9994 7 6 5", "1 1 2\n1\n1000000000", "2 2 100\n99 150\n1 150", "3 3 4\n1 101 102\n2 3 100"], "outputs": ["50", "7", "23", "1394", "327", "1984199027", "2449", "10833", "1999999998", "999999999", "1999999998", "999999999", "4", "1999999993", "1999999998", "196", "11", "1999999996", "0", "1999999998", "1999999980", "7243", "15", "1", "1008", "1999999997", "2", "4", "7", "7", "0", "1999999949", "1966", "3", "6", "1999999997", "197", "99"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	25	codeforces
f4f8a3dbed3bce393863f09f59c5e587	none	You are given a string s, consisting of small Latin letters. Let's denote the length of the string as \|s\|. The characters in the string are numbered starting from 1. Your task is to find out if it is possible to rearrange characters in string s so that for any prime number p<=≤<=\|s\| and for any integer i ranging from 1 to \|s\|<=/<=p (inclusive) the following condition was fulfilled sp<==<=sp<=×<=i. If the answer is positive, find one way to rearrange the characters. The only line contains the initial string s, consisting of small Latin letters (1<=≤<=\|s\|<=≤<=1000). If it is possible to rearrange the characters in the string so that the above-mentioned conditions were fulfilled, then print in the first line "YES" (without the quotes) and print on the second line one of the possible resulting strings. If such permutation is impossible to perform, then print the single string "NO". Sample Input abc abcd xxxyxxx Sample Output YES abc NO YES xxxxxxy	{"inputs": ["abc", "abcd", "xxxyxxx", "xxxjddyxduquybxdxx", "jjjjjjjjjjzjjjjjjjjjjjjjjjj", "mggnngggnjgnggggngnggpnggumggpg", "hfihihhfh", "ppppppopppionpppppppppwppppppppppppppppppppppb", "jntnnnnnnngnnnnntnnennannnnnnnnnnnnnnnnjnnnnngnnnnannnnnnnnnq", "dattqddidyddddmriftkdddddddddqvedwddfdrdiaddiokdddodyqqddddtdddvdddaodd", "qqqqqqqqqqqqqqqqqqqqzqqqzqqqqqqqqqqqqqzqqqqqqqqcqqzqqqqqzqqqqqqqqqqqq", "danmwkmkcekwkkekwugcqwfrkrkqowkakqinzkzksisekhmqtykkuhugknygvkkrhdhnuuf", "jjjjjjjjjjjjjjjjjjjnjjjjjjjujjjjjjjjjjjjjjjjjjjjmpjjjjjjjjjjpjmjmpjjjjpjujjjjjjjjpjjjjjjujjjjjjnjjjjjjj", "qqqqqqqqqqsqqqqqqqqqqqqgpqqqqqqqbqqqqqqqqqqqqqqqqqqqqpqqqbqqqqqqqqqqqqqqqqqwqqqqsqqzqzqoqqqqqqqqqqwqqpqqqpq", "uupwbpqnpwpcpppewppdsppiplpppwidplpnqblppppppwsxpplxpxlppikpewxppnlbkpppqecbpeppqupsepppqpneqnpexpbqcpqpccnple", "nnnnnnnnnnnnjonnnnnnnnnnnnnnnnnnnnnnnndnnnnnnnnnnnnnnjnnnnnnnnnnnnnnnnndfnnnnnnnnnnnnnnnnnnnnn", "ssjjvshvssjdjnsdhvsjneehnnsshlldhjshdvsssshvsndsvsshlssvssvveslhllssshesssjsvvlsesssnselhjlljldlvnnshvsedllsennnnjssnsnsdsv", "cccccccccccxccgccccccccccgccciccccicccgccccccccccccccccxcccccccccccycccccccccctcccccccccccccccccccctccccaicccccgccccccccccccccccccccccaicccccccc", "httttfttttttttttthttttttttttthtttttutttttttttttsjttttttttutttttajdttttttytttttuttttttattttttttttttttttttttttdttttttttttttttttttttttttttattttttsttttttfttttttt", "wwwiuwujwijwwwwwwwwwwdwwwwhwwwwwiwwwwwwwwwuwwwhwwwjwwwwwwhwwwwwwwwniwwiwwwwwwwwwwwwwjwwwwwwwhwwwuhwwojwwwwjwwuwwwwwwwwwwiwwwwnwdwjwwwwwwwnwwwwh", "kkkkkkokkkkkkokkkkkokkkkkkkxkkkkkkkkxkkkkkkkkkkkkkkkkkkkkkjkkkkekokkkkkkkkkkkkxkkkkokkkkkkkkkkkkkkkkkokkkkkkkkkbkkkkkkekkkxkkkkkkkkkkkkkkjkkkkkkkkkkkkkxkkkkkkkkkkkkkkkkkkkkkkkekkkkk", "ouscouyvvoooocvokcuoovoooyorjyocosackfocooaoosaucooaojhacoooooorsruocorokufcvyjokoooproaroocjooyrkoorojsocfooskxujoxxpokoopyookooysofooovuoroxraofokupcpjrcokoxucskovoaokoocyoyoovfrovouoocvsc", "ssssssssssssssssupsssssssqsssssssssssssssssssssssssssssssssssssassssssssssssssssssssssacssshsssssssscssssssssssspsssssslsgssssssslssssssdsasssessssssssssscssssbsszssssssssssssssssssossstsssssssssssssshs", "uuuuuuuuuuuuouuuuuuuuuuuuuuuuuuuuuuuucuuuuuuuuuuuuuuuuyuuuuuwuuuduuuuuuuuuutuuuuuuuuuuuuuuuuuuuuuuuuwuuuuquuuuuuuuuuuuuuuuuuuuuuuujumuuuuuutuuuuuuuhuuuuuuuauecuduuuuuuuuuuuuuuuuujusuuiuuuuuuuuuumuuyujuu", "hlchxdgrkdxglihydlyqdgxggvdhdgrgigkugrqhhgpgxhyhgkcgyqildrpcvdlpggikrxggculgyudrrgvkycvgklldxkgggxlxvqgrgygpigcudhidgcigyqqhyxkgdxixglpgdxuxhlyxkidglriglkvgyckqrqvguclryvpyvdggluggcgkillcghdxkrhdglgcxgxicrkgkpugvkhliqyii", "hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhjhhhhhhhhuhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhjhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhjhhuhhhhhhhhhhhhhhhjhhhhhhhhhhhhhhhhjhhhhhhhuhhuhhhhhhhhhhhhhhhhjhhhhhhhuhhhhuhhhhhhhhhhhhhjhhhhhhhh", "hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh", "uuuruuuuuuuuuuuuuuuuuuuuuuuiuuuuuuuuuuuuigzuuuuuuuuuuuguuuuuuouuuuuuuuuuuuuuuuuuuuuguuuuuuuzuueuuuuuuuuuuuuuufuuaouuuxuuuuutuuuuuuuuuuuuuuuuuuuuuuuuuuuulluuuutuuduuuuuuuujuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuupuruuouuuuuuuuuuuuuuuuuuuuqauu", "kkkmkkkkkkkymkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkdekkkkkkkkkkhrkkkkkkkkkkkkkkkkkkkkkxkkkkkokkkkikkkkkkkkkkkkkkkkkkkkkkkkkkkkkxkkfkkkkkkkkkkkkmkkkktykkkkkkkkkkkrkkkkkkrbekkkkkkkkkkkkkkkkkkfkskkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkykkkkkkkkkkkkkkzykkkkkkkkkkkmbkkkkkkkkk", "rrrvjurvrrsukrsrvxskrrrrbrapyrmrmvprmrseuakrmrnvokshwoawhnrbrrvrynwrynrxurrmprmmsryvkvronrmrprsrsrrrrrvwrarfrrrusrsvemwrevrarbwrmrrkhrryrhxornrorrrrrraphrvvhrrkrrfrprvorkkrsurpwvrkexpavbpnksafrrebxxyhsyrsywrrrrraryprunaxkbvrauokrrwrkpwwpwrrhakrxjrrxerefrrnxkwabrpbrrwmr", "mmmmqmmmmmmmmmmmmmmlmmmmmmmmammmmmmmmmmmmmmmmmmmmmmmmmmmmmmmtmmmmmmmmmmimmmmmmmmmmmmmmmmmmammmmimmmmmmmmhmimmmomlmmmmmammmmmmmmmmmmmmmmmmimmmmlmmmmmmmimmmhmmmmmmmmmmmmmmmmmmmlmmmmmmmmmmmmmmhmmmmmmmmmmmmmmmtmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmotmmmmlmmmmmmmmmqmmmmmmmmmmmmmmmmmm", "mmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmymmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmm", "zzzzzzzzzzzzzzrzzzzbmzzzezzzzzzgzzzzzzzzzzhzzzzgzzzxzzzznzzzzzyzzzzzzzzzzzxzzzzzzzzzzzzzzzizzzzzzzzzzzzzzzzzzzzzzuzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzmzzzzzzzzzzzzzzzzzzzzzhzzzzzyzzzzzzzzzmzzfzbzzuzzzzzzzzzzzzzzzzzzzzzzzozzzzzzzyzzzzzzzzbzhzzzzzzzzzrzzzzzzyzzzzzzzzzzzzzzzzzzzzajzzzzz", "bbbbbbbbbcbbbbbbqbbbbbkbbbbbbbbbbbbbvbsbbbbbebbbbbbbbbbbbbbbbbbbbbbbcbbbkbvbbbbbbubbbbbbbfbbbbbbbbbbbbbbbbbbcbbbbbbbbbbbbbbbekkbbbbbbbbbbbbbbbbfbqbbbbbbbbbfbbebbbbbbbbbbbbbbbbbbbbbbbbbeebbbbbbbbbbbbbbbeubbbbbbbbbbbqbbbbbbbbbbbbbbbbbbbbbbbbbbfbbbbbbbbbbbbbbbbkbebbbbbbbbbbbbuvbbbbbfbbbbbbbbbbbbbbbbbbbbbbbbbbbbcbbb", "wtwwttwttwwwwwwwwtwtwwwwwtwwtwwtwwwwwtwtwtwtwwtwwwtwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwtwwwwwwwwwwwtwwwwwtwttwwwwtwwwwwwwwwwwwwwwwwtwwwwtwwwwwwwwwwwwwttwtwwwwwtwwtwwwwwwwtwwttttwwwwwwwwwwwwwwwwwwwtwwwttwtwwtwwtwwtwwwwtwwtwtwwtwwwwwwwwwwtwwww", "xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "koadaaaaarnaavmmavimdolavaaovkaaabalaavabaolarkewawaavaaaaiaaalaaeaaenaobaamaaikaiaabaavaeenlaaaaaadaoaaaaaaaiekaebavvwaaabiobaadavaiaaviaaaadaaaamarakmaaakaeavwlaaeanaaanaaaaaakllovwnenvlakaiomaaaaaaamaainebaeakaaaaaalraiaallaannammaaamaaaaeeaaiawaabvaaealaermaobaavreaaaaakavrvdaawaraedaaaaawiaeoaaaadaaaaavvadaaaoaaeewokbaaaeaaamaabdaaama", "oooooooocooocooooooooooooooooooooooooofoooooooooooooovoooozoooooooooqoooooooooooooooooooooooooooooooooxooovoooooooocoooooxooobooczoooooooooqooooooooooooooooocooooeooooooxoooooooooooooooooozooooooooooooooooooxoopooooocooobooooooooooooooooloooooooooooooooooooobooooelooooooooooooooooooooooooxooiooooooooooopooboooooooooooooooooooooolooooooooooooooooooooo", "bbbbbbzbbbbbbbbbbgbbbbbbbbbbbpbbbbbbbbbbbbbbbbbbsbbbbbbbbbbbbbbbbbbbbbbbbmbbbbbbbobbbbbbbwubbbrbbbbbbbbbbbbbbbubbbbbbbqobbbbdbbbbbbbbbbrbbbbbbbbbbbbbbbbbbbbbbbbbbbxbbbbbbbbbbbbbbbbbbdbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbobbbbbbbbbibbbbbbbbbbgbbbbebbybbbbbbbbbbbbbbbabbbbbbbbbybiybbbbdbbbgbebbbbbkbbbbbbnbbbbbbbbbbbbbbbbbbbbbbbsbbbbbbbbbbbbbbbtbbbbbbbbbpbbb", "llvlluelllllllllzllnndluelllhdunlnlllllhnbhldllelllllhllleulunvlldlllllbepellpzulbulllelllvblllulllllllllezpllhldellzldlllllllelllhlllehllvevlnullllvllllpudldlllvdbllllhnvlllllvllvllvlllplelzplpzllllulzlbllzldevlullelllhhzdeulllllllllnlzvllllllbllvllllllllluellnlllulnllllbdlevlhlvllllpenblvzlzlllblvhllllhllllpeblevelpllllnpbhlhllbllllndllblldvn", "zzzzzzzzzzzzzzzzzzzzzzzzzzzozzzzzzzzzzzzzzzzzzzzzzzzozzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzozzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz", "lsllllmllllslllxlvlxluyylllslllmlllvllxllslllvlslyulllullllllmlxulllyxlllmlllllvullllllslllsmlllxmllvvlslllllllllllulllvlllllllmllllsylylvluylllmullslllllvylmmlluyllvlylllllllllllvllllsmlxlslmlllxxslllmyluvylylllllxmxlulsslslmllulxllmllxuusllllumlllllmsssmxullllmsllllmlxxllmllllylvllmlluymxlllllslyxllvlllllllllllllllsllullmlllllslllsllullslllllllllllvyllllvlllylllsllvlvsmlvllllllulullllllslxlml", "cccjcchccccccjcccccccjlccccccccccccchccccwccctccccccccccccccccczccccccccccccccccccccccccccccccccccccccnwcccccccccccccccccccoccwcccccccccccwccccccccccccccncdccccbcctcccccccccccccccccccccccxccccccvcccnccccbccccccccccccccccccccccclccccccccczccvccccccvscccccccccxccccocccccccscccccccccccccxvccccccccccccccccccccccccccccccccccccccccccccccxccccccccccccwccccccchccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc", "uuuuuuuuuuuuuuuuuuuuuuuuuuquuuuulquuuuuuuouuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuouuuuxouuuuuxuuuuuuuuuuuuuuuuuuuuuuuxuuuuuuruuuuuuxuuuuuuuuuuuuuuuuuuuuuuuzuuuuuuuuuuuuuuupuuuuuuuuuuuuuuuuuuluuuuuuuuuuuuuuuuuuuuuuuuuuuuuurluuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuxuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuruuuuuuouuuquuuluuuuuuuuupuuouuuuuuuuuuzuuuuuuuokuuluuuupuuukuuuuuruuuuuuupuuuuuuuuuuuuzuouuuuuuuuuuuuuuuz", "vkxvxkxvxxxkkvkxvkkxvvvvvvvvkkvkkxvvkkvkkvkkvxxvxvvvvkvkvvxvvxvxvvvkvxkkxkxxkxxkxvxvvxvkvvxvkvkvkxkxvxkvvkvxkxkvkxvxvxxxxxvxxvxxxkkvvvvkkvvvxxkxkvvkxvvxkkkvkvvkvvvvxxxkxxxvvvkxkxvkvxxkxkxkxkvvxxkkkkvxxkvkkxvxvxxvxxxxvvkvxkxkxvkkvxxvxkvvkxkkvxvkkkkkkxkxkvxkkkxxxxxxxvxkxkkvxkkxvkvkkvkkkxvkvkvkvvxkkkxxvxxxxxvkvvxkvvvxvxvkkvvvxkvkxkvxxkvvkxvvxkxxkxkkkvxkxxvkkkxxkxxxvxkxkkkvkkxxxvvkkvvkvkkkxkvxkxxxvkvxvxxkvkxkvkxvxvvxvxxkkkxxkkkkvvvv", "gggggggggggqggggggggnqggggggepgggeggggpggqeggggegggggggggpggggggggggggggggggggggggggggggggggggggggggggggggggggggggggghggqghgggggggggggggggggggggggqgqggggghgggnnggggggggggggggggqgggggpgggggggggggnggggpggggggggggggggggggggggggggggggggqgggqggggggggggeegggggggggggggggggggggngggggghqggggggggggggggggggggggggggggggepggggggggghgggggggggggggggggggggggggghggggggghgggnhgggggggggpggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggg", "pynyyyyypyyyfyyyyyyyvoyyyyvyyyldyyyyyhyyvyyyyyyyyyyyyoyyppyyyyyyywyyysyyyyayyyayyyyyyyoyyyydyyyyyavyyygiyyhfyyyyyyyyyyzyyyysyyyyicyyyyyyycjyyhykyiyykkyylyyyyiyyyyyyyyifyyyyyyyzyyyyyiyyryykyyyhzyydryyyysyyyyyyyyyyyyyaybyyyoyyyykyyyyyyyyyyncyyyyvryyjyyyyqyyfbyyysyyqypyydyyyyyyyyyyyqyywjyyyyyayyyyyyyyyjyyyyyyyyyyyyaygyyypyyyyyayyyyyyyoyyyyiyyyyyiyyyyyjoyykyyyyyyyyyyyyyyyyyyyyyohyyyyvyykyybiyyyyyyyyyyyyyyyyyyyyyyyfyyyyyyyyyyyyyyyyvyyyyyyy", "bbbbbbbbbbbbzqbbbbibbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbibbbbbbbbbbbjbbbbbbbbbbbbbbgbbbbbbbbbbzebbbbbvbbbbbbbbbbbbbbbbbbbbbbbbtbbbtbvbebbbbzvbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbibbbbbbqbqjbbpbbzbbbbbbbbbbbbbbbbbbbbbbbbbbbebbbbzbbcbbbbbbbqbbbvbbbbbbbbbbbbbbbbbbbbpbbbbbbbbbbbgbbbbzbbbbbbbbbbbbjbbbbbbbbbbbbbbbbbbbbbcbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcbbbbebqbbbbjbbbbbbbbbbbbbbbbbbbbbbbbtbbbbbbbbbbbbbbbbbbbbbbbbbbbbqbbbbbbbbbbbbbbbibbbbbbbbbbbbbbbbbzb", "tsssshssusssssssssssusssspssssssssssssssssssssssssssssssvsssssssssssssssossssvssssssssssysssssscsssssssussfsssssssszssssssssfssssssssssssssssssssssswssssssssdsssssssssssussssssessmssssssssssjsssssvsssssssssssssssssssssssssssssssssssssssssssssssstssssssssrsssssshssssssssssssssssssssssssssssusssssssssssssssssssssssssssssssessscssrssssssessssssslwwsssssssssssusssscsssssssssssssswssssssssssssssessssstssssssstsshsssssssssssssssssssssisssssssssssssssssssssssosssssswsss", "fkfffffffvfkfoffffqoqqffaftftvfuffjffffffffoflftvfffgffffffzfrvfocfmfkmjfftfmfwafzfffajsfffalguvjdfftfndfcnfjfgfffoofoflnffffffofdiczffajffdifrffffffrffffnifofffifdffvgffvoffwbfkfqfsfwfmwcfrkzuzokufmffffffcfffqfzfoffonfnfffkfffkwqifffsfifffzfofofffrfffflftkkfvfffbffuwffjtffmfffaffdlznffjllfqgfffffffffdmlfwlabfblcfdfwffffbfvmfrifwvvffffzffbfafnsffantfrkffzffffffifffrwacfrffffsdfffkffffooaffqckqbnbqqofvafffrtgffwsmfngffbzfffgffofnflfffvrffffmjjkfvfcfccfqfjfnf", "xxxxxxxxxxfxxxxxxxxxxxxxxxxxxxxxxxxxxxrxtxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxexxxxmxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxexxxxxxxxixxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxtxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxuxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxpxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxoxxxxxxxxxxxxxxxxxxxxxxxxxxaxxxbxxxxxxxxxxxxxxxxxxxxxxxxxxxbxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxsxxxxxzxxxxxxxxxxxxxxxxxxxxxxxxxhrxxnxxxxxxxxxxxxxxxxtxxxxxxxxxx", "vtvzvlvlzvrtevdvvvsvjyvwrwwjhovvtotvkvvvvvovvewlvrvvfsvvvvnvfcsvvvtcrmckvvvztvvlvvdyfvcylvhvvcvvvvrvhwvryvhmvvcnsozusvltocvvywvvsvvvdocoftvkvvzvvtnvcmevyvhvhvlovvvvlvvvvtdjcvvvyvvurvuovusvvwvrvtvvfvmvvvmnycnvmvovuzvzvvvjvvvvnvvdrvvcrrvfvzujvyvtmrucvvvcjuvrvvtukvvvlvrkhvvsvjvftvzvmvvunsweuzcvvvfrvrwhyvdjerltlvcvvzednvyvjkvktvvesovvvmkvvnvzvjvcvfwvzhfkvvvuvvduovvmevkvhvuvmnvnvvvvvuvvlfjtjmdvceslvmevvvjvvkvvkjnvfyseevmvlvzvvvvvfdvleuvvlvvyvmrmvvfsevovhzdrru", "mmmmmmmmmmmmmmmmmmmmmmmmmsmmmmmmmmmmmmummmmmummmmmmmmmmmmmmmsmmmmmmmmmmmmmmsmmmmmmmmmmmmmmmmmmmmmsmmmmmmmmmmmmmmmmrummmmmmmmmmmmmmmmmmmmmmmmmmmmmsmsmmmmmmmrmmmmmmmmmmmmmmmmmmrmmmmmmcmmsmmmmmmmmrmmmmmmmmmmmmmmmmmmmmmmummmmmmcmmmmmmmmmmmmmmmmmmmcmmmmmmmrmmmmmmmmmmcmmmmmrurmmmmmmmmmmmmmummmmmmmmmmmummmmmmsmmmmrmmmmmmmmmmmmmmcmmmmmmmmmmmmmmmmummsmmmummmmmmmmmrmmmmmmmmmmmmummummrmmmmmmmmmmmmmmmmmmmrmrmmmmmmmmmmmmmmummmmmmmmmmmmmsmmmmmmmummmmmmmmmmmmmmmcmmmmmmmmmmmmmmmmmmmmmm", "z"], "outputs": ["YES\nabc", "NO", "YES\nxxxxxxy", "NO", "YES\njjjjjjjjjjjjjjjjjjjjjjzjjjj", "NO", "NO", "YES\nbpppppppppppppppppppppppppppipnpppppopppopwppp", "NO", "NO", "YES\ncqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqzqqqqqzqqqqqzqzqqqqqzqq", "NO", "YES\nmjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjmjjjjjmjnjjjjjnjjjpjpjjjjjpjjjpjjjjjpjjjjjjjujjjuju", "NO", "NO", "YES\ndnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnndnnnnnfnjnnnnnjnnnnnnnnnnnnnnnnnnnnnonnnnn", "NO", "YES\nacccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccacccccgcccgcccccgcccccccgccciciccciciccctccccccccccccctcccxcccccxcyccccc", "NO", "NO", "YES\nbkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkekkkekekkkjkjkkkkkkkkkkkkkkkkkkkkkokkkkkokokkkkkkkkkokokkkkkokkkkkxkkkxkkkkkxkkkkkxkx", "NO", "YES\nasssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssasssasbssscssssssssssssscssscsssssdsesssssssssgshssssshssssslssslsssssossssspspsssssssssqstsssuszsss", "NO", "NO", "YES\nhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhjhhhhhjhhhhhjhjhhhhhhhhhjhjhhhjhuhhhhhhhhhhhuhhhhhhhhhhhuhhhuhuhhhuhh", "YES\nhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh", "YES\nauuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuauuuduuuuueufuuuuuuuuuguguuuuuguuuuuiuuuiuuuuujuuuuululuuuuuuuuuououuuoupuuuuuuuuuuuquuuuuuuuuuuruuurutuuutuuuuuxuzuuuuuuuuuz", "NO", "NO", "YES\nammmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmamammmmmmmmmhmhmmmmmhmmmmmimmmimmmmmimmmmmimimmmmmmmmmlmlmmmlmlmmmmmmmmmmmlmmmmmmmmmmmmmmmmmmmmmmmmmmmomommmmmmmmmqmmmmmqmmmmmtmmmmmtmtm", "YES\nmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmymmm", "YES\nazzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzbzbzzzzzbzzzzzezzzfzzzzzgzzzzzgzhzzzzzzzzzhzhzzzizjzzzzzzzzzzzmzzzzzzzzzzzmzzzmznzzzozzzzzrzrzzzzzzzzzuzzzzzuzzzzzxzzzzzxzyzzzzzyzzzyzyzz", "NO", "NO", "YES\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "NO", "YES\nbooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooobobooooooooobocooococooooooooooocooooooooooocooocoeoooeooooofoiooooooooolooooolooooolooooopopoooooqoooqovooooooooovoooooooooooooxoooxoxoooxoooooooooooooxooooozooooooooozozooo", "NO", "NO", "YES\nozzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzozozzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz", "NO", "YES\nbcccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccbcccccccccccdccchchccchcccccjcjcccccccccjccccclccccclcccccncncccccncccococccccccccscccccccccccccsccctctcccvcccccccccccccvcccccvcccccccccvcwcccwcccccwcccccccwcccccwcccccxcccxcccccxcccccccxccczccccccczccccc", "NO", "NO", "YES\negggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggegggegegggegggggegeggggggggggggggghggggghggggghghggggghggghghggggggggghgggggggggggggngggngngggngggggggggggggngggggngggggggggpgpgggpgggggpgggggggpgggggpgggggpgggqgggggqgggggggqgggqgggggggqgggggggggqgqgggggggggqgqgggggqggg", "NO", "YES\ncbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcbbbcbbbbbebebbbbbbbbbebbbbbebbbbbgbbbbbgbibbbbbibbbibibbbbbbbbbjbbbbbbbbbbbbbjbbbjbjbbbpbbbbbbbbbbbbbpbbbbbqbbbbbbbbbqbqbbbqbbbbbqbbbbbbbqbbbbbtbbbbbtbbbtbbbbbvbbbbbbbvbbbvbbbbbbbvbbbbbbbbbzbzbbbbbbbbbzbzbbbbbzbbbzbbbbbzbbbbb", "NO", "NO", "YES\naxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxbxxxxxbxxxxxexxxxxexfxxxxxhxxxixmxxxxxxxxxnxxxxxxxxxxxxxoxxxoxoxxxpxxxxxxxxxxxxxrxxxxxrxxxxxxxxxsxtxxxtxxxxxtxxxxxxxuxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxzxxxx", "NO", "YES\ncmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmcmcmmmmmmmmmcmmmmmcmmmmmcmmmmmrmrmmmmmrmmmrmrmmmmmmmmmrmmmmmmmmmmmmmrmmmrmrmmmrmmmmmmmmmmmmmrmmmmmrmmmmmmmmmsmsmmmsmmmmmsmmmmmmmsmmmmmsmmmmmsmmmsmmmmmsmmmmmmmsmmmummmmmmmummmmmmmmmumummmmmmmmmumummmmmummmummmmmummmmmmmummmumummmummmmmmm", "YES\nz"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	14	codeforces
f53c2e77b713b9fecc9d1983adaae7e8	Sereja and Stairs	Sereja loves integer sequences very much. He especially likes stairs. Sequence a1,<=a2,<=...,<=a\|a\| (\|a\| is the length of the sequence) is stairs if there is such index i (1<=≤<=i<=≤<=\|a\|), that the following condition is met: For example, sequences [1, 2, 3, 2] and [4, 2] are stairs and sequence [3, 1, 2] isn't. Sereja has m cards with numbers. He wants to put some cards on the table in a row to get a stair sequence. What maximum number of cards can he put on the table? The first line contains integer m (1<=≤<=m<=≤<=105) — the number of Sereja's cards. The second line contains m integers bi (1<=≤<=bi<=≤<=5000) — the numbers on the Sereja's cards. In the first line print the number of cards you can put on the table. In the second line print the resulting stairs. Sample Input 5 1 2 3 4 5 6 1 1 2 2 3 3 Sample Output 5 5 4 3 2 1 5 1 2 3 2 1	{"inputs": ["5\n1 2 3 4 5", "6\n1 1 2 2 3 3", "47\n3 4 5 3 1 4 4 3 4 6 1 5 1 3 5 3 6 5 1 4 3 2 6 5 3 1 4 6 4 6 2 1 1 1 4 3 6 1 6 6 3 5 1 4 6 4 4", "13\n8 23 26 8 15 13 35 36 28 8 4 33 6", "17\n15 29 28 23 20 12 9 30 4 13 1 25 11 20 6 23 10", "31\n189 73 300 133 414 23 150 301 252 21 274 272 316 291 339 356 201 267 257 43 10 25 16 211 59 2 181 54 344 337 201", "85\n319 554 696 281 275 544 356 313 296 308 848 668 135 705 231 735 882 622 796 435 621 523 709 247 169 152 395 758 447 595 550 819 188 664 589 907 3 619 771 810 669 471 425 870 737 329 83 549 425 138 870 775 451 818 735 169 162 419 903 803 852 75 297 687 310 714 419 652 164 667 245 906 133 643 881 322 681 704 479 278 114 324 42 475 396", "102\n1830 2653 1293 4285 4679 3563 3668 4499 3507 2666 3507 1120 466 290 4280 60 4135 1120 289 1752 2101 2699 653 2811 3885 4018 4097 3142 2932 561 193 3662 3017 3487 3158 2876 3396 2806 3440 4503 1728 362 2194 2743 2946 596 1892 4785 3661 2971 3487 17 3616 2710 1189 613 915 3891 2654 554 3506 1938 2783 2537 4791 1098 930 1000 1007 942 3871 2547 1798 4610 1613 774 1347 1460 2752 3158 4540 4720 2639 887 1999 2046 1199 1889 426 1888 4317 649 1660 336 4728 2422 2771 3536 1683 3786 2711 308", "1\n1", "2\n1 1", "3\n1 2 3", "3\n2 1 2", "2\n1 2"], "outputs": ["5\n5 4 3 2 1", "5\n1 2 3 2 1", "11\n1 2 3 4 5 6 5 4 3 2 1", "12\n8 36 35 33 28 26 23 15 13 8 6 4", "17\n20 23 30 29 28 25 23 20 15 13 12 11 10 9 6 4 1", "31\n201 414 356 344 339 337 316 301 300 291 274 272 267 257 252 211 201 189 181 150 133 73 59 54 43 25 23 21 16 10 2", "85\n169 419 425 735 870 907 906 903 882 881 870 852 848 819 818 810 803 796 775 771 758 737 735 714 709 705 704 696 687 681 669 668 667 664 652 643 622 621 619 595 589 554 550 549 544 523 479 475 471 451 447 435 425 419 396 395 356 329 324 322 319 313 310 308 297 296 281 278 275 247 245 231 188 169 164 162 152 138 135 133 114 83 75 42 3", "102\n1120 3158 3487 3507 4791 4785 4728 4720 4679 4610 4540 4503 4499 4317 4285 4280 4135 4097 4018 3891 3885 3871 3786 3668 3662 3661 3616 3563 3536 3507 3506 3487 3440 3396 3158 3142 3017 2971 2946 2932 2876 2811 2806 2783 2771 2752 2743 2711 2710 2699 2666 2654 2653 2639 2547 2537 2422 2194 2101 2046 1999 1938 1892 1889 1888 1830 1798 1752 1728 1683 1660 1613 1460 1347 1293 1199 1189 1120 1098 1007 1000 942 930 915 887 774 653 649 613 596 561 554 466 426 362 336 308 290 289 193 60 17", "1\n1", "1\n1", "3\n3 2 1", "2\n2 1", "2\n2 1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	13	codeforces
f53de49dea0cc731a12013a4ca367818	Indivisibility	IT City company developing computer games decided to upgrade its way to reward its employees. Now it looks the following way. After a new game release users start buying it actively, and the company tracks the number of sales with precision to each transaction. Every time when the next number of sales is not divisible by any number from 2 to 10 every developer of this game gets a small bonus. A game designer Petya knows that the company is just about to release a new game that was partly developed by him. On the basis of his experience he predicts that n people will buy the game during the first month. Now Petya wants to determine how many times he will get the bonus. Help him to know it. The only line of the input contains one integer n (1<=≤<=n<=≤<=1018) — the prediction on the number of people who will buy the game. Output one integer showing how many numbers from 1 to n are not divisible by any number from 2 to 10. Sample Input 12 Sample Output 2	{"inputs": ["12", "2519", "2521", "1", "314159265", "718281828459045235", "1000000000000000000", "987654321234567890", "3628800", "504000000000000000"], "outputs": ["2", "576", "577", "1", "71807832", "164178703647781768", "228571428571428571", "225749559139329804", "829440", "115200000000000000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
f54731867043ce86f02c1fd79631d7cf	Bear and Up-Down	The life goes up and down, just like nice sequences. Sequence t1,<=t2,<=...,<=tn is called nice if the following two conditions are satisfied: - ti<=<<=ti<=+<=1 for each odd i<=<<=n; - ti<=><=ti<=+<=1 for each even i<=<<=n. For example, sequences (2,<=8), (1,<=5,<=1) and (2,<=5,<=1,<=100,<=99,<=120) are nice, while (1,<=1), (1,<=2,<=3) and (2,<=5,<=3,<=2) are not. Bear Limak has a sequence of positive integers t1,<=t2,<=...,<=tn. This sequence is not nice now and Limak wants to fix it by a single swap. He is going to choose two indices i<=<<=j and swap elements ti and tj in order to get a nice sequence. Count the number of ways to do so. Two ways are considered different if indices of elements chosen for a swap are different. The first line of the input contains one integer n (2<=≤<=n<=≤<=150<=000) — the length of the sequence. The second line contains n integers t1,<=t2,<=...,<=tn (1<=≤<=ti<=≤<=150<=000) — the initial sequence. It's guaranteed that the given sequence is not nice. Print the number of ways to swap two elements exactly once in order to get a nice sequence. Sample Input 5 2 8 4 7 7 4 200 150 100 50 10 3 2 1 4 1 4 1 4 1 4 9 1 2 3 4 5 6 7 8 9 Sample Output 2 1 8 0	{"inputs": ["5\n2 8 4 7 7", "4\n200 150 100 50", "10\n3 2 1 4 1 4 1 4 1 4", "9\n1 2 3 4 5 6 7 8 9", "5\n1 1 1 4 3", "10\n7 7 8 10 5 10 1 5 2 6", "50\n11836 28308 72527 92281 139289 93797 134555 148444 40866 111317 21564 87813 65466 20541 99238 2287 74647 128071 18163 61672 39766 55589 138385 147443 138100 142683 60703 15444 52566 72976 147412 116006 115986 110545 79993 100440 9876 71470 75209 62443 64906 88987 72232 2246 63160 45041 729 148611 103397 78474", "10\n522 309 276 454 566 978 175 388 289 276", "20\n8 9 1 10 7 9 5 8 5 7 5 6 1 3 2 7 3 2 6 9", "25\n25 20 58 95 47 68 38 39 24 83 36 68 28 67 25 40 62 99 11 88 74 75 38 90 42", "30\n18647 31594 58075 122543 49766 65303 48728 102863 22542 140297 5300 90685 50141 86948 27074 40214 17945 147095 97758 140835 121469 139920 63817 138623 85609 110002 70046 128002 122139 116109", "39\n18329 39326 21115 36341 3916 40060 23262 41923 17476 42107 17052 23198 10756 32540 14873 28454 23912 35765 9459 45834 85 46756 31859 40087 35420 47585 9781 46544 31859 49453 7394 17459 2816 34051 12519 4077 692 44098 23345", "2\n5 1", "2\n10 10", "6\n1 1 1 2 2 2", "12\n10 15 10 15 10 8 10 15 10 20 30 20"], "outputs": ["2", "1", "8", "0", "1", "2", "0", "0", "3", "1", "1", "15", "1", "0", "1", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	7	codeforces
f555f0260b3c8873cba4bcd572c3085a	Bracket Sequence	A bracket sequence is a string, containing only characters "(", ")", "[" and "]". A correct bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()[]", "([])" are correct (the resulting expressions are: "(1)+[1]", "([1+1]+1)"), and "](" and "[" are not. The empty string is a correct bracket sequence by definition. A substring s[l... r] (1<=≤<=l<=≤<=r<=≤<=\|s\|) of string s<==<=s1s2... s\|s\| (where \|s\| is the length of string s) is the string slsl<=+<=1... sr. The empty string is a substring of any string by definition. You are given a bracket sequence, not necessarily correct. Find its substring which is a correct bracket sequence and contains as many opening square brackets «[» as possible. The first and the only line contains the bracket sequence as a string, consisting only of characters "(", ")", "[" and "]". It is guaranteed that the string is non-empty and its length doesn't exceed 105 characters. In the first line print a single integer — the number of brackets «[» in the required bracket sequence. In the second line print the optimal sequence. If there are more than one optimal solutions print any of them. Sample Input ([]) ((( Sample Output 1 ([]) 0	{"inputs": ["([])", "(((", "(][)", "(()[))()[]", "(][](](][[(][", "((])(]]))(](((()[[()[[[)([]()])[(]][)]])[]]()[()[[[[(([[)", "](]][)]()][[])[()(][)]))[)[]()()])[([((([[(([)][(])](][])([([)())))([(([][))[)()]][[])()[)](][[((]](](])]][(][[()(]][[)][])(][]))[])[)[(])[)()()[[))((()]]([([[(]))][(]())))))[[]]][][))[)])])()((((([[](([[()(([[()](([[([[(](]([)]())))[)]([]", "[(()[])]()[()[]]", "([])()[()]()()[(([])[]()[()([])()[][]()])]", "[()][([[]])][[[]()]][()[]]()()([[][]][[]][](()))[[[(())]]][]()(([([])(([[[]]()])(()))]((())))([()]([()[[[]([][[[[][(())([[]()])]]][[(())]([])]()][[](())]()[])]()[][]]([[]])[]])[(()[()((()[][()]))][])[]()()([]())](()[][][])()()[]()))[]()[]", "(][(](][[(][(", ")[)][)))((([[)]((]][)[)((]([)[)(([)[)]][([", "][([))][[))[[((]][([(([[)]]])([)][([([[[[([))]])][[[[[([)]]([[(((]([(](([([[)[(]])(][(((][)[[)][)(][[)[[)])))[)]))]])[([[))(([(]][))([(]]][(])]))))))[[[[[([[([)[[[)[(([)[[(][((([(([([(([))[[[[[[([(](])(][[)[)(](]])]]]((([))(])[[)[))[([[[[(]][)[([(]](([)([[)[[([))[)", "()]])()()]", "[([[)[(()[])[()][]()[[[)()[][[[()[]]]()]][", "[()][][][][]()[)])))[(]()[]([)(])[)(])()[))][)]()[][][]][][)(((([))))[)[))]]([[[)[())))[(][(()[()[(]())]])([[)[)[[())[()[]()[[[[])][))](()()())()](((((([(()]][[)([)([]]))(()[((]]())[]])][)()(][]][][(([])]]((]])([[][)])(][)][([[[[(][()(][[(", "(([])", "()()([]]", "([[[]]))", "[[]", "((((([]((((((((((", "(((((([](((((((", "[[])", "((()))([]", "([]", "[]())])([)][[[]])))][])([]([]()]]))))())[[([))()(])))]][)[][[])(][()()]]](]][])[[))((]][)[)(]))([])((]([)([])]]]]]]][)[[[]]([[[]]][(][][])()[[([](])(]]((]([[)])]])([)(][([)(([))(]([)[[](([(](][[)()(]["], "outputs": ["1\n([])", "0", "0", "1\n()[]", "1\n[]", "1\n[]()", "2\n[[]]", "4\n[(()[])]()[()[]]", "9\n([])()[()]()()[(([])[]()[()([])()[][]()])]", "61\n[()][([[]])][[[]()]][()[]]()()([[][]][[]][](()))[[[(())]]][]()(([([])(([[[]]()])(()))]((())))([()]([()[[[]([][[[[][(())([[]()])]]][[(())]([])]()][[](())]()[])]()[][]]([[]])[]])[(()[()((()[][()]))][])[]()()([]())](()[][][])()()[]()))[]()[]", "0", "0", "0", "0", "5\n()[][[[()[]]]()]", "5\n[()][][][][]()", "1\n([])", "1\n[]", "2\n[[]]", "1\n[]", "1\n[]", "1\n[]", "1\n[]", "1\n[]", "1\n[]", "3\n[[[]]]"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	8	codeforces
f556bf48bdfac471314a32265c949ac9	Tanya and Toys	In Berland recently a new collection of toys went on sale. This collection consists of 109 types of toys, numbered with integers from 1 to 109. A toy from the new collection of the i-th type costs i bourles. Tania has managed to collect n different types of toys a1,<=a2,<=...,<=an from the new collection. Today is Tanya's birthday, and her mother decided to spend no more than m bourles on the gift to the daughter. Tanya will choose several different types of toys from the new collection as a gift. Of course, she does not want to get a type of toy which she already has. Tanya wants to have as many distinct types of toys in her collection as possible as the result. The new collection is too diverse, and Tanya is too little, so she asks you to help her in this. The first line contains two integers n (1<=≤<=n<=≤<=100<=000) and m (1<=≤<=m<=≤<=109) — the number of types of toys that Tanya already has and the number of bourles that her mom is willing to spend on buying new toys. The next line contains n distinct integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the types of toys that Tanya already has. In the first line print a single integer k — the number of different types of toys that Tanya should choose so that the number of different types of toys in her collection is maximum possible. Of course, the total cost of the selected toys should not exceed m. In the second line print k distinct space-separated integers t1,<=t2,<=...,<=tk (1<=≤<=ti<=≤<=109) — the types of toys that Tanya should choose. If there are multiple answers, you may print any of them. Values of ti can be printed in any order. Sample Input 3 7 1 3 4 4 14 4 6 12 8 Sample Output 2 2 5 4 7 2 3 1	{"inputs": ["3 7\n1 3 4", "4 14\n4 6 12 8", "5 6\n97746 64770 31551 96547 65684", "10 10\n94125 56116 29758 94024 29289 31663 99794 35076 25328 58656", "30 38\n9560 64176 75619 53112 54160 68775 12655 13118 99502 89757 78434 42521 19210 1927 34097 5416 56110 44786 59126 44266 79240 65567 54602 25325 37171 2879 89291 89121 39568 28162", "1 999999298\n85187", "1 999999119\n34421", "1 1000000000\n1", "1 1000000000\n44720", "1 1000000000\n44719", "1 1000000000\n44721", "3 1000000000\n123456789 234567891 345678912", "2 5\n999999999 1000000000", "2 1000000000\n1 1000000000", "3 100000\n1000000000 100000000 1", "5 5\n100000000 200000000 300000000 400000000 1000000000", "6 3\n1 2 3 4 5 6", "2 1\n1 2", "1 1000000000\n1000000000", "5 1000000\n1000000000 100000000 10000000 99999999 123456789", "2 10000000\n1234567 123456", "1 1\n1000000000", "1 1000000000\n9999999", "5 10000\n1000000000 888888888 777777777 666666666 959595959", "3 1\n1000000000 999999999 999999998", "5 100000000\n100000000 999999999 1 2 3", "3 55\n100000000 1000000000 999999999", "2 10\n5 10000009", "3 10000000\n999999999 999999998 999999997", "1 1100\n1000000000", "1 40\n1000000000"], "outputs": ["2\n2 5 ", "4\n1 2 3 5 ", "3\n1 2 3 ", "4\n1 2 3 4 ", "8\n1 2 3 4 5 6 7 8 ", "44720\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 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "44720\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 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "44719\n2 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 141 142 143 144 145 146 147 148 149 150 151 152 153 15...", "44720\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 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "44720\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 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "44720\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 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "44720\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 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "2\n1 2 ", "44719\n2 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 141 142 143 144 145 146 147 148 149 150 151 152 153 15...", "445\n2 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 141 142 143 144 145 146 147 148 149 150 151 152 153 154 ...", "2\n1 2 ", "0", "0", "44720\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 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "1413\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 141 142 143 144 145 146 147 148 149 150 151 152 153 1...", "4471\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 141 142 143 144 145 146 147 148 149 150 151 152 153 1...", "1\n1 ", "44720\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 141 142 143 144 145 146 147 148 149 150 151 152 153 ...", "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 140 ", "1\n1 ", "14138\n4 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 141 142 143 144 145 146 147 148 149 150 151 152 153 154 15...", "10\n1 2 3 4 5 6 7 8 9 10 ", "4\n1 2 3 4 ", "4471\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 141 142 143 144 145 146 147 148 149 150 151 152 153 1...", "46\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 ", "8\n1 2 3 4 5 6 7 8 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	93	codeforces
f5636aa985f73a0c339b33d720a5f31e	Datatypes	Tattah's youngest brother, Tuftuf, is new to programming. Since his older brother is such a good programmer, his biggest dream is to outshine him. Tuftuf is a student at the German University in Cairo (GUC) where he learns to write programs in Gava. Today, Tuftuf was introduced to Gava's unsigned integer datatypes. Gava has n unsigned integer datatypes of sizes (in bits) a1,<=a2,<=... an. The i-th datatype have size ai bits, so it can represent every integer between 0 and 2ai<=-<=1 inclusive. Tuftuf is thinking of learning a better programming language. If there exists an integer x, such that x fits in some type i (in ai bits) and x·x does not fit in some other type j (in aj bits) where ai<=<<=aj, then Tuftuf will stop using Gava. Your task is to determine Tuftuf's destiny. The first line contains integer n (2<=≤<=n<=≤<=105) — the number of Gava's unsigned integer datatypes' sizes. The second line contains a single-space-separated list of n integers (1<=≤<=ai<=≤<=109) — sizes of datatypes in bits. Some datatypes may have equal sizes. Print "YES" if Tuftuf will stop using Gava, and "NO" otherwise. Sample Input 3 64 16 32 4 4 2 1 3 Sample Output NO YES	{"inputs": ["3\n64 16 32", "4\n4 2 1 3", "5\n1 5 3 3 2", "52\n474 24 24 954 9 234 474 114 24 114 234 24 114 114 234 9 9 24 9 54 234 54 9 954 474 9 54 54 54 234 9 114 24 54 114 954 954 474 24 54 54 234 234 474 474 24 114 9 954 954 954 474", "56\n43 641 626 984 107 521 266 835 707 220 402 406 558 199 988 685 843 808 182 73 553 17 765 979 116 178 489 271 532 889 26 263 654 680 240 392 980 267 264 46 888 444 874 519 735 301 743 526 376 793 40 110 811 184 82 96", "9\n20 44 92 8 20 380 8 188 764", "97\n250 58 26 506 58 122 506 506 250 506 26 58 26 58 10 26 58 58 2 506 506 10 10 2 26 26 122 58 506 10 506 58 250 2 26 122 122 10 250 58 2 58 58 122 10 506 26 122 26 2 2 2 250 506 2 506 10 2 26 122 250 2 250 122 10 250 10 26 58 122 58 2 2 10 250 250 26 250 10 250 506 122 122 122 506 26 58 10 122 10 250 10 2 2 26 250 122", "85\n436 23 384 417 11 227 713 910 217 177 227 161 851 396 556 948 700 819 920 451 877 249 332 189 606 986 627 468 877 682 497 579 189 443 252 795 147 642 643 569 250 863 615 560 142 752 918 167 677 49 750 871 282 721 102 884 179 980 392 509 178 977 51 241 912 599 142 975 453 353 350 130 837 955 688 7 588 239 194 277 50 865 227 848 538", "43\n906 652 445 325 991 682 173 290 731 528 432 615 698 132 874 38 643 301 223 442 722 529 150 659 593 22 679 178 410 978 201 559 115 533 586 790 703 596 492 591 781 761 384", "8\n421 250 398 257 512 329 25 972", "2\n1000000000 999999999", "220\n10 6 6 2 8 6 6 5 6 2 10 3 9 10 10 2 3 5 2 2 4 7 6 6 7 5 6 2 10 10 1 1 2 2 3 2 4 4 8 1 1 2 1 10 9 2 1 4 2 1 7 4 8 4 2 9 7 7 6 6 8 3 1 9 10 6 3 5 9 5 1 1 8 3 10 8 10 3 7 9 2 4 8 2 8 4 10 5 7 10 6 8 3 5 7 9 4 2 6 2 2 7 7 2 10 1 1 8 7 4 8 8 9 1 1 9 5 5 5 3 5 5 3 2 6 4 7 9 10 9 3 1 10 1 7 8 8 7 6 5 1 5 6 2 1 9 9 10 8 4 9 5 4 8 10 4 9 2 3 7 10 3 3 9 10 5 7 7 6 7 3 1 5 7 10 6 3 5 4 7 8 6 10 10 10 8 3 5 1 1 1 10 2 3 5 5 2 5 8 4 7 3 1 10 1 10 9 2 10 3 4 9 1 5 9 8 2 7 7 2", "7\n1 2 3 4 8 16 32", "2\n1 1", "2\n1 2", "3\n1 2 2", "3\n1 1 2"], "outputs": ["NO", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	20	codeforces
f5677e201ea80926f44a9e2ca0e950ce	Running with Obstacles	A sportsman starts from point xstart<==<=0 and runs to point with coordinate xfinish<==<=m (on a straight line). Also, the sportsman can jump — to jump, he should first take a run of length of not less than s meters (in this case for these s meters his path should have no obstacles), and after that he can jump over a length of not more than d meters. Running and jumping is permitted only in the direction from left to right. He can start andfinish a jump only at the points with integer coordinates in which there are no obstacles. To overcome some obstacle, it is necessary to land at a point which is strictly to the right of this obstacle. On the way of an athlete are n obstacles at coordinates x1,<=x2,<=...,<=xn. He cannot go over the obstacles, he can only jump over them. Your task is to determine whether the athlete will be able to get to the finish point. The first line of the input containsd four integers n, m, s and d (1<=≤<=n<=≤<=200<=000, 2<=≤<=m<=≤<=109, 1<=≤<=s,<=d<=≤<=109) — the number of obstacles on the runner's way, the coordinate of the finishing point, the length of running before the jump and the maximum length of the jump, correspondingly. The second line contains a sequence of n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=m<=-<=1) — the coordinates of the obstacles. It is guaranteed that the starting and finishing point have no obstacles, also no point can have more than one obstacle, The coordinates of the obstacles are given in an arbitrary order. If the runner cannot reach the finishing point, print in the first line of the output "IMPOSSIBLE" (without the quotes). If the athlete can get from start to finish, print any way to do this in the following format: - print a line of form "RUN X>" (where "X" should be a positive integer), if the athlete should run for "X" more meters; - print a line of form "JUMP Y" (where "Y" should be a positive integer), if the sportsman starts a jump and should remain in air for "Y" more meters. All commands "RUN" and "JUMP" should strictly alternate, starting with "RUN", besides, they should be printed chronologically. It is not allowed to jump over the finishing point but it is allowed to land there after a jump. The athlete should stop as soon as he reaches finish. Sample Input 3 10 1 3 3 4 7 2 9 2 3 6 4 Sample Output RUN 2 JUMP 3 RUN 1 JUMP 2 RUN 2 IMPOSSIBLE	{"inputs": ["3 10 1 3\n3 4 7", "2 9 2 3\n6 4", "10 100 2 8\n93 35 24 87 39 46 86 37 73 33", "10 1000000000 8905990 20319560\n233244997 997992814 242452779 497363176 572234096 126615858 886769539 662035052 989086824 716655858", "100 1000 1 4\n228 420 360 642 442 551 940 343 24 83 928 110 663 548 704 461 942 799 283 746 371 204 435 209 986 489 918 526 496 321 233 643 208 717 806 18 291 431 521 631 3 450 711 602 401 60 680 930 625 891 161 279 510 529 546 338 473 925 446 786 384 952 260 649 865 916 789 71 103 997 484 89 408 129 953 670 568 55 287 511 369 225 950 539 652 567 730 499 687 90 779 848 801 606 82 853 967 776 951 329", "100 600 1 4\n9 536 518 59 229 377 72 203 81 309 304 321 55 439 287 505 3 410 582 351 440 568 584 259 22 415 348 147 404 277 477 323 537 75 548 324 338 198 145 182 271 496 256 329 592 132 291 222 115 587 54 158 154 103 356 15 36 76 402 27 223 551 267 527 51 34 417 573 479 398 425 71 485 20 262 566 467 131 524 352 330 541 146 53 322 436 366 86 88 272 96 456 388 319 149 470 129 162 353 346", "1 2 1 5\n1", "1 3 1 2\n2", "1 5 1 2\n2", "100 1000 1 5\n204 233 384 776 450 649 473 717 55 90 208 951 499 551 916 18 539 103 420 521 730 779 360 546 746 953 484 82 110 789 161 950 71 806 928 652 510 287 997 967 329 786 643 431 321 663 279 291 799 986 848 680 89 225 918 801 567 369 687 209 602 401 952 930 442 853 606 338 129 631 228 24 3 925 940 711 496 625 548 446 891 283 60 83 529 511 568 704 371 343 670 435 461 865 408 642 260 526 489 942", "1 1000000000 1000000000 2\n999999999", "1 100 1 1\n4", "1 1000000000 1 1000000000\n2", "3 12000 2000 3000\n3000 9002 7001", "4 30000 5000 6000\n6000 16000 15000 21001", "3 12000 2000 245\n3000 9003 7001", "4 30000 5000 1654\n6000 16000 14999 21002", "4 10000 500 500\n700 600 1099 2000", "3 20000 4000 3502\n5000 8500 15000", "4 10000 500 500\n700 601 1099 2000", "3 20000 4000 3502\n5000 8501 15000", "1 10 1 2\n9", "1 10 2 9\n5", "1 9 6 4\n4", "1 10 7 4\n5", "2 14 8 8\n5 9", "2 23 12 8\n8 16", "2 14 4 2\n2 7", "3 21 6 2\n7 11 16", "3 29 3 4\n7 16 19", "3 24 2 6\n6 12 17", "4 31 12 9\n7 13 21 28", "4 10 1 7\n2 4 6 8", "4 36 8 4\n4 13 19 27", "5 25 10 2\n6 12 13 15 22", "5 19 7 10\n3 7 9 12 16", "5 28 6 8\n3 9 15 21 25", "6 35 12 4\n7 12 17 21 24 28", "6 22 5 7\n4 6 10 13 15 18", "6 55 3 5\n10 18 24 34 39 45", "7 51 6 1\n8 17 18 23 27 33 42", "7 36 11 4\n6 11 17 19 22 24 30", "7 28 10 2\n5 10 14 19 21 23 27", "8 46 4 5\n3 6 15 21 24 26 36 42", "8 51 2 1\n6 14 20 26 29 35 40 48", "8 56 2 9\n7 11 20 28 34 39 40 48", "9 57 2 2\n5 11 15 21 24 30 36 43 50", "9 82 14 4\n10 18 28 38 46 55 64 74 79", "9 40 6 3\n5 10 14 18 22 27 30 31 36", "10 44 6 2\n4 8 13 19 23 29 32 33 37 41", "10 42 1 3\n1 6 10 15 17 22 24 29 33 38", "10 82 2 5\n9 17 27 37 44 51 57 62 67 72", "11 69 4 9\n7 14 20 26 29 35 40 46 52 58 64", "11 65 1 7\n7 11 14 21 24 30 37 44 50 56 59", "11 77 10 10\n7 14 17 24 29 34 38 47 56 64 69", "12 78 3 1\n4 11 19 22 30 38 43 51 56 59 67 73", "12 89 14 9\n6 11 18 24 33 37 45 51 60 69 71 80", "12 13 6 7\n1 2 3 4 5 6 7 8 9 10 11 12", "13 91 1 3\n5 12 17 22 29 36 43 49 57 64 70 74 84", "13 87 5 6\n7 10 18 24 31 40 41 48 54 63 69 78 81", "13 46 2 4\n1 4 9 13 15 19 21 23 25 30 35 37 42", "14 93 1 1\n8 15 19 21 28 36 44 51 56 63 67 74 79 85", "14 62 11 4\n5 10 15 18 22 26 31 34 39 42 44 47 52 57", "14 109 10 1\n8 15 25 29 38 48 57 65 70 79 81 89 94 100", "15 97 4 4\n3 7 13 23 29 35 39 45 49 50 60 68 72 81 87", "15 77 4 8\n7 14 16 20 26 33 36 43 44 48 52 59 61 66 70", "15 56 1 5\n5 10 15 20 21 25 29 31 34 37 38 41 43 47 52", "2 1000000000 1 3\n5 8", "2 1000000000 1 2\n5 8", "2 1000000000 1 4\n5 8", "2 1000000000 2 4\n5 8", "2 1000000000 2 5\n5 8"], "outputs": ["RUN 2\nJUMP 3\nRUN 1\nJUMP 2\nRUN 2", "IMPOSSIBLE", "RUN 23\nJUMP 2\nRUN 7\nJUMP 8\nRUN 5\nJUMP 2\nRUN 25\nJUMP 2\nRUN 11\nJUMP 3\nRUN 4\nJUMP 2\nRUN 6", "RUN 126615857\nJUMP 2\nRUN 106629137\nJUMP 2\nRUN 9207780\nJUMP 2\nRUN 254910395\nJUMP 2\nRUN 74870918\nJUMP 2\nRUN 89800954\nJUMP 2\nRUN 54620804\nJUMP 2\nRUN 170113679\nJUMP 2\nRUN 102317283\nJUMP 8905992\nRUN 2007185", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "RUN 1\nJUMP 2", "RUN 1\nJUMP 2\nRUN 2", "RUN 2\nJUMP 2\nRUN 13\nJUMP 2\nRUN 4\nJUMP 2\nRUN 29\nJUMP 2\nRUN 3\nJUMP 2\nRUN 9\nJUMP 2\nRUN 9\nJUMP 3\nRUN 4\nJUMP 3\nRUN 11\nJUMP 2\nRUN 5\nJUMP 2\nRUN 17\nJUMP 2\nRUN 30\nJUMP 2\nRUN 41\nJUMP 2\nRUN 2\nJUMP 3\nRUN 14\nJUMP 2\nRUN 1\nJUMP 2\nRUN 3\nJUMP 2\nRUN 25\nJUMP 2\nRUN 17\nJUMP 2\nRUN 2\nJUMP 2\nRUN 2\nJUMP 2\nRUN 2\nJUMP 2\nRUN 28\nJUMP 2\nRUN 6\nJUMP 2\nRUN 7\nJUMP 2\nRUN 3\nJUMP 2\nRUN 15\nJUMP 2\nRUN 7\nJUMP 4\nRUN 11\nJUMP 2\nRUN 15\nJUMP 2\nRUN 5\nJUMP 2\nRUN 10\nJUMP 2\nRUN 9\nJUMP 2\nRU...", "IMPOSSIBLE", "IMPOSSIBLE", "RUN 1\nJUMP 2\nRUN 999999997", "RUN 2999\nJUMP 2\nRUN 3999\nJUMP 2003\nRUN 2997", "IMPOSSIBLE", "RUN 2999\nJUMP 2\nRUN 3999\nJUMP 2\nRUN 2000\nJUMP 2\nRUN 2996", "RUN 5999\nJUMP 2\nRUN 8997\nJUMP 1003\nRUN 5000\nJUMP 2\nRUN 8997", "IMPOSSIBLE", "RUN 4999\nJUMP 3502\nRUN 6498\nJUMP 2\nRUN 4999", "RUN 600\nJUMP 500\nRUN 899\nJUMP 2\nRUN 7999", "IMPOSSIBLE", "RUN 8\nJUMP 2", "RUN 4\nJUMP 2\nRUN 4", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "RUN 5\nJUMP 2\nRUN 4\nJUMP 2\nRUN 3\nJUMP 2\nRUN 6", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "RUN 9\nJUMP 2\nRUN 6\nJUMP 2\nRUN 4\nJUMP 2\nRUN 8\nJUMP 2\nRUN 3\nJUMP 2\nRUN 4\nJUMP 2\nRUN 9", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "RUN 6\nJUMP 2\nRUN 2\nJUMP 2\nRUN 7\nJUMP 2\nRUN 6\nJUMP 2\nRUN 4\nJUMP 2\nRUN 3\nJUMP 3\nRUN 6\nJUMP 2\nRUN 7", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "RUN 8\nJUMP 2\nRUN 6\nJUMP 2\nRUN 8\nJUMP 2\nRUN 8\nJUMP 2\nRUN 5\nJUMP 2\nRUN 5\nJUMP 2\nRUN 4\nJUMP 2\nRUN 3\nJUMP 2\nRUN 3\nJUMP 2\nRUN 3\nJUMP 2\nRUN 9", "RUN 6\nJUMP 2\nRUN 5\nJUMP 2\nRUN 4\nJUMP 2\nRUN 4\nJUMP 5\nRUN 4\nJUMP 7\nRUN 4\nJUMP 2\nRUN 4\nJUMP 2\nRUN 4\nJUMP 2\nRUN 4\nJUMP 2\nRUN 4", "RUN 6\nJUMP 2\nRUN 2\nJUMP 2\nRUN 1\nJUMP 2\nRUN 5\nJUMP 2\nRUN 1\nJUMP 2\nRUN 4\nJUMP 2\nRUN 5\nJUMP 2\nRUN 5\nJUMP 2\nRUN 4\nJUMP 2\nRUN 4\nJUMP 2\nRUN 1\nJUMP 2\nRUN 5", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "RUN 4\nJUMP 2\nRUN 5\nJUMP 2\nRUN 3\nJUMP 2\nRUN 3\nJUMP 2\nRUN 5\nJUMP 2\nRUN 5\nJUMP 2\nRUN 5\nJUMP 2\nRUN 4\nJUMP 2\nRUN 6\nJUMP 2\nRUN 5\nJUMP 2\nRUN 4\nJUMP 2\nRUN 2\nJUMP 2\nRUN 8\nJUMP 2\nRUN 6", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "RUN 4\nJUMP 2\nRUN 3\nJUMP 2\nRUN 3\nJUMP 2\nRUN 3\nJUMP 3\nRUN 2\nJUMP 2\nRUN 2\nJUMP 4\nRUN 1\nJUMP 2\nRUN 1\nJUMP 3\nRUN 1\nJUMP 4\nRUN 2\nJUMP 2\nRUN 3\nJUMP 2\nRUN 3", "RUN 4\nJUMP 2\nRUN 1\nJUMP 2\nRUN 999999991", "RUN 4\nJUMP 2\nRUN 1\nJUMP 2\nRUN 999999991", "RUN 4\nJUMP 2\nRUN 1\nJUMP 2\nRUN 999999991", "IMPOSSIBLE", "RUN 4\nJUMP 5\nRUN 999999991"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	5	codeforces
f56798c29ee8a6da3eda8faa5ae6e069	Reducing Fractions	To confuse the opponents, the Galactic Empire represents fractions in an unusual format. The fractions are represented as two sets of integers. The product of numbers from the first set gives the fraction numerator, the product of numbers from the second set gives the fraction denominator. However, it turned out that the programs that work with fractions in this representations aren't complete, they lack supporting the operation of reducing fractions. Implement this operation and the Empire won't forget you. The first input line contains two space-separated integers n, m (1<=≤<=n,<=m<=≤<=105) that show how many numbers the first set (the numerator) and the second set (the denominator) contain, correspondingly. The second line contains n space-separated integers: a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=107) — the numbers that are multiplied to produce the numerator. The third line contains m space-separated integers: b1,<=b2,<=...,<=bm (1<=≤<=bi<=≤<=107) — the numbers that are multiplied to produce the denominator. Print the answer to the problem in the form, similar to the form of the input data. The number of values in the sets you print nout,<=mout must satisfy the inequality 1<=≤<=nout,<=mout<=≤<=105, and the actual values in the sets aout,<=i and bout,<=i must satisfy the inequality 1<=≤<=aout,<=i,<=bout,<=i<=≤<=107. Separate the values in the lines by spaces. The printed fraction must be reduced, that is, there mustn't be such integer x (x<=><=1), that the numerator and the denominator of the printed fraction are divisible by x. If there are several matching answers, print any of them. Sample Input 3 2 100 5 2 50 10 4 3 2 5 10 20 100 1 3 Sample Output 2 3 2 1 1 1 1 1 1 20 3	{"inputs": ["3 2\n100 5 2\n50 10", "4 3\n2 5 10 20\n100 1 3", "2 3\n50 10\n100 5 2", "1 1\n1\n1", "3 2\n100 5 2\n10 100", "5 3\n16 24 36 54 81\n4 6 9", "10 10\n2 5 11 17 23 31 41 47 59 67\n3 7 13 19 29 37 43 53 61 71", "5 5\n2 9 8 3 5\n5 7 8 1 1", "10 11\n7 43 39 13 25 23 33 40 5 2\n42 22 39 1 23 37 12 48 46 2 2", "1 5\n99\n3 55 18 1 19"], "outputs": ["2 3\n2 1\n1 1 1", "1 1\n20\n3", "2 3\n1 1 \n2 1 1 ", "1 1\n1 \n1 ", "3 2\n1 1 1 \n1 1 ", "5 3\n16 24 9 27 3 \n1 1 1 ", "10 10\n2 5 11 17 23 31 41 47 59 67 \n3 7 13 19 29 37 43 53 61 71 ", "5 5\n2 9 1 3 1 \n1 7 1 1 1 ", "10 11\n1 43 13 1 25 1 1 5 5 1 \n6 2 3 1 23 37 4 8 1 1 1 ", "1 5\n1 \n3 5 2 1 19 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
f5720d2aa74a1670c2180f6deeffec02	Beads	One Martian boy called Zorg wants to present a string of beads to his friend from the Earth — Masha. He knows that Masha likes two colours: blue and red, — and right in the shop where he has come, there is a variety of adornments with beads of these two colours. All the strings of beads have a small fastener, and if one unfastens it, one might notice that all the strings of beads in the shop are of the same length. Because of the peculiarities of the Martian eyesight, if Zorg sees one blue-and-red string of beads first, and then the other with red beads instead of blue ones, and blue — instead of red, he regards these two strings of beads as identical. In other words, Zorg regards as identical not only those strings of beads that can be derived from each other by the string turnover, but as well those that can be derived from each other by a mutual replacement of colours and/or by the string turnover. It is known that all Martians are very orderly, and if a Martian sees some amount of objects, he tries to put them in good order. Zorg thinks that a red bead is smaller than a blue one. Let's put 0 for a red bead, and 1 — for a blue one. From two strings the Martian puts earlier the string with a red bead in the i-th position, providing that the second string has a blue bead in the i-th position, and the first two beads i<=-<=1 are identical. At first Zorg unfastens all the strings of beads, and puts them into small heaps so, that in each heap strings are identical, in his opinion. Then he sorts out the heaps and chooses the minimum string in each heap, in his opinion. He gives the unnecassary strings back to the shop assistant and says he doesn't need them any more. Then Zorg sorts out the remaining strings of beads and buys the string with index k. All these manupulations will take Zorg a lot of time, that's why he asks you to help and find the string of beads for Masha. The input file contains two integers n and k (2<=≤<=n<=≤<=50;1<=≤<=k<=≤<=1016) —the length of a string of beads, and the index of the string, chosen by Zorg. Output the k-th string of beads, putting 0 for a red bead, and 1 — for a blue one. If it s impossible to find the required string, output the only number -1. Sample Input 4 4 Sample Output 0101	{"inputs": ["4 4", "2 1", "2 2", "3 1", "3 2", "3 3", "4 1", "4 2", "4 3", "4 4", "4 5", "4 6", "5 1", "5 2", "5 3", "5 4", "5 5", "5 6", "5 7", "5 8", "5 9", "5 10", "6 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 14", "6 15", "6 16", "6 17", "6 18", "6 19", "6 20", "7 15", "8 38", "9 122", "10 204", "11 233", "12 838", "13 1395", "15 7182", "49 40394027154620", "49 60751526478082", "49 47052263674145", "49 112040518472135", "49 51848130384485", "49 125654751631398", "49 36309684494664", "49 130173238599396", "49 1277796700834", "49 140149194635018", "50 250144743882708", "50 107064605474749", "50 57129577186267", "50 161245081749292", "50 48522499712553", "50 264823400156610", "50 5176185247152", "50 280853334157361", "50 8840088596980", "50 280700827717974"], "outputs": ["0101", "01", "-1", "001", "010", "-1", "0001", "0010", "0011", "0101", "0110", "-1", "00001", "00010", "00011", "00100", "00101", "00110", "01001", "01010", "01110", "-1", "000001", "000010", "000011", "000100", "000101", "000110", "000111", "001001", "001010", "001011", "001100", "001101", "001110", "010001", "010010", "010101", "010110", "011001", "011110", "-1", "0010001", "00101011", "010110110", "0100001001", "00100000110", "010001101110", "0011011100001", "010100100010110", "0001001111101011001111110101110100100000001011001", "0001111110000000110111111000011100100101011101101", "0001011110010000111110011010010011001001000001110", "0100011000110011010111000100101001100101110010010", "0001101001000110010000111010110110011111010000011", "0101011000011000110101000100101001000001111011001", "0001000110111101110000010011001100010001010001001", "0101110011101110010011111111010101001011111101001", "0000000010010101000110000010001111111010111011010", "0111011110111001011010110100111001100100111000001", "01010101010010111011000010110101001100000110000101", "00011011001111100010010111111110001010101001100010", "00001101101110011100010111101100101101111110100110", "00101100010110000001101000110001001101000011000011", "00001011100011011110000110010110011001011100111011", "01100000110111100000001000001110010101010011111110", "00000001001011101011000100010001010111011000010101", "01111001111111000000110101011110110100000010000001", "00000010000001101010101001101010111000110010100110", "01111001010010011000001011001100001101000110111110"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
f5785293d81f3553abdcb79b2d447963	Divide by three, multiply by two	Polycarp likes to play with numbers. He takes some integer number $x$, writes it down on the board, and then performs with it $n - 1$ operations of the two kinds: - divide the number $x$ by $3$ ($x$ must be divisible by $3$); - multiply the number $x$ by $2$. After each operation, Polycarp writes down the result on the board and replaces $x$ by the result. So there will be $n$ numbers on the board after all. You are given a sequence of length $n$ — the numbers that Polycarp wrote down. This sequence is given in arbitrary order, i.e. the order of the sequence can mismatch the order of the numbers written on the board. Your problem is to rearrange (reorder) elements of this sequence in such a way that it can match possible Polycarp's game in the order of the numbers written on the board. I.e. each next number will be exactly two times of the previous number or exactly one third of previous number. It is guaranteed that the answer exists. The first line of the input contatins an integer number $n$ ($2 \le n \le 100$) — the number of the elements in the sequence. The second line of the input contains $n$ integer numbers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 3 \cdot 10^{18}$) — rearranged (reordered) sequence that Polycarp can wrote down on the board. Print $n$ integer numbers — rearranged (reordered) input sequence that can be the sequence that Polycarp could write down on the board. It is guaranteed that the answer exists. Sample Input 6 4 8 6 3 12 9 4 42 28 84 126 2 1000000000000000000 3000000000000000000 Sample Output 9 3 6 12 4 8 126 42 84 28 3000000000000000000 1000000000000000000	{"inputs": ["6\n4 8 6 3 12 9", "4\n42 28 84 126", "2\n1000000000000000000 3000000000000000000", "19\n46875000000000000 732421875000000 5859375000000000 11444091796875 2929687500000000 187500000000000000 91552734375000 11718750000000000 3000000000000000000 22888183593750 1464843750000000 375000000000000000 45776367187500 183105468750000 93750000000000000 366210937500000 23437500000000000 750000000000000000 1500000000000000000", "6\n558 744 1488 279 2232 1116", "17\n2985984 2239488 7077888 5971968 10616832 746496 28311552 3538944 7962624 3145728 15925248 1492992 14155776 5308416 3981312 11943936 9437184", "18\n47775744 7077888 5971968 3538944 4478976 3145728 2985984 4718592 1572864 5308416 1048576 1492992 23887872 10616832 2239488 11943936 15925248 14155776", "3\n9000 1000 3000", "2\n3000 9000", "2\n3000000000000000000 1000000000000000000", "2\n1 3", "2\n1500000000000000000 3000000000000000000", "3\n4 1 2", "2\n2000000000000000004 1000000000000000002", "2\n2999999999999999997 999999999999999999", "2\n999999999999999999 1999999999999999998", "2\n1999999999999999998 999999999999999999", "2\n10 5"], "outputs": ["9 3 6 12 4 8 ", "126 42 84 28 ", "3000000000000000000 1000000000000000000 ", "11444091796875 22888183593750 45776367187500 91552734375000 183105468750000 366210937500000 732421875000000 1464843750000000 2929687500000000 5859375000000000 11718750000000000 23437500000000000 46875000000000000 93750000000000000 187500000000000000 375000000000000000 750000000000000000 1500000000000000000 3000000000000000000 ", "279 558 1116 2232 744 1488 ", "2239488 746496 1492992 2985984 5971968 11943936 3981312 7962624 15925248 5308416 10616832 3538944 7077888 14155776 28311552 9437184 3145728 ", "2239488 4478976 1492992 2985984 5971968 11943936 23887872 47775744 15925248 5308416 10616832 3538944 7077888 14155776 4718592 1572864 3145728 1048576 ", "9000 3000 1000 ", "9000 3000 ", "3000000000000000000 1000000000000000000 ", "3 1 ", "1500000000000000000 3000000000000000000 ", "1 2 4 ", "1000000000000000002 2000000000000000004 ", "2999999999999999997 999999999999999999 ", "999999999999999999 1999999999999999998 ", "999999999999999999 1999999999999999998 ", "5 10 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	14	codeforces
f58134faa67baff47e60249ea62a672c	Dexterina’s Lab	Dexterina and Womandark have been arch-rivals since they’ve known each other. Since both are super-intelligent teenage girls, they’ve always been trying to solve their disputes in a peaceful and nonviolent way. After god knows how many different challenges they’ve given to one another, their score is equal and they’re both desperately trying to best the other in various games of wits. This time, Dexterina challenged Womandark to a game of Nim. Nim is a two-player game in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects from a single heap. The player who can't make a turn loses. By their agreement, the sizes of piles are selected randomly from the range [0,<=x]. Each pile's size is taken independently from the same probability distribution that is known before the start of the game. Womandark is coming up with a brand new and evil idea on how to thwart Dexterina’s plans, so she hasn’t got much spare time. She, however, offered you some tips on looking fabulous in exchange for helping her win in Nim. Your task is to tell her what is the probability that the first player to play wins, given the rules as above. The first line of the input contains two integers n (1<=≤<=n<=≤<=109) and x (1<=≤<=x<=≤<=100) — the number of heaps and the maximum number of objects in a heap, respectively. The second line contains x<=+<=1 real numbers, given with up to 6 decimal places each: P(0),<=P(1),<=... ,<=P(X). Here, P(i) is the probability of a heap having exactly i objects in start of a game. It's guaranteed that the sum of all P(i) is equal to 1. Output a single real number, the probability that the first player wins. The answer will be judged as correct if it differs from the correct answer by at most 10<=-<=6. Sample Input 2 2 0.500000 0.250000 0.250000 Sample Output 0.62500000	{"inputs": ["2 2\n0.500000 0.250000 0.250000", "9 9\n0.100000 0.100000 0.100000 0.100000 0.100000 0.100000 0.100000 0.100000 0.100000 0.100000", "1000001 5\n0.000000 0.300000 0.000000 0.500000 0.000000 0.200000", "1000000 5\n0.000000 0.000000 1.000000 0.000000 0.000000 0.000000", "100 20\n0.065682 0.015963 0.024840 0.025856 0.000807 0.004366 0.020977 0.151841 0.050870 0.009918 0.044345 0.009672 0.077615 0.019520 0.166791 0.028122 0.010873 0.018634 0.172648 0.037614 0.043046", "1000000 50\n0.034403 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.033928 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.071853 0.000000 0.000000 0.016440 0.000000 0.000000 0.000000 0.000000 0.023167 0.067938 0.000000 0.000000 0.000000 0.000000 0.176349 0.030154 0.180266 0.272662 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.000000 0.014462 0.000000 0.000000 0.037916 0.040462"], "outputs": ["0.62500000", "0.93687014", "1.00000000", "0.00000000", "0.96875000", "0.98437500"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
f597a081a3acc7008f50eae51fc18f00	Lost in Transliteration	There are some ambiguities when one writes Berland names with the letters of the Latin alphabet. For example, the Berland sound u can be written in the Latin alphabet as "u", and can be written as "oo". For this reason, two words "ulyana" and "oolyana" denote the same name. The second ambiguity is about the Berland sound h: one can use both "h" and "kh" to write it. For example, the words "mihail" and "mikhail" denote the same name. There are n users registered on the Polycarp's website. Each of them indicated a name represented by the Latin letters. How many distinct names are there among them, if two ambiguities described above are taken into account? Formally, we assume that two words denote the same name, if using the replacements "u" "oo" and "h" "kh", you can make the words equal. One can make replacements in both directions, in any of the two words an arbitrary number of times. A letter that resulted from the previous replacement can participate in the next replacements. For example, the following pairs of words denote the same name: - "koouper" and "kuooper". Making the replacements described above, you can make both words to be equal: "koouper" "kuuper" and "kuooper" "kuuper". - "khun" and "kkkhoon". With the replacements described above you can make both words to be equal: "khun" "khoon" and "kkkhoon" "kkhoon" "khoon". For a given list of words, find the minimal number of groups where the words in each group denote the same name. The first line contains integer number n (2<=≤<=n<=≤<=400) — number of the words in the list. The following n lines contain words, one word per line. Each word consists of only lowercase Latin letters. The length of each word is between 1 and 20 letters inclusive. Print the minimal number of groups where the words in each group denote the same name. Sample Input 10 mihail oolyana kooooper hoon ulyana koouper mikhail khun kuooper kkkhoon 9 hariton hkariton buoi kkkhariton boooi bui khariton boui boi 2 alex alex Sample Output 4 5 1	{"inputs": ["10\nmihail\noolyana\nkooooper\nhoon\nulyana\nkoouper\nmikhail\nkhun\nkuooper\nkkkhoon", "9\nhariton\nhkariton\nbuoi\nkkkhariton\nboooi\nbui\nkhariton\nboui\nboi", "2\nalex\nalex", "40\nuok\nkuu\nku\no\nkku\nuh\nu\nu\nhh\nk\nkh\nh\nh\nou\nokh\nukk\nou\nuhk\nuo\nuko\nu\nuu\nh\nh\nhk\nuhu\nuoh\nooo\nk\nh\nuk\nk\nkku\nh\nku\nok\nk\nkuu\nou\nhh", "40\noooo\nhu\no\nhoh\nkhk\nuuh\nhu\nou\nuuoh\no\nkouk\nuouo\nu\nok\nuu\nuuuo\nhoh\nuu\nkuu\nh\nu\nkkoh\nkhh\nuoh\nouuk\nkuo\nk\nu\nuku\nh\nu\nk\nhuho\nku\nh\noo\nuh\nk\nuo\nou", "100\nuh\nu\nou\nhk\nokh\nuou\nk\no\nuhh\nk\noku\nk\nou\nhuh\nkoo\nuo\nkk\nkok\nhhu\nuu\noou\nk\nk\noh\nhk\nk\nu\no\nuo\no\no\no\nhoh\nkuo\nhuh\nkhu\nuu\nk\noku\nk\nh\nuu\nuo\nhuo\noo\nhu\nukk\nok\no\noh\nuo\nkko\nok\nouh\nkoh\nhhu\nku\nko\nhho\nkho\nkho\nkhk\nho\nhk\nuko\nukh\nh\nkh\nkk\nuku\nkkk\no\nuo\no\nouh\nou\nuhk\nou\nk\nh\nkko\nuko\no\nu\nho\nu\nooo\nuo\no\nko\noh\nkh\nuk\nohk\noko\nuko\nh\nh\noo\no", "101\nukuu\nh\nouuo\no\nkkuo\nko\nu\nh\nhku\nh\nh\nhuo\nuhoh\nkuu\nhu\nhkko\nuhuk\nkoho\nh\nhukk\noohu\nkk\nkko\nou\noou\nh\nuuu\nuh\nkhuk\nokoo\nouou\nuo\nkk\noo\nhuok\no\nu\nhok\nhu\nhhuu\nkuu\nooho\noku\nhuoh\nhhkh\nuuuh\nouo\nhou\nhhu\nh\no\nokou\nuo\nh\nukk\nu\nhook\nh\noouk\nokuo\nkuuu\nk\nuuk\nu\nukk\nkk\nu\nuhk\nh\nk\nokuu\nuoho\nkhuk\nhukk\nhoo\nouko\nu\nuu\nu\nh\nhuo\nh\nukk\nhk\nk\nuoh\nhk\nko\nou\nho\nu\nhhhk\nkuo\nhuo\nhkh\nku\nhok\nho\nkok\nhk\nouuh", "2\nkkkhkkh\nhh", "2\nkkhookkhoo\nhuhu"], "outputs": ["4", "5", "1", "21", "25", "36", "50", "1", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	88	codeforces
f5a3f39afda2c439a842a8a0e82872d9	Start of the session	Before the start of the football season in Berland a strange magic ritual is held. The most experienced magicians have to find a magic matrix of the size n<=×<=n (n is even number). Gods will never allow to start the championship without it. Matrix should contain integers from 0 to n<=-<=1, main diagonal should contain only zeroes and matrix should be symmetric. Moreover, all numbers in each row should be different. Magicians are very tired of the thinking process, so they ask you to write a program to find such matrix. The first line contains one integer n (2<=≤<=n<=≤<=1000), n is even. Output n lines with n numbers each — the required matrix. Separate numbers with spaces. If there are several solutions, output any. Sample Input 2 4 Sample Output 0 1 1 0 0 1 3 2 1 0 2 3 3 2 0 1 2 3 1 0	{"inputs": ["2", "4", "6", "8", "10", "12", "14", "16", "18", "20", "32", "40", "666", "66", "80", "88", "96", "100", "128", "144", "250", "284", "332", "400", "600", "700", "780", "846", "902", "1000"], "outputs": ["0 1\n1 0", "0 1 3 2\n1 0 2 3\n3 2 0 1\n2 3 1 0", "0 1 4 2 5 3\n1 0 2 5 3 4\n4 2 0 3 1 5\n2 5 3 0 4 1\n5 3 1 4 0 2\n3 4 5 1 2 0", "0 1 5 2 6 3 7 4\n1 0 2 6 3 7 4 5\n5 2 0 3 7 4 1 6\n2 6 3 0 4 1 5 7\n6 3 7 4 0 5 2 1\n3 7 4 1 5 0 6 2\n7 4 1 5 2 6 0 3\n4 5 6 7 1 2 3 0", "0 1 6 2 7 3 8 4 9 5\n1 0 2 7 3 8 4 9 5 6\n6 2 0 3 8 4 9 5 1 7\n2 7 3 0 4 9 5 1 6 8\n7 3 8 4 0 5 1 6 2 9\n3 8 4 9 5 0 6 2 7 1\n8 4 9 5 1 6 0 7 3 2\n4 9 5 1 6 2 7 0 8 3\n9 5 1 6 2 7 3 8 0 4\n5 6 7 8 9 1 2 3 4 0", "0 1 7 2 8 3 9 4 10 5 11 6\n1 0 2 8 3 9 4 10 5 11 6 7\n7 2 0 3 9 4 10 5 11 6 1 8\n2 8 3 0 4 10 5 11 6 1 7 9\n8 3 9 4 0 5 11 6 1 7 2 10\n3 9 4 10 5 0 6 1 7 2 8 11\n9 4 10 5 11 6 0 7 2 8 3 1\n4 10 5 11 6 1 7 0 8 3 9 2\n10 5 11 6 1 7 2 8 0 9 4 3\n5 11 6 1 7 2 8 3 9 0 10 4\n11 6 1 7 2 8 3 9 4 10 0 5\n6 7 8 9 10 11 1 2 3 4 5 0", "0 1 8 2 9 3 10 4 11 5 12 6 13 7\n1 0 2 9 3 10 4 11 5 12 6 13 7 8\n8 2 0 3 10 4 11 5 12 6 13 7 1 9\n2 9 3 0 4 11 5 12 6 13 7 1 8 10\n9 3 10 4 0 5 12 6 13 7 1 8 2 11\n3 10 4 11 5 0 6 13 7 1 8 2 9 12\n10 4 11 5 12 6 0 7 1 8 2 9 3 13\n4 11 5 12 6 13 7 0 8 2 9 3 10 1\n11 5 12 6 13 7 1 8 0 9 3 10 4 2\n5 12 6 13 7 1 8 2 9 0 10 4 11 3\n12 6 13 7 1 8 2 9 3 10 0 11 5 4\n6 13 7 1 8 2 9 3 10 4 11 0 12 5\n13 7 1 8 2 9 3 10 4 11 5 12 0 6\n7 8 9 10 11 12 13 1 2 3 4 5 6 0", "0 1 9 2 10 3 11 4 12 5 13 6 14 7 15 8\n1 0 2 10 3 11 4 12 5 13 6 14 7 15 8 9\n9 2 0 3 11 4 12 5 13 6 14 7 15 8 1 10\n2 10 3 0 4 12 5 13 6 14 7 15 8 1 9 11\n10 3 11 4 0 5 13 6 14 7 15 8 1 9 2 12\n3 11 4 12 5 0 6 14 7 15 8 1 9 2 10 13\n11 4 12 5 13 6 0 7 15 8 1 9 2 10 3 14\n4 12 5 13 6 14 7 0 8 1 9 2 10 3 11 15\n12 5 13 6 14 7 15 8 0 9 2 10 3 11 4 1\n5 13 6 14 7 15 8 1 9 0 10 3 11 4 12 2\n13 6 14 7 15 8 1 9 2 10 0 11 4 12 5 3\n6 14 7 15 8 1 9 2 10 3 11 0 12 5 13 4\n14 7 15 8 1 9 2 10 3 11 4 12 0 13 6 5\n7 15...", "0 1 10 2 11 3 12 4 13 5 14 6 15 7 16 8 17 9\n1 0 2 11 3 12 4 13 5 14 6 15 7 16 8 17 9 10\n10 2 0 3 12 4 13 5 14 6 15 7 16 8 17 9 1 11\n2 11 3 0 4 13 5 14 6 15 7 16 8 17 9 1 10 12\n11 3 12 4 0 5 14 6 15 7 16 8 17 9 1 10 2 13\n3 12 4 13 5 0 6 15 7 16 8 17 9 1 10 2 11 14\n12 4 13 5 14 6 0 7 16 8 17 9 1 10 2 11 3 15\n4 13 5 14 6 15 7 0 8 17 9 1 10 2 11 3 12 16\n13 5 14 6 15 7 16 8 0 9 1 10 2 11 3 12 4 17\n5 14 6 15 7 16 8 17 9 0 10 2 11 3 12 4 13 1\n14 6 15 7 16 8 17 9 1 10 0 11 3 12 4 13 5 2\n6 15 7 16 8 17 9...", "0 1 11 2 12 3 13 4 14 5 15 6 16 7 17 8 18 9 19 10\n1 0 2 12 3 13 4 14 5 15 6 16 7 17 8 18 9 19 10 11\n11 2 0 3 13 4 14 5 15 6 16 7 17 8 18 9 19 10 1 12\n2 12 3 0 4 14 5 15 6 16 7 17 8 18 9 19 10 1 11 13\n12 3 13 4 0 5 15 6 16 7 17 8 18 9 19 10 1 11 2 14\n3 13 4 14 5 0 6 16 7 17 8 18 9 19 10 1 11 2 12 15\n13 4 14 5 15 6 0 7 17 8 18 9 19 10 1 11 2 12 3 16\n4 14 5 15 6 16 7 0 8 18 9 19 10 1 11 2 12 3 13 17\n14 5 15 6 16 7 17 8 0 9 19 10 1 11 2 12 3 13 4 18\n5 15 6 16 7 17 8 18 9 0 10 1 11 2 12 3 13 4 14 19\n1...", "0 1 17 2 18 3 19 4 20 5 21 6 22 7 23 8 24 9 25 10 26 11 27 12 28 13 29 14 30 15 31 16\n1 0 2 18 3 19 4 20 5 21 6 22 7 23 8 24 9 25 10 26 11 27 12 28 13 29 14 30 15 31 16 17\n17 2 0 3 19 4 20 5 21 6 22 7 23 8 24 9 25 10 26 11 27 12 28 13 29 14 30 15 31 16 1 18\n2 18 3 0 4 20 5 21 6 22 7 23 8 24 9 25 10 26 11 27 12 28 13 29 14 30 15 31 16 1 17 19\n18 3 19 4 0 5 21 6 22 7 23 8 24 9 25 10 26 11 27 12 28 13 29 14 30 15 31 16 1 17 2 20\n3 19 4 20 5 0 6 22 7 23 8 24 9 25 10 26 11 27 12 28 13 29 14 30 15 31 16 1 1...", "0 1 21 2 22 3 23 4 24 5 25 6 26 7 27 8 28 9 29 10 30 11 31 12 32 13 33 14 34 15 35 16 36 17 37 18 38 19 39 20\n1 0 2 22 3 23 4 24 5 25 6 26 7 27 8 28 9 29 10 30 11 31 12 32 13 33 14 34 15 35 16 36 17 37 18 38 19 39 20 21\n21 2 0 3 23 4 24 5 25 6 26 7 27 8 28 9 29 10 30 11 31 12 32 13 33 14 34 15 35 16 36 17 37 18 38 19 39 20 1 22\n2 22 3 0 4 24 5 25 6 26 7 27 8 28 9 29 10 30 11 31 12 32 13 33 14 34 15 35 16 36 17 37 18 38 19 39 20 1 21 23\n22 3 23 4 0 5 25 6 26 7 27 8 28 9 29 10 30 11 31 12 32 13 33 14 34 ...", "0 1 334 2 335 3 336 4 337 5 338 6 339 7 340 8 341 9 342 10 343 11 344 12 345 13 346 14 347 15 348 16 349 17 350 18 351 19 352 20 353 21 354 22 355 23 356 24 357 25 358 26 359 27 360 28 361 29 362 30 363 31 364 32 365 33 366 34 367 35 368 36 369 37 370 38 371 39 372 40 373 41 374 42 375 43 376 44 377 45 378 46 379 47 380 48 381 49 382 50 383 51 384 52 385 53 386 54 387 55 388 56 389 57 390 58 391 59 392 60 393 61 394 62 395 63 396 64 397 65 398 66 399 67 400 68 401 69 402 70 403 71 404 72 405 73 406 74 407 ...", "0 1 34 2 35 3 36 4 37 5 38 6 39 7 40 8 41 9 42 10 43 11 44 12 45 13 46 14 47 15 48 16 49 17 50 18 51 19 52 20 53 21 54 22 55 23 56 24 57 25 58 26 59 27 60 28 61 29 62 30 63 31 64 32 65 33\n1 0 2 35 3 36 4 37 5 38 6 39 7 40 8 41 9 42 10 43 11 44 12 45 13 46 14 47 15 48 16 49 17 50 18 51 19 52 20 53 21 54 22 55 23 56 24 57 25 58 26 59 27 60 28 61 29 62 30 63 31 64 32 65 33 34\n34 2 0 3 36 4 37 5 38 6 39 7 40 8 41 9 42 10 43 11 44 12 45 13 46 14 47 15 48 16 49 17 50 18 51 19 52 20 53 21 54 22 55 23 56 24 57 2...", "0 1 41 2 42 3 43 4 44 5 45 6 46 7 47 8 48 9 49 10 50 11 51 12 52 13 53 14 54 15 55 16 56 17 57 18 58 19 59 20 60 21 61 22 62 23 63 24 64 25 65 26 66 27 67 28 68 29 69 30 70 31 71 32 72 33 73 34 74 35 75 36 76 37 77 38 78 39 79 40\n1 0 2 42 3 43 4 44 5 45 6 46 7 47 8 48 9 49 10 50 11 51 12 52 13 53 14 54 15 55 16 56 17 57 18 58 19 59 20 60 21 61 22 62 23 63 24 64 25 65 26 66 27 67 28 68 29 69 30 70 31 71 32 72 33 73 34 74 35 75 36 76 37 77 38 78 39 79 40 41\n41 2 0 3 43 4 44 5 45 6 46 7 47 8 48 9 49 10 50 1...", "0 1 45 2 46 3 47 4 48 5 49 6 50 7 51 8 52 9 53 10 54 11 55 12 56 13 57 14 58 15 59 16 60 17 61 18 62 19 63 20 64 21 65 22 66 23 67 24 68 25 69 26 70 27 71 28 72 29 73 30 74 31 75 32 76 33 77 34 78 35 79 36 80 37 81 38 82 39 83 40 84 41 85 42 86 43 87 44\n1 0 2 46 3 47 4 48 5 49 6 50 7 51 8 52 9 53 10 54 11 55 12 56 13 57 14 58 15 59 16 60 17 61 18 62 19 63 20 64 21 65 22 66 23 67 24 68 25 69 26 70 27 71 28 72 29 73 30 74 31 75 32 76 33 77 34 78 35 79 36 80 37 81 38 82 39 83 40 84 41 85 42 86 43 87 44 45\n4...", "0 1 49 2 50 3 51 4 52 5 53 6 54 7 55 8 56 9 57 10 58 11 59 12 60 13 61 14 62 15 63 16 64 17 65 18 66 19 67 20 68 21 69 22 70 23 71 24 72 25 73 26 74 27 75 28 76 29 77 30 78 31 79 32 80 33 81 34 82 35 83 36 84 37 85 38 86 39 87 40 88 41 89 42 90 43 91 44 92 45 93 46 94 47 95 48\n1 0 2 50 3 51 4 52 5 53 6 54 7 55 8 56 9 57 10 58 11 59 12 60 13 61 14 62 15 63 16 64 17 65 18 66 19 67 20 68 21 69 22 70 23 71 24 72 25 73 26 74 27 75 28 76 29 77 30 78 31 79 32 80 33 81 34 82 35 83 36 84 37 85 38 86 39 87 40 88 41...", "0 1 51 2 52 3 53 4 54 5 55 6 56 7 57 8 58 9 59 10 60 11 61 12 62 13 63 14 64 15 65 16 66 17 67 18 68 19 69 20 70 21 71 22 72 23 73 24 74 25 75 26 76 27 77 28 78 29 79 30 80 31 81 32 82 33 83 34 84 35 85 36 86 37 87 38 88 39 89 40 90 41 91 42 92 43 93 44 94 45 95 46 96 47 97 48 98 49 99 50\n1 0 2 52 3 53 4 54 5 55 6 56 7 57 8 58 9 59 10 60 11 61 12 62 13 63 14 64 15 65 16 66 17 67 18 68 19 69 20 70 21 71 22 72 23 73 24 74 25 75 26 76 27 77 28 78 29 79 30 80 31 81 32 82 33 83 34 84 35 85 36 86 37 87 38 88 39...", "0 1 65 2 66 3 67 4 68 5 69 6 70 7 71 8 72 9 73 10 74 11 75 12 76 13 77 14 78 15 79 16 80 17 81 18 82 19 83 20 84 21 85 22 86 23 87 24 88 25 89 26 90 27 91 28 92 29 93 30 94 31 95 32 96 33 97 34 98 35 99 36 100 37 101 38 102 39 103 40 104 41 105 42 106 43 107 44 108 45 109 46 110 47 111 48 112 49 113 50 114 51 115 52 116 53 117 54 118 55 119 56 120 57 121 58 122 59 123 60 124 61 125 62 126 63 127 64\n1 0 2 66 3 67 4 68 5 69 6 70 7 71 8 72 9 73 10 74 11 75 12 76 13 77 14 78 15 79 16 80 17 81 18 82 19 83 20 8...", "0 1 73 2 74 3 75 4 76 5 77 6 78 7 79 8 80 9 81 10 82 11 83 12 84 13 85 14 86 15 87 16 88 17 89 18 90 19 91 20 92 21 93 22 94 23 95 24 96 25 97 26 98 27 99 28 100 29 101 30 102 31 103 32 104 33 105 34 106 35 107 36 108 37 109 38 110 39 111 40 112 41 113 42 114 43 115 44 116 45 117 46 118 47 119 48 120 49 121 50 122 51 123 52 124 53 125 54 126 55 127 56 128 57 129 58 130 59 131 60 132 61 133 62 134 63 135 64 136 65 137 66 138 67 139 68 140 69 141 70 142 71 143 72\n1 0 2 74 3 75 4 76 5 77 6 78 7 79 8 80 9 81 ...", "0 1 126 2 127 3 128 4 129 5 130 6 131 7 132 8 133 9 134 10 135 11 136 12 137 13 138 14 139 15 140 16 141 17 142 18 143 19 144 20 145 21 146 22 147 23 148 24 149 25 150 26 151 27 152 28 153 29 154 30 155 31 156 32 157 33 158 34 159 35 160 36 161 37 162 38 163 39 164 40 165 41 166 42 167 43 168 44 169 45 170 46 171 47 172 48 173 49 174 50 175 51 176 52 177 53 178 54 179 55 180 56 181 57 182 58 183 59 184 60 185 61 186 62 187 63 188 64 189 65 190 66 191 67 192 68 193 69 194 70 195 71 196 72 197 73 198 74 199 ...", "0 1 143 2 144 3 145 4 146 5 147 6 148 7 149 8 150 9 151 10 152 11 153 12 154 13 155 14 156 15 157 16 158 17 159 18 160 19 161 20 162 21 163 22 164 23 165 24 166 25 167 26 168 27 169 28 170 29 171 30 172 31 173 32 174 33 175 34 176 35 177 36 178 37 179 38 180 39 181 40 182 41 183 42 184 43 185 44 186 45 187 46 188 47 189 48 190 49 191 50 192 51 193 52 194 53 195 54 196 55 197 56 198 57 199 58 200 59 201 60 202 61 203 62 204 63 205 64 206 65 207 66 208 67 209 68 210 69 211 70 212 71 213 72 214 73 215 74 216 ...", "0 1 167 2 168 3 169 4 170 5 171 6 172 7 173 8 174 9 175 10 176 11 177 12 178 13 179 14 180 15 181 16 182 17 183 18 184 19 185 20 186 21 187 22 188 23 189 24 190 25 191 26 192 27 193 28 194 29 195 30 196 31 197 32 198 33 199 34 200 35 201 36 202 37 203 38 204 39 205 40 206 41 207 42 208 43 209 44 210 45 211 46 212 47 213 48 214 49 215 50 216 51 217 52 218 53 219 54 220 55 221 56 222 57 223 58 224 59 225 60 226 61 227 62 228 63 229 64 230 65 231 66 232 67 233 68 234 69 235 70 236 71 237 72 238 73 239 74 240 ...", "0 1 201 2 202 3 203 4 204 5 205 6 206 7 207 8 208 9 209 10 210 11 211 12 212 13 213 14 214 15 215 16 216 17 217 18 218 19 219 20 220 21 221 22 222 23 223 24 224 25 225 26 226 27 227 28 228 29 229 30 230 31 231 32 232 33 233 34 234 35 235 36 236 37 237 38 238 39 239 40 240 41 241 42 242 43 243 44 244 45 245 46 246 47 247 48 248 49 249 50 250 51 251 52 252 53 253 54 254 55 255 56 256 57 257 58 258 59 259 60 260 61 261 62 262 63 263 64 264 65 265 66 266 67 267 68 268 69 269 70 270 71 271 72 272 73 273 74 274 ...", "0 1 301 2 302 3 303 4 304 5 305 6 306 7 307 8 308 9 309 10 310 11 311 12 312 13 313 14 314 15 315 16 316 17 317 18 318 19 319 20 320 21 321 22 322 23 323 24 324 25 325 26 326 27 327 28 328 29 329 30 330 31 331 32 332 33 333 34 334 35 335 36 336 37 337 38 338 39 339 40 340 41 341 42 342 43 343 44 344 45 345 46 346 47 347 48 348 49 349 50 350 51 351 52 352 53 353 54 354 55 355 56 356 57 357 58 358 59 359 60 360 61 361 62 362 63 363 64 364 65 365 66 366 67 367 68 368 69 369 70 370 71 371 72 372 73 373 74 374 ...", "0 1 351 2 352 3 353 4 354 5 355 6 356 7 357 8 358 9 359 10 360 11 361 12 362 13 363 14 364 15 365 16 366 17 367 18 368 19 369 20 370 21 371 22 372 23 373 24 374 25 375 26 376 27 377 28 378 29 379 30 380 31 381 32 382 33 383 34 384 35 385 36 386 37 387 38 388 39 389 40 390 41 391 42 392 43 393 44 394 45 395 46 396 47 397 48 398 49 399 50 400 51 401 52 402 53 403 54 404 55 405 56 406 57 407 58 408 59 409 60 410 61 411 62 412 63 413 64 414 65 415 66 416 67 417 68 418 69 419 70 420 71 421 72 422 73 423 74 424 ...", "0 1 391 2 392 3 393 4 394 5 395 6 396 7 397 8 398 9 399 10 400 11 401 12 402 13 403 14 404 15 405 16 406 17 407 18 408 19 409 20 410 21 411 22 412 23 413 24 414 25 415 26 416 27 417 28 418 29 419 30 420 31 421 32 422 33 423 34 424 35 425 36 426 37 427 38 428 39 429 40 430 41 431 42 432 43 433 44 434 45 435 46 436 47 437 48 438 49 439 50 440 51 441 52 442 53 443 54 444 55 445 56 446 57 447 58 448 59 449 60 450 61 451 62 452 63 453 64 454 65 455 66 456 67 457 68 458 69 459 70 460 71 461 72 462 73 463 74 464 ...", "0 1 424 2 425 3 426 4 427 5 428 6 429 7 430 8 431 9 432 10 433 11 434 12 435 13 436 14 437 15 438 16 439 17 440 18 441 19 442 20 443 21 444 22 445 23 446 24 447 25 448 26 449 27 450 28 451 29 452 30 453 31 454 32 455 33 456 34 457 35 458 36 459 37 460 38 461 39 462 40 463 41 464 42 465 43 466 44 467 45 468 46 469 47 470 48 471 49 472 50 473 51 474 52 475 53 476 54 477 55 478 56 479 57 480 58 481 59 482 60 483 61 484 62 485 63 486 64 487 65 488 66 489 67 490 68 491 69 492 70 493 71 494 72 495 73 496 74 497 ...", "0 1 452 2 453 3 454 4 455 5 456 6 457 7 458 8 459 9 460 10 461 11 462 12 463 13 464 14 465 15 466 16 467 17 468 18 469 19 470 20 471 21 472 22 473 23 474 24 475 25 476 26 477 27 478 28 479 29 480 30 481 31 482 32 483 33 484 34 485 35 486 36 487 37 488 38 489 39 490 40 491 41 492 42 493 43 494 44 495 45 496 46 497 47 498 48 499 49 500 50 501 51 502 52 503 53 504 54 505 55 506 56 507 57 508 58 509 59 510 60 511 61 512 62 513 63 514 64 515 65 516 66 517 67 518 68 519 69 520 70 521 71 522 72 523 73 524 74 525 ...", "0 1 501 2 502 3 503 4 504 5 505 6 506 7 507 8 508 9 509 10 510 11 511 12 512 13 513 14 514 15 515 16 516 17 517 18 518 19 519 20 520 21 521 22 522 23 523 24 524 25 525 26 526 27 527 28 528 29 529 30 530 31 531 32 532 33 533 34 534 35 535 36 536 37 537 38 538 39 539 40 540 41 541 42 542 43 543 44 544 45 545 46 546 47 547 48 548 49 549 50 550 51 551 52 552 53 553 54 554 55 555 56 556 57 557 58 558 59 559 60 560 61 561 62 562 63 563 64 564 65 565 66 566 67 567 68 568 69 569 70 570 71 571 72 572 73 573 74 574 ..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	6	codeforces
f5adec5d79907a5e2e386a91f8277578	Choosing Capital for Treeland	The country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Overall there are n<=-<=1 roads in the country. We know that if we don't take the direction of the roads into consideration, we can get from any city to any other one. The council of the elders has recently decided to choose the capital of Treeland. Of course it should be a city of this country. The council is supposed to meet in the capital and regularly move from the capital to other cities (at this stage nobody is thinking about getting back to the capital from these cities). For that reason if city a is chosen a capital, then all roads must be oriented so that if we move along them, we can get from city a to any other city. For that some roads may have to be inversed. Help the elders to choose the capital so that they have to inverse the minimum number of roads in the country. The first input line contains integer n (2<=≤<=n<=≤<=2·105) — the number of cities in Treeland. Next n<=-<=1 lines contain the descriptions of the roads, one road per line. A road is described by a pair of integers si,<=ti (1<=≤<=si,<=ti<=≤<=n; si<=≠<=ti) — the numbers of cities, connected by that road. The i-th road is oriented from city si to city ti. You can consider cities in Treeland indexed from 1 to n. In the first line print the minimum number of roads to be inversed if the capital is chosen optimally. In the second line print all possible ways to choose the capital — a sequence of indexes of cities in the increasing order. Sample Input 3 2 1 2 3 4 1 4 2 4 3 4 Sample Output 0 2 2 1 2 3	{"inputs": ["3\n2 1\n2 3", "4\n1 4\n2 4\n3 4", "2\n1 2", "8\n1 2\n3 2\n4 3\n4 5\n6 5\n6 7\n8 7", "10\n2 3\n1 8\n9 5\n5 4\n6 10\n4 8\n5 6\n7 6\n5 3", "10\n9 3\n3 8\n4 3\n3 5\n7 8\n10 3\n2 3\n6 2\n3 1", "10\n5 4\n6 5\n10 1\n2 5\n9 8\n1 3\n7 10\n2 3\n5 9", "10\n2 3\n1 8\n9 5\n5 4\n6 10\n4 8\n5 6\n7 6\n5 3", "11\n3 10\n4 7\n11 7\n8 2\n6 9\n9 3\n5 9\n1 3\n3 8\n7 3", "12\n10 7\n6 10\n8 10\n4 12\n10 4\n3 12\n1 2\n2 7\n4 5\n11 5\n11 9", "13\n7 13\n5 4\n5 1\n11 12\n8 3\n13 4\n10 7\n11 5\n8 13\n2 8\n10 6\n4 9", "14\n13 10\n5 14\n9 4\n8 12\n10 1\n5 2\n3 6\n11 2\n13 2\n13 7\n8 2\n4 5\n1 3", "15\n15 6\n2 15\n14 15\n15 12\n1 2\n10 15\n7 4\n13 7\n11 2\n5 2\n7 2\n3 2\n7 8\n9 15"], "outputs": ["0\n2 ", "2\n1 2 3 ", "0\n1 ", "3\n4 6 8 ", "3\n9 ", "4\n6 ", "2\n7 ", "3\n9 ", "5\n4 5 6 11 ", "5\n1 6 8 ", "4\n2 10 ", "3\n9 ", "7\n13 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	15	codeforces
f5b1edc2123050877e37a9fcb3209b4a	George and Number	George is a cat, so he really likes to play. Most of all he likes to play with his array of positive integers b. During the game, George modifies the array by using special changes. Let's mark George's current array as b1,<=b2,<=...,<=b\|b\| (record \|b\| denotes the current length of the array). Then one change is a sequence of actions: - Choose two distinct indexes i and j (1<=≤<=i,<=j<=≤<=\|b\|; i<=≠<=j), such that bi<=≥<=bj. - Get number v<==<=concat(bi,<=bj), where concat(x,<=y) is a number obtained by adding number y to the end of the decimal record of number x. For example, concat(500,<=10)<==<=50010, concat(2,<=2)<==<=22. - Add number v to the end of the array. The length of the array will increase by one. - Remove from the array numbers with indexes i and j. The length of the array will decrease by two, and elements of the array will become re-numbered from 1 to current length of the array. George played for a long time with his array b and received from array b an array consisting of exactly one number p. Now George wants to know: what is the maximum number of elements array b could contain originally? Help him find this number. Note that originally the array could contain only positive integers. The first line of the input contains a single integer p (1<=≤<=p<=<<=10100000). It is guaranteed that number p doesn't contain any leading zeroes. Print an integer — the maximum number of elements array b could contain originally. Sample Input 9555 10000000005 800101 45 1000000000000001223300003342220044555 19992000 310200 Sample Output 42311712	{"inputs": ["9555", "10000000005", "800101", "45", "1000000000000001223300003342220044555", "19992000", "310200", "63100605000394089000505000600600062000170273350000", "20900000000090009000070069000026000000000000020008", "60000000000000000000000000000000000000000000000000", "7", "6944262915652659458125599978116114458736683259866511789545994938161622536342972115877623999684282136", "45000", "10", "1", "456", "542", "54000", "999", "11", "11001000", "10001000", "112000", "1111200", "10000000000000000000000000000000000000400500000000000000000000000000000000030020010300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "110003000054"], "outputs": ["4", "2", "3", "1", "17", "1", "2", "21", "10", "1", "1", "99", "1", "1", "1", "2", "3", "1", "3", "2", "2", "2", "1", "5", "2", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	10	codeforces
f5beda691ed3a24d56dfc8e156695d38	Anagram Search	A string t is called an anagram of the string s, if it is possible to rearrange letters in t so that it is identical to the string s. For example, the string "aab" is an anagram of the string "aba" and the string "aaa" is not. The string t is called a substring of the string s if it can be read starting from some position in the string s. For example, the string "aba" has six substrings: "a", "b", "a", "ab", "ba", "aba". You are given a string s, consisting of lowercase Latin letters and characters "?". You are also given a string p, consisting of lowercase Latin letters only. Let's assume that a string is good if you can obtain an anagram of the string p from it, replacing the "?" characters by Latin letters. Each "?" can be replaced by exactly one character of the Latin alphabet. For example, if the string p = «aba», then the string "a??" is good, and the string «?bc» is not. Your task is to find the number of good substrings of the string s (identical substrings must be counted in the answer several times). The first line is non-empty string s, consisting of no more than 105 lowercase Latin letters and characters "?". The second line is non-empty string p, consisting of no more than 105 lowercase Latin letters. Please note that the length of the string p can exceed the length of the string s. Print the single number representing the number of good substrings of string s. Two substrings are considered different in their positions of occurrence are different. Thus, if some string occurs several times, then it should be counted the same number of times. Sample Input bb??x??? aab ab?c acb Sample Output 2 2	{"inputs": ["bb??x???\naab", "ab?c\nacb", "ccaac\ncbcbca", "?bba?\nbba", "aaaaa??a?a\naaa", "?bba?b?aaa\nabb", "?b?aaabaa?\naaa", "aaaaa?ab??\naab", "?bab?a?aab\naaa", "??fb???a??\ndeeefc", "?\na", "a\na", "?\ncb", "a\naa"], "outputs": ["2", "2", "0", "3", "8", "6", "3", "5", "3", "0", "1", "1", "0", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
f5de91435f10ae345408623b2344c3b1	Maximize!	You are given a multiset S consisting of positive integers (initially empty). There are two kind of queries: 1. Add a positive integer to S, the newly added integer is not less than any number in it. 1. Find a subset s of the set S such that the value is maximum possible. Here max(s) means maximum value of elements in s, — the average value of numbers in s. Output this maximum possible value of . The first line contains a single integer Q (1<=≤<=Q<=≤<=5·105) — the number of queries. Each of the next Q lines contains a description of query. For queries of type 1 two integers 1 and x are given, where x (1<=≤<=x<=≤<=109) is a number that you should add to S. It's guaranteed that x is not less than any number in S. For queries of type 2, a single integer 2 is given. It's guaranteed that the first query has type 1, i. e. S is not empty when a query of type 2 comes. Output the answer for each query of the second type in the order these queries are given in input. Each number should be printed in separate line. Your answer is considered correct, if each of your answers has absolute or relative error not greater than 10<=-<=6. Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if . Sample Input 6 1 3 2 1 4 2 1 8 2 4 1 1 1 4 1 5 2 Sample Output 0.0000000000 0.5000000000 3.0000000000 2.0000000000	{"inputs": ["6\n1 3\n2\n1 4\n2\n1 8\n2", "4\n1 1\n1 4\n1 5\n2", "8\n1 7\n1 26\n1 40\n1 45\n1 64\n2\n1 88\n1 94", "9\n1 35\n2\n2\n1 45\n1 58\n2\n2\n2\n1 100", "15\n1 300022520\n1 542407315\n2\n2\n2\n1 622764928\n1 706078395\n1 715915848\n1 933742920\n1 942115408\n2\n2\n2\n2\n2", "25\n1 134292126\n2\n1 218916741\n1 237556189\n2\n1 259193070\n2\n2\n1 397804479\n1 430795002\n2\n1 483338629\n1 626042215\n2\n1 658608263\n1 715368294\n2\n2\n2\n2\n1 833121838\n2\n1 863192433\n2\n1 966351027", "88\n1 1411\n2\n1 1783\n1 2132\n2\n2\n1 2799\n2\n2\n1 7856\n1 10551\n2\n2\n1 10868\n1 15159\n1 16497\n2\n1 20266\n2\n2\n2\n1 21665\n2\n2\n2\n2\n1 25670\n2\n2\n2\n1 26767\n1 31392\n2\n2\n2\n1 35319\n1 38575\n1 40111\n2\n1 41305\n1 49444\n1 53013\n2\n2\n1 53117\n2\n2\n1 55113\n2\n2\n2\n2\n2\n2\n1 55270\n1 55395\n1 57534\n2\n1 59699\n2\n2\n2\n2\n2\n1 63483\n1 68129\n2\n2\n2\n2\n2\n1 77893\n2\n2\n2\n2\n2\n1 78505\n1 79944\n1 84716\n1 85845\n2\n2\n1 87122\n1 87614\n1 88419\n1 98018\n2"], "outputs": ["0.0000000000\n0.5000000000\n3.0000000000", "2.0000000000", "31.6666666667", "0.0000000000\n0.0000000000\n12.0000000000\n12.0000000000\n12.0000000000", "121192397.5000000000\n121192397.5000000000\n121192397.5000000000\n347266993.6666666900\n347266993.6666666900\n347266993.6666666900\n347266993.6666666900\n347266993.6666666900", "0.0000000000\n51632031.5000000000\n62450472.0000000000\n62450472.0000000000\n175404987.5000000000\n330842146.8000000100\n402303010.0000000000\n402303010.0000000000\n402303010.0000000000\n402303010.0000000000\n496505845.1999999900\n520562321.1999999900", "0.0000000000\n360.5000000000\n360.5000000000\n801.3333333333\n801.3333333333\n6815.8000000000\n6815.8000000000\n11572.6000000000\n14587.8000000000\n14587.8000000000\n14587.8000000000\n15707.0000000000\n15707.0000000000\n15707.0000000000\n15707.0000000000\n18911.0000000000\n18911.0000000000\n18911.0000000000\n23496.5000000000\n23496.5000000000\n23496.5000000000\n30762.3333333333\n41711.3750000000\n41711.3750000000\n41802.3750000000\n41802.3750000000\n43548.8750000000\n43548.8750000000\n43548.8750000000\n435..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	8	codeforces
f6050dd5b349336b7c103efd3295fa88	Dasha and friends	Running with barriers on the circle track is very popular in the country where Dasha lives, so no wonder that on her way to classes she saw the following situation: The track is the circle with length L, in distinct points of which there are n barriers. Athlete always run the track in counterclockwise direction if you look on him from above. All barriers are located at integer distance from each other along the track. Her friends the parrot Kefa and the leopard Sasha participated in competitions and each of them ran one lap. Each of the friends started from some integral point on the track. Both friends wrote the distance from their start along the track to each of the n barriers. Thus, each of them wrote n integers in the ascending order, each of them was between 0 and L<=-<=1, inclusively. There are several tracks in the country, all of them have same length and same number of barriers, but the positions of the barriers can differ among different tracks. Now Dasha is interested if it is possible that Kefa and Sasha ran the same track or they participated on different tracks. Write the program which will check that Kefa's and Sasha's tracks coincide (it means that one can be obtained from the other by changing the start position). Note that they always run the track in one direction — counterclockwise, if you look on a track from above. The first line contains two integers n and L (1<=≤<=n<=≤<=50, n<=≤<=L<=≤<=100) — the number of barriers on a track and its length. The second line contains n distinct integers in the ascending order — the distance from Kefa's start to each barrier in the order of its appearance. All integers are in the range from 0 to L<=-<=1 inclusively. The second line contains n distinct integers in the ascending order — the distance from Sasha's start to each barrier in the order of its overcoming. All integers are in the range from 0 to L<=-<=1 inclusively. Print "YES" (without quotes), if Kefa and Sasha ran the coinciding tracks (it means that the position of all barriers coincides, if they start running from the same points on the track). Otherwise print "NO" (without quotes). Sample Input 3 8 2 4 6 1 5 7 4 9 2 3 5 8 0 1 3 6 2 4 1 3 1 2 Sample Output YES YES NO	{"inputs": ["3 8\n2 4 6\n1 5 7", "4 9\n2 3 5 8\n0 1 3 6", "2 4\n1 3\n1 2", "5 9\n0 2 5 6 7\n1 3 6 7 8", "5 60\n7 26 27 40 59\n14 22 41 42 55", "20 29\n0 1 2 4 5 8 9 12 14 15 17 19 20 21 22 23 25 26 27 28\n0 2 4 5 6 7 8 10 11 12 13 14 15 16 18 19 22 23 26 28", "35 41\n0 1 2 3 4 5 6 7 9 10 11 12 13 14 18 19 20 21 22 23 24 25 26 28 30 31 32 33 34 35 36 37 38 39 40\n0 1 2 3 4 5 7 8 9 10 11 12 16 17 18 19 20 21 22 23 24 26 28 29 30 31 32 33 34 35 36 37 38 39 40", "40 63\n0 2 3 4 5 6 9 10 12 15 17 19 23 25 26 27 28 29 30 31 33 34 36 37 38 39 40 43 45 49 50 52 53 54 55 57 58 60 61 62\n1 2 3 4 5 8 10 14 15 17 18 19 20 22 23 25 26 27 28 30 31 32 33 34 37 38 40 43 46 47 51 53 54 55 56 57 58 59 61 62", "50 97\n1 2 3 4 6 9 10 11 12 13 14 21 22 23 24 25 28 29 30 31 32 33 34 36 37 40 41 45 53 56 59 64 65 69 70 71 72 73 74 77 81 84 85 86 87 89 91 92 95 96\n0 1 2 3 6 10 13 14 15 16 18 20 21 24 25 27 28 29 30 33 35 36 37 38 39 40 47 48 49 50 51 54 55 56 57 58 59 60 62 63 66 67 71 79 82 85 90 91 95 96", "50 100\n0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50 52 54 56 58 60 62 64 66 68 70 72 74 76 78 80 82 84 86 88 90 92 94 96 98\n1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 51 53 55 57 59 61 63 65 67 69 71 73 75 77 79 81 83 85 87 89 91 93 95 97 99", "1 2\n0\n0", "1 2\n0\n1", "1 2\n1\n0", "1 2\n1\n1", "1 1\n0\n0", "5 12\n2 3 4 8 10\n2 3 4 8 10", "1 18\n3\n10", "1 75\n65\n8", "2 16\n4 13\n2 11", "2 95\n45 59\n3 84", "3 53\n29 43 50\n29 43 50", "3 60\n39 46 51\n43 50 55", "4 4\n0 1 2 3\n0 1 2 3", "4 93\n45 48 50 90\n20 68 71 73", "6 18\n0 3 8 11 15 16\n2 7 10 14 15 17", "6 87\n0 1 21 31 34 66\n11 12 32 42 45 77", "7 26\n0 3 9 13 14 19 20\n4 7 13 17 18 23 24", "7 81\n0 12 19 24 25 35 59\n1 8 13 14 24 48 70", "8 20\n0 1 2 3 5 6 14 15\n1 2 10 11 16 17 18 19", "8 94\n0 8 11 27 38 54 57 89\n1 33 38 46 49 65 76 92", "9 18\n1 3 6 8 11 12 13 16 17\n0 2 5 6 7 10 11 13 15", "9 90\n10 11 27 33 34 55 63 84 87\n9 12 25 26 42 48 49 70 78", "10 42\n4 9 10 14 15 16 19 33 36 40\n0 14 17 21 27 32 33 37 38 39", "10 73\n4 5 15 19 20 25 28 42 57 58\n3 4 9 12 26 41 42 61 62 72", "11 11\n0 1 2 3 4 5 6 7 8 9 10\n0 1 2 3 4 5 6 7 8 9 10", "11 57\n1 4 27 30 31 35 37 41 50 52 56\n22 25 26 30 32 36 45 47 51 53 56", "12 73\n5 9 11 20 25 36 40 41 44 48 56 60\n12 16 18 27 32 43 47 48 51 55 63 67", "12 95\n1 37 42 46 56 58 59 62 64 71 76 80\n2 18 54 59 63 73 75 76 79 81 88 93", "13 29\n2 5 6 9 12 17 18 19 20 21 22 24 27\n0 3 6 11 12 13 14 15 16 18 21 25 28", "13 90\n9 18 23 30 31 36 39 44 58 59 74 82 87\n1 6 18 27 32 39 40 45 48 53 67 68 83", "14 29\n1 2 3 4 5 7 9 12 13 20 21 22 23 24\n0 3 4 11 12 13 14 15 21 22 23 24 25 27", "14 94\n7 8 9 21 34 35 36 37 38 43 46 52 84 93\n2 3 4 16 29 30 31 32 33 38 41 47 79 88", "15 19\n1 2 3 4 5 6 7 8 9 10 11 13 14 16 17\n0 1 2 3 4 5 6 7 8 9 10 12 13 15 16", "15 27\n2 3 4 5 6 7 8 9 10 11 12 14 17 24 26\n2 3 4 5 6 7 8 9 10 11 12 14 17 24 26", "16 28\n3 5 6 7 9 10 11 12 13 14 17 19 20 25 26 27\n0 5 6 7 11 13 14 15 17 18 19 20 21 22 25 27", "16 93\n5 6 10 11 13 14 41 43 46 61 63 70 74 79 83 92\n0 9 15 16 20 21 23 24 51 53 56 71 73 80 84 89", "17 49\n2 5 11 12 16 18 19 21 22 24 36 37 38 39 40 44 47\n1 7 8 12 14 15 17 18 20 32 33 34 35 36 40 43 47", "17 86\n16 17 25 33 39 41 50 51 54 56 66 70 72 73 77 80 85\n3 9 11 20 21 24 26 36 40 42 43 47 50 55 72 73 81", "18 20\n0 1 2 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19\n0 1 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19", "18 82\n0 5 10 13 14 16 21 28 29 30 44 46 61 64 69 71 77 78\n0 5 8 9 11 16 23 24 25 39 41 56 59 64 66 72 73 77", "19 25\n0 1 2 3 5 7 9 10 12 13 16 17 18 19 20 21 22 23 24\n0 3 4 5 6 7 8 9 10 11 12 13 14 15 17 19 21 22 24", "19 91\n5 17 18 20 22 25 26 31 32 33 43 47 54 61 62 64 77 80 87\n4 5 6 16 20 27 34 35 37 50 53 60 69 81 82 84 86 89 90", "20 53\n2 6 8 9 16 17 20 21 22 23 25 26 35 36 38 39 44 46 47 50\n4 5 8 9 10 11 13 14 23 24 26 27 32 34 35 38 43 47 49 50", "21 44\n0 1 3 4 6 7 8 9 10 11 12 15 17 18 21 22 27 29 34 36 42\n1 7 9 10 12 13 15 16 17 18 19 20 21 24 26 27 30 31 36 38 43", "21 94\n3 5 6 8 9 15 16 20 28 31 35 39 49 50 53 61 71 82 85 89 90\n6 17 20 24 25 32 34 35 37 38 44 45 49 57 60 64 68 78 79 82 90", "22 24\n0 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 22 23\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 21 22 23", "22 85\n3 5 7 14 18 21 25 32 38 41 53 58 61 62 66 70 71 73 75 76 79 83\n3 6 18 23 26 27 31 35 36 38 40 41 44 48 53 55 57 64 68 71 75 82", "23 38\n0 2 4 5 7 8 12 13 14 16 17 18 21 22 24 27 28 30 31 32 35 36 37\n0 1 2 3 5 7 8 10 11 15 16 17 19 20 21 24 25 27 30 31 33 34 35", "23 93\n1 3 5 10 19 22 26 27 30 35 39 53 55 60 66 67 75 76 77 80 82 89 90\n9 11 16 22 23 31 32 33 36 38 45 46 50 52 54 59 68 71 75 76 79 84 88", "24 37\n1 4 5 6 8 11 12 13 15 16 17 19 20 21 23 26 27 28 30 31 33 34 35 36\n0 3 4 5 7 8 10 11 12 13 15 18 19 20 22 25 26 27 29 30 31 33 34 35", "24 94\n9 10 13 14 16 18 19 22 24 29 32 35 48 55 57 63 64 69 72 77 78 85 90 92\n1 7 8 13 16 21 22 29 34 36 47 48 51 52 54 56 57 60 62 67 70 73 86 93", "25 45\n0 1 2 4 6 7 8 9 13 14 17 19 21 22 23 25 28 29 30 31 34 36 38 39 42\n1 3 4 5 7 10 11 12 13 16 18 20 21 24 27 28 29 31 33 34 35 36 40 41 44", "25 72\n1 2 6 8 9 11 15 18 19 20 26 29 31 33 34 40 41 43 45 48 58 60 68 69 71\n0 6 9 11 13 14 20 21 23 25 28 38 40 48 49 51 53 54 58 60 61 63 67 70 71", "26 47\n0 2 5 7 8 9 10 12 13 14 20 22 23 25 27 29 31 32 33 35 36 37 38 42 44 45\n0 2 4 6 8 9 10 12 13 14 15 19 21 22 24 26 29 31 32 33 34 36 37 38 44 46", "26 99\n0 1 13 20 21 22 25 26 27 28 32 39 44 47 56 58 60 62 71 81 83 87 89 93 94 98\n6 8 12 14 18 19 23 24 25 37 44 45 46 49 50 51 52 56 63 68 71 80 82 84 86 95", "27 35\n0 2 3 4 5 6 7 8 10 11 12 13 14 15 16 17 19 20 21 23 26 27 29 30 31 32 33\n0 1 2 3 5 7 8 9 10 11 12 13 15 16 17 18 19 20 21 22 24 25 26 28 31 32 34", "27 51\n1 2 4 7 8 11 13 17 20 21 23 24 25 28 29 30 34 35 37 38 40 43 45 46 47 48 50\n0 1 2 4 6 7 9 12 13 16 18 22 25 26 28 29 30 33 34 35 39 40 42 43 45 48 50", "28 38\n1 4 5 7 8 9 10 11 12 14 15 16 18 19 20 21 22 23 24 25 28 29 30 32 33 35 36 37\n0 1 2 3 4 5 6 9 10 11 13 14 16 17 18 20 23 24 26 27 28 29 30 31 33 34 35 37", "28 67\n0 1 2 3 6 9 10 15 18 22 24 25 30 35 36 38 39 47 48 49 51 53 55 56 58 62 63 64\n4 7 11 13 14 19 24 25 27 28 36 37 38 40 42 44 45 47 51 52 53 56 57 58 59 62 65 66", "29 29\n0 1 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\n0 1 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 93\n1 2 11 13 18 21 27 28 30 38 41 42 46 54 55 56 60 61 63 64 66 69 71 72 77 81 83 89 90\n2 10 11 12 16 17 19 20 22 25 27 28 33 37 39 45 46 50 51 60 62 67 70 76 77 79 87 90 91", "30 63\n0 2 3 5 6 7 8 10 13 18 19 21 22 23 26 32 35 37 38 39 40 41 43 44 49 51 53 54 58 61\n0 2 3 5 6 7 8 10 13 18 19 21 22 23 26 32 35 37 38 39 40 41 43 44 49 51 53 54 58 61", "30 91\n1 2 3 7 8 9 13 16 17 19 27 29 38 45 47 52 53 55 61 62 66 77 78 79 80 81 82 84 88 89\n3 4 5 9 12 13 15 23 25 34 41 43 48 49 51 57 58 62 73 74 75 76 77 78 80 84 85 88 89 90", "31 39\n0 1 2 3 4 5 6 7 8 10 11 13 14 17 18 20 21 23 24 25 27 28 29 30 31 33 34 35 36 37 38\n0 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 18 19 21 22 25 26 28 29 31 32 33 35 36 37 38", "31 95\n9 12 14 15 21 23 26 28 30 36 37 42 47 51 54 56 59 62 64 65 66 70 72 74 75 79 82 85 87 91 93\n0 2 3 7 10 13 15 19 21 32 35 37 38 44 46 49 51 53 59 60 65 70 74 77 79 82 85 87 88 89 93", "32 61\n0 2 3 5 7 10 13 14 15 18 19 20 21 22 23 24 26 32 33 34 36 38 43 46 47 51 54 55 56 57 58 59\n1 2 4 6 9 12 13 14 17 18 19 20 21 22 23 25 31 32 33 35 37 42 45 46 50 53 54 55 56 57 58 60", "32 86\n5 7 9 10 13 17 18 19 25 26 28 32 33 37 38 43 45 47 50 53 57 58 60 69 73 74 75 77 80 82 83 85\n7 11 12 13 15 18 20 21 23 29 31 33 34 37 41 42 43 49 50 52 56 57 61 62 67 69 71 74 77 81 82 84", "33 44\n0 1 2 3 5 9 10 11 12 13 14 15 17 18 20 21 22 23 24 25 26 27 28 30 31 32 35 36 38 39 41 42 43\n0 2 3 4 7 8 10 11 13 14 15 16 17 18 19 21 25 26 27 28 29 30 31 33 34 36 37 38 39 40 41 42 43", "33 73\n3 6 7 8 9 10 11 13 14 15 17 19 22 23 26 27 28 31 33 34 35 37 42 44 48 52 54 57 62 63 64 67 68\n2 3 4 7 8 16 19 20 21 22 23 24 26 27 28 30 32 35 36 39 40 41 44 46 47 48 50 55 57 61 65 67 70", "34 52\n1 2 3 4 5 6 8 9 10 12 13 14 15 16 17 19 21 24 26 27 28 29 31 33 35 36 37 39 40 45 46 49 50 51\n0 1 2 3 4 6 7 8 10 11 12 13 14 15 17 19 22 24 25 26 27 29 31 33 34 35 37 38 43 44 47 48 49 51", "34 68\n0 7 9 10 11 14 15 16 20 21 22 24 26 32 34 35 37 38 40 41 42 43 44 45 47 50 53 55 57 58 59 62 64 65\n0 1 2 3 5 8 11 13 15 16 17 20 22 23 26 33 35 36 37 40 41 42 46 47 48 50 52 58 60 61 63 64 66 67", "35 90\n4 5 7 8 10 11 12 13 14 22 27 29 31 33 34 38 46 49 52 53 54 55 56 57 60 61 64 69 77 81 83 86 87 88 89\n4 7 10 11 12 13 14 15 18 19 22 27 35 39 41 44 45 46 47 52 53 55 56 58 59 60 61 62 70 75 77 79 81 82 86", "36 43\n1 2 3 4 6 7 8 9 10 11 14 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 42\n0 1 2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 21 23 24 25 26 28 29 30 31 32 33 36 38 39 40 41 42", "36 84\n1 3 6 13 15 16 17 18 19 21 23 26 29 33 38 40 42 45 49 50 53 54 57 58 60 61 64 65 67 70 73 76 78 79 81 83\n0 2 5 8 12 17 19 21 24 28 29 32 33 36 37 39 40 43 44 46 49 52 55 57 58 60 62 64 66 69 76 78 79 80 81 82", "37 46\n0 1 3 6 7 8 9 10 12 13 14 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 33 34 35 36 37 39 40 41 42 43 44\n0 3 4 5 6 7 9 10 11 13 14 16 17 18 19 20 21 22 23 24 25 26 27 28 30 31 32 33 34 36 37 38 39 40 41 43 44", "37 97\n0 5 10 11 12 15 16 18 19 25 28 29 34 35 36 37 38 40 46 47 48 49 55 58 60 61 62 64 65 70 76 77 80 82 88 94 96\n1 7 13 15 16 21 26 27 28 31 32 34 35 41 44 45 50 51 52 53 54 56 62 63 64 65 71 74 76 77 78 80 81 86 92 93 96", "38 58\n1 2 3 4 5 8 9 11 12 13 15 16 17 22 23 24 25 26 27 29 30 31 32 33 34 36 37 40 41 43 46 47 48 52 53 55 56 57\n1 2 3 5 6 7 8 9 12 13 15 16 17 19 20 21 26 27 28 29 30 31 33 34 35 36 37 38 40 41 44 45 47 50 51 52 56 57", "38 92\n1 2 3 5 6 7 12 14 15 16 17 18 20 22 29 31 33 34 38 41 43 49 54 55 57 58 61 63 66 67 69 73 75 76 82 85 88 90\n1 3 4 10 13 16 18 21 22 23 25 26 27 32 34 35 36 37 38 40 42 49 51 53 54 58 61 63 69 74 75 77 78 81 83 86 87 89", "39 59\n0 1 2 3 5 6 7 8 9 10 11 12 13 15 16 17 19 24 25 28 29 31 32 33 35 37 38 40 41 42 43 45 46 47 49 50 53 55 56\n0 1 3 4 5 6 8 9 10 12 13 16 18 19 22 23 24 25 27 28 29 30 31 32 33 34 35 37 38 39 41 46 47 50 51 53 54 55 57", "39 67\n1 3 5 7 8 16 18 20 21 23 24 25 27 28 29 31 32 34 36 38 40 43 44 46 47 48 49 50 52 53 54 55 58 59 61 62 63 64 66\n0 1 2 4 6 8 10 12 13 21 23 25 26 28 29 30 32 33 34 36 37 39 41 43 45 48 49 51 52 53 54 55 57 58 59 60 63 64 66", "40 63\n0 2 3 4 5 6 9 10 12 15 18 19 23 25 26 27 28 29 30 31 33 34 36 37 38 39 40 43 45 49 50 52 53 54 55 57 58 60 61 62\n1 2 3 4 5 8 10 14 15 17 18 19 20 22 23 25 26 27 28 30 31 32 33 34 37 38 40 43 46 47 51 53 54 55 56 57 58 59 61 62", "40 96\n5 11 12 13 14 16 17 18 19 24 30 31 32 33 37 42 46 50 53 54 55 58 60 61 64 67 68 69 70 72 75 76 77 81 84 85 89 91 92 93\n2 7 11 15 18 19 20 23 25 26 29 32 33 34 35 37 40 41 42 46 49 50 54 56 57 58 66 72 73 74 75 77 78 79 80 85 91 92 93 94", "41 67\n0 2 3 5 8 10 11 12 13 14 15 19 20 21 22 26 29 30 31 32 34 35 37 38 40 41 44 45 46 47 49 51 52 53 54 56 57 58 59 63 66\n2 3 4 5 9 12 13 14 15 17 18 20 21 23 24 27 28 29 30 32 34 35 36 37 39 40 41 42 46 49 50 52 53 55 58 60 61 62 63 64 65", "41 72\n0 3 4 6 7 8 9 12 13 14 16 21 23 24 25 26 27 29 31 32 33 34 35 38 40 41 45 47 49 50 51 52 56 57 58 59 61 62 65 66 69\n0 1 4 5 6 8 13 15 16 17 18 19 21 23 24 25 26 27 30 32 33 37 39 41 42 43 44 48 49 50 51 53 54 57 58 61 64 67 68 70 71", "42 48\n0 1 2 3 4 7 8 9 10 11 12 13 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 32 33 34 35 36 37 38 40 41 42 43 44 45 46 47\n0 1 2 3 4 5 6 8 9 10 11 12 14 15 16 17 18 19 20 22 23 24 25 26 27 28 29 30 31 32 33 34 37 38 39 40 41 42 43 45 46 47", "42 81\n0 1 3 6 7 8 11 13 17 18 19 21 22 24 29 30 31 32 34 35 38 44 46 48 49 50 51 52 53 55 59 61 62 63 65 66 67 69 70 72 77 80\n0 1 3 4 6 11 12 13 14 16 17 20 26 28 30 31 32 33 34 35 37 41 43 44 45 47 48 49 51 52 54 59 62 63 64 66 69 70 71 74 76 80", "43 55\n0 1 2 3 4 5 6 7 8 12 14 15 17 18 19 20 21 22 23 26 27 28 29 31 32 33 35 36 37 38 40 42 43 44 45 46 47 48 49 50 51 53 54\n1 2 4 5 6 7 8 9 10 13 14 15 16 18 19 20 22 23 24 25 27 29 30 31 32 33 34 35 36 37 38 40 41 42 43 44 45 46 47 48 49 50 54", "43 81\n2 3 4 5 6 7 9 10 12 13 18 19 20 21 23 26 27 29 30 32 34 38 39 43 46 47 48 50 51 52 54 55 58 62 64 67 69 70 71 72 73 75 80\n0 3 5 6 7 8 9 11 16 19 20 21 22 23 24 26 27 29 30 35 36 37 38 40 43 44 46 47 49 51 55 56 60 63 64 65 67 68 69 71 72 75 79", "44 54\n0 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 21 22 23 24 25 26 27 28 29 31 33 34 35 36 37 39 40 41 43 44 47 49 50 52 53\n0 1 2 3 4 5 6 7 8 10 12 13 14 15 16 18 19 20 22 23 26 28 29 31 32 33 34 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52", "44 93\n1 5 6 7 8 10 14 17 19 21 25 26 27 30 33 34 35 36 38 41 45 48 49 51 53 55 57 60 66 67 69 70 73 76 78 79 80 81 82 83 85 87 88 90\n0 2 4 8 9 10 13 16 17 18 19 21 24 28 31 32 34 36 38 40 43 49 50 52 53 56 59 61 62 63 64 65 66 68 70 71 73 77 81 82 83 84 86 90", "45 47\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 43 44 45 46\n0 1 2 3 4 5 6 7 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 33 34 35 36 37 38 39 40 41 42 43 44 45 46", "45 71\n0 2 3 7 8 11 12 13 14 15 16 17 20 21 22 23 24 26 28 30 32 37 39 41 42 43 44 45 47 48 50 52 54 55 56 57 58 59 60 61 62 64 66 68 70\n0 1 2 3 4 7 8 9 10 11 13 15 17 19 24 26 28 29 30 31 32 34 35 37 39 41 42 43 44 45 46 47 48 49 51 53 55 57 58 60 61 65 66 69 70", "46 46\n0 1 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\n0 1 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 93\n0 1 2 6 13 16 17 18 19 21 27 29 32 34 37 38 39 40 41 44 45 49 50 52 54 56 57 61 64 65 66 67 69 71 73 75 77 78 79 83 85 87 88 90 91 92\n0 2 4 5 7 8 9 10 11 12 16 23 26 27 28 29 31 37 39 42 44 47 48 49 50 51 54 55 59 60 62 64 66 67 71 74 75 76 77 79 81 83 85 87 88 89", "47 49\n0 1 2 3 4 5 6 7 9 10 11 12 13 14 15 16 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\n0 1 2 3 4 5 6 7 8 9 10 11 13 14 15 16 17 18 19 20 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", "47 94\n0 1 3 4 5 7 8 9 14 18 19 26 30 33 34 35 37 40 42 45 46 49 50 51 52 53 55 56 60 61 62 63 64 65 66 69 71 73 75 79 84 86 87 88 90 92 93\n1 2 3 4 6 7 8 10 11 12 17 21 22 29 33 36 37 38 40 43 45 48 49 52 53 54 55 56 58 59 63 64 65 66 67 68 69 72 74 76 78 82 87 89 90 91 93", "48 65\n0 1 2 4 5 6 7 8 9 10 11 12 15 16 17 20 22 24 25 26 27 28 30 32 33 34 35 37 38 39 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 61 62 63\n0 1 4 6 8 9 10 11 12 14 16 17 18 19 21 22 23 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 64", "48 90\n1 3 4 5 8 9 11 13 14 15 16 18 20 21 24 26 29 30 31 33 34 36 37 38 39 40 42 43 44 46 47 48 51 52 55 58 59 61 62 63 65 66 68 78 79 81 82 89\n0 3 4 6 8 9 10 11 13 15 16 19 21 24 25 26 28 29 31 32 33 34 35 37 38 39 41 42 43 46 47 50 53 54 56 57 58 60 61 63 73 74 76 77 84 86 88 89", "49 60\n0 1 2 5 7 8 9 10 11 12 13 14 15 16 17 19 20 21 23 25 26 27 28 29 30 31 32 33 34 36 38 39 40 41 42 43 44 46 47 48 49 50 51 52 53 54 55 58 59\n0 1 2 3 4 5 6 7 8 10 11 12 14 16 17 18 19 20 21 22 23 24 25 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 49 50 51 52 53 56 58 59", "49 97\n0 1 2 3 6 8 11 14 19 23 26 29 32 34 35 37 39 41 43 44 45 46 51 53 63 64 65 66 67 70 71 72 73 76 77 78 79 81 83 84 86 87 90 91 92 93 94 95 96\n0 3 4 5 6 7 8 9 10 11 12 13 16 18 21 24 29 33 36 39 42 44 45 47 49 51 53 54 55 56 61 63 73 74 75 76 77 80 81 82 83 86 87 88 89 91 93 94 96", "50 58\n0 1 2 3 5 6 7 8 10 11 12 13 14 15 16 17 18 19 21 22 23 24 25 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 54 55 56 57\n0 1 3 4 5 6 7 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 31 32 36 37 38 39 40 41 42 43 45 46 47 48 50 51 52 53 54 55 56 57", "50 97\n1 2 3 4 7 9 10 11 12 13 14 21 22 23 24 25 28 29 30 31 32 33 34 36 37 40 41 45 53 56 59 64 65 69 70 71 72 73 74 77 81 84 85 86 87 89 91 92 95 96\n0 1 2 3 6 10 13 14 15 16 18 20 21 24 25 27 28 29 30 33 35 36 37 38 39 40 47 48 49 50 51 54 55 56 57 58 59 60 62 63 66 67 71 79 82 85 90 91 95 96", "40 96\n5 11 12 13 14 16 17 18 19 24 30 31 32 33 37 42 46 50 53 54 55 58 60 61 64 67 68 69 70 72 75 76 77 81 84 85 88 91 92 93\n2 7 11 15 18 19 20 23 25 26 29 32 33 34 35 37 40 41 42 46 49 50 54 56 57 58 66 72 73 74 75 77 78 79 80 85 91 92 93 94", "41 67\n0 2 3 5 8 10 11 12 13 14 15 19 20 21 22 25 29 30 31 32 34 35 37 38 40 41 44 45 46 47 49 51 52 53 54 56 57 58 59 63 66\n2 3 4 5 9 12 13 14 15 17 18 20 21 23 24 27 28 29 30 32 34 35 36 37 39 40 41 42 46 49 50 52 53 55 58 60 61 62 63 64 65", "41 72\n0 3 4 6 7 8 9 12 13 14 16 21 23 24 25 26 27 28 31 32 33 34 35 38 40 41 45 47 49 50 51 52 56 57 58 59 61 62 65 66 69\n0 1 4 5 6 8 13 15 16 17 18 19 21 23 24 25 26 27 30 32 33 37 39 41 42 43 44 48 49 50 51 53 54 57 58 61 64 67 68 70 71", "42 48\n0 1 2 3 4 7 8 9 10 11 12 13 15 16 17 18 19 20 21 22 23 24 25 27 28 29 30 32 33 34 35 36 37 38 40 41 42 43 44 45 46 47\n0 1 2 3 4 5 6 8 9 10 11 12 14 15 16 17 18 19 20 22 23 24 25 26 27 28 29 30 31 32 33 34 37 38 39 40 41 42 43 45 46 47", "42 81\n0 1 3 6 7 8 11 13 17 18 19 20 22 24 29 30 31 32 34 35 38 44 46 48 49 50 51 52 53 55 59 61 62 63 65 66 67 69 70 72 77 80\n0 1 3 4 6 11 12 13 14 16 17 20 26 28 30 31 32 33 34 35 37 41 43 44 45 47 48 49 51 52 54 59 62 63 64 66 69 70 71 74 76 80", "43 55\n0 1 2 3 4 5 6 7 8 12 14 15 17 18 19 20 21 22 23 26 27 28 29 31 32 33 34 36 37 38 40 42 43 44 45 46 47 48 49 50 51 53 54\n1 2 4 5 6 7 8 9 10 13 14 15 16 18 19 20 22 23 24 25 27 29 30 31 32 33 34 35 36 37 38 40 41 42 43 44 45 46 47 48 49 50 54", "43 81\n2 3 4 5 6 7 9 10 12 13 17 19 20 21 23 26 27 29 30 32 34 38 39 43 46 47 48 50 51 52 54 55 58 62 64 67 69 70 71 72 73 75 80\n0 3 5 6 7 8 9 11 16 19 20 21 22 23 24 26 27 29 30 35 36 37 38 40 43 44 46 47 49 51 55 56 60 63 64 65 67 68 69 71 72 75 79", "44 54\n0 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 21 22 23 24 25 26 27 28 29 31 33 34 35 36 37 38 40 41 43 44 47 49 50 52 53\n0 1 2 3 4 5 6 7 8 10 12 13 14 15 16 18 19 20 22 23 26 28 29 31 32 33 34 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52", "44 93\n1 5 6 7 8 10 14 17 19 21 25 26 27 30 33 34 35 36 38 41 45 48 49 51 53 55 57 60 66 67 69 70 73 76 78 79 80 81 82 83 84 87 88 90\n0 2 4 8 9 10 13 16 17 18 19 21 24 28 31 32 34 36 38 40 43 49 50 52 53 56 59 61 62 63 64 65 66 68 70 71 73 77 81 82 83 84 86 90", "45 47\n0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 44 45 46\n0 1 2 3 4 5 6 7 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 33 34 35 36 37 38 39 40 41 42 43 44 45 46", "45 71\n0 2 3 7 8 11 12 13 14 15 16 17 20 21 22 23 24 26 28 30 32 37 39 40 42 43 44 45 47 48 50 52 54 55 56 57 58 59 60 61 62 64 66 68 70\n0 1 2 3 4 7 8 9 10 11 13 15 17 19 24 26 28 29 30 31 32 34 35 37 39 41 42 43 44 45 46 47 48 49 51 53 55 57 58 60 61 65 66 69 70", "46 46\n0 1 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\n0 1 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 93\n0 1 2 6 13 16 17 18 19 21 27 29 32 34 37 38 39 40 41 44 45 49 50 52 54 56 57 61 64 65 66 67 69 71 73 75 77 78 79 83 85 86 88 90 91 92\n0 2 4 5 7 8 9 10 11 12 16 23 26 27 28 29 31 37 39 42 44 47 48 49 50 51 54 55 59 60 62 64 66 67 71 74 75 76 77 79 81 83 85 87 88 89", "47 49\n0 1 2 3 4 5 6 7 9 10 11 12 13 14 15 16 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\n0 1 2 3 4 5 6 7 8 9 10 11 13 14 15 16 17 18 19 20 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", "47 94\n0 1 3 4 5 7 8 9 14 18 19 26 30 33 34 35 37 40 42 44 46 49 50 51 52 53 55 56 60 61 62 63 64 65 66 69 71 73 75 79 84 86 87 88 90 92 93\n1 2 3 4 6 7 8 10 11 12 17 21 22 29 33 36 37 38 40 43 45 48 49 52 53 54 55 56 58 59 63 64 65 66 67 68 69 72 74 76 78 82 87 89 90 91 93", "48 65\n0 1 2 4 5 6 7 8 9 10 11 12 15 16 17 20 21 24 25 26 27 28 30 32 33 34 35 37 38 39 44 45 46 47 48 50 51 52 53 54 55 56 57 58 59 61 62 63\n0 1 4 6 8 9 10 11 12 14 16 17 18 19 21 22 23 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 64", "48 90\n1 3 4 5 8 9 11 13 14 15 16 17 20 21 24 26 29 30 31 33 34 36 37 38 39 40 42 43 44 46 47 48 51 52 55 58 59 61 62 63 65 66 68 78 79 81 82 89\n0 3 4 6 8 9 10 11 13 15 16 19 21 24 25 26 28 29 31 32 33 34 35 37 38 39 41 42 43 46 47 50 53 54 56 57 58 60 61 63 73 74 76 77 84 86 88 89", "49 60\n0 1 2 5 7 8 9 10 11 12 13 14 15 16 17 18 20 21 23 25 26 27 28 29 30 31 32 33 34 36 38 39 40 41 42 43 44 46 47 48 49 50 51 52 53 54 55 58 59\n0 1 2 3 4 5 6 7 8 10 11 12 14 16 17 18 19 20 21 22 23 24 25 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 49 50 51 52 53 56 58 59", "49 97\n0 1 2 3 5 8 11 14 19 23 26 29 32 34 35 37 39 41 43 44 45 46 51 53 63 64 65 66 67 70 71 72 73 76 77 78 79 81 83 84 86 87 90 91 92 93 94 95 96\n0 3 4 5 6 7 8 9 10 11 12 13 16 18 21 24 29 33 36 39 42 44 45 47 49 51 53 54 55 56 61 63 73 74 75 76 77 80 81 82 83 86 87 88 89 91 93 94 96", "50 58\n0 1 2 3 5 6 7 8 10 11 12 13 14 15 16 17 18 19 21 22 23 24 25 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 54 55 56 57\n0 1 3 4 5 6 7 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 31 32 36 37 38 39 40 41 42 43 45 46 47 48 50 51 52 53 54 55 56 57", "5 10\n0 1 3 5 7\n0 1 2 4 7", "5 8\n0 2 4 6 7\n0 2 3 5 7"], "outputs": ["YES", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "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", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	92	codeforces
f61d78de4dfc8f9ad1757133850be363	Fixed Points	A permutation of length n is an integer sequence such that each integer from 0 to (n<=-<=1) appears exactly once in it. For example, sequence [0,<=2,<=1] is a permutation of length 3 while both [0,<=2,<=2] and [1,<=2,<=3] are not. A fixed point of a function is a point that is mapped to itself by the function. A permutation can be regarded as a bijective function. We'll get a definition of a fixed point in a permutation. An integer i is a fixed point of permutation a0,<=a1,<=...,<=an<=-<=1 if and only if ai<==<=i. For example, permutation [0,<=2,<=1] has 1 fixed point and permutation [0,<=1,<=2] has 3 fixed points. You are given permutation a. You are allowed to swap two elements of the permutation at most once. Your task is to maximize the number of fixed points in the resulting permutation. Note that you are allowed to make at most one swap operation. The first line contains a single integer n (1<=≤<=n<=≤<=105). The second line contains n integers a0,<=a1,<=...,<=an<=-<=1 — the given permutation. Print a single integer — the maximum possible number of fixed points in the permutation after at most one swap operation. Sample Input 5 0 1 3 4 2 Sample Output 3	{"inputs": ["5\n0 1 3 4 2", "10\n6 9 4 7 8 2 3 5 0 1", "100\n99 5 40 32 4 31 38 57 94 47 26 16 89 72 9 80 55 86 78 90 42 41 46 74 56 97 21 48 66 27 93 85 88 59 64 95 10 45 12 22 84 60 8 98 62 51 14 65 39 30 11 71 92 19 76 43 87 54 15 53 37 6 25 18 96 35 13 91 2 3 0 23 1 7 49 75 81 33 50 52 63 44 69 36 17 61 24 20 68 34 73 29 70 83 58 79 82 28 77 67", "3\n0 1 2", "3\n2 1 0", "3\n1 2 0", "1\n0", "5\n0 1 2 3 4", "4\n0 1 2 3", "7\n0 1 2 4 3 6 5", "6\n0 1 2 3 5 4"], "outputs": ["3", "2", "3", "3", "3", "1", "1", "5", "4", "5", "6"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	111	codeforces
f6259d8cdf46697bf882fbfca39bdc34	Number With The Given Amount Of Divisors	Given the number n, find the smallest positive integer which has exactly n divisors. It is guaranteed that for the given n the answer will not exceed 1018. The first line of the input contains integer n (1<=≤<=n<=≤<=1000). Output the smallest positive integer with exactly n divisors. Sample Input 4 6 Sample Output 6 12	{"inputs": ["1", "7", "8", "9", "10", "15", "20", "47", "59", "100", "159", "265", "312", "473", "637", "500", "720", "902", "940", "1000", "999", "118"], "outputs": ["1", "64", "24", "36", "48", "144", "240", "70368744177664", "288230376151711744", "45360", "40532396646334464", "364791569817010176", "14192640", "259700248434180096", "46656000000", "62370000", "61261200", "324625310542725120", "199495389743677440", "810810000", "757632231014400", "864691128455135232"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	36	codeforces
f662d236d019258c2096118a6174c09f	Bear and Elections	Limak is a grizzly bear who desires power and adoration. He wants to win in upcoming elections and rule over the Bearland. There are n candidates, including Limak. We know how many citizens are going to vote for each candidate. Now i-th candidate would get ai votes. Limak is candidate number 1. To win in elections, he must get strictly more votes than any other candidate. Victory is more important than everything else so Limak decided to cheat. He will steal votes from his opponents by bribing some citizens. To bribe a citizen, Limak must give him or her one candy - citizens are bears and bears like candies. Limak doesn't have many candies and wonders - how many citizens does he have to bribe? The first line contains single integer n (2<=≤<=n<=≤<=100) - number of candidates. The second line contains n space-separated integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=1000) - number of votes for each candidate. Limak is candidate number 1. Note that after bribing number of votes for some candidate might be zero or might be greater than 1000. Print the minimum number of citizens Limak must bribe to have strictly more votes than any other candidate. Sample Input 5 5 1 11 2 8 4 1 8 8 8 2 7 6 Sample Output 4 6 0	{"inputs": ["5\n5 1 11 2 8", "4\n1 8 8 8", "2\n7 6", "2\n1 1", "10\n100 200 57 99 1 1000 200 200 200 500", "16\n7 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "100\n47 64 68 61 68 66 69 61 69 65 69 63 62 60 68 65 64 65 65 62 63 68 60 70 63 63 65 67 70 69 68 69 61 65 63 60 60 65 61 60 70 66 66 65 62 60 65 68 61 62 67 64 66 65 67 68 60 69 70 63 65 62 64 65 67 67 69 68 66 69 70 67 65 70 60 66 70 67 67 64 69 69 66 68 60 64 62 62 68 69 67 69 60 70 69 68 62 63 68 66", "2\n96 97", "2\n1000 1000", "3\n999 1000 1000", "3\n1 2 3", "7\n10 940 926 990 946 980 985", "10\n5 3 4 5 5 2 1 8 4 1", "15\n17 15 17 16 13 17 13 16 14 14 17 17 13 15 17", "20\n90 5 62 9 50 7 14 43 44 44 56 13 71 22 43 35 52 60 73 54", "30\n27 85 49 7 77 38 4 68 23 28 81 100 40 9 78 38 1 60 60 49 98 44 45 92 46 39 98 24 37 39", "51\n90 47 100 12 21 96 2 68 84 60 2 9 33 8 45 13 59 50 100 93 22 97 4 81 51 2 3 78 19 16 25 63 52 34 79 32 34 87 7 42 96 93 30 33 33 43 69 8 63 58 57", "77\n1000 2 2 3 1 1 1 3 3 2 1 1 3 2 2 2 3 2 3 1 3 1 1 2 2 2 3 1 1 2 2 2 3 2 1 3 3 1 2 3 3 3 2 1 3 2 1 3 3 2 3 3 2 1 3 1 1 1 2 3 2 3 1 3 1 2 1 2 2 2 1 2 2 3 2 2 2", "91\n3 92 89 83 85 80 91 94 95 82 92 95 80 88 90 85 81 90 87 86 94 88 90 87 88 82 95 84 84 93 83 95 91 85 89 88 88 85 87 90 93 80 89 95 94 92 93 86 83 82 86 84 91 80 90 95 84 86 84 85 84 92 82 84 83 91 87 95 94 95 90 95 86 92 86 80 95 86 88 80 82 87 84 83 91 93 81 81 91 89 88", "100\n1 3 71 47 64 82 58 61 61 35 52 36 57 62 63 54 52 21 78 100 24 94 4 80 99 62 43 72 21 70 90 4 23 14 72 4 76 49 71 96 96 99 78 7 32 11 14 61 19 69 1 68 100 77 86 54 14 86 47 53 30 88 67 66 61 70 17 63 40 5 99 53 38 31 91 18 41 5 77 61 53 30 87 21 23 54 52 17 23 75 58 99 99 63 20 1 78 72 28 11", "100\n1 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100", "94\n3 100 100 99 99 99 100 99 99 99 99 99 100 99 100 100 99 100 99 99 100 99 100 99 100 100 100 99 100 99 100 99 100 99 99 99 100 99 99 99 99 99 100 99 100 100 99 100 99 99 99 99 100 99 100 99 99 99 100 100 99 100 100 99 99 100 100 100 99 100 99 99 99 99 99 100 100 100 100 100 100 100 100 100 99 99 99 99 100 99 100 99 100 100", "97\n99 99 98 98 100 98 99 99 98 100 100 100 99 99 100 99 99 98 99 99 98 98 98 100 100 99 98 99 100 98 99 98 98 100 98 99 100 98 98 99 98 98 99 98 100 99 99 99 99 98 98 98 100 99 100 100 99 99 100 99 99 98 98 98 100 100 98 100 100 99 98 99 100 98 98 98 98 99 99 98 98 99 100 100 98 98 99 98 99 100 98 99 100 98 99 99 100", "100\n100 55 70 81 73 51 6 75 45 85 33 61 98 63 11 59 1 8 14 28 78 74 44 80 7 69 7 5 90 73 43 78 64 64 43 92 59 70 80 19 33 39 31 70 38 85 24 23 86 79 98 56 92 63 92 4 36 8 79 74 2 81 54 13 69 44 49 63 17 76 78 99 42 36 47 71 19 90 9 58 83 53 27 2 35 51 65 59 90 51 74 87 84 48 98 44 84 100 84 93", "100\n100 637 498 246 615 901 724 673 793 33 282 908 477 185 185 969 34 859 90 70 107 492 227 918 919 131 620 182 802 703 779 184 403 891 448 499 628 553 905 392 70 396 8 575 66 908 992 496 792 174 667 355 836 610 855 377 244 827 836 808 667 354 800 114 746 556 75 894 162 367 99 718 394 273 833 776 151 433 315 470 759 12 552 613 85 793 775 649 225 86 296 624 557 201 209 595 697 527 282 168", "100\n107 172 549 883 564 56 399 970 173 990 224 217 601 381 948 631 159 958 512 136 61 584 633 202 652 355 26 723 663 237 410 721 688 552 699 24 748 186 461 88 34 243 872 205 471 298 654 693 244 33 359 533 471 116 386 653 654 887 531 303 335 829 319 340 827 89 602 191 422 289 361 200 593 421 592 402 256 813 606 589 741 9 148 893 3 142 50 169 219 360 642 45 810 818 507 624 561 743 303 111", "90\n670 694 651 729 579 539 568 551 707 638 604 544 502 531 775 805 558 655 506 729 802 778 653 737 591 770 594 535 588 604 658 713 779 705 504 563 513 651 529 572 505 553 515 750 621 574 727 774 714 725 665 798 670 747 751 635 755 798 635 717 583 682 517 546 740 802 743 507 658 700 645 671 533 594 506 633 768 584 672 666 703 522 530 501 592 528 678 708 619 786", "90\n10 265 429 431 343 305 806 746 284 313 503 221 594 351 83 653 232 431 427 610 458 88 255 215 529 205 492 549 55 694 535 104 45 327 816 432 595 549 454 141 216 557 250 415 531 494 190 749 718 380 78 447 784 347 196 814 16 780 262 462 776 315 160 307 593 694 692 41 528 725 376 777 337 44 438 630 345 502 384 184 742 429 570 361 394 267 820 778 662 377", "95\n800 280 176 472 587 763 588 838 760 378 667 231 566 278 713 305 354 815 140 220 188 409 109 180 251 268 474 590 853 143 235 691 313 785 386 92 783 471 43 342 718 592 678 404 256 362 239 504 163 85 521 81 356 73 754 589 380 159 196 862 838 509 149 42 366 630 467 292 698 123 187 796 576 37 689 800 186 518 488 432 159 860 349 799 282 304 880 283 23 312 55 507 734 370 490", "100\n95 88 84 85 74 97 100 52 91 94 62 66 90 56 86 66 95 73 79 68 54 67 99 52 82 62 81 71 93 85 72 72 95 52 72 63 57 90 92 89 88 77 84 78 95 59 72 86 98 64 89 64 80 70 54 93 88 86 79 78 94 64 89 66 50 90 54 82 52 96 99 54 81 66 83 79 69 80 51 73 81 69 93 82 76 52 58 87 93 92 52 67 78 63 63 87 77 95 58 78", "100\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "100\n999 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "100\n901 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "4\n8 5 11 3", "3\n3 10 1"], "outputs": ["4", "6", "0", "1", "451", "932", "23", "1", "1", "2", "2", "817", "2", "1", "0", "58", "8", "0", "89", "90", "99", "97", "2", "1", "749", "729", "111", "714", "52", "4", "1", "2", "99", "2", "4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	165	codeforces
f66884c846d9ab53effb39a95437459d	Race Against Time	Have you ever tried to explain to the coordinator, why it is eight hours to the contest and not a single problem has been prepared yet? Misha had. And this time he has a really strong excuse: he faced a space-time paradox! Space and time replaced each other. The entire universe turned into an enormous clock face with three hands — hour, minute, and second. Time froze, and clocks now show the time h hours, m minutes, s seconds. Last time Misha talked with the coordinator at t1 o'clock, so now he stands on the number t1 on the clock face. The contest should be ready by t2 o'clock. In the terms of paradox it means that Misha has to go to number t2 somehow. Note that he doesn't have to move forward only: in these circumstances time has no direction. Clock hands are very long, and Misha cannot get round them. He also cannot step over as it leads to the collapse of space-time. That is, if hour clock points 12 and Misha stands at 11 then he cannot move to 1 along the top arc. He has to follow all the way round the clock center (of course, if there are no other hands on his way). Given the hands' positions, t1, and t2, find if Misha can prepare the contest on time (or should we say on space?). That is, find if he can move from t1 to t2 by the clock face. Five integers h, m, s, t1, t2 (1<=≤<=h<=≤<=12, 0<=≤<=m,<=s<=≤<=59, 1<=≤<=t1,<=t2<=≤<=12, t1<=≠<=t2). Misha's position and the target time do not coincide with the position of any hand. Print "YES" (quotes for clarity), if Misha can prepare the contest on time, and "NO" otherwise. You can print each character either upper- or lowercase ("YeS" and "yes" are valid when the answer is "YES"). Sample Input 12 30 45 3 11 12 0 1 12 1 3 47 0 4 9 Sample Output NO YES YES	{"inputs": ["12 30 45 3 11", "12 0 1 12 1", "3 47 0 4 9", "10 22 59 6 10", "3 1 13 12 3", "11 19 28 9 10", "9 38 22 6 1", "5 41 11 5 8", "11 2 53 10 4", "9 41 17 10 1", "6 54 48 12 6", "12 55 9 5 1", "8 55 35 9 3", "3 21 34 3 10", "2 52 1 12 3", "7 17 11 1 7", "11 6 37 6 4", "9 6 22 8 1", "3 10 5 5 9", "7 12 22 11 2", "7 19 4 7 3", "11 36 21 4 6", "10 32 49 1 3", "1 9 43 11 3", "1 8 33 4 8", "3 0 33 9 4", "7 15 9 10 3", "8 3 57 11 1", "1 33 49 5 9", "3 40 0 5 7", "5 50 9 2 7", "10 0 52 6 1", "3 10 4 1 11", "2 41 53 4 6", "10 29 30 4 7", "5 13 54 9 11", "1 0 23 3 9", "1 0 41 12 1", "6 30 30 3 9", "3 7 32 11 10", "1 0 25 12 4", "12 0 0 5 6", "1 5 4 3 2", "6 30 30 9 10", "6 0 0 2 8", "10 50 59 9 10", "12 59 59 12 6", "3 0 30 3 4", "2 10 10 1 11", "10 5 30 1 12", "5 29 31 5 10", "5 2 2 11 2", "5 15 46 3 10", "1 30 50 1 2", "5 26 14 1 12", "1 58 43 12 1", "12 0 12 11 1", "6 52 41 6 5", "5 8 2 1 3", "2 0 0 1 3", "1 5 6 2 1", "9 5 5 11 12", "12 5 19 3 4", "6 14 59 1 3", "10 38 34 4 12", "2 54 14 2 12", "5 31 0 6 7", "6 15 30 3 9", "3 54 41 8 10", "3 39 10 10 12", "1 11 50 1 2", "5 40 24 8 1", "9 5 59 1 3", "5 0 0 6 7", "4 40 59 6 8", "10 13 55 12 1", "6 50 0 5 6", "7 59 3 7 4", "6 0 1 6 7", "6 15 55 3 5", "12 9 55 10 2", "2 0 1 11 2", "8 45 17 12 9", "5 30 31 11 3", "6 43 0 10 6", "6 30 30 1 11", "11 59 59 11 12", "5 45 35 9 5", "2 43 4 9 7", "12 30 50 6 9", "1 10 1 2 3", "10 5 55 9 1", "1 59 59 2 3", "1 49 14 10 3", "3 15 15 2 4", "10 5 55 1 5", "6 33 45 12 6", "1 20 20 11 1", "2 30 45 1 11", "1 55 1 11 10", "3 0 1 11 1", "1 5 6 1 12", "12 10 5 11 4", "6 5 59 12 1", "12 0 20 11 12", "3 25 30 4 5", "2 15 18 11 1", "12 5 48 11 9", "6 30 30 10 2", "1 0 11 1 2", "10 0 1 10 11", "3 30 45 10 1", "11 21 56 3 12", "3 16 16 3 4", "11 55 55 1 12", "12 12 12 11 12", "3 5 1 1 2", "3 30 45 10 11", "10 0 1 9 10", "3 0 5 3 6", "1 1 49 1 10", "9 45 15 11 12", "12 15 59 3 8", "5 0 5 3 6", "3 30 45 1 2", "2 10 11 2 4", "2 10 10 4 3", "3 30 59 1 2", "11 59 59 12 11", "10 25 50 5 6", "6 30 30 9 3", "8 14 40 12 3", "2 10 10 1 6"], "outputs": ["NO", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	67	codeforces
f67e84e95f79dcc728e8824d78e742f1	Necklace	Ivan wants to make a necklace as a present to his beloved girl. A necklace is a cyclic sequence of beads of different colors. Ivan says that necklace is beautiful relative to the cut point between two adjacent beads, if the chain of beads remaining after this cut is a palindrome (reads the same forward and backward). Ivan has beads of n colors. He wants to make a necklace, such that it's beautiful relative to as many cuts as possible. He certainly wants to use all the beads. Help him to make the most beautiful necklace. The first line of the input contains a single number n (1<=≤<=n<=≤<=26) — the number of colors of beads. The second line contains after n positive integers ai — the quantity of beads of i-th color. It is guaranteed that the sum of ai is at least 2 and does not exceed 100<=000. In the first line print a single number — the maximum number of beautiful cuts that a necklace composed from given beads may have. In the second line print any example of such necklace. Each color of the beads should be represented by the corresponding lowercase English letter (starting with a). As the necklace is cyclic, print it starting from any point. Sample Input 3 4 2 1 1 4 2 1 1 Sample Output 1 abacaba4 aaaa 0 ab	{"inputs": ["3\n4 2 1", "1\n4", "2\n1 1", "1\n2", "1\n3", "1\n5", "2\n2 2", "3\n1 2 4", "3\n3 3 3", "3\n3 3 6", "3\n6 6 6", "3\n6 6 9", "26\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", "3\n7 7 21", "2\n95 50", "3\n30 30 15", "3\n1 50 70", "2\n70 10", "10\n100 100 100 50 20 300 400 300 350 320", "4\n1100 220 66 11", "1\n100000", "2\n50000 50000", "3\n33333 33333 33333", "3\n33332 33333 33332", "20\n12264 5236 1834 7238 560 938 6209 91 1540 2821 35 6097 12593 1092 6181 7553 4095 280 8568 2723", "26\n4779 4128 2559 3834 6519 3420 1989 5679 2301 189 453 576 2787 648 492 1551 2796 10713 438 288 9900 2811 990 2250 1320 8367", "21\n500 8500 5600 500 9500 1200 1500 12500 400 1000 1700 2100 600 6000 2500 5100 4100 6300 400 2300 1800", "18\n369 2583 4551 615 369 369 2091 3813 1845 369 615 861 1599 984 3567 2337 123 1599", "26\n1790 5549 5191 1969 6623 1969 3759 9129 1969 11277 8771 2685 5191 895 179 2685 1611 179 1969 8055 1969 2685 537 2327 716 3401", "15\n4400 2750 18150 8250 2200 4950 1100 3850 10450 2750 3850 9900 4400 10450 11000", "3\n4648 56552 5992", "3\n7733 11132 22649", "7\n10010 13013 5005 11011 33033 5005 3003", "23\n4431 567 2079 567 231 1071 567 609 987 819 2205 1365 1323 5691 1155 2457 3045 105 21 777 6804 4767 3969"], "outputs": ["1\naabcbaa", "4\naaaa", "0\nab", "2\naa", "3\naaa", "5\naaaaa", "2\nabba", "1\nbccaccb", "0\naaabbbccc", "0\naaabbbcccccc", "6\nabccbaabccbaabccba", "3\nabcccbaabcccbaabcccba", "0\nabcdefghijklmnopqrstuvwxyz", "0\naaaaaaabbbbbbbccccccccccccccccccccc", "5\nbbbbbaaaaaaaaaaaaaaaaaaabbbbbbbbbbaaaaaaaaaaaaaaaaaaabbbbbbbbbbaaaaaaaaaaaaaaaaaaabbbbbbbbbbaaaaaaaaaaaaaaaaaaabbbbbbbbbbaaaaaaaaaaaaaaaaaaabbbbb", "15\nabcbaabcbaabcbaabcbaabcbaabcbaabcbaabcbaabcbaabcbaabcbaabcbaabcbaabcbaabcba", "1\nbbbbbbbbbbbbbbbbbbbbbbbbbcccccccccccccccccccccccccccccccccccacccccccccccccccccccccccccccccccccccbbbbbbbbbbbbbbbbbbbbbbbbb", "10\naaaabaaaaaabaaaaaaaabaaaaaabaaaaaaaabaaaaaabaaaaaaaabaaaaaabaaaaaaaabaaaaaabaaaa", "10\naaaaabbbbbcccccefffffffffffffffgggggggggggggggggggghhhhhhhhhhhhhhhjjjjjjjjjjjjjjjjdddiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiddjjjjjjjjjjjjjjjjhhhhhhhhhhhhhhhggggggggggggggggggggfffffffffffffffecccccbbbbbaaaaaaaaaabbbbbcccccefffffffffffffffgggggggggggggggggggghhhhhhhhhhhhhhhjjjjjjjjjjjjjjjjddiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiidddjjjjjjjjjjjjjjjjhhhhhhhhhhhhhhhggggggggggggggggggggfffffffffffffffecccccbbbbbaaaaaaaaaabbbbbcccccefffffffffffffffgggggggggggggggggggghhhhhhhhhhhhhhhjjjjjjjjjjjjjjjjdddiiiiiiiiiiiiii...", "11\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbcccdcccbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbcccdcccbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbcccdcccbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbcccdcccbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "100000\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "50000\nabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabba...", "0\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "1\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "0\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "0\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "100\nuuuuuuuuuccccccccccccccccccccccccccccssffffffiijjjjjmmmnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnkkkkkkkkkttttttttttttrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrqqqqqqqqqqqqqqqqqqqqqppppppppppppppppppppppppppooooooooooooolllllllllllaaahhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhggggggggeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeedddbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeggggggghhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh...", "0\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...", "0\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "550\naaaaeeglllllllllmmmmoooooooooobbbcccccccccccccccccddddddddfffffhhhhiiiiiiiiiijjjkkkknnnnnnnnnnnnnnnnnnnkkkjjiiiiiiiiihhhffffdddddddccccccccccccccccbboooooooooommmmlllllllllgeeaaaaaaaaeeglllllllllmmmmoooooooooobbccccccccccccccccdddddddffffhhhiiiiiiiiijjkkknnnnnnnnnnnnnnnnnnnkkkkjjjiiiiiiiiiihhhhfffffddddddddcccccccccccccccccbbboooooooooommmmlllllllllgeeaaaaaaaaeeglllllllllmmmmoooooooooobbbcccccccccccccccccddddddddfffffhhhhiiiiiiiiiijjjkkkknnnnnnnnnnnnnnnnnnnkkkjjiiiiiiiiihhhffffdddddddccccccccccccccccb...", "8\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...", "0\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "0\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...", "0\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
f6b787869ae37c46c36ee88999a86ba8	Kuro and Walking Route	Kuro is living in a country called Uberland, consisting of $n$ towns, numbered from $1$ to $n$, and $n - 1$ bidirectional roads connecting these towns. It is possible to reach each town from any other. Each road connects two towns $a$ and $b$. Kuro loves walking and he is planning to take a walking marathon, in which he will choose a pair of towns $(u, v)$ ($u \neq v$) and walk from $u$ using the shortest path to $v$ (note that $(u, v)$ is considered to be different from $(v, u)$). Oddly, there are 2 special towns in Uberland named Flowrisa (denoted with the index $x$) and Beetopia (denoted with the index $y$). Flowrisa is a town where there are many strong-scent flowers, and Beetopia is another town where many bees live. In particular, Kuro will avoid any pair of towns $(u, v)$ if on the path from $u$ to $v$, he reaches Beetopia after he reached Flowrisa, since the bees will be attracted with the flower smell on Kuro’s body and sting him. Kuro wants to know how many pair of city $(u, v)$ he can take as his route. Since he’s not really bright, he asked you to help him with this problem. The first line contains three integers $n$, $x$ and $y$ ($1 \leq n \leq 3 \cdot 10^5$, $1 \leq x, y \leq n$, $x \ne y$) - the number of towns, index of the town Flowrisa and index of the town Beetopia, respectively. $n - 1$ lines follow, each line contains two integers $a$ and $b$ ($1 \leq a, b \leq n$, $a \ne b$), describes a road connecting two towns $a$ and $b$. It is guaranteed that from each town, we can reach every other town in the city using the given roads. That is, the given map of towns and roads is a tree. A single integer resembles the number of pair of towns $(u, v)$ that Kuro can use as his walking route. Sample Input 3 1 3 1 2 2 3 3 1 3 1 2 1 3 Sample Output 54	{"inputs": ["3 1 3\n1 2\n2 3", "3 1 3\n1 2\n1 3", "61 26 12\n33 38\n32 8\n27 59\n1 21\n61 57\n61 22\n35 18\n61 14\n39 56\n50 10\n1 42\n21 43\n61 41\n31 30\n35 9\n23 28\n39 34\n39 4\n39 25\n27 60\n45 51\n1 11\n35 26\n29 15\n23 44\n31 2\n35 27\n39 20\n1 24\n1 53\n35 58\n39 37\n61 13\n61 16\n1 12\n32 17\n1 40\n33 47\n29 52\n1 39\n35 19\n39 50\n27 6\n26 3\n26 55\n35 31\n1 61\n1 23\n27 45\n39 7\n1 35\n39 29\n27 5\n39 32\n27 48\n35 49\n29 54\n1 46\n35 36\n31 33", "8 5 1\n5 8\n1 5\n1 3\n1 4\n5 6\n6 7\n1 2", "31 29 20\n29 23\n29 18\n22 14\n29 20\n1 21\n29 10\n28 2\n1 17\n17 15\n1 11\n29 31\n28 6\n12 29\n12 26\n1 13\n22 4\n29 25\n28 22\n17 5\n28 30\n20 27\n29 8\n12 28\n1 12\n12 24\n22 7\n12 16\n12 3\n28 9\n1 19", "8 6 4\n1 2\n1 4\n1 8\n1 3\n1 7\n2 6\n2 5", "7 7 3\n3 2\n3 5\n3 7\n1 3\n1 4\n5 6", "70 42 32\n25 50\n51 7\n39 61\n1 33\n20 5\n1 70\n1 63\n42 35\n64 16\n1 11\n39 42\n20 54\n11 14\n57 44\n1 59\n55 40\n25 3\n31 18\n38 68\n57 23\n39 57\n28 10\n39 20\n42 26\n58 6\n20 56\n57 2\n13 21\n15 69\n39 64\n1 39\n62 53\n39 13\n1 41\n22 12\n13 30\n68 67\n20 31\n51 15\n57 32\n59 34\n39 4\n31 65\n58 24\n20 55\n15 27\n25 46\n20 22\n57 49\n68 52\n39 8\n54 58\n39 28\n13 48\n15 43\n25 66\n1 29\n15 37\n31 60\n1 19\n62 38\n39 17\n64 36\n59 25\n57 45\n57 9\n11 62\n20 51\n54 47", "13 5 13\n2 5\n5 8\n1 2\n13 7\n2 3\n1 13\n13 11\n13 4\n10 6\n10 12\n7 9\n1 10", "72 16 5\n1 20\n8 4\n23 19\n16 63\n45 65\n27 67\n58 21\n36 17\n20 52\n1 71\n8 59\n20 26\n28 16\n23 3\n45 42\n61 51\n6 31\n1 15\n1 11\n6 62\n43 60\n20 27\n20 32\n1 8\n68 25\n1 57\n20 70\n1 64\n1 13\n8 18\n8 46\n28 49\n8 39\n64 58\n28 47\n27 14\n8 10\n11 53\n1 24\n28 2\n72 30\n36 29\n1 45\n24 23\n1 72\n46 61\n45 56\n72 35\n11 50\n8 55\n8 28\n1 38\n61 41\n1 44\n61 40\n27 33\n72 69\n46 36\n43 66\n61 22\n45 5\n27 43\n46 12\n1 7\n16 68\n1 6\n1 9\n45 37\n27 34\n8 54\n20 48", "2 1 2\n1 2", "2 1 2\n2 1"], "outputs": ["5", "4", "3657", "40", "872", "55", "36", "4827", "146", "5108", "1", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	14	codeforces
f6ed80837137f82f9377e02bf1061dd1	Median on Segments (Permutations Edition)	You are given a permutation $p_1, p_2, \dots, p_n$. A permutation of length $n$ is a sequence such that each integer between $1$ and $n$ occurs exactly once in the sequence. Find the number of pairs of indices $(l, r)$ ($1 \le l \le r \le n$) such that the value of the median of $p_l, p_{l+1}, \dots, p_r$ is exactly the given number $m$. The median of a sequence is the value of the element which is in the middle of the sequence after sorting it in non-decreasing order. If the length of the sequence is even, the left of two middle elements is used. For example, if $a=[4, 2, 7, 5]$ then its median is $4$ since after sorting the sequence, it will look like $[2, 4, 5, 7]$ and the left of two middle elements is equal to $4$. The median of $[7, 1, 2, 9, 6]$ equals $6$ since after sorting, the value $6$ will be in the middle of the sequence. Write a program to find the number of pairs of indices $(l, r)$ ($1 \le l \le r \le n$) such that the value of the median of $p_l, p_{l+1}, \dots, p_r$ is exactly the given number $m$. The first line contains integers $n$ and $m$ ($1 \le n \le 2\cdot10^5$, $1 \le m \le n$) — the length of the given sequence and the required value of the median. The second line contains a permutation $p_1, p_2, \dots, p_n$ ($1 \le p_i \le n$). Each integer between $1$ and $n$ occurs in $p$ exactly once. Print the required number. Sample Input 5 4 2 4 5 3 1 5 5 1 2 3 4 5 15 8 1 15 2 14 3 13 4 8 12 5 11 6 10 7 9 Sample Output 4 1 48	{"inputs": ["5 4\n2 4 5 3 1", "5 5\n1 2 3 4 5", "15 8\n1 15 2 14 3 13 4 8 12 5 11 6 10 7 9", "1 1\n1", "2 1\n1 2", "2 1\n2 1", "2 2\n1 2", "2 2\n2 1", "3 1\n1 2 3", "3 1\n1 3 2", "3 1\n2 1 3", "3 1\n2 3 1", "3 1\n3 1 2", "3 1\n3 2 1", "5 2\n2 1 3 4 5", "6 3\n3 6 1 4 2 5", "7 4\n1 7 6 4 2 3 5", "8 7\n2 3 6 8 7 5 4 1", "9 9\n6 4 8 5 1 7 2 9 3", "10 1\n6 9 8 10 4 3 7 1 5 2", "11 2\n9 4 7 5 11 1 3 8 10 2 6", "12 3\n6 4 3 7 8 10 1 2 11 5 12 9", "14 5\n13 14 5 11 3 2 10 8 12 9 6 1 7 4", "100 1\n78 52 95 76 96 49 53 59 77 100 64 11 9 48 15 17 44 46 21 54 39 68 43 4 32 28 73 6 16 62 72 84 65 86 98 75 33 45 25 3 91 82 2 92 63 88 7 50 97 93 14 22 20 42 60 55 80 85 29 34 56 71 83 38 26 47 90 70 51 41 40 31 37 12 35 99 67 94 1 87 57 8 61 19 23 79 36 18 66 74 5 27 81 69 24 58 13 10 89 30", "100 50\n2 4 82 12 47 63 52 91 87 45 53 1 17 25 64 50 9 13 22 54 21 30 43 24 38 33 68 11 41 78 99 23 28 18 58 67 79 10 71 56 49 61 26 29 59 20 90 74 5 75 89 8 39 95 72 42 66 98 44 32 88 35 92 3 97 55 65 51 77 27 81 76 84 69 73 85 19 46 62 100 60 37 7 36 57 6 14 83 40 48 16 70 96 15 31 93 80 86 94 34", "100 100\n70 54 10 72 81 84 56 15 27 19 43 100 49 44 52 33 63 40 95 17 58 2 51 39 22 18 82 1 16 99 32 29 24 94 9 98 5 37 47 14 42 73 41 31 79 64 12 6 53 26 68 67 89 13 90 4 21 93 46 74 75 88 66 57 23 7 25 48 92 62 30 8 50 61 38 87 71 34 97 28 80 11 60 91 3 35 86 96 36 20 59 65 83 45 76 77 78 69 85 55"], "outputs": ["4", "1", "48", "1", "2", "2", "1", "1", "2", "2", "3", "2", "3", "2", "3", "6", "10", "4", "1", "3", "3", "4", "10", "3", "182", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	17	codeforces
f6efa3da33b7fe29692c702f81aaa53e	Cut Ribbon	Polycarpus has a ribbon, its length is n. He wants to cut the ribbon in a way that fulfils the following two conditions: - After the cutting each ribbon piece should have length a, b or c. - After the cutting the number of ribbon pieces should be maximum. Help Polycarpus and find the number of ribbon pieces after the required cutting. The first line contains four space-separated integers n, a, b and c (1<=≤<=n,<=a,<=b,<=c<=≤<=4000) — the length of the original ribbon and the acceptable lengths of the ribbon pieces after the cutting, correspondingly. The numbers a, b and c can coincide. Print a single number — the maximum possible number of ribbon pieces. It is guaranteed that at least one correct ribbon cutting exists. Sample Input 5 5 3 2 7 5 5 2 Sample Output 2 2	{"inputs": ["5 5 3 2", "7 5 5 2", "4 4 4 4", "1 1 1 1", "4000 1 2 3", "4000 3 4 5", "10 3 4 5", "100 23 15 50", "3119 3515 1021 7", "918 102 1327 1733", "3164 42 430 1309", "3043 317 1141 2438", "26 1 772 2683", "370 2 1 15", "734 12 6 2", "418 18 14 17", "18 16 28 9", "14 6 2 17", "29 27 18 2", "29 12 7 10", "27 23 4 3", "5 14 5 2", "5 17 26 5", "9 1 10 3", "2 19 15 1", "4 6 4 9", "10 6 2 9", "2 2 9 6", "6 2 4 1", "27 24 5 27", "2683 83 26 2709", "728 412 789 158", "3964 4 2916 176", "3399 2035 2 3334", "3455 244 3301 3", "595 2263 3625 1", "4000 1 1 1", "3999 2 2 3999", "25 6 8 11", "4000 500 1000 2000", "53 10 11 23", "100 100 1 1", "17 3 4 10", "413 101 102 105", "490 4 49 50", "3999 2 3 3", "8 3 8 4", "5 1 3 3", "100 3 17 22", "4000 2 3 4", "4000 3 3 5", "13 4 6 7", "4000 5 2 2", "3999 2 2 3", "4000 33 7 3333", "60 33 20 9", "100 9 11 99", "2009 6 8 9"], "outputs": ["2", "2", "1", "1", "4000", "1333", "3", "2", "11", "9", "15", "7", "26", "370", "367", "29", "2", "7", "2", "3", "9", "1", "1", "9", "2", "1", "5", "1", "6", "1", "101", "3", "991", "683", "991", "595", "4000", "1", "3", "8", "5", "100", "5", "4", "111", "1999", "2", "5", "27", "2000", "1332", "2", "2000", "1999", "564", "4", "10", "334"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	168	codeforces
f6f6f7f83556081cb3f54ab634ecbaef	Jumping on Walls	Vasya plays a computer game with ninjas. At this stage Vasya's ninja should get out of a deep canyon. The canyon consists of two vertical parallel walls, their height is n meters. Let's imagine that we split these walls into 1 meter-long areas and number them with positive integers from 1 to n from bottom to top. Some areas are safe and the ninja can climb them. Others are spiky and ninja can't be there. Let's call such areas dangerous. Initially the ninja is on the lower area of the left wall. He can use each second to perform one of the following actions: - climb one area up; - climb one area down; - jump to the opposite wall. That gets the ninja to the area that is exactly k meters higher than the area he jumped from. More formally, if before the jump the ninja is located at area x of one wall, then after the jump he is located at area x<=+<=k of the other wall. If at some point of time the ninja tries to get to an area with a number larger than n, then we can assume that the ninja got out of the canyon. The canyon gets flooded and each second the water level raises one meter. Initially the water level is at the lower border of the first area. Ninja cannot be on the area covered by water. We can assume that the ninja and the water "move in turns" — first the ninja performs some action, then the water raises for one meter, then the ninja performs one more action and so on. The level is considered completed if the ninja manages to get out of the canyon. After several failed attempts Vasya started to doubt whether it is possible to complete the level at all. Help him answer the question. The first line contains two integers n and k (1<=≤<=n,<=k<=≤<=105) — the height of the canyon and the height of ninja's jump, correspondingly. The second line contains the description of the left wall — a string with the length of n characters. The i-th character represents the state of the i-th wall area: character "X" represents a dangerous area and character "-" represents a safe area. The third line describes the right wall in the same format. It is guaranteed that the first area of the left wall is not dangerous. Print "YES" (without the quotes) if the ninja can get out from the canyon, otherwise, print "NO" (without the quotes). Sample Input 7 3 ---X--X -X--XX- 6 2 --X-X- X--XX- Sample Output YES NO	{"inputs": ["7 3\n---X--X\n-X--XX-", "6 2\n--X-X-\nX--XX-", "10 1\n-X-X-X-X-X\nX-X-X-X-X-", "5 4\n-X---\n----X", "6 2\n--X--X\nXX-X-X", "50 4\n-X-X-X--X--X--X-XX-----XX--X--------------XXX-X-X-\n--XX---XXXXXXX----XX--X--XXX--XXXX-XX--X--X--X----", "1 1\n-\nX", "2 1\n-X\nX-", "2 1\n-X\n-X", "1 20\n-\n-", "1 100000\n-\n-", "5 2\n-----\nXXXXX", "5 1\n----X\n----X", "12 4\n----X---X--X\n-----X-----X", "12 2\n-X-X-X-X-X-X\nX---XXX--X-X", "10 8\n-XXXXXXXXX\nXXXXXXXXX-", "100 10\n-X------XXX--XXX-XXXXXX---XXX---X-XX--XXX----------XX-X-XXXX-X-X-XX-X-X--XXXXX---X--X--XXX-X--XXXXXX\n---X-XXXXXXX--X-XXX--X-XX--XX----XX-X----X-X-XX-X--X-XXXXXXX-XX-X---X--XX-X-XX--XXXXXXX-X--XX--X-XXX", "12 3\n--XX--XX-XXX\n----X---XXX-", "6 2\n--X-X-\nX--XX-", "25 3\n-XXXXX-XXXXX-XXXXX-X-XXXX\nXXX-XXXXX-XXXXX-X-----X--", "13 2\n---X---X--X-X\n--X---X-X--X-", "5 2\n---XX\n---X-", "101 1\n----------------------------------------------------------------------------------------------------X\n----------------------------------------------------------------------------------------------------X"], "outputs": ["YES", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	12	codeforces
f7024bf1d013c03844cb96bcc9fa93bb	Chamber of Secrets	"The Chamber of Secrets has been opened again" — this news has spread all around Hogwarts and some of the students have been petrified due to seeing the basilisk. Dumbledore got fired and now Harry is trying to enter the Chamber of Secrets. These aren't good news for Lord Voldemort. The problem is, he doesn't want anybody to be able to enter the chamber. The Dark Lord is going to be busy sucking life out of Ginny. The Chamber of Secrets is an n<=×<=m rectangular grid in which some of the cells are columns. A light ray (and a basilisk's gaze) passes through the columns without changing its direction. But with some spell we can make a column magic to reflect the light ray (or the gaze) in all four directions when it receives the ray. This is shown in the figure below. The basilisk is located at the right side of the lower right cell of the grid and is looking to the left (in the direction of the lower left cell). According to the legend, anyone who meets a basilisk's gaze directly dies immediately. But if someone meets a basilisk's gaze through a column, this person will get petrified. We know that the door to the Chamber is located on the left side of the upper left corner of the grid and anyone who wants to enter will look in the direction of its movement (in the direction of the upper right cell) from that position. Given the dimensions of the chamber and the location of regular columns, Lord Voldemort has asked you to find the minimum number of columns that we need to make magic so that anyone who wants to enter the chamber would be petrified or just declare that it's impossible to secure the chamber. The first line of the input contains two integer numbers n and m (2<=≤<=n,<=m<=≤<=1000). Each of the next n lines contains m characters. Each character is either "." or "#" and represents one cell of the Chamber grid. It's "." if the corresponding cell is empty and "#" if it's a regular column. Print the minimum number of columns to make magic or -1 if it's impossible to do. Sample Input 3 3 .#. ... .#. 4 3 ##. ... .#. .#. Sample Output 2 2	{"inputs": ["3 3\n.#.\n...\n.#.", "4 3\n##.\n...\n.#.\n.#.", "3 3\n###\n###\n###", "3 4\n..##\n....\n..#.", "4 3\n#.#\n...\n...\n.##", "4 4\n##..\n..#.\n...#\n...#", "5 5\n...#.\n.....\n.....\n.....\n..#.#", "5 5\n.....\n.#...\n.....\n.....\n#.###", "5 5\n.....\n.###.\n..##.\n..##.\n...#.", "5 5\n.##..\n.##..\n.#.#.\n..#..\n..#..", "5 5\n...#.\n.#..#\n#.#.#\n#....\n#.#..", "5 5\n.#.#.\n#..#.\n.#.##\n.#.##\n##.#.", "5 5\n.####\n#.###\n#####\n#.###\n#####", "5 5\n.####\n#.#.#\n#####\n#####\n#####", "5 5\n#####\n#####\n#####\n#####\n#####", "2 42\n.########.#.########.#..#############.##..\n#####.#############.#####.#.#.#####.####..", "2 2\n##\n.#", "4 3\n.#.\n...\n##.\n#.#", "4 3\n..#\n#.#\n...\n#..", "10 10\n#.........\n...#..#...\n..........\n..........\n.......#.#\n..........\n..........\n......##..\n#..#......\n.........#", "4 4\n.#..\n..##\n.#.#\n..#.", "4 3\n#.#\n.##\n...\n.#.", "4 4\n...#\n.##.\n.#.#\n..#.", "4 4\n#...\n.##.\n#.#.\n.#..", "3 3\n..#\n#.#\n#..", "4 4\n#...\n.#.#\n##..\n...#", "5 5\n#....\n.....\n..##.\n#.#..\n...#.", "4 4\n..#.\n#.#.\n#..#\n...#", "4 7\n..#....\n##.##.#\n.##....\n...##.#", "5 2\n.#\n##\n..\n#.\n#.", "4 3\n.#.\n#.#\n##.\n..#"], "outputs": ["2", "2", "2", "2", "2", "-1", "-1", "-1", "-1", "2", "-1", "2", "2", "2", "2", "2", "2", "4", "4", "10", "6", "4", "6", "6", "4", "6", "6", "6", "6", "4", "6"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
f717d6d18d0b83f713963b87aacd0bcb	Five-In-a-Row	Alice and Bob play 5-in-a-row game. They have a playing field of size 10<=×<=10. In turns they put either crosses or noughts, one at a time. Alice puts crosses and Bob puts noughts. In current match they have made some turns and now it's Alice's turn. She wonders if she can put cross in such empty cell that she wins immediately. Alice wins if some crosses in the field form line of length not smaller than 5. This line can be horizontal, vertical and diagonal. You are given matrix 10<=×<=10 (10 lines of 10 characters each) with capital Latin letters 'X' being a cross, letters 'O' being a nought and '.' being an empty cell. The number of 'X' cells is equal to the number of 'O' cells and there is at least one of each type. There is at least one empty cell. It is guaranteed that in the current arrangement nobody has still won. Print 'YES' if it's possible for Alice to win in one turn by putting cross in some empty cell. Otherwise print 'NO'. Sample Input XX.XX..... .....OOOO. .......... .......... .......... .......... .......... .......... .......... .......... XXOXX..... OO.O...... .......... .......... .......... .......... .......... .......... .......... .......... Sample Output YES NO	{"inputs": ["O.......O.\n.....O.X..\n......O...\n....X.O...\n.O.O.....X\n.XO.....XX\n...X...X.O\n........O.\n........O.\n.X.X.....X", "....OX....\n..........\n.O..X...X.\nXXO..XO..O\nO.......X.\n...XX.....\n..O.O...OX\n.........X\n.....X..OO\n........O.", "..O..X.X..\n.O..X...O.\n........O.\n...O..O...\nX.XX....X.\n..O....O.X\n..X.X....O\n......X..X\nO.........\n..X.O...OO", "..........\n..........\n..........\n..........\n..........\nX.........\n.........X\n..........\n..O.......\n.O...X...O", ".OXXOOOXXO\nXOX.O.X.O.\nXX.X...OXX\nOOOX......\nX.OX.X.O..\nX.O...O.O.\n.OXOXOO...\nOO.XOOX...\nO..XX...XX\nXX.OXXOOXO", ".OX.XX.OOO\n..OXXOXOO.\nX..XXXOO.X\nXOX.O.OXOX\nO.O.X.XX.O\nOXXXOXXOXX\nO.OOO...XO\nO.X....OXX\nXO...XXO.O\nXOX.OOO.OX", "....X.....\n...X......\n..........\n.X........\nX.........\n..........\n..........\n..........\n..........\n......OOOO", "..........\n..........\n..........\n..........\n..........\n....X.....\n...X.....O\n.........O\n.X.......O\nX........O", "OOOO......\n..........\n..........\n..........\n..........\n..........\n......X...\n.......X..\n........X.\n.........X", "..........\n..........\n..........\n..........\n..........\n..........\n......X...\nOOOO...X..\n........X.\n.........X", "..........\n.........X\n........X.\n.......X..\n......X...\n..........\n..........\n..........\n..........\n......OOOO", "..........\n......OOO.\n..........\n..........\n..........\n.....O....\n......X...\n.......X..\n........X.\n.........X", ".........X\n........X.\n.......X..\n......X...\n..........\n..........\n..........\n..........\n..........\n......OOOO", "..........\n..........\n..........\n.....X....\n....X.....\n...X......\n.........O\n.X.......O\n.........O\n.........O", ".X........\n..........\n...X......\n....X.....\n.....X....\n..........\n..........\n..........\n..........\n......OOOO", "O.........\nOO........\nOOO.......\nOOO.......\n..........\n......O.OO\n.....OXXXX\n.....OXXXX\n.....OXXXX\n.....OXXXX", ".XX.....X.\n.X...O.X..\n.O........\n.....X....\n.X..XO.O..\n.X........\n.X.......O\n.........O\n..O.......\n..O....O.O", ".........X\n........X.\n.......X..\n..........\n.....X....\n..........\n..........\n..........\n..........\n......OOOO", "..........\n.....OOOO.\n..........\n..........\n..........\n..........\n.........X\n.........X\n.........X\n.........X", "..........\n.....OOOO.\n..........\n..........\n..........\n..........\n......X...\n.......X..\n........X.\n.........X", ".XX.....X.\n.X...O.X.X\n.O........\n.....X....\n.X..XO.O..\n.X........\n.X.......O\nO........O\n..O.......\n..O....O.O", "..........\n..........\n..........\n..........\n..........\n..O......X\n..O......X\n..O.......\n..O......X\n.........X", "..........\n..........\n..O.......\n...O......\n....O.....\n.....O....\n......X...\n.......X..\n........X.\n.........X", "OOO...O...\n.X...X.O..\n...O.XXX.O\n.O..XOX.X.\n..O.XXX.O.\n..X.OO.O..\n.OOXXOXXO.\n.OOX.OX.X.\n.XXX....XX\n.OO...OXO.", "..........\n.........O\n.........O\n.........O\n.........O\n..........\n.........X\n.........X\n.........X\n.........X", ".....OXXXX\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n......OOO.", "..........\n.....OOOO.\n.......OO.\n..........\n..........\n..........\n..........\n.......X..\n........X.\n......XXXX", "X.XX..XXXX\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\nOOO.O.O.OO", ".....OXXXX\n..........\n..........\n..........\n..........\n.....O....\nOOO...X...\nOOOO...X..\n........X.\n....X....X", "..........\n.....OOOO.\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n......XXXX", "..........\n.....OOOO.\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n...X.X.X.X", ".....O....\n....X..O.O\n...X.....O\n..X.......\n.X.......O\n..........\n..........\n..........\n..........\n.........X", "....X.....\n...X......\n..X.......\n.X........\n..........\n..........\n..........\n..........\n..........\n......OOOO", ".......XXX\nX.........\n..........\n..........\n..........\n..........\n..........\n..........\n..........\n......OOOO"], "outputs": ["NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	45	codeforces
f718d17fcf33e09f943d8d3f2aa51ab5	A Good Contest	Codeforces user' handle color depends on his rating — it is red if his rating is greater or equal to 2400; it is orange if his rating is less than 2400 but greater or equal to 2200, etc. Each time participant takes part in a rated contest, his rating is changed depending on his performance. Anton wants the color of his handle to become red. He considers his performance in the rated contest to be good if he outscored some participant, whose handle was colored red before the contest and his rating has increased after it. Anton has written a program that analyses contest results and determines whether he performed good or not. Are you able to do the same? The first line of the input contains a single integer n (1<=≤<=n<=≤<=100) — the number of participants Anton has outscored in this contest . The next n lines describe participants results: the i-th of them consists of a participant handle namei and two integers beforei and afteri (<=-<=4000<=≤<=beforei,<=afteri<=≤<=4000) — participant's rating before and after the contest, respectively. Each handle is a non-empty string, consisting of no more than 10 characters, which might be lowercase and uppercase English letters, digits, characters «_» and «-» characters. It is guaranteed that all handles are distinct. Print «YES» (quotes for clarity), if Anton has performed good in the contest and «NO» (quotes for clarity) otherwise. Sample Input 3 Burunduk1 2526 2537 BudAlNik 2084 2214 subscriber 2833 2749 3 Applejack 2400 2400 Fluttershy 2390 2431 Pinkie_Pie -2500 -2450 Sample Output YESNO	{"inputs": ["3\nBurunduk1 2526 2537\nBudAlNik 2084 2214\nsubscriber 2833 2749", "3\nApplejack 2400 2400\nFluttershy 2390 2431\nPinkie_Pie -2500 -2450", "1\nDb -3373 3591", "5\nQ2bz 960 2342\nhmX 2710 -1348\ngbAe -1969 -963\nE -160 196\npsi 2665 -3155", "9\nmwAz9lQ 1786 -1631\nnYgYFXZQfY -1849 -1775\nKU4jF -1773 -3376\nopR 3752 2931\nGl -1481 -1002\nR -1111 3778\n0i9B21DC 3650 289\nQ8L2dS0 358 -3305\ng -2662 3968", "5\nzMSBcOUf -2883 -2238\nYN -3314 -1480\nfHpuccQn06 -1433 -589\naM1NVEPQi 399 3462\n_L 2516 -3290", "1\na 2400 2401", "1\nfucker 4000 4000", "1\nJora 2400 2401", "1\nACA 2400 2420", "1\nAca 2400 2420", "1\nSub_d 2401 2402", "2\nHack 2400 2401\nDum 1243 555", "1\nXXX 2400 2500", "1\nfucker 2400 2401", "1\nX 2400 2500", "1\nvineet 2400 2401", "1\nabc 2400 2500", "1\naaaaa 2400 2401", "1\nhoge 2400 2401", "1\nInfinity 2400 2468", "1\nBurunduk1 2400 2401", "1\nFuck 2400 2401", "1\nfuck 2400 2401", "3\nApplejack 2400 2401\nFluttershy 2390 2431\nPinkie_Pie -2500 -2450", "1\nalex 2400 2401", "1\nA 2400 2401", "1\na 2400 2455", "1\nlol 2400 2401", "2\nBurunduk1 2400 2537\nBudAlNik 2084 2214", "1\naaaaaa 2400 2401", "1\nBurunduk1 2400 2500", "1\nds 2400 2410", "1\nas 2400 2401", "1\nabc 2400 2401", "3\nBudAlNik 2084 2214\nsubscriber 2833 2749\nBurunduk1 2526 2537", "1\ncaonima 2400 2401", "1\narr 2400 2500", "1\nx 2400 2401", "1\narrr 2400 2500", "1\nabc 2400 2405", "3\nBurunduk1 2400 2420\nBudAlNik 2084 2214\nsubscriber 2833 2749", "1\nBurunduk1 2400 2537", "1\nHELLO 2400 2401", "1\neatmore 2400 2500", "1\nb 2400 2401", "3\nBurunduk1 2400 2537\nBudAlNik 2084 2214\nsubscriber 2833 2749", "1\nApplejack 2400 2410", "1\nabacaba 2400 2451", "1\nrekt_n00b 2500 2600"], "outputs": ["YES", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	365	codeforces
f76189f114131cbaa9af76123ee3508a	Red-Green Towers	There are r red and g green blocks for construction of the red-green tower. Red-green tower can be built following next rules: - Red-green tower is consisting of some number of levels; - Let the red-green tower consist of n levels, then the first level of this tower should consist of n blocks, second level — of n<=-<=1 blocks, the third one — of n<=-<=2 blocks, and so on — the last level of such tower should consist of the one block. In other words, each successive level should contain one block less than the previous one; - Each level of the red-green tower should contain blocks of the same color. Let h be the maximum possible number of levels of red-green tower, that can be built out of r red and g green blocks meeting the rules above. The task is to determine how many different red-green towers having h levels can be built out of the available blocks. Two red-green towers are considered different if there exists some level, that consists of red blocks in the one tower and consists of green blocks in the other tower. You are to write a program that will find the number of different red-green towers of height h modulo 109<=+<=7. The only line of input contains two integers r and g, separated by a single space — the number of available red and green blocks respectively (0<=≤<=r,<=g<=≤<=2·105, r<=+<=g<=≥<=1). Output the only integer — the number of different possible red-green towers of height h modulo 109<=+<=7. Sample Input 4 6 9 7 1 1 Sample Output 2 6 2	{"inputs": ["4 6", "9 7", "1 1", "3 3", "2 19", "18 3", "100000 1", "1 100000", "6 6", "10 10", "200000 200000", "0 1", "1 0", "0 200000", "200000 0", "199396 0", "199395 0", "0 199397", "121147 78249", "78250 121147", "121146 78249", "199585 199586", "199586 199586", "199585 199585", "107344 159729", "2954 1977", "25580 17318", "89671 32487", "38 36", "136749 183300", "10000 10000", "200000 199999"], "outputs": ["2", "6", "2", "2", "1", "2", "2", "2", "6", "18", "206874596", "1", "1", "1", "1", "1", "1", "1", "64290784", "981737243", "832902708", "438320405", "876640810", "199771918", "849320920", "835530858", "263898876", "654128709", "612", "906576609", "885988055", "396481680"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
f7633c6db0a40963f948f432f5ef18b8	Three Garlands	Mishka is decorating the Christmas tree. He has got three garlands, and all of them will be put on the tree. After that Mishka will switch these garlands on. When a garland is switched on, it periodically changes its state — sometimes it is lit, sometimes not. Formally, if i-th garland is switched on during x-th second, then it is lit only during seconds x, x<=+<=ki, x<=+<=2ki, x<=+<=3ki and so on. Mishka wants to switch on the garlands in such a way that during each second after switching the garlands on there would be at least one lit garland. Formally, Mishka wants to choose three integers x1, x2 and x3 (not necessarily distinct) so that he will switch on the first garland during x1-th second, the second one — during x2-th second, and the third one — during x3-th second, respectively, and during each second starting from max(x1,<=x2,<=x3) at least one garland will be lit. Help Mishka by telling him if it is possible to do this! The first line contains three integers k1, k2 and k3 (1<=≤<=ki<=≤<=1500) — time intervals of the garlands. If Mishka can choose moments of time to switch on the garlands in such a way that each second after switching the garlands on at least one garland will be lit, print YES. Otherwise, print NO. Sample Input 2 2 3 4 2 3 Sample Output YES NO	{"inputs": ["2 2 3", "4 2 3", "1499 1498 1500", "1500 1500 1500", "100 4 1", "4 2 4", "3 3 3", "2 3 6", "2 3 3", "4 4 2", "1 1 1", "2 11 2", "4 4 4", "4 4 5", "3 3 2", "3 6 6", "2 3 2", "1 1 3", "3 3 4", "2 4 4", "2 2 2", "2 10 10", "3 4 4", "2 5 5", "2 4 5", "228 2 2", "2 998 1000", "2 6 6", "6 4 7", "2 5 2", "2 100 100", "7 7 2", "3 3 6", "82 3 82", "2 3 5", "1 218 924", "4 4 123", "4 4 3", "3 4 2", "2 2 5", "2 10 2", "5 2 2", "3 3 9", "1 5 5", "2 4 6", "15 3 3", "1 5 10", "2 3 14", "1265 2 593", "2 2 567", "1 6 5", "2 2 7", "2 2 1500", "3 6 9", "1 46 79", "4 3 3", "2 4 8", "1493 1489 1487", "1 2 3", "1 2 5", "1 2 8", "3 4 5", "2 2 4", "3 2 3", "7 2 2", "3 2 2", "6 7 4"], "outputs": ["YES", "NO", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "YES", "YES", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	75	codeforces
f7641ca673ddd74e3ceea30537a93912	Word Cut	Let's consider one interesting word game. In this game you should transform one word into another through special operations. Let's say we have word w, let's split this word into two non-empty parts x and y so, that w<==<=xy. A split operation is transforming word w<==<=xy into word u<==<=yx. For example, a split operation can transform word "wordcut" into word "cutword". You are given two words start and end. Count in how many ways we can transform word start into word end, if we apply exactly k split operations consecutively to word start. Two ways are considered different if the sequences of applied operations differ. Two operation sequences are different if exists such number i (1<=≤<=i<=≤<=k), that in the i-th operation of the first sequence the word splits into parts x and y, in the i-th operation of the second sequence the word splits into parts a and b, and additionally x<=≠<=a holds. The first line contains a non-empty word start, the second line contains a non-empty word end. The words consist of lowercase Latin letters. The number of letters in word start equals the number of letters in word end and is at least 2 and doesn't exceed 1000 letters. The third line contains integer k (0<=≤<=k<=≤<=105) — the required number of operations. Print a single number — the answer to the problem. As this number can be rather large, print it modulo 1000000007 (109<=+<=7). Sample Input ab ab 2 ababab ababab 1 ab ba 2 Sample Output 1 2 0	{"inputs": ["ab\nab\n2", "ababab\nababab\n1", "ab\nba\n2", "aaa\naaa\n0", "hi\nhi\n1", "abcd\ncbad\n5", "ab\nba\n10", "voodoo\ndoovoo\n100000", "ababab\nbababa\n100000", "abcdefgh\ncdefghab\n666", "aaaabaaaaaaaaaaabaaaaaaa\naaaaaaaaaabaaaaaaaaabaaa\n7477", "ssgqcodnqgfbhqsgineioafkkhcmmmihbiefialidgkffrhaiekebpieqgpplmsgmghphjsfgpscrbcgrssbccqroffnfgkfohljdarbpqmkolldcjcfhpodeqmgbdddlgoolesecdqsochdfgjsmorbnmiinjlpda\nljdarbpqmkolldcjcfhpodeqmgbdddlgoolesecdqsochdfgjsmorbnmiinjlpdassgqcodnqgfbhqsgineioafkkhcmmmihbiefialidgkffrhaiekebpieqgpplmsgmghphjsfgpscrbcgrssbccqroffnfgkfoh\n50897", "jfemedqrsqaopiekdosgjnhbshanggdqqpkhepjfrkgkshepbmkdnidmpgfojjjbeddkelccoqapnpkqbimlbgagllioqbdgnsejqcbicjbbijjlrjmkkarjdoganmfsmfohlspbsoldfspdacasgsrcndlhg\nhepbmkdnidmpgfojjjbeddkelccoqapnpkqbimlbgagllioqbdgnsejqcbicjbbijjlrjmkkarjdoganmfsmfohlspbsoldfspdacasgsrcndlhgjfemedqrsqaopiekdosgjnhbshanggdqqpkhepjfrkgks\n6178", "aaeddddadbcacbdccaeeeddecadbecbbcebdcdbcddcadcadccecccecdbabd\nadbecbbcebdcdbcddcadcadccecccecdbabdaaeddddadbcacbdccaeeeddec\n55400", "chajciihijjbjcgaedebdcjaaeaiffiggfdfbdjhikhbiijhbjciebgkadbbekijadafhjhgiidfjkjbgcdfdgjjfficbagghkdgdhdedihifcfkedcefcdfjaagiehccjbjhihcbdakbjfjdgakkfagddhekccbdjhejhakfccgghkdc\ndafhjhgiidfjkjbgcdfdgjjfficbagghkdgdhdedihifcfkedcefcdfjaagiehccjbjhihcbdakbjfjdgakkfagddhekccbdjhejhakfccgghkdcchajciihijjbjcgaedebdcjaaeaiffiggfdfbdjhikhbiijhbjciebgkadbbekija\n67572", "dkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjijdkjij\ndddkikjjidkkidijjjjkkjjikjdikiidijjikikjijjiijdikkjjjiddjjijkkkjkiijijkijdjjikikdjjjijdddjkjjdijjjjjjjddkjjkjjjdjjdkijjkijkkjkkkiiijdjijkkdjdjjjkkjkdddjidjjijdddkijididjdddidijjjjjdkidijjkkjiijkjjjjjjdjkkdddkjj\n31328", "lnxjsxjjfbrhijshlptgogxstvaybbueilocmaqwhlauulubpwtjtsdktgrowgbkhdotemhstqtxnpspmxjxrqymonnpcvrendrfxbwqxeedyamwvyyytxtmorkovoeklkabyexrfseimlaqlibaoaaeae\nalxckgrkneuqrqstpxormswxsyhaaoebqhfspyqjbxgytrpdoybxmmenllxxrrjtxtvhaoidjmaekiflxykmpnwageytemoewalwihbunbnvomqbututijjvdsbelrxestajokwysctfptalvegdahlboo\n44031", "cfacacbfaeadfdbedfdccdccdddaaa\ncbfaeadfdbedfdccdccdddaaacfaca\n15215", "xxx\nyyy\n0", "abc\ncba\n0", "ab\nba\n0", "abc\nabc\n1", "ab\nba\n9", "ab\nba\n10", "aa\naa\n1", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n100000", "aaaba\naaaad\n0"], "outputs": ["1", "2", "0", "1", "0", "0", "0", "792428974", "377286908", "83913683", "0", "222669762", "568786732", "471327413", "18146811", "0", "0", "668863397", "0", "0", "0", "0", "1", "0", "1", "486606280", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	24	codeforces
f77027b5a8bdd60ddf914fe8d79e9619	Coprime Subsequences	Let's call a non-empty sequence of positive integers a1,<=a2... ak coprime if the greatest common divisor of all elements of this sequence is equal to 1. Given an array a consisting of n positive integers, find the number of its coprime subsequences. Since the answer may be very large, print it modulo 109<=+<=7. Note that two subsequences are considered different if chosen indices are different. For example, in the array [1,<=1] there are 3 different subsequences: [1], [1] and [1,<=1]. The first line contains one integer number n (1<=≤<=n<=≤<=100000). The second line contains n integer numbers a1,<=a2... an (1<=≤<=ai<=≤<=100000). Print the number of coprime subsequences of a modulo 109<=+<=7. Sample Input 3 1 2 3 4 1 1 1 1 7 1 3 5 15 3 105 35 Sample Output 5 15 100	{"inputs": ["3\n1 2 3", "4\n1 1 1 1", "7\n1 3 5 15 3 105 35", "1\n1", "1\n100000", "5\n10 8 6 4 6", "5\n5 1 3 5 4", "5\n5 1 6 6 6", "10\n9 6 8 5 5 2 8 9 2 2", "10\n2 2 16 16 14 1 9 12 15 13", "50\n17 81 20 84 6 86 11 33 19 46 70 79 23 64 40 99 78 70 3 10 32 42 18 73 35 36 69 90 81 81 8 25 87 23 76 100 53 11 36 19 87 89 53 65 97 67 3 65 88 87", "50\n166 126 98 42 179 166 99 192 1 185 114 173 152 187 57 21 132 88 152 55 110 51 1 30 147 153 34 115 59 3 78 16 19 136 188 134 28 48 54 120 97 74 108 54 181 79 143 187 51 4", "100\n154 163 53 13 186 87 143 114 17 111 143 108 102 111 158 171 69 74 67 18 87 43 80 104 63 109 19 113 86 52 119 91 15 154 9 153 140 91 19 19 191 193 76 84 50 128 173 27 120 83 6 59 65 5 135 59 162 121 15 110 146 107 137 99 55 189 2 118 55 27 4 198 23 79 167 125 72 30 74 163 44 184 166 43 198 116 68 5 47 138 121 146 98 103 89 75 137 36 146 195", "100\n881 479 355 759 257 497 690 598 275 446 439 787 257 326 584 713 322 5 253 781 434 307 164 154 241 381 38 942 680 906 240 11 431 478 628 959 346 74 493 964 455 746 950 41 585 549 892 687 264 41 487 676 63 453 861 980 477 901 80 907 285 506 619 748 773 743 56 925 651 685 845 313 419 504 770 324 2 559 405 851 919 128 318 698 820 409 547 43 777 496 925 918 162 725 481 83 220 203 609 617"], "outputs": ["5", "15", "100", "1", "0", "0", "26", "23", "951", "953", "896338157", "763698643", "363088732", "934190491"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	16	codeforces
f787e15865d3fc919c7733bf0d10c0ca	none	Some time ago Mister B detected a strange signal from the space, which he started to study. After some transformation the signal turned out to be a permutation p of length n or its cyclic shift. For the further investigation Mister B need some basis, that's why he decided to choose cyclic shift of this permutation which has the minimum possible deviation. Let's define the deviation of a permutation p as . Find a cyclic shift of permutation p with minimum possible deviation. If there are multiple solutions, print any of them. Let's denote id k (0<=≤<=k<=<<=n) of a cyclic shift of permutation p as the number of right shifts needed to reach this shift, for example: - k<==<=0: shift p1,<=p2,<=... pn, - k<==<=1: shift pn,<=p1,<=... pn<=-<=1, - ..., - k<==<=n<=-<=1: shift p2,<=p3,<=... pn,<=p1. First line contains single integer n (2<=≤<=n<=≤<=106) — the length of the permutation. The second line contains n space-separated integers p1,<=p2,<=...,<=pn (1<=≤<=pi<=≤<=n) — the elements of the permutation. It is guaranteed that all elements are distinct. Print two integers: the minimum deviation of cyclic shifts of permutation p and the id of such shift. If there are multiple solutions, print any of them. Sample Input 3 1 2 3 3 2 3 1 3 3 2 1 Sample Output 0 0 0 1 2 1	{"inputs": ["3\n1 2 3", "3\n2 3 1", "3\n3 2 1", "2\n1 2", "2\n2 1", "10\n10 1 9 2 8 3 7 4 6 5", "108\n1 102 33 99 6 83 4 20 61 100 76 71 44 9 24 87 57 2 81 82 90 85 12 30 66 53 47 36 43 29 31 64 96 84 77 23 93 78 58 68 42 55 13 70 62 19 92 14 10 65 63 75 91 48 11 105 37 50 32 94 18 26 52 89 104 106 86 97 80 95 17 72 40 22 79 103 25 101 35 51 15 98 67 5 34 69 54 27 45 88 56 16 46 60 74 108 21 41 73 39 107 59 3 8 28 49 7 38", "4\n1 2 3 4", "4\n1 2 4 3", "4\n1 3 2 4", "4\n1 3 4 2", "4\n1 4 2 3", "4\n1 4 3 2", "4\n2 1 3 4", "4\n2 1 4 3", "4\n2 3 1 4", "4\n2 3 4 1", "4\n2 4 1 3", "4\n2 4 3 1", "4\n3 1 2 4", "4\n3 1 4 2", "4\n3 2 1 4", "4\n3 2 4 1", "4\n3 4 1 2", "4\n3 4 2 1", "4\n4 1 2 3", "4\n4 1 3 2", "4\n4 2 1 3", "4\n4 2 3 1", "4\n4 3 1 2", "4\n4 3 2 1", "10\n1 2 3 4 6 5 7 9 10 8", "10\n1 2 10 9 7 4 8 3 6 5", "10\n1 3 10 9 4 7 5 8 6 2", "10\n1 4 10 8 9 2 3 6 7 5", "10\n1 5 10 8 4 3 9 2 7 6", "10\n1 6 10 7 9 5 3 8 4 2", "10\n1 7 10 6 5 2 3 8 9 4", "10\n1 8 10 6 2 4 9 3 7 5", "10\n1 9 10 5 6 7 3 8 4 2", "10\n1 10 9 5 3 2 4 7 8 6", "10\n2 1 10 5 8 4 9 3 7 6", "10\n2 3 10 5 4 8 6 9 7 1", "10\n2 4 10 3 9 1 5 7 8 6", "10\n2 5 10 3 6 4 9 1 8 7", "10\n2 6 10 1 9 7 4 8 5 3", "10\n2 7 10 1 6 3 4 8 9 5"], "outputs": ["0 0", "0 1", "2 1", "0 0", "0 1", "24 7", "3428 30", "0 0", "2 0", "2 0", "2 1", "4 0", "4 0", "2 0", "4 0", "4 0", "0 1", "2 2", "2 1", "2 3", "4 1", "4 0", "2 1", "0 2", "2 2", "0 3", "2 3", "2 3", "4 1", "2 2", "4 1", "6 0", "26 5", "22 1", "20 5", "26 6", "24 4", "26 6", "24 6", "26 1", "20 7", "28 0", "14 1", "28 0", "28 0", "28 1", "20 7"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
f792ab42d078f44a187ba4dbaad41927	Breaking Good	Breaking Good is a new video game which a lot of gamers want to have. There is a certain level in the game that is really difficult even for experienced gamers. Walter William, the main character of the game, wants to join a gang called Los Hermanos (The Brothers). The gang controls the whole country which consists of n cities with m bidirectional roads connecting them. There is no road is connecting a city to itself and for any two cities there is at most one road between them. The country is connected, in the other words, it is possible to reach any city from any other city using the given roads. The roads aren't all working. There are some roads which need some more work to be performed to be completely functioning. The gang is going to rob a bank! The bank is located in city 1. As usual, the hardest part is to escape to their headquarters where the police can't get them. The gang's headquarters is in city n. To gain the gang's trust, Walter is in charge of this operation, so he came up with a smart plan. First of all the path which they are going to use on their way back from city 1 to their headquarters n must be as short as possible, since it is important to finish operation as fast as possible. Then, gang has to blow up all other roads in country that don't lay on this path, in order to prevent any police reinforcements. In case of non-working road, they don't have to blow up it as it is already malfunctional. If the chosen path has some roads that doesn't work they'll have to repair those roads before the operation. Walter discovered that there was a lot of paths that satisfied the condition of being shortest possible so he decided to choose among them a path that minimizes the total number of affected roads (both roads that have to be blown up and roads to be repaired). Can you help Walter complete his task and gain the gang's trust? The first line of input contains two integers n,<=m (2<=≤<=n<=≤<=105, ), the number of cities and number of roads respectively. In following m lines there are descriptions of roads. Each description consists of three integers x,<=y,<=z (1<=≤<=x,<=y<=≤<=n, ) meaning that there is a road connecting cities number x and y. If z<==<=1, this road is working, otherwise it is not. In the first line output one integer k, the minimum possible number of roads affected by gang. In the following k lines output three integers describing roads that should be affected. Each line should contain three integers x,<=y,<=z (1<=≤<=x,<=y<=≤<=n, ), cities connected by a road and the new state of a road. z<==<=1 indicates that the road between cities x and y should be repaired and z<==<=0 means that road should be blown up. You may output roads in any order. Each affected road should appear exactly once. You may output cities connected by a single road in any order. If you output a road, it's original state should be different from z. After performing all operations accroding to your plan, there should remain working only roads lying on some certain shortest past between city 1 and n. If there are multiple optimal answers output any. Sample Input 2 1 1 2 0 4 4 1 2 1 1 3 0 2 3 1 3 4 1 8 9 1 2 0 8 3 0 2 3 1 1 4 1 8 7 0 1 5 1 4 6 1 5 7 0 6 8 0 Sample Output 1 1 2 1 3 1 2 0 1 3 1 2 3 0 3 2 3 0 1 5 0 6 8 1	{"inputs": ["2 1\n1 2 0", "4 4\n1 2 1\n1 3 0\n2 3 1\n3 4 1", "8 9\n1 2 0\n8 3 0\n2 3 1\n1 4 1\n8 7 0\n1 5 1\n4 6 1\n5 7 0\n6 8 0", "9 10\n1 2 0\n2 3 0\n1 4 1\n4 5 1\n4 6 1\n6 7 1\n1 7 0\n1 8 0\n7 8 0\n9 7 1", "5 6\n1 2 0\n3 2 0\n5 1 1\n1 3 1\n5 3 0\n4 3 1", "15 31\n6 2 0\n5 15 1\n2 3 1\n6 9 1\n13 12 0\n2 7 0\n15 3 0\n3 5 1\n3 8 1\n5 8 1\n1 9 1\n8 4 0\n13 2 1\n9 12 0\n9 2 1\n6 13 1\n3 1 0\n14 9 0\n15 2 1\n10 15 0\n7 10 0\n2 8 1\n11 7 0\n10 9 1\n12 11 1\n7 15 0\n12 2 0\n13 11 1\n4 6 0\n12 7 0\n12 1 1", "5 10\n1 2 1\n1 3 0\n1 4 0\n1 5 0\n2 3 0\n2 4 1\n2 5 0\n3 4 1\n3 5 1\n4 5 0", "5 10\n1 2 0\n1 3 1\n1 4 0\n1 5 0\n2 3 0\n2 4 0\n2 5 1\n3 4 0\n3 5 0\n4 5 1", "5 10\n1 2 0\n1 3 0\n1 4 0\n1 5 0\n2 3 0\n2 4 0\n2 5 0\n3 4 0\n3 5 0\n4 5 0", "13 58\n9 12 0\n8 11 0\n4 8 0\n2 12 1\n9 1 1\n10 6 1\n5 2 1\n3 9 0\n8 3 0\n9 10 0\n8 5 1\n11 3 0\n11 1 0\n2 6 1\n12 3 1\n11 6 0\n1 12 0\n2 1 1\n11 13 0\n6 8 1\n11 5 1\n8 9 0\n1 4 0\n12 7 1\n5 12 0\n11 7 0\n10 2 0\n5 10 1\n9 4 1\n7 5 1\n2 11 0\n13 12 1\n10 3 1\n1 13 0\n7 1 0\n6 3 0\n7 13 0\n4 10 0\n7 10 1\n12 8 1\n2 13 0\n3 1 1\n5 13 0\n4 3 0\n8 1 0\n4 12 1\n11 10 1\n10 1 1\n1 6 0\n8 13 1\n5 4 0\n9 11 0\n10 13 1\n8 2 0\n10 12 0\n6 12 0\n1 5 0\n11 12 0", "6 6\n1 2 1\n2 3 1\n3 4 1\n3 5 1\n4 6 1\n4 5 1", "9 12\n1 2 1\n2 3 1\n3 1 0\n2 4 1\n4 5 0\n2 5 0\n4 6 0\n4 7 1\n6 7 0\n5 8 1\n8 9 1\n5 9 1", "12 48\n9 5 0\n6 3 0\n2 4 1\n6 8 1\n9 2 1\n7 2 0\n3 12 1\n6 12 1\n2 5 0\n11 4 1\n7 12 0\n8 11 1\n11 2 1\n2 6 0\n9 1 0\n1 3 0\n8 12 0\n11 5 1\n10 6 0\n10 9 1\n1 12 1\n10 12 1\n1 10 0\n10 2 0\n1 8 0\n7 4 1\n9 3 0\n11 7 0\n4 3 0\n1 2 0\n8 9 0\n11 12 0\n12 9 1\n7 5 0\n3 5 0\n5 6 1\n3 10 0\n11 10 1\n2 3 0\n4 9 0\n1 5 1\n10 5 1\n6 9 1\n10 4 0\n9 7 0\n4 12 0\n3 8 1\n6 11 1", "6 6\n1 2 1\n2 3 1\n3 4 1\n3 5 1\n5 6 1\n4 5 1", "6 7\n1 2 1\n1 3 1\n2 4 1\n2 5 1\n3 5 1\n3 6 1\n5 6 1"], "outputs": ["1\n1 2 1", "3\n1 2 0\n1 3 1\n2 3 0", "3\n2 3 0\n1 5 0\n6 8 1", "5\n1 4 0\n4 5 0\n4 6 0\n6 7 0\n1 7 1", "2\n1 3 0\n4 3 0", "18\n5 15 0\n2 3 0\n6 9 0\n15 3 1\n3 5 0\n3 8 0\n5 8 0\n1 9 0\n13 2 0\n9 2 0\n6 13 0\n3 1 1\n15 2 0\n2 8 0\n10 9 0\n12 11 0\n13 11 0\n12 1 0", "5\n1 2 0\n1 5 1\n2 4 0\n3 4 0\n3 5 0", "4\n1 3 0\n1 5 1\n2 5 0\n4 5 0", "1\n1 5 1", "25\n2 12 0\n9 1 0\n10 6 0\n5 2 0\n8 5 0\n2 6 0\n12 3 0\n2 1 0\n6 8 0\n11 5 0\n12 7 0\n5 10 0\n9 4 0\n7 5 0\n13 12 0\n10 3 0\n1 13 1\n7 10 0\n12 8 0\n3 1 0\n4 12 0\n11 10 0\n10 1 0\n8 13 0\n10 13 0", "2\n3 5 0\n4 5 0", "6\n2 3 0\n2 4 0\n2 5 1\n4 7 0\n5 8 0\n8 9 0", "20\n2 4 0\n6 8 0\n9 2 0\n3 12 0\n6 12 0\n11 4 0\n8 11 0\n11 2 0\n11 5 0\n10 9 0\n10 12 0\n7 4 0\n12 9 0\n5 6 0\n11 10 0\n1 5 0\n10 5 0\n6 9 0\n3 8 0\n6 11 0", "2\n3 4 0\n4 5 0", "5\n1 2 0\n2 4 0\n2 5 0\n3 5 0\n5 6 0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
f7aa8d7390b43237f204ef5ed371668b	Hometask	Sergey attends lessons of the N-ish language. Each lesson he receives a hometask. This time the task is to translate some sentence to the N-ish language. Sentences of the N-ish language can be represented as strings consisting of lowercase Latin letters without spaces or punctuation marks. Sergey totally forgot about the task until half an hour before the next lesson and hastily scribbled something down. But then he recollected that in the last lesson he learned the grammar of N-ish. The spelling rules state that N-ish contains some "forbidden" pairs of letters: such letters can never occur in a sentence next to each other. Also, the order of the letters doesn't matter (for example, if the pair of letters "ab" is forbidden, then any occurrences of substrings "ab" and "ba" are also forbidden). Also, each pair has different letters and each letter occurs in no more than one forbidden pair. Now Sergey wants to correct his sentence so that it doesn't contain any "forbidden" pairs of letters that stand next to each other. However, he is running out of time, so he decided to simply cross out some letters from the sentence. What smallest number of letters will he have to cross out? When a letter is crossed out, it is "removed" so that the letters to its left and right (if they existed), become neighboring. For example, if we cross out the first letter from the string "aba", we get the string "ba", and if we cross out the second letter, we get "aa". The first line contains a non-empty string s, consisting of lowercase Latin letters — that's the initial sentence in N-ish, written by Sergey. The length of string s doesn't exceed 105. The next line contains integer k (0<=≤<=k<=≤<=13) — the number of forbidden pairs of letters. Next k lines contain descriptions of forbidden pairs of letters. Each line contains exactly two different lowercase Latin letters without separators that represent the forbidden pairs. It is guaranteed that each letter is included in no more than one pair. Print the single number — the smallest number of letters that need to be removed to get a string without any forbidden pairs of neighboring letters. Please note that the answer always exists as it is always possible to remove all letters. Sample Input ababa 1 ab codeforces 2 do cs Sample Output 2 1	{"inputs": ["ababa\n1\nab", "codeforces\n2\ndo\ncs", "nllnrlrnll\n1\nrl", "aludfbjtwnkgnfl\n1\noy", "pgpgppgggpbbnnn\n2\npg\nnb", "eepeeeeppppppeepeppe\n1\npe", "vefneyamdzoytemupniw\n13\nve\nfg\noi\nan\nck\nwx\npq\nml\nbt\nud\nrz\nsj\nhy", "drvwfaacccwnncfwuptsorrrvvvrgdzytrwweeexzyyyxuwuuk\n13\nld\nac\nnp\nrv\nmo\njh\ngb\nuw\nfq\nst\nkx\nzy\nei", "pninnihzipirpbdggrdglzdpbldtzihgbzdnrgznbpdanhnlag\n4\nli\nqh\nad\nbp", "mbmxuuuuxuuuuhhooooxxxuxxxuxuuxuuuxxjvjvjjjjvvvjjjjjvvjvjjjvvvjjvjjvvvjjjvjvvjvjjjjjmmbmbbbbbmbbbbmm\n5\nmb\nho\nxu\njv\nyp", "z\n0", "t\n13\nzx\nig\nyq\nbd\nph\nar\nne\nwo\ntk\njl\ncv\nfs\nmu", "rbnxovfcwkdjctdjfskaozjzthlcntuaoiavnbsfpuzxyvhfbxetvryvwrqetokdshadxpxijtpkrqvghsrejgnqntwiypiglzmp\n13\njr\nnf\nyk\ntq\nwe\nil\ngu\npb\naz\nxm\nhc\nvd\nso", "yynynnyyyiynyniiiinyynniiyiyyyniyniyynyyyynyynnniiiniyyniiyyiynyiynnnnyiiyiyniyyininiyiiiyynnnyiyinnnnyiinnnnnyninyinyynynyiynyyyiyinyynnyyinynyinininyniniynniiyyiiyy\n1\nni", "eowsgsewestwsootoetteoeeeetwssesstswegswetwetggewsteeteoggetssetseegwteswtteowsgowwoowetwgogewssogwgtttgwwoeotgoswwwwswsgeeoowwwwetwgeswsgwtsgewswtstwgggtegsssggsstwsoggeoseotgwswwggtggweewwgwegggoteweessotsewttwseosgegswwsoewgwstetwteegseowgwoteegwttwwowtwtosweeggweeeeoeesgseetgwgtswteotgwewetssggteewteeetetweeotwttwoeswggoosogoeg\n3\nst\neo\ngw", "ttspivgoupgupvgpusvppogsseueusuglpiugssviuutlvgvugtpovuvspvpipggooplgvgugpogvesppulovugsvuougveiivgvslllviogpvtolepglguuellotpvgevspvoiiggiiplppgosuguvtstttpielteuglopgeoeeuivtptggltoltpgliviotsospvitupiopisoetupvvspooilsopslpoloptigstspoiuutiuvvuvlpplvioitsuvlpvtleveslslovolloogsgpvpepgueesslgtssttuupieppsstoeopeeppvopglpvtvuugpsuoplttsgstsiplpiugtoolisgpeeiuvutstpulvtllipsvsslvoepooslvteoevipvpsuoiippeuegoovoovstlvgsstitsivlvseguoolpslueuepgeooltviovpveeivolssloieuugovguoleulvssopetlpivpgoigtv\n1\ngs", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\n1\nab"], "outputs": ["2", "1", "1", "0", "7", "10", "1", "11", "4", "37", "0", "0", "0", "28", "49", "8", "75"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	16	codeforces
f7b93766b035c712017b0bdc774bdecf	Chess Tourney	Berland annual chess tournament is coming! Organizers have gathered 2·n chess players who should be divided into two teams with n people each. The first team is sponsored by BerOil and the second team is sponsored by BerMobile. Obviously, organizers should guarantee the win for the team of BerOil. Thus, organizers should divide all 2·n players into two teams with n people each in such a way that the first team always wins. Every chess player has its rating ri. It is known that chess player with the greater rating always wins the player with the lower rating. If their ratings are equal then any of the players can win. After teams assignment there will come a drawing to form n pairs of opponents: in each pair there is a player from the first team and a player from the second team. Every chess player should be in exactly one pair. Every pair plays once. The drawing is totally random. Is it possible to divide all 2·n players into two teams with n people each so that the player from the first team in every pair wins regardless of the results of the drawing? The first line contains one integer n (1<=≤<=n<=≤<=100). The second line contains 2·n integers a1,<=a2,<=... a2n (1<=≤<=ai<=≤<=1000). If it's possible to divide all 2·n players into two teams with n people each so that the player from the first team in every pair wins regardless of the results of the drawing, then print "YES". Otherwise print "NO". Sample Input 2 1 3 2 4 1 3 3 Sample Output YES NO	{"inputs": ["2\n1 3 2 4", "1\n3 3", "5\n1 1 1 1 2 2 3 3 3 3", "5\n1 1 1 1 1 2 2 2 2 2", "10\n1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000", "1\n2 3", "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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "35\n919 240 231 858 456 891 959 965 758 30 431 73 505 694 874 543 975 445 16 147 904 690 940 278 562 127 724 314 30 233 389 442 353 652 581 383 340 445 487 283 85 845 578 946 228 557 906 572 919 388 686 181 958 955 736 438 991 170 632 593 475 264 178 344 159 414 739 590 348 884", "5\n1 2 3 4 10 10 6 7 8 9", "2\n1 1 1 2", "2\n10 4 4 4", "2\n2 3 3 3", "4\n1 2 3 4 5 4 6 7", "4\n2 5 4 5 8 3 1 5", "4\n8 2 2 4 1 4 10 9", "2\n3 8 10 2", "3\n1 3 4 4 5 6", "2\n3 3 3 4", "2\n1 1 2 2", "2\n1 1 3 3", "2\n1 2 3 2", "10\n1 2 7 3 9 4 1 5 10 3 6 1 10 7 8 5 7 6 1 4", "3\n1 2 3 3 4 5", "2\n2 2 1 1", "7\n1 2 3 4 5 6 7 7 8 9 10 11 12 19", "5\n1 2 3 4 5 3 3 5 6 7", "4\n1 1 2 2 3 3 3 3", "51\n576 377 63 938 667 992 959 997 476 94 652 272 108 410 543 456 942 800 917 163 931 584 357 890 895 318 544 179 268 130 649 916 581 350 573 223 495 26 377 695 114 587 380 424 744 434 332 249 318 522 908 815 313 384 981 773 585 747 376 812 538 525 997 896 859 599 437 163 878 14 224 733 369 741 473 178 153 678 12 894 630 921 505 635 128 404 64 499 208 325 343 996 970 39 380 80 12 756 580 57 934 224", "3\n3 3 3 2 3 2", "2\n5 3 3 6", "2\n1 2 2 3", "2\n1 3 2 2", "2\n1 3 3 4", "2\n1 2 2 2", "3\n1 2 7 19 19 7", "3\n1 2 3 3 5 6", "2\n1 2 2 4", "2\n6 6 5 5", "2\n3 1 3 1", "3\n1 2 3 3 1 1", "3\n3 2 1 3 4 5", "3\n4 5 6 4 2 1", "3\n1 1 2 3 2 4", "3\n100 99 1 1 1 1", "3\n1 2 3 6 5 3", "2\n2 2 1 2", "4\n1 2 3 4 5 6 7 4", "3\n1 2 3 1 1 1", "3\n6 5 3 3 1 3", "2\n1 2 1 2", "3\n1 2 5 6 8 6", "5\n1 2 3 4 5 3 3 3 3 3", "2\n1 2 4 2", "3\n7 7 4 5 319 19", "3\n1 2 4 4 3 5", "3\n3 2 3 4 5 2", "5\n1 2 3 4 4 5 3 6 7 8", "3\n3 3 4 4 5 1", "2\n3 4 3 3", "2\n2 5 4 4", "5\n1 2 3 3 4 5 6 7 8 4", "3\n1 2 3 3 5 5", "2\n3 4 4 4", "2\n1 4 5 4", "2\n1 2 3 3", "2\n1 1 2 1", "4\n1 1 1 1 2 2 2 2", "4\n1 2 3 5 6 7 8 5", "2\n4 3 3 1", "3\n3 1 2 4 3 5", "3\n1 2 3 3 4 6", "4\n2 2 2 4 5 5 5 5", "2\n1 3 4 3", "2\n3 3 2 3", "2\n1 2 1 1", "3\n1 3 4 4 2 5", "4\n4 7 1 2 3 5 6 4", "2\n3 2 2 2", "1\n2 1", "2\n3 3 1 2", "1\n8 6", "7\n6 7 6 7 3 1 9 4 6 10 8 2 5 7", "2\n3 9 2 1", "2\n3 3 3 3"], "outputs": ["YES", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "YES", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	131	codeforces
f7ecc31f6717583a02c3bf8945146bfa	Worms Evolution	Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a1, a2, ..., an. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this. The first line contains integer n (3<=≤<=n<=≤<=100) — amount of worm's forms. The second line contains n space-separated integers ai (1<=≤<=ai<=≤<=1000) — lengths of worms of each form. Output 3 distinct integers i j k (1<=≤<=i,<=j,<=k<=≤<=n) — such indexes of worm's forms that ai<==<=aj<=+<=ak. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that aj<==<=ak. Sample Input 5 1 2 3 5 7 5 1 8 1 5 1 Sample Output 3 2 1 -1	{"inputs": ["5\n1 2 3 5 7", "5\n1 8 1 5 1", "4\n303 872 764 401", "6\n86 402 133 524 405 610", "8\n217 779 418 895 996 473 3 22", "10\n858 972 670 15 662 114 33 273 53 310", "100\n611 697 572 770 603 870 128 245 49 904 468 982 788 943 549 288 668 796 803 515 999 735 912 49 298 80 412 841 494 434 543 298 17 571 271 105 70 313 178 755 194 279 585 766 412 164 907 841 776 556 731 268 735 880 176 267 287 65 239 588 155 658 821 47 783 595 585 69 226 906 429 161 999 148 7 484 362 585 952 365 92 749 904 525 307 626 883 367 450 755 564 950 728 724 69 106 119 157 96 290", "100\n713 572 318 890 577 657 646 146 373 783 392 229 455 871 20 593 573 336 26 381 280 916 907 732 820 713 111 840 570 446 184 711 481 399 788 647 492 15 40 530 549 506 719 782 126 20 778 996 712 761 9 74 812 418 488 175 103 585 900 3 604 521 109 513 145 708 990 361 682 827 791 22 596 780 596 385 450 643 158 496 876 975 319 783 654 895 891 361 397 81 682 899 347 623 809 557 435 279 513 438", "100\n156 822 179 298 981 82 610 345 373 378 895 734 768 15 78 335 764 608 932 297 717 553 916 367 425 447 361 195 66 70 901 236 905 744 919 564 296 610 963 628 840 52 100 750 345 308 37 687 192 704 101 815 10 990 216 358 823 546 578 821 706 148 182 582 421 482 829 425 121 337 500 301 402 868 66 935 625 527 746 585 308 523 488 914 608 709 875 252 151 781 447 2 756 176 976 302 450 35 680 791", "100\n54 947 785 838 359 647 92 445 48 465 323 486 101 86 607 31 860 420 709 432 435 372 272 37 903 814 309 197 638 58 259 822 793 564 309 22 522 907 101 853 486 824 614 734 630 452 166 532 256 499 470 9 933 452 256 450 7 26 916 406 257 285 895 117 59 369 424 133 16 417 352 440 806 236 478 34 889 469 540 806 172 296 73 655 261 792 868 380 204 454 330 53 136 629 236 850 134 560 264 291", "99\n175 269 828 129 499 890 127 263 995 807 508 289 996 226 437 320 365 642 757 22 190 8 345 499 834 713 962 889 336 171 608 492 320 257 472 801 176 325 301 306 198 729 933 4 640 322 226 317 567 586 249 237 202 633 287 128 911 654 719 988 420 855 361 574 716 899 317 356 581 440 284 982 541 111 439 29 37 560 961 224 478 906 319 416 736 603 808 87 762 697 392 713 19 459 262 238 239 599 997", "98\n443 719 559 672 16 69 529 632 953 999 725 431 54 22 346 968 558 696 48 669 963 129 257 712 39 870 498 595 45 821 344 925 179 388 792 346 755 213 423 365 344 659 824 356 773 637 628 897 841 155 243 536 951 361 192 105 418 431 635 596 150 162 145 548 473 531 750 306 377 354 450 975 79 743 656 733 440 940 19 139 237 346 276 227 64 799 479 633 199 17 796 362 517 234 729 62 995 535", "97\n359 522 938 862 181 600 283 1000 910 191 590 220 761 818 903 264 751 751 987 316 737 898 168 925 244 674 34 950 754 472 81 6 37 520 112 891 981 454 897 424 489 238 363 709 906 951 677 828 114 373 589 835 52 89 97 435 277 560 551 204 879 469 928 523 231 163 183 609 821 915 615 969 616 23 874 437 844 321 78 53 643 786 585 38 744 347 150 179 988 985 200 11 15 9 547 886 752", "4\n303 872 764 401", "100\n328 397 235 453 188 254 879 225 423 36 384 296 486 592 231 849 856 255 213 898 234 800 701 529 951 693 507 326 15 905 618 348 967 927 28 979 752 850 343 35 84 302 36 390 482 826 249 918 91 289 973 457 557 348 365 239 709 565 320 560 153 130 647 708 483 469 788 473 322 844 830 562 611 961 397 673 69 960 74 703 369 968 382 451 328 160 211 230 566 208 7 545 293 73 806 375 157 410 303 58", "33\n52 145 137 734 180 847 178 286 716 134 181 630 358 764 593 762 785 28 1 468 189 540 764 485 165 656 114 58 628 108 605 584 257", "57\n75 291 309 68 444 654 985 158 514 204 116 918 374 806 176 31 49 455 269 66 722 713 164 818 317 295 546 564 134 641 28 13 987 478 146 219 213 940 289 173 157 666 168 391 392 71 870 477 446 988 414 568 964 684 409 671 454", "88\n327 644 942 738 84 118 981 686 530 404 137 197 434 16 693 183 423 325 410 345 941 329 7 106 79 867 584 358 533 675 192 718 641 329 900 768 404 301 101 538 954 590 401 954 447 14 559 337 756 586 934 367 538 928 945 936 770 641 488 579 206 869 902 139 216 446 723 150 829 205 373 578 357 368 960 40 121 206 503 385 521 161 501 694 138 370 709 308", "100\n804 510 266 304 788 625 862 888 408 82 414 470 777 991 729 229 933 406 601 1 596 720 608 706 432 361 527 548 59 548 474 515 4 991 263 568 681 24 117 563 576 587 281 643 904 521 891 106 842 884 943 54 605 815 504 757 311 374 335 192 447 652 633 410 455 402 382 150 432 836 413 819 669 875 638 925 217 805 632 520 605 266 728 795 162 222 603 159 284 790 914 443 775 97 789 606 859 13 851 47", "100\n449 649 615 713 64 385 927 466 138 126 143 886 80 199 208 43 196 694 92 89 264 180 617 970 191 196 910 150 275 89 693 190 191 99 542 342 45 592 114 56 451 170 64 589 176 102 308 92 402 153 414 675 352 157 69 150 91 288 163 121 816 184 20 234 836 12 593 150 793 439 540 93 99 663 186 125 349 247 476 106 77 523 215 7 363 278 441 745 337 25 148 384 15 915 108 211 240 58 23 408", "90\n881 436 52 308 97 261 153 931 670 538 702 156 114 445 154 685 452 76 966 790 93 42 547 65 736 364 136 489 719 322 239 628 696 735 55 703 622 375 100 188 804 341 546 474 484 446 729 290 974 301 602 225 996 244 488 983 882 460 962 754 395 617 61 640 534 292 158 375 632 902 420 979 379 38 100 67 963 928 190 456 545 571 45 716 153 68 844 2 102 116", "80\n313 674 262 240 697 146 391 221 793 504 896 818 92 899 86 370 341 339 306 887 937 570 830 683 729 519 240 833 656 847 427 958 435 704 853 230 758 347 660 575 843 293 649 396 437 787 654 599 35 103 779 783 447 379 444 585 902 713 791 150 851 228 306 721 996 471 617 403 102 168 197 741 877 481 968 545 331 715 236 654", "70\n745 264 471 171 946 32 277 511 269 469 89 831 69 2 369 407 583 602 646 633 429 747 113 302 722 321 344 824 241 372 263 287 822 24 652 758 246 967 219 313 882 597 752 965 389 775 227 556 95 904 308 340 899 514 400 187 275 318 621 546 659 488 199 154 811 1 725 79 925 82", "60\n176 502 680 102 546 917 516 801 392 435 635 492 398 456 653 444 472 513 634 378 273 276 44 920 68 124 800 167 825 250 452 264 561 344 98 933 381 939 426 51 568 548 206 887 342 763 151 514 156 354 486 546 998 649 356 438 295 570 450 589", "50\n608 92 889 33 146 803 402 91 868 400 828 505 375 558 584 129 361 776 974 123 765 804 326 186 61 927 904 511 762 775 640 593 300 664 897 461 869 911 986 789 607 500 309 457 294 104 724 471 216 155", "40\n40 330 98 612 747 336 640 381 991 366 22 167 352 12 868 166 603 40 313 869 609 981 609 804 54 729 8 854 347 300 828 922 39 633 695 988 4 530 545 176", "30\n471 920 308 544 347 222 878 671 467 332 215 180 681 114 151 203 492 951 653 614 453 510 540 422 399 532 113 198 932 825", "20\n551 158 517 475 595 108 764 961 590 297 761 841 659 568 82 888 733 214 993 359", "10\n983 748 726 406 196 993 2 251 66 263", "9\n933 266 457 863 768 257 594 136 145", "8\n537 198 48 771 944 868 700 163", "7\n140 779 639 679 768 479 158", "6\n744 359 230 586 944 442", "5\n700 939 173 494 120", "4\n303 872 764 401", "3\n907 452 355", "3\n963 630 333", "3\n2 2 4", "3\n2 4 100"], "outputs": ["3 2 1", "-1", "-1", "6 4 1", "5 2 1", "2 6 1", "1 38 25", "1 63 61", "1 98 69", "2 29 27", "1 44 30", "2 70 40", "1 23 10", "-1", "1 79 6", "8 30 7", "2 41 29", "1 77 61", "1 77 42", "1 6 5", "1 14 2", "1 13 8", "1 63 60", "2 26 20", "3 25 11", "5 10 8", "2 21 9", "3 20 2", "-1", "-1", "7 8 1", "2 3 1", "-1", "-1", "-1", "-1", "1 3 2", "3 2 1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	131	codeforces
f811d54f672bee985c0aacecb9dada21	Report	Each month Blake gets the report containing main economic indicators of the company "Blake Technologies". There are n commodities produced by the company. For each of them there is exactly one integer in the final report, that denotes corresponding revenue. Before the report gets to Blake, it passes through the hands of m managers. Each of them may reorder the elements in some order. Namely, the i-th manager either sorts first ri numbers in non-descending or non-ascending order and then passes the report to the manager i<=+<=1, or directly to Blake (if this manager has number i<==<=m). Employees of the "Blake Technologies" are preparing the report right now. You know the initial sequence ai of length n and the description of each manager, that is value ri and his favourite order. You are asked to speed up the process and determine how the final report will look like. The first line of the input contains two integers n and m (1<=≤<=n,<=m<=≤<=200<=000) — the number of commodities in the report and the number of managers, respectively. The second line contains n integers ai (\|ai\|<=≤<=109) — the initial report before it gets to the first manager. Then follow m lines with the descriptions of the operations managers are going to perform. The i-th of these lines contains two integers ti and ri (, 1<=≤<=ri<=≤<=n), meaning that the i-th manager sorts the first ri numbers either in the non-descending (if ti<==<=1) or non-ascending (if ti<==<=2) order. Print n integers — the final report, which will be passed to Blake by manager number m. Sample Input 3 1 1 2 3 2 2 4 2 1 2 4 3 2 3 1 2 Sample Output 2 1 3 2 4 1 3	{"inputs": ["3 1\n1 2 3\n2 2", "4 2\n1 2 4 3\n2 3\n1 2", "4 1\n4 3 2 1\n1 4", "5 1\n1 2 3 4 5\n2 5", "6 2\n3 1 2 6 4 5\n1 6\n2 3", "10 3\n6 4 0 2 -3 7 8 -9 1 5\n1 8\n1 4\n2 2", "100 30\n65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 74 57 115 16 55 88 79 97 21 80 41 56 49 103 61 66 1 36 44 43 82 37 38 106 27 114 51 112 55 87 41 69 31 86 58 27 46 99 18 105 91 38 5 9 2 109 39 2 27 47\n2 38\n2 32\n1 46\n1 37\n1 20\n1 5\n2 42\n2 18\n1 35\n1 36\n2 44\n1 36\n1 20\n2 21\n2 14\n1 13\n2 2\n1 15\n2 50\n2 35\n1 42\n1 21\n1 50\n2 50\n1 1\n2 48\n2 24\n1 34\n1 23\n2 9", "1 1\n1234\n1 1", "1 1\n1000000000\n2 1", "1 2\n-1000000000\n1 1\n2 1", "30 13\n15 44 5 56 84 15 24 72 97 3 61 97 36 33 98 49 1 40 76 94 7 46 85 53 79 68 78 54 80 33\n2 18\n1 9\n1 6\n2 30\n2 15\n2 4\n2 17\n2 16\n2 20\n2 16\n2 7\n2 12\n1 20"], "outputs": ["2 1 3 ", "2 4 1 3 ", "1 2 3 4 ", "5 4 3 2 1 ", "3 2 1 4 5 6 ", "-3 -9 0 2 4 6 7 8 1 5 ", "65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 65 74 57 115 16 55 88 79 97 21 80 41 56 49 103 61 66 1 36 44 43 82 37 38 106 27 114 51 112 55 87 41 69 31 86 58 27 46 99 18 105 91 38 5 9 2 109 39 2 27 47 ", "1234 ", "1000000000 ", "-1000000000 ", "40 44 46 49 53 54 56 61 68 72 76 78 79 80 84 85 94 97 97 98 36 33 33 24 15 15 7 5 3 1 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	29	codeforces
f853095fb8e1806dff3305c2c7f1356a	Two Heaps	Valera has 2·n cubes, each cube contains an integer from 10 to 99. He arbitrarily chooses n cubes and puts them in the first heap. The remaining cubes form the second heap. Valera decided to play with cubes. During the game he takes a cube from the first heap and writes down the number it has. Then he takes a cube from the second heap and write out its two digits near two digits he had written (to the right of them). In the end he obtained a single fourdigit integer — the first two digits of it is written on the cube from the first heap, and the second two digits of it is written on the second cube from the second heap. Valera knows arithmetic very well. So, he can easily count the number of distinct fourdigit numbers he can get in the game. The other question is: how to split cubes into two heaps so that this number (the number of distinct fourdigit integers Valera can get) will be as large as possible? The first line contains integer n (1<=≤<=n<=≤<=100). The second line contains 2·n space-separated integers ai (10<=≤<=ai<=≤<=99), denoting the numbers on the cubes. In the first line print a single number — the maximum possible number of distinct four-digit numbers Valera can obtain. In the second line print 2·n numbers bi (1<=≤<=bi<=≤<=2). The numbers mean: the i-th cube belongs to the bi-th heap in your division. If there are multiple optimal ways to split the cubes into the heaps, print any of them. Sample Input 1 10 99 2 13 24 13 45 Sample Output 1 2 1 4 1 2 2 1	{"inputs": ["1\n10 99", "2\n13 24 13 45", "5\n21 60 18 21 17 39 58 74 62 34", "10\n26 43 29 92 22 27 95 56 72 55 93 51 91 30 70 77 32 69 87 98", "20\n80 56 58 61 75 60 25 49 59 15 43 39 21 73 67 13 75 31 18 87 32 44 53 15 53 76 79 94 85 80 27 25 48 78 32 18 20 78 46 37", "50\n49 13 81 20 73 62 19 49 65 95 32 84 24 96 51 57 53 83 40 44 26 65 78 80 92 87 87 95 56 46 22 44 69 80 41 61 97 92 58 53 42 78 53 19 47 36 25 77 65 81 14 61 38 99 27 58 67 37 67 80 77 51 32 43 31 48 19 79 31 91 46 97 91 71 27 63 22 84 73 73 89 44 34 84 70 23 45 31 56 73 83 38 68 45 99 33 83 86 87 80", "2\n10 10 10 11"], "outputs": ["1\n2 1 ", "4\n1 2 2 1 ", "25\n1 1 1 2 2 1 2 1 2 2 ", "100\n1 2 1 2 2 2 2 1 2 2 1 1 1 2 1 1 1 2 2 1 ", "400\n1 2 1 2 1 1 1 1 2 1 1 2 2 2 1 2 2 2 1 2 1 2 1 2 2 1 2 1 1 2 1 2 2 1 2 2 1 2 1 1 ", "1936\n1 2 1 2 1 2 1 2 1 1 1 1 2 1 1 1 1 1 1 1 2 2 1 1 1 1 2 2 1 1 1 2 1 2 2 1 1 2 1 2 1 2 1 2 1 1 1 1 1 2 1 2 1 1 1 2 1 2 2 1 2 2 2 2 1 2 1 2 2 1 2 2 2 1 2 1 2 2 2 1 2 1 2 2 2 1 1 2 2 2 2 2 2 2 2 1 2 1 2 2 ", "2\n1 2 1 2 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
f862e4461b9c0bb971a8c79bb1c73e64	Not Wool Sequences	A sequence of non-negative integers a1,<=a2,<=...,<=an of length n is called a wool sequence if and only if there exists two integers l and r (1<=≤<=l<=≤<=r<=≤<=n) such that . In other words each wool sequence contains a subsequence of consecutive elements with xor equal to 0. The expression means applying the operation of a bitwise xor to numbers x and y. The given operation exists in all modern programming languages, for example, in languages C++ and Java it is marked as "^", in Pascal — as "xor". In this problem you are asked to compute the number of sequences made of n integers from 0 to 2m<=-<=1 that are not a wool sequence. You should print this number modulo 1000000009 (109<=+<=9). The only line of input contains two space-separated integers n and m (1<=≤<=n,<=m<=≤<=105). Print the required number of sequences modulo 1000000009 (109<=+<=9) on the only line of output. Sample Input 3 2 Sample Output 6	{"inputs": ["3 2", "4 2", "1 2", "4 11", "5 100", "5444 31525", "60282 92611", "62600 39199", "14095 86011", "78606 36436", "25063 54317", "86232 41348", "94882 95834", "83781 52238", "21857 94145", "7413 87155", "7683 65667", "88201 96978", "50664 46559", "60607 63595", "85264 15318", "100000 100000", "100000 16", "100000 17", "127 7", "128 8", "65535 16", "99999 1", "1 99999", "1 29", "2 15", "1 1", "2 1", "2 2", "3 1", "3 2", "3 3", "4 1", "4 2", "4 3", "4 4", "12345 31", "50000 100000"], "outputs": ["6", "0", "3", "433239206", "345449482", "637906839", "814908070", "366778414", "656508583", "657976765", "735545216", "77566161", "360122315", "188770162", "689996210", "340839315", "298588855", "508134449", "425318276", "396334239", "635855261", "738698541", "0", "614965071", "399589559", "987517349", "558444716", "0", "833014736", "536870911", "73643513", "1", "0", "6", "0", "6", "210", "0", "0", "840", "32760", "378093434", "821709120"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	8	codeforces
f871e22e89df88a072982b9d30fa1a08	Petya and Post	Little Vasya's uncle is a postman. The post offices are located on one circular road. Besides, each post office has its own gas station located next to it. Petya's uncle works as follows: in the morning he should leave the house and go to some post office. In the office he receives a portion of letters and a car. Then he must drive in the given car exactly one round along the circular road and return to the starting post office (the uncle can drive along the circle in any direction, counterclockwise or clockwise). Besides, since the car belongs to the city post, it should also be fuelled with gasoline only at the Post Office stations. The total number of stations equals to n. One can fuel the car at the i-th station with no more than ai liters of gasoline. Besides, one can fuel the car no more than once at each station. Also, the distance between the 1-st and the 2-nd station is b1 kilometers, the distance between the 2-nd and the 3-rd one is b2 kilometers, ..., between the (n<=-<=1)-th and the n-th ones the distance is bn<=-<=1 kilometers and between the n-th and the 1-st one the distance is bn kilometers. Petya's uncle's high-tech car uses only one liter of gasoline per kilometer. It is known that the stations are located so that the sum of all ai is equal to the sum of all bi. The i-th gas station and i-th post office are very close, so the distance between them is 0 kilometers. Thus, it becomes clear that if we start from some post offices, then it is not always possible to drive one round along a circular road. The uncle faces the following problem: to what stations can he go in the morning to be able to ride exactly one circle along the circular road and visit all the post offices that are on it? Petya, who used to attend programming classes, has volunteered to help his uncle, but his knowledge turned out to be not enough, so he asks you to help him write the program that will solve the posed problem. The first line contains integer n (1<=≤<=n<=≤<=105). The second line contains n integers ai — amount of gasoline on the i-th station. The third line contains n integers b1,<=b2,<=...,<=bn. They are the distances between the 1-st and the 2-nd gas stations, between the 2-nd and the 3-rd ones, ..., between the n-th and the 1-st ones, respectively. The sum of all bi equals to the sum of all ai and is no more than 109. Each of the numbers ai, bi is no less than 1 and no more than 109. Print on the first line the number k — the number of possible post offices, from which the car can drive one circle along a circular road. Print on the second line k numbers in the ascending order — the numbers of offices, from which the car can start. Sample Input 4 1 7 2 3 8 1 1 3 8 1 2 1 2 1 2 1 2 2 1 2 1 2 1 2 1 Sample Output 2 2 4 8 1 2 3 4 5 6 7 8	{"inputs": ["4\n1 7 2 3\n8 1 1 3", "8\n1 2 1 2 1 2 1 2\n2 1 2 1 2 1 2 1", "20\n31 16 20 30 19 35 8 11 20 45 10 26 21 39 29 52 8 10 37 49\n16 33 41 32 43 24 35 48 19 37 28 26 7 10 23 48 18 2 1 25", "20\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10\n10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10", "1\n1\n1", "1\n1000000000\n1000000000", "3\n3 3 3\n3 2 4", "10\n1 5 4 3 2 1 5 8 2 3\n1 1 1 1 5 5 5 5 5 5", "10\n44 22 14 9 93 81 52 64 3 99\n43 23 13 10 92 82 51 65 2 100"], "outputs": ["2\n2 4", "8\n1 2 3 4 5 6 7 8", "4\n1 2 12 13", "20\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20", "1\n1", "1\n1", "3\n1 2 3", "3\n1 2 5", "6\n1 3 5 7 9 10"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
f87bced97729877cde26614688d8cc40	Online Meeting	Nearly each project of the F company has a whole team of developers working on it. They often are in different rooms of the office in different cities and even countries. To keep in touch and track the results of the project, the F company conducts shared online meetings in a Spyke chat. One day the director of the F company got hold of the records of a part of an online meeting of one successful team. The director watched the record and wanted to talk to the team leader. But how can he tell who the leader is? The director logically supposed that the leader is the person who is present at any conversation during a chat meeting. In other words, if at some moment of time at least one person is present on the meeting, then the leader is present on the meeting. You are the assistant director. Given the 'user logged on'/'user logged off' messages of the meeting in the chronological order, help the director determine who can be the leader. Note that the director has the record of only a continuous part of the meeting (probably, it's not the whole meeting). The first line contains integers n and m (1<=≤<=n,<=m<=≤<=105) — the number of team participants and the number of messages. Each of the next m lines contains a message in the format: - '+ id': the record means that the person with number id (1<=≤<=id<=≤<=n) has logged on to the meeting. - '- id': the record means that the person with number id (1<=≤<=id<=≤<=n) has logged off from the meeting. Assume that all the people of the team are numbered from 1 to n and the messages are given in the chronological order. It is guaranteed that the given sequence is the correct record of a continuous part of the meeting. It is guaranteed that no two log on/log off events occurred simultaneously. In the first line print integer k (0<=≤<=k<=≤<=n) — how many people can be leaders. In the next line, print k integers in the increasing order — the numbers of the people who can be leaders. If the data is such that no member of the team can be a leader, print a single number 0. Sample Input 5 4 + 1 + 2 - 2 - 1 3 2 + 1 - 2 2 4 + 1 - 1 + 2 - 2 5 6 + 1 - 1 - 3 + 3 + 4 - 4 2 4 + 1 - 2 + 2 - 1 Sample Output 4 1 3 4 5 1 3 0 3 2 3 5 0	{"inputs": ["5 4\n+ 1\n+ 2\n- 2\n- 1", "3 2\n+ 1\n- 2", "2 4\n+ 1\n- 1\n+ 2\n- 2", "5 6\n+ 1\n- 1\n- 3\n+ 3\n+ 4\n- 4", "2 4\n+ 1\n- 2\n+ 2\n- 1", "1 1\n+ 1", "2 1\n- 2", "3 5\n- 1\n+ 1\n+ 2\n- 2\n+ 3", "10 8\n+ 1\n- 1\n- 2\n- 3\n+ 3\n+ 7\n- 7\n+ 9", "5 5\n+ 5\n+ 2\n+ 3\n+ 4\n+ 1", "5 4\n+ 1\n- 1\n+ 1\n+ 2", "10 3\n+ 1\n+ 2\n- 7", "1 20\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", "20 1\n- 16", "50 20\n- 6\n+ 40\n- 3\n- 23\n+ 31\n- 27\n- 40\n+ 25\n+ 29\n- 41\n- 16\n+ 23\n+ 20\n+ 13\n- 45\n+ 40\n+ 24\n+ 22\n- 23\n+ 17", "20 50\n+ 5\n+ 11\n- 5\n+ 6\n- 16\n- 13\n+ 5\n+ 7\n- 8\n- 7\n- 10\n+ 10\n- 20\n- 19\n+ 17\n- 2\n+ 2\n+ 19\n+ 18\n- 2\n- 6\n- 5\n+ 6\n+ 4\n- 14\n+ 14\n- 9\n+ 15\n- 17\n- 15\n+ 2\n+ 5\n- 2\n+ 9\n- 11\n+ 2\n- 19\n+ 7\n+ 12\n+ 16\n+ 19\n- 18\n- 2\n+ 18\n- 9\n- 10\n+ 9\n+ 13\n- 14\n- 16", "100 5\n- 60\n- 58\n+ 25\n- 32\n+ 86", "4 4\n+ 2\n- 1\n- 3\n- 2", "3 3\n- 2\n+ 1\n+ 2", "5 4\n- 1\n- 2\n+ 3\n+ 4", "6 6\n- 5\n- 6\n- 3\n- 1\n- 2\n- 4", "10 7\n- 8\n+ 1\n+ 2\n+ 3\n- 2\n- 3\n- 1", "10 7\n- 8\n+ 1\n+ 2\n+ 3\n- 2\n- 3\n- 1", "4 10\n+ 2\n- 1\n- 2\n- 3\n+ 3\n+ 2\n+ 4\n- 2\n+ 2\n+ 1", "4 9\n+ 2\n- 1\n- 2\n- 3\n+ 3\n+ 2\n+ 4\n- 2\n+ 2", "10 8\n+ 1\n- 1\n- 4\n+ 4\n+ 3\n+ 7\n- 7\n+ 9", "10 6\n+ 2\n- 2\n+ 2\n- 2\n+ 2\n- 3", "10 5\n+ 2\n- 2\n+ 2\n- 2\n- 3", "10 11\n+ 1\n- 1\n- 2\n+ 3\n- 3\n- 4\n+ 5\n- 5\n- 6\n+ 6\n+ 7", "10 10\n+ 1\n- 1\n- 2\n+ 3\n- 3\n- 4\n+ 5\n- 5\n- 6\n+ 6", "10 9\n+ 1\n- 1\n- 2\n+ 3\n- 3\n- 4\n+ 5\n- 5\n- 6", "10 12\n+ 1\n- 1\n- 2\n+ 3\n- 3\n- 4\n+ 5\n- 5\n- 6\n+ 6\n+ 7\n- 7", "2 2\n- 1\n+ 1", "7 4\n- 2\n- 3\n+ 3\n- 6", "2 3\n+ 1\n+ 2\n- 1", "5 5\n- 2\n+ 1\n+ 2\n- 2\n+ 4", "5 3\n+ 1\n- 1\n+ 2", "4 4\n- 1\n+ 1\n- 1\n+ 2"], "outputs": ["4\n1 3 4 5 ", "1\n3 ", "0", "3\n2 3 5 ", "0", "1\n1 ", "2\n1 2 ", "1\n1 ", "6\n3 4 5 6 8 10 ", "1\n5 ", "4\n1 3 4 5 ", "7\n3 4 5 6 8 9 10 ", "1\n1 ", "20\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 ", "34\n1 2 4 5 7 8 9 10 11 12 14 15 18 19 21 26 28 30 32 33 34 35 36 37 38 39 42 43 44 46 47 48 49 50 ", "2\n1 3 ", "95\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 26 27 28 29 30 31 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 59 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 87 88 89 90 91 92 93 94 95 96 97 98 99 100 ", "1\n4 ", "1\n3 ", "1\n5 ", "1\n4 ", "6\n4 5 6 7 9 10 ", "6\n4 5 6 7 9 10 ", "1\n3 ", "1\n3 ", "6\n2 4 5 6 8 10 ", "8\n1 4 5 6 7 8 9 10 ", "9\n1 3 4 5 6 7 8 9 10 ", "4\n6 8 9 10 ", "5\n6 7 8 9 10 ", "5\n6 7 8 9 10 ", "4\n6 8 9 10 ", "2\n1 2 ", "4\n1 4 5 7 ", "0", "2\n3 5 ", "3\n3 4 5 ", "2\n3 4 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
f88938594102e07665a6daf0fe883b8d	Make Palindrome	A string is called palindrome if it reads the same from left to right and from right to left. For example "kazak", "oo", "r" and "mikhailrubinchikkihcniburliahkim" are palindroms, but strings "abb" and "ij" are not. You are given string s consisting of lowercase Latin letters. At once you can choose any position in the string and change letter in that position to any other lowercase letter. So after each changing the length of the string doesn't change. At first you can change some letters in s. Then you can permute the order of letters as you want. Permutation doesn't count as changes. You should obtain palindrome with the minimal number of changes. If there are several ways to do that you should get the lexicographically (alphabetically) smallest palindrome. So firstly you should minimize the number of changes and then minimize the palindrome lexicographically. The only line contains string s (1<=≤<=\|s\|<=≤<=2·105) consisting of only lowercase Latin letters. Print the lexicographically smallest palindrome that can be obtained with the minimal number of changes. Sample Input aabc aabcd Sample Output abba abcba	{"inputs": ["aabc", "aabcd", "u", "ttttt", "xxxvvvxxvv", "wrwrwfrrfrffrrwwwffffwrfrrwfrrfrwwfwfrwfwfwffwrrwfrrrwwwfrrrwfrrfwrwwrwrrrffffwrrrwrwfffwrffrwwwrwww", "aabbcccdd", "baaab", "aaabbbhhlhlugkjgckj", "aabcc", "bbbcccddd", "zzzozzozozozoza", "aaabb", "zza", "azzzbbb", "bbaaccddc", "aaabbbccc", "aaaaabbccdd", "aaabbbcccdd", "aaaabbcccccdd", "aaacccb", "abcd", "abb", "abababccc", "aaadd", "qqqqaaaccdd", "affawwzzw", "hack", "bbaaa", "ababa", "aaazzzz", "aabbbcc", "successfullhack", "aaabbccdd", "zaz", "aaabbbcccdddeee", "zaaz", "acc", "abbbzzz", "zzzzazazazazazznnznznnznnznznzaajzjajjjjanaznnzanzppnzpaznnpanz", "aaaaabbbcccdddd", "aaaaabbccdddd", "abababa", "azz", "abbbccc", "aaacccddd", "asbbsha", "bababab", "aaabbccddbbccddaaaaaaaaaaaaaaaa", "aaabbccddbbccddaaaaaaaaaaaaaa", "aaabbccddbbccddaaaaaaaaaaaa", "ooooo", "aaabbccddbbccddaaaaaaaaaa", "aaabbccddbbccddaaaaaaaa", "aaabbccddbbccddaa"], "outputs": ["abba", "abcba", "u", "ttttt", "vvvxxxxvvv", "fffffffffffffffrrrrrrrrrrrrrrrrrrwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwrrrrrrrrrrrrrrrrrrfffffffffffffff", "abcdcdcba", "ababa", "aabbghjklclkjhgbbaa", "acbca", "bbcdcdcbb", "aoozzzzozzzzooa", "ababa", "zaz", "abzbzba", "abcdcdcba", "aabcbcbaa", "aabcdadcbaa", "aabcdbdcbaa", "aabccdcdccbaa", "aacbcaa", "abba", "bab", "aabcbcbaa", "adada", "acdqqaqqdca", "afwzwzwfa", "acca", "ababa", "ababa", "azzazza", "abcbcba", "accelsufuslecca", "abcdadcba", "zaz", "aabbcdecedcbbaa", "azza", "cac", "abzbzba", "aaaaaaajjjnnnnnnnnppzzzzzzzzzzznzzzzzzzzzzzppnnnnnnnnjjjaaaaaaa", "aaabcddbddcbaaa", "aabcddaddcbaa", "aabbbaa", "zaz", "abcbcba", "aacdcdcaa", "abshsba", "abbabba", "aaaaaaaaabbccddaddccbbaaaaaaaaa", "aaaaaaaabbccddaddccbbaaaaaaaa", "aaaaaaabbccddaddccbbaaaaaaa", "ooooo", "aaaaaabbccddaddccbbaaaaaa", "aaaaabbccddaddccbbaaaaa", "aabbccddaddccbbaa"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	32	codeforces
f8a456e2fbac83b186fed6c3beb0157b	School Marks	Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't want to stand out from the crowd too much. If the sum of his marks for all tests exceeds value x, then his classmates notice how smart he is and start distracting him asking to let them copy his homework. And if the median of his marks will be lower than y points (the definition of a median is given in the notes), then his mom will decide that he gets too many bad marks and forbid him to play computer games. Vova has already wrote k tests and got marks a1,<=...,<=ak. He doesn't want to get into the first or the second situation described above and now he needs to determine which marks he needs to get for the remaining tests. Help him do that. The first line contains 5 space-separated integers: n, k, p, x and y (1<=≤<=n<=≤<=999, n is odd, 0<=≤<=k<=<<=n, 1<=≤<=p<=≤<=1000, n<=≤<=x<=≤<=n·p, 1<=≤<=y<=≤<=p). Here n is the number of tests that Vova is planned to write, k is the number of tests he has already written, p is the maximum possible mark for a test, x is the maximum total number of points so that the classmates don't yet disturb Vova, y is the minimum median point so that mom still lets him play computer games. The second line contains k space-separated integers: a1,<=...,<=ak (1<=≤<=ai<=≤<=p) — the marks that Vova got for the tests he has already written. If Vova cannot achieve the desired result, print "-1". Otherwise, print n<=-<=k space-separated integers — the marks that Vova should get for the remaining tests. If there are multiple possible solutions, print any of them. Sample Input 5 3 5 18 4 3 5 4 5 3 5 16 4 5 5 5 Sample Output 4 1 -1	{"inputs": ["5 3 5 18 4\n3 5 4", "5 3 5 16 4\n5 5 5", "5 3 5 17 4\n5 5 5", "5 3 5 12 1\n5 5 1", "5 3 5 13 1\n5 5 1", "7 4 5 26 5\n5 2 4 5", "7 4 5 27 5\n5 2 4 5", "1 0 1000 999 1000", "1 0 1000 1000 1000", "1 0 1000 1000 999", "995 1 1000 1772 2\n1", "993 0 1000 63930 1", "5 3 5 25 4\n3 3 3", "7 4 5 25 5\n5 5 4 5", "7 4 5 26 5\n5 5 4 5", "7 4 5 26 5\n5 5 4 5", "5 3 5 17 4\n3 3 4", "5 3 5 18 4\n3 3 4", "5 3 5 5 1\n1 1 2", "5 3 5 6 1\n1 1 2", "3 0 2 3 1", "3 0 2 4 2", "3 0 2 5 2", "9 7 3 16 2\n1 3 1 3 1 3 1", "9 7 3 17 2\n1 3 1 3 1 3 1", "9 7 3 18 2\n1 3 1 3 1 3 1", "9 7 3 18 3\n1 3 1 3 1 3 1", "9 7 3 19 3\n1 3 1 3 1 3 1", "9 7 3 20 3\n1 3 1 3 1 3 1", "9 6 3 27 2\n1 1 1 2 1 1", "9 6 3 13 2\n1 1 1 2 1 2", "9 6 3 14 2\n1 1 1 2 1 2", "5 0 5 13 4", "5 0 5 14 4", "5 0 5 5 1", "5 0 5 7 2", "5 0 5 8 2", "9 7 2 18 2\n1 1 1 2 2 1 1", "9 7 2 13 1\n2 2 2 1 1 2 2", "9 7 2 14 1\n2 2 2 1 1 2 2", "993 0 3 993 2", "995 1 3 2877 3\n3", "997 100 3 1102 2\n1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 2 1 1 1 1 1 1 3", "993 0 42 12022 1", "995 1 42 28887 42\n13", "997 100 42 3151 1\n27 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 25 1 1 1 1 1 1 1 1 24 1 1 1 1 1 1 1 1 1 1 22 1 1 1 32 1 1 1 1 1 1 1 16 42 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 38 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 40 38 1 1 1", "11 8 10 110 5\n9 9 9 9 9 9 9 9", "9 8 10 90 2\n1 1 1 1 1 1 1 1", "3 2 10 30 2\n1 1", "3 2 10 30 1\n1 1", "5 4 100 14 4\n4 4 4 4", "5 4 2 8 2\n2 2 2 2", "5 4 2 7 2\n1 1 1 2", "11 10 1000 101 5\n10 10 10 10 10 10 10 10 10 10", "7 5 100 100 5\n7 1 1 1 1", "5 4 5 25 2\n1 1 1 1", "9 8 10 89 5\n8 8 8 8 8 8 8 8", "5 3 5 18 4\n1 1 1", "11 10 1000 100 5\n10 10 10 10 10 10 10 10 10 10", "9 7 10 30 2\n3 3 3 3 3 3 3", "5 4 2 10 2\n2 2 2 2", "7 6 1000 31 5\n5 5 5 5 5 5", "9 8 100 100 2\n1 1 1 1 1 1 1 1"], "outputs": ["4 1", "-1", "1 1", "-1", "1 1", "-1", "5 5 1", "-1", "1000", "999", "2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "-1", "-1", "5 1 1", "5 1 1", "-1", "4 4", "-1", "1 1", "1 1 1", "-1", "2 2 1", "-1", "2 2", "2 2", "-1", "3 3", "3 3", "-1", "-1", "2 2 2", "-1", "4 4 4 1 1", "1 1 1 1 1", "-1", "2 2 2 1 1", "-1", "-1", "1 1", "-1", "3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3...", "-1", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 42 4...", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...", "1 1 1", "-1", "-1", "1", "-1", "-1", "-1", "1", "-1", "-1", "1", "-1", "-1", "1 1", "1", "1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	7	codeforces
f8b348afc539834c64b2f852cbcc0b6e	Increasing Sequence	A sequence a0,<=a1,<=...,<=at<=-<=1 is called increasing if ai<=-<=1<=<<=ai for each i:<=0<=<<=i<=<<=t. You are given a sequence b0,<=b1,<=...,<=bn<=-<=1 and a positive integer d. In each move you may choose one element of the given sequence and add d to it. What is the least number of moves required to make the given sequence increasing? The first line of the input contains two integer numbers n and d (2<=≤<=n<=≤<=2000,<=1<=≤<=d<=≤<=106). The second line contains space separated sequence b0,<=b1,<=...,<=bn<=-<=1 (1<=≤<=bi<=≤<=106). Output the minimal number of moves needed to make the sequence increasing. Sample Input 4 2 1 3 3 2 Sample Output 3	{"inputs": ["4 2\n1 3 3 2", "2 1\n1 1", "2 1\n2 5", "2 1\n1 2", "2 1\n1 1", "2 7\n10 20", "2 7\n1 1", "3 3\n18 1 9", "3 3\n15 17 9", "3 3\n10 9 12", "10 3\n2 1 17 10 5 16 8 4 15 17", "10 3\n6 11 4 12 22 15 23 26 24 26", "10 3\n10 24 13 15 18 14 15 26 33 35", "100 3\n529 178 280 403 326 531 671 427 188 866 669 646 421 804 494 609 53 1012 211 243 887 833 900 543 226 42 859 718 454 372 971 692 846 770 511 395 499 479 641 756 115 269 206 45 1039 727 400 779 859 614 146 214 196 919 702 959 380 830 535 878 859 784 316 305 782 924 536 243 236 978 564 150 291 877 808 983 537 839 490 120 168 838 267 650 900 170 211 504 326 771 895 984 994 483 776 100 471 1078 317 580", "100 3\n329 226 331 909 962 112 837 1005 194 818 506 416 125 648 367 459 400 582 989 547 329 438 234 121 272 226 821 376 834 427 718 164 834 113 654 177 737 212 169 696 744 180 89 944 233 147 667 990 809 1072 1085 1093 814 265 1067 312 833 572 303 901 1032 504 185 817 389 158 613 723 239 269 911 352 769 404 225 822 897 606 947 323 913 804 923 1084 552 901 486 249 209 898 847 610 728 1122 986 669 1116 1076 367 327"], "outputs": ["3", "1", "0", "0", "1", "0", "1", "10", "3", "2", "31", "13", "29", "15717", "16133"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	229	codeforces
f8e254217a50cd8cfe9726c4fd64f082	Game of Credit Cards	After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions in peaceful game of Credit Cards. Rules of this game are simple: each player bring his favourite n-digit credit card. Then both players name the digits written on their cards one by one. If two digits are not equal, then the player, whose digit is smaller gets a flick (knock in the forehead usually made with a forefinger) from the other player. For example, if n<==<=3, Sherlock's card is 123 and Moriarty's card has number 321, first Sherlock names 1 and Moriarty names 3 so Sherlock gets a flick. Then they both digit 2 so no one gets a flick. Finally, Sherlock names 3, while Moriarty names 1 and gets a flick. Of course, Sherlock will play honestly naming digits one by one in the order they are given, while Moriary, as a true villain, plans to cheat. He is going to name his digits in some other order (however, he is not going to change the overall number of occurences of each digit). For example, in case above Moriarty could name 1, 2, 3 and get no flicks at all, or he can name 2, 3 and 1 to give Sherlock two flicks. Your goal is to find out the minimum possible number of flicks Moriarty will get (no one likes flicks) and the maximum possible number of flicks Sherlock can get from Moriarty. Note, that these two goals are different and the optimal result may be obtained by using different strategies. The first line of the input contains a single integer n (1<=≤<=n<=≤<=1000) — the number of digits in the cards Sherlock and Moriarty are going to use. The second line contains n digits — Sherlock's credit card number. The third line contains n digits — Moriarty's credit card number. First print the minimum possible number of flicks Moriarty will get. Then print the maximum possible number of flicks that Sherlock can get from Moriarty. Sample Input 3 123 321 2 88 00 Sample Output 0 2 2 0	{"inputs": ["3\n123\n321", "2\n88\n00", "1\n4\n5", "1\n8\n7", "2\n55\n55", "3\n534\n432", "3\n486\n024", "5\n22222\n22222", "5\n72471\n05604", "5\n72471\n72471", "5\n72471\n41772", "8\n99999999\n99999999", "8\n01234567\n01234567", "8\n07070707\n76543210", "8\n88888888\n98769876", "8\n23456789\n01234567", "5\n11222\n22111", "9\n777777777\n777777777", "9\n353589343\n280419388", "10\n8104381743\n8104381743", "10\n8104381743\n8418134730", "10\n1111122222\n2222211111", "100\n6317494220822818719411404030346382869796138932712461187067886456209071515048745855973784223939110171\n6017563370120161528504797580620647099370814387367549926215651181421345104088127581963662589996747937", "200\n89017372169770060638462517044634884577600285180365791227828841983192945639410766634962149214165390392679430585962408483864914959904870801002680423351144765728677610509881245693518626747873607530273392\n34804385048475325130258121398275821439066233953856051421626677848150660724595847484466293487857039579239864150199164135152374201294909986469345076423004279983866383035554588630496127880705497919788390", "3\n112\n111", "5\n66666\n11119", "3\n232\n123"], "outputs": ["0\n2", "2\n0", "0\n1", "1\n0", "0\n0", "1\n1", "2\n0", "0\n0", "2\n3", "0\n3", "0\n3", "0\n0", "0\n7", "3\n4", "4\n2", "2\n5", "1\n2", "0\n0", "3\n5", "0\n8", "0\n8", "0\n5", "2\n86", "6\n175", "1\n0", "4\n1", "1\n1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	174	codeforces
f915e41a0bd233ff98b58882ba47ed03	Problems for Round	There are n problems prepared for the next Codeforces round. They are arranged in ascending order by their difficulty, and no two problems have the same difficulty. Moreover, there are m pairs of similar problems. Authors want to split problems between two division according to the following rules: - Problemset of each division should be non-empty. - Each problem should be used in exactly one division (yes, it is unusual requirement). - Each problem used in division 1 should be harder than any problem used in division 2. - If two problems are similar, they should be used in different divisions. Your goal is count the number of ways to split problem between two divisions and satisfy all the rules. Two ways to split problems are considered to be different if there is at least one problem that belongs to division 1 in one of them and to division 2 in the other. Note, that the relation of similarity is not transitive. That is, if problem i is similar to problem j and problem j is similar to problem k, it doesn't follow that i is similar to k. The first line of the input contains two integers n and m (2<=≤<=n<=≤<=100<=000, 0<=≤<=m<=≤<=100<=000) — the number of problems prepared for the round and the number of pairs of similar problems, respectively. Each of the following m lines contains a pair of similar problems ui and vi (1<=≤<=ui,<=vi<=≤<=n,<=ui<=≠<=vi). It's guaranteed, that no pair of problems meets twice in the input. Print one integer — the number of ways to split problems in two divisions. Sample Input 5 2 1 4 5 2 3 3 1 2 2 3 1 3 3 2 3 1 3 2 Sample Output 2 0 1	{"inputs": ["5 2\n1 4\n5 2", "3 3\n1 2\n2 3\n1 3", "3 2\n3 1\n3 2", "2 0", "2 1\n1 2", "3 0", "3 1\n1 2", "3 1\n1 3", "100000 0", "4 2\n1 2\n3 4", "3 1\n2 3", "3 2\n1 2\n1 3", "3 2\n1 2\n2 3", "4 0", "100000 1\n100000 1", "100000 1\n26711 97965", "100000 10\n99562 479\n643 99684\n593 99867\n99529 175\n99738 616\n99523 766\n99503 121\n99784 158\n199 99199\n15 99849", "10 10\n8 3\n2 8\n3 7\n3 9\n9 4\n7 2\n1 8\n1 9\n10 2\n10 1", "55 1\n55 1", "4 2\n1 4\n3 2", "5 1\n1 5", "7 1\n3 5", "7 2\n1 6\n2 7", "5 1\n2 3", "5 2\n3 5\n1 2", "4 2\n3 4\n1 2", "7 2\n1 5\n5 2", "7 2\n1 3\n3 6", "10 11\n1 10\n1 9\n1 8\n1 7\n2 10\n2 9\n2 8\n2 7\n3 10\n3 9\n3 8", "4 2\n1 2\n1 3"], "outputs": ["2", "0", "1", "1", "1", "2", "1", "2", "99999", "0", "1", "1", "0", "3", "99999", "71254", "98433", "3", "54", "1", "4", "2", "4", "1", "0", "0", "3", "0", "4", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	34	codeforces
f92c029ea391d554908f59e9e6fabd23	Circle Line	The circle line of the Berland subway has n stations. We know the distances between all pairs of neighboring stations: - d1 is the distance between the 1-st and the 2-nd station;- d2 is the distance between the 2-nd and the 3-rd station;...- dn<=-<=1 is the distance between the n<=-<=1-th and the n-th station;- dn is the distance between the n-th and the 1-st station. The trains go along the circle line in both directions. Find the shortest distance between stations with numbers s and t. The first line contains integer n (3<=≤<=n<=≤<=100) — the number of stations on the circle line. The second line contains n integers d1,<=d2,<=...,<=dn (1<=≤<=di<=≤<=100) — the distances between pairs of neighboring stations. The third line contains two integers s and t (1<=≤<=s,<=t<=≤<=n) — the numbers of stations, between which you need to find the shortest distance. These numbers can be the same. The numbers in the lines are separated by single spaces. Print a single number — the length of the shortest path between stations number s and t. Sample Input 4 2 3 4 9 1 3 4 5 8 2 100 4 1 3 1 1 1 3 1 3 31 41 59 1 1 Sample Output 5 15 1 0	{"inputs": ["4\n2 3 4 9\n1 3", "4\n5 8 2 100\n4 1", "3\n1 1 1\n3 1", "3\n31 41 59\n1 1", "5\n16 13 10 30 15\n4 2", "6\n89 82 87 32 67 33\n4 4", "7\n2 3 17 10 2 2 2\n4 2", "3\n4 37 33\n3 3", "8\n87 40 96 7 86 86 72 97\n6 8", "10\n91 94 75 99 100 91 79 86 79 92\n2 8", "19\n1 1 1 1 2 1 1 1 1 1 2 1 3 2 2 1 1 1 2\n7 7", "34\n96 65 24 99 74 76 97 93 99 69 94 82 92 91 98 83 95 97 96 81 90 95 86 87 43 78 88 86 82 62 76 99 83 96\n21 16", "50\n75 98 65 75 99 89 84 65 9 53 62 61 61 53 80 7 6 47 86 1 89 27 67 1 31 39 53 92 19 20 76 41 60 15 29 94 76 82 87 89 93 38 42 6 87 36 100 97 93 71\n2 6", "99\n1 15 72 78 23 22 26 98 7 2 75 58 100 98 45 79 92 69 79 72 33 88 62 9 15 87 17 73 68 54 34 89 51 91 28 44 20 11 74 7 85 61 30 46 95 72 36 18 48 22 42 46 29 46 86 53 96 55 98 34 60 37 75 54 1 81 20 68 84 19 18 18 75 84 86 57 73 34 23 43 81 87 47 96 57 41 69 1 52 44 54 7 85 35 5 1 19 26 7\n4 64", "100\n33 63 21 27 49 82 86 93 43 55 4 72 89 85 5 34 80 7 23 13 21 49 22 73 89 65 81 25 6 92 82 66 58 88 48 96 1 1 16 48 67 96 84 63 87 76 20 100 36 4 31 41 35 62 55 76 74 70 68 41 4 16 39 81 2 41 34 73 66 57 41 89 78 93 68 96 87 47 92 60 40 58 81 12 19 74 56 83 56 61 83 97 26 92 62 52 39 57 89 95\n71 5", "100\n95 98 99 81 98 96 100 92 96 90 99 91 98 98 91 78 97 100 96 98 87 93 96 99 91 92 96 92 90 97 85 83 99 95 66 91 87 89 100 95 100 88 99 84 96 79 99 100 94 100 99 99 92 89 99 91 100 94 98 97 91 92 90 87 84 99 97 98 93 100 90 85 75 95 86 71 98 93 91 87 92 95 98 94 95 94 100 98 96 100 97 96 95 95 86 86 94 97 98 96\n67 57", "100\n100 100 100 100 100 100 100 100 100 100 97 100 100 100 100 100 99 100 100 99 99 100 99 100 100 100 100 100 100 100 100 100 97 99 98 98 100 98 98 100 99 100 100 100 100 99 100 98 100 99 98 99 98 98 100 100 100 100 100 100 100 100 100 100 99 100 100 100 100 100 98 100 99 99 100 96 100 96 100 99 100 100 99 100 99 100 100 100 99 100 100 100 100 98 98 97 100 100 99 98\n16 6", "100\n3 6 23 4 23 1 2 14 2 3 3 9 17 8 10 5 1 14 8 5 7 4 13 8 5 6 24 3 12 3 4 9 2 8 2 1 2 1 3 2 1 6 14 23 8 6 3 5 7 8 18 9 2 5 22 6 13 16 2 4 31 20 4 3 3 6 6 1 1 18 5 11 1 14 4 16 6 37 11 1 8 3 7 11 21 14 3 3 12 2 5 1 9 16 3 1 3 4 4 2\n98 24", "100\n1 1 3 1 1 2 1 2 1 1 2 2 2 1 1 1 1 1 1 3 1 1 1 3 1 3 3 1 1 2 1 1 1 1 1 2 1 1 1 4 1 1 3 3 2 1 1 1 1 1 2 2 1 3 1 1 1 2 4 1 1 2 5 2 1 1 2 1 1 1 2 3 1 1 1 1 2 1 1 1 1 2 1 1 1 1 1 2 2 3 1 7 3 1 3 1 2 1 2 1\n49 10", "100\n75 62 31 96 62 76 93 96 72 67 88 35 67 34 60 56 95 86 82 48 64 61 74 100 56 98 76 98 78 55 53 10 12 78 58 45 86 90 93 77 69 73 88 66 92 88 33 50 95 69 89 12 93 57 93 89 59 53 71 86 15 13 61 93 24 100 58 76 46 95 76 82 50 20 79 38 5 72 99 81 55 90 90 65 85 44 63 39 6 34 98 72 88 30 59 73 84 61 25 67\n86 25", "100\n100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100\n1 51", "4\n1 1 1 1\n2 4", "4\n1 1 2 1\n2 4"], "outputs": ["5", "15", "1", "0", "23", "0", "18", "0", "158", "348", "0", "452", "337", "1740", "2127", "932", "997", "195", "60", "2523", "5000", "2", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	295	codeforces
f93d8e4fa0765000b58f5a3f530474f7	Kay and Snowflake	After the piece of a devilish mirror hit the Kay's eye, he is no longer interested in the beauty of the roses. Now he likes to watch snowflakes. Once upon a time, he found a huge snowflake that has a form of the tree (connected acyclic graph) consisting of n nodes. The root of tree has index 1. Kay is very interested in the structure of this tree. After doing some research he formed q queries he is interested in. The i-th query asks to find a centroid of the subtree of the node vi. Your goal is to answer all queries. Subtree of a node is a part of tree consisting of this node and all it's descendants (direct or not). In other words, subtree of node v is formed by nodes u, such that node v is present on the path from u to root. Centroid of a tree (or a subtree) is a node, such that if we erase it from the tree, the maximum size of the connected component will be at least two times smaller than the size of the initial tree (or a subtree). The first line of the input contains two integers n and q (2<=≤<=n<=≤<=300<=000, 1<=≤<=q<=≤<=300<=000) — the size of the initial tree and the number of queries respectively. The second line contains n<=-<=1 integer p2,<=p3,<=...,<=pn (1<=≤<=pi<=≤<=n) — the indices of the parents of the nodes from 2 to n. Node 1 is a root of the tree. It's guaranteed that pi define a correct tree. Each of the following q lines contain a single integer vi (1<=≤<=vi<=≤<=n) — the index of the node, that define the subtree, for which we want to find a centroid. For each query print the index of a centroid of the corresponding subtree. If there are many suitable nodes, print any of them. It's guaranteed, that each subtree has at least one centroid. Sample Input 7 4 1 1 3 3 5 3 1 2 3 5 Sample Output 3 2 3 6	{"inputs": ["7 4\n1 1 3 3 5 3\n1\n2\n3\n5", "2 2\n1\n1\n2"], "outputs": ["3\n2\n3\n6", "2\n2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
f948aec78c25fd48780db400dd2e905b	Rank List	Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are shown its final place. You know the rules of comparing the results of two given teams very well. Let's say that team a solved pa problems with total penalty time ta and team b solved pb problems with total penalty time tb. Team a gets a higher place than team b in the end, if it either solved more problems on the contest, or solved the same number of problems but in less total time. In other words, team a gets a higher place than team b in the final results' table if either pa<=><=pb, or pa<==<=pb and ta<=<<=tb. It is considered that the teams that solve the same number of problems with the same penalty time share all corresponding places. More formally, let's say there is a group of x teams that solved the same number of problems with the same penalty time. Let's also say that y teams performed better than the teams from this group. In this case all teams from the group share places y<=+<=1, y<=+<=2, ..., y<=+<=x. The teams that performed worse than the teams from this group, get their places in the results table starting from the y<=+<=x<=+<=1-th place. Your task is to count what number of teams from the given list shared the k-th place. The first line contains two integers n and k (1<=≤<=k<=≤<=n<=≤<=50). Then n lines contain the description of the teams: the i-th line contains two integers pi and ti (1<=≤<=pi,<=ti<=≤<=50) — the number of solved problems and the total penalty time of the i-th team, correspondingly. All numbers in the lines are separated by spaces. In the only line print the sought number of teams that got the k-th place in the final results' table. Sample Input 7 2 4 10 4 10 4 10 3 20 2 1 2 1 1 10 5 4 3 1 3 1 5 3 3 1 3 1 Sample Output 3 4	{"inputs": ["7 2\n4 10\n4 10\n4 10\n3 20\n2 1\n2 1\n1 10", "5 4\n3 1\n3 1\n5 3\n3 1\n3 1", "5 1\n2 2\n1 1\n1 1\n1 1\n2 2", "6 3\n2 2\n3 1\n2 2\n4 5\n2 2\n4 5", "5 5\n3 1\n10 2\n2 2\n1 10\n10 2", "3 2\n3 3\n3 3\n3 3", "4 3\n10 3\n6 10\n5 2\n5 2", "5 3\n10 10\n10 10\n1 1\n10 10\n4 3", "3 1\n2 1\n1 1\n1 2", "1 1\n28 28", "2 2\n1 2\n1 2", "5 3\n2 3\n4 2\n5 3\n2 4\n3 5", "50 22\n4 9\n8 1\n3 7\n1 2\n3 8\n9 8\n8 5\n2 10\n5 8\n1 3\n1 8\n2 3\n7 9\n10 2\n9 9\n7 3\n8 6\n10 6\n5 4\n8 1\n1 5\n6 8\n9 5\n9 5\n3 2\n3 3\n3 8\n7 5\n4 5\n8 10\n8 2\n3 5\n3 2\n1 1\n7 2\n2 7\n6 8\n10 4\n7 5\n1 7\n6 5\n3 1\n4 9\n2 3\n3 6\n5 8\n4 10\n10 7\n7 10\n9 8", "50 6\n11 20\n18 13\n1 13\n3 11\n4 17\n15 10\n15 8\n9 16\n11 17\n16 3\n3 20\n14 13\n12 15\n9 10\n14 2\n12 12\n13 17\n6 10\n20 9\n2 8\n13 7\n7 20\n15 3\n1 20\n2 13\n2 5\n14 7\n10 13\n15 12\n15 5\n17 6\n9 11\n18 5\n10 1\n15 14\n3 16\n6 12\n4 1\n14 9\n7 14\n8 17\n17 13\n4 6\n19 16\n5 6\n3 15\n4 19\n15 20\n2 10\n20 10", "50 12\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "50 28\n2 2\n1 1\n2 1\n1 2\n1 1\n1 1\n1 1\n2 2\n2 2\n2 2\n2 1\n2 2\n2 1\n2 1\n1 2\n1 2\n1 2\n1 1\n2 2\n1 2\n2 2\n2 2\n2 1\n1 1\n1 2\n1 2\n1 1\n1 1\n1 1\n2 2\n2 1\n2 1\n2 2\n1 2\n1 2\n1 2\n1 1\n2 2\n1 2\n1 1\n2 2\n2 2\n1 1\n2 1\n2 1\n1 1\n2 2\n2 2\n2 2\n2 2", "50 40\n2 3\n3 1\n2 1\n2 1\n2 1\n3 1\n1 1\n1 2\n2 3\n1 3\n1 3\n2 1\n3 1\n1 1\n3 1\n3 1\n2 2\n1 1\n3 3\n3 1\n3 2\n2 3\n3 3\n3 1\n1 3\n2 3\n2 1\n3 2\n3 3\n3 1\n2 1\n2 2\n1 3\n3 3\n1 1\n3 2\n1 2\n2 3\n2 1\n2 2\n3 2\n1 3\n3 1\n1 1\n3 3\n2 3\n2 1\n2 3\n2 3\n1 2", "50 16\n2 1\n3 2\n5 2\n2 2\n3 4\n4 4\n3 3\n4 1\n2 3\n1 5\n4 1\n2 2\n1 5\n3 2\n2 1\n5 4\n5 2\n5 4\n1 1\n3 5\n2 1\n4 5\n5 1\n5 5\n5 4\n2 4\n1 2\n5 5\n4 4\n1 5\n4 2\n5 1\n2 4\n2 5\n2 2\n3 4\n3 1\n1 1\n5 5\n2 2\n3 4\n2 4\n5 2\n4 1\n3 1\n1 1\n4 1\n4 4\n1 4\n1 3", "50 32\n6 6\n4 2\n5 5\n1 1\n2 4\n6 5\n2 3\n6 5\n2 3\n6 3\n1 4\n1 6\n3 3\n2 4\n3 2\n6 2\n4 1\n3 3\n3 1\n5 5\n1 2\n2 1\n5 4\n3 1\n4 4\n5 6\n4 1\n2 5\n3 1\n4 6\n2 3\n1 1\n6 5\n2 6\n3 3\n2 6\n2 3\n2 6\n3 4\n2 6\n4 5\n5 4\n1 6\n3 2\n5 1\n4 1\n4 6\n4 2\n1 2\n5 2", "50 48\n5 1\n6 4\n3 2\n2 1\n4 7\n3 6\n7 1\n7 5\n6 5\n5 6\n4 7\n5 7\n5 7\n5 5\n7 3\n3 5\n4 3\n5 4\n6 2\n1 6\n6 3\n6 5\n5 2\n4 2\n3 1\n1 1\n5 6\n1 3\n6 5\n3 7\n1 5\n7 5\n6 5\n3 6\n2 7\n5 3\n5 3\n4 7\n5 2\n6 5\n5 7\n7 1\n2 3\n5 5\n2 6\n4 1\n6 2\n6 5\n3 3\n1 6", "50 8\n5 3\n7 3\n4 3\n7 4\n2 2\n4 4\n5 4\n1 1\n7 7\n4 8\n1 1\n6 3\n1 5\n7 3\n6 5\n4 5\n8 6\n3 6\n2 1\n3 2\n2 5\n7 6\n5 8\n1 3\n5 5\n8 4\n4 5\n4 4\n8 8\n7 2\n7 2\n3 6\n2 8\n8 3\n3 2\n4 5\n8 1\n3 2\n8 7\n6 3\n2 3\n5 1\n3 4\n7 2\n6 3\n7 3\n3 3\n6 4\n2 2\n5 1", "20 16\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "20 20\n1 2\n2 2\n1 1\n2 1\n2 2\n1 1\n1 1\n2 1\n1 1\n1 2\n2 2\n1 2\n1 2\n2 2\n2 2\n1 2\n2 1\n2 1\n1 2\n2 2", "30 16\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1\n1 1", "30 22\n2 1\n1 2\n2 1\n2 2\n2 1\n1 2\n2 2\n1 2\n2 2\n1 2\n2 2\n1 2\n1 2\n2 1\n1 2\n2 2\n2 2\n1 2\n2 1\n1 1\n1 2\n1 2\n1 1\n1 2\n1 2\n2 2\n1 2\n2 2\n2 1\n1 1", "30 22\n1 1\n1 3\n2 3\n3 1\n2 3\n3 1\n1 2\n3 3\n2 1\n2 1\n2 2\n3 1\n3 2\n2 3\n3 1\n1 3\n2 3\n3 1\n1 2\n1 2\n2 3\n2 1\n3 3\n3 2\n1 3\n3 3\n3 3\n3 3\n3 3\n3 1", "50 16\n2 1\n3 2\n5 2\n2 2\n3 4\n4 4\n3 3\n4 1\n2 3\n1 5\n4 1\n2 2\n1 5\n3 2\n2 1\n5 4\n5 2\n5 4\n1 1\n3 5\n2 1\n4 5\n5 1\n5 5\n5 4\n2 4\n1 2\n5 5\n4 4\n1 5\n4 2\n5 1\n2 4\n2 5\n2 2\n3 4\n3 1\n1 1\n5 5\n2 2\n3 4\n2 4\n5 2\n4 1\n3 1\n1 1\n4 1\n4 4\n1 4\n1 3", "50 22\n4 9\n8 1\n3 7\n1 2\n3 8\n9 8\n8 5\n2 10\n5 8\n1 3\n1 8\n2 3\n7 9\n10 2\n9 9\n7 3\n8 6\n10 6\n5 4\n8 1\n1 5\n6 8\n9 5\n9 5\n3 2\n3 3\n3 8\n7 5\n4 5\n8 10\n8 2\n3 5\n3 2\n1 1\n7 2\n2 7\n6 8\n10 4\n7 5\n1 7\n6 5\n3 1\n4 9\n2 3\n3 6\n5 8\n4 10\n10 7\n7 10\n9 8", "50 22\n29 15\n18 10\n6 23\n38 28\n34 40\n40 1\n16 26\n22 33\n14 30\n26 7\n15 16\n22 40\n14 15\n6 28\n32 27\n33 3\n38 22\n40 17\n16 27\n21 27\n34 26\n5 15\n34 9\n38 23\n7 36\n17 6\n19 37\n40 1\n10 28\n9 14\n8 31\n40 8\n14 2\n24 16\n38 33\n3 37\n2 9\n21 21\n40 26\n28 33\n24 31\n10 12\n27 27\n17 4\n38 5\n21 31\n5 12\n29 7\n39 12\n26 14", "50 14\n4 20\n37 50\n46 19\n20 25\n47 10\n6 34\n12 41\n47 9\n22 28\n41 34\n47 40\n12 42\n9 4\n15 15\n27 8\n38 9\n4 17\n8 13\n47 7\n9 38\n30 48\n50 7\n41 34\n23 11\n16 37\n2 32\n18 46\n37 48\n47 41\n13 9\n24 50\n46 14\n33 49\n9 50\n35 30\n49 44\n42 49\n39 15\n33 42\n3 18\n44 15\n44 28\n9 17\n16 4\n10 36\n4 22\n47 17\n24 12\n2 31\n6 30", "2 1\n50 50\n50 50", "2 2\n50 50\n50 50", "2 1\n50 50\n50 49", "2 2\n50 50\n50 49", "50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50", "50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n49 50", "50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 50\n50 49", "10 1\n3 1\n3 2\n3 2\n2 3\n2 3\n2 3\n2 4\n2 4\n2 4\n2 4", "4 3\n1 1\n1 2\n2 1\n2 2", "4 2\n1 2\n1 3\n1 5\n1 2", "6 1\n4 3\n4 2\n5 1\n5 2\n5 3\n5 3", "5 3\n2 1\n1 3\n1 2\n1 1\n1 1", "3 1\n1 1\n1 2\n1 3", "10 10\n3 1\n3 2\n3 2\n2 3\n2 3\n2 3\n2 4\n2 4\n2 4\n2 4", "5 1\n5 5\n5 6\n5 7\n5 8\n5 5", "4 1\n1 1\n1 1\n1 2\n1 3"], "outputs": ["3", "4", "2", "1", "1", "3", "2", "3", "1", "1", "2", "1", "1", "1", "50", "13", "5", "1", "1", "1", "3", "20", "6", "30", "13", "5", "1", "1", "1", "2", "2", "2", "1", "1", "50", "1", "49", "1", "1", "2", "1", "2", "1", "4", "2", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	143	codeforces
f971e5a1ca10583a10bfb7fe8f0d6ebd	Points on Line	Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. Now Petya is wondering in how many ways he can choose three distinct points so that the distance between the two farthest of them doesn't exceed d. Note that the order of the points inside the group of three chosen points doesn't matter. The first line contains two integers: n and d (1<=≤<=n<=≤<=105; 1<=≤<=d<=≤<=109). The next line contains n integers x1,<=x2,<=...,<=xn, their absolute value doesn't exceed 109 — the x-coordinates of the points that Petya has got. It is guaranteed that the coordinates of the points in the input strictly increase. Print a single integer — the number of groups of three points, where the distance between two farthest points doesn't exceed d. 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 3 1 2 3 4 4 2 -3 -2 -1 0 5 19 1 10 20 30 50 Sample Output 4 2 1	{"inputs": ["4 3\n1 2 3 4", "4 2\n-3 -2 -1 0", "5 19\n1 10 20 30 50", "10 5\n31 36 43 47 48 50 56 69 71 86", "10 50\n1 4 20 27 65 79 82 83 99 100", "10 90\n24 27 40 41 61 69 73 87 95 97", "100 100\n-98 -97 -96 -93 -92 -91 -90 -87 -86 -84 -81 -80 -79 -78 -76 -75 -73 -71 -69 -67 -65 -64 -63 -62 -61 -54 -51 -50 -49 -48 -46 -45 -44 -37 -36 -33 -30 -28 -27 -16 -15 -13 -12 -10 -9 -7 -6 -5 -4 2 3 5 8 9 10 11 13 14 15 16 17 19 22 24 25 26 27 28 30 31 32 36 40 43 45 46 47 50 51 52 53 58 60 63 69 70 73 78 80 81 82 85 88 89 90 91 95 96 97 99", "1 14751211\n847188590", "2 1000000000\n-907894512 -289906312", "2 1000000000\n-14348867 1760823", "3 1000000000\n-5 -1 1"], "outputs": ["4", "2", "1", "2", "25", "120", "79351", "0", "0", "0", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	271	codeforces

Subsets and Splits