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
741bb1f946dda8d9d2ae4bdb4ddc08bc	T-shirts Distribution	The organizers of a programming contest have decided to present t-shirts to participants. There are six different t-shirts sizes in this problem: S, M, L, XL, XXL, XXXL (sizes are listed in increasing order). The t-shirts are already prepared. For each size from S to XXXL you are given the number of t-shirts of this size. During the registration, the organizers asked each of the n participants about the t-shirt size he wants. If a participant hesitated between two sizes, he could specify two neighboring sizes — this means that any of these two sizes suits him. Write a program that will determine whether it is possible to present a t-shirt to each participant of the competition, or not. Of course, each participant should get a t-shirt of proper size: - the size he wanted, if he specified one size; - any of the two neibouring sizes, if he specified two sizes. If it is possible, the program should find any valid distribution of the t-shirts. The first line of the input contains six non-negative integers — the number of t-shirts of each size. The numbers are given for the sizes S, M, L, XL, XXL, XXXL, respectively. The total number of t-shirts doesn't exceed 100<=000. The second line contains positive integer n (1<=≤<=n<=≤<=100<=000) — the number of participants. The following n lines contain the sizes specified by the participants, one line per participant. The i-th line contains information provided by the i-th participant: single size or two sizes separated by comma (without any spaces). If there are two sizes, the sizes are written in increasing order. It is guaranteed that two sizes separated by comma are neighboring. If it is not possible to present a t-shirt to each participant, print «NO» (without quotes). Otherwise, print n<=+<=1 lines. In the first line print «YES» (without quotes). In the following n lines print the t-shirt sizes the orginizers should give to participants, one per line. The order of the participants should be the same as in the input. If there are multiple solutions, print any of them. Sample Input 0 1 0 1 1 0 3 XL S,M XL,XXL 1 1 2 0 1 1 5 S M S,M XXL,XXXL XL,XXL Sample Output YES XL M XXL NO	{"inputs": ["0 1 0 1 1 0\n3\nXL\nS,M\nXL,XXL", "1 1 2 0 1 1\n5\nS\nM\nS,M\nXXL,XXXL\nXL,XXL", "1 2 4 4 1 1\n10\nXL\nXL\nS,M\nL\nM,L\nL\nS,M\nM\nXL,XXL\nXL", "1 3 0 2 2 2\n10\nL,XL\nS,M\nXXL,XXXL\nS,M\nS,M\nXXXL\nXL,XXL\nXXL\nS,M\nXL", "5 1 5 2 4 3\n20\nL,XL\nS,M\nL,XL\nXXL,XXXL\nS,M\nS,M\nXL,XXL\nL,XL\nS,M\nL,XL\nS,M\nM,L\nXXL,XXXL\nXXL,XXXL\nL\nXXL,XXXL\nXL,XXL\nM,L\nS,M\nXXL", "4 8 8 1 6 3\n30\nS,M\nM,L\nM\nXXL,XXXL\nXXL\nM,L\nS,M\nS,M\nXXL,XXXL\nL\nL\nS,M\nM\nL,XL\nS,M\nM,L\nL\nXXL,XXXL\nS,M\nXXL\nM,L\nM,L\nM,L\nXXL\nXXL,XXXL\nM,L\nS,M\nXXL\nM,L\nXXL,XXXL", "1 0 0 0 0 0\n1\nS", "0 1 0 0 0 0\n1\nS", "1 0 0 0 0 0\n1\nM", "0 1 0 0 0 0\n1\nM", "0 0 0 0 0 1\n1\nL", "0 0 1 0 0 0\n1\nL", "0 0 0 1 0 0\n1\nXL", "1 0 0 0 0 0\n1\nXL", "0 0 0 0 1 0\n1\nXXL", "0 1 0 0 0 0\n1\nXXL", "0 0 0 0 0 1\n1\nXXXL", "0 0 1 0 0 0\n1\nXXXL", "1 2 3 6 1 2\n10\nXL\nXL\nM\nL,XL\nL,XL\nL,XL\nS\nS,M\nXL\nL,XL", "9 8 1 7 2 3\n20\nL,XL\nM,L\nS\nXL,XXL\nM,L\nXL,XXL\nS\nL,XL\nS,M\nS,M\nXXL,XXXL\nS,M\nS,M\nS,M\nXL,XXL\nL\nXXL,XXXL\nS,M\nXL,XXL\nM,L", "9 12 3 8 4 14\n30\nS,M\nS,M\nXL\nXXXL\nXXL,XXXL\nXXL,XXXL\nXXXL\nS,M\nXXL,XXXL\nM,L\nXXL\nXXL,XXXL\nXL,XXL\nL,XL\nXXL,XXXL\nM\nS,M\nXXXL\nXXL,XXXL\nXXL,XXXL\nM\nM,L\nS,M\nS,M\nXXL,XXXL\nXL,XXL\nXXL,XXXL\nXXL,XXXL\nS,M\nM,L", "1 3 0 0 4 2\n10\nXXL\nS,M\nXXXL\nS,M\nS\nXXL,XXXL\nXXL\nXXL,XXXL\nM\nXXL,XXXL", "5 6 0 0 6 3\n20\nXXL,XXXL\nS,M\nS,M\nXXL,XXXL\nS\nS\nXXL,XXXL\nM\nS,M\nXXL,XXXL\nS\nM\nXXXL\nXXL,XXXL\nS,M\nXXXL\nXXL,XXXL\nS,M\nS\nXXL,XXXL"], "outputs": ["YES\nXL\nM\nXXL", "NO", "YES\nXL\nXL\nS\nL\nL\nL\nM\nM\nXL\nXL", "YES\nXL\nS\nXXXL\nM\nM\nXXXL\nXXL\nXXL\nM\nXL", "YES\nL\nS\nL\nXXL\nS\nS\nXXL\nXL\nS\nXL\nS\nL\nXXXL\nXXXL\nL\nXXXL\nXXL\nL\nM\nXXL", "YES\nS\nM\nM\nXXL\nXXL\nM\nS\nS\nXXL\nL\nL\nS\nM\nXL\nM\nM\nL\nXXXL\nM\nXXL\nL\nL\nL\nXXL\nXXXL\nL\nM\nXXL\nL\nXXXL", "YES\nS", "NO", "NO", "YES\nM", "NO", "YES\nL", "YES\nXL", "NO", "YES\nXXL", "NO", "YES\nXXXL", "NO", "YES\nXL\nXL\nM\nL\nL\nL\nS\nM\nXL\nXL", "YES\nXL\nM\nS\nXL\nM\nXL\nS\nXL\nS\nS\nXXL\nS\nS\nS\nXL\nL\nXXL\nS\nXL\nM", "YES\nS\nS\nXL\nXXXL\nXXL\nXXL\nXXXL\nS\nXXL\nM\nXXL\nXXXL\nXL\nL\nXXXL\nM\nS\nXXXL\nXXXL\nXXXL\nM\nM\nS\nS\nXXXL\nXL\nXXXL\nXXXL\nS\nM", "YES\nXXL\nM\nXXXL\nM\nS\nXXL\nXXL\nXXL\nM\nXXXL", "YES\nXXL\nS\nM\nXXL\nS\nS\nXXL\nM\nM\nXXL\nS\nM\nXXXL\nXXL\nM\nXXXL\nXXL\nM\nS\nXXXL"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	12	codeforces
74216fbb643744f747461380b71d0be3	Checking the Calendar	You are given names of two days of the week. Please, determine whether it is possible that during some non-leap year the first day of some month was equal to the first day of the week you are given, while the first day of the next month was equal to the second day of the week you are given. Both months should belong to one year. In this problem, we consider the Gregorian calendar to be used. The number of months in this calendar is equal to 12. The number of days in months during any non-leap year is: 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31. Names of the days of the week are given with lowercase English letters: "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday". The input consists of two lines, each of them containing the name of exactly one day of the week. It's guaranteed that each string in the input is from the set "monday", "tuesday", "wednesday", "thursday", "friday", "saturday", "sunday". Print "YES" (without quotes) if such situation is possible during some non-leap year. Otherwise, print "NO" (without quotes). Sample Input monday tuesday sunday sunday saturday tuesday Sample Output NO YES YES	{"inputs": ["monday\ntuesday", "sunday\nsunday", "saturday\ntuesday", "tuesday\nthursday", "friday\nwednesday", "sunday\nsaturday", "monday\nmonday", "monday\nwednesday", "monday\nthursday", "monday\nfriday", "monday\nsaturday", "monday\nsunday", "tuesday\nmonday", "tuesday\ntuesday", "tuesday\nwednesday", "tuesday\nfriday", "tuesday\nsaturday", "tuesday\nsunday", "wednesday\nmonday", "wednesday\ntuesday", "wednesday\nwednesday", "wednesday\nthursday", "wednesday\nfriday", "wednesday\nsaturday", "wednesday\nsunday", "thursday\nmonday", "thursday\ntuesday", "thursday\nwednesday", "thursday\nthursday", "thursday\nfriday", "thursday\nsaturday", "thursday\nsunday", "friday\nmonday", "friday\ntuesday", "friday\nthursday", "friday\nsaturday", "friday\nsunday", "saturday\nmonday", "saturday\nwednesday", "saturday\nthursday", "saturday\nfriday", "saturday\nsaturday", "saturday\nsunday", "sunday\nmonday", "sunday\ntuesday", "sunday\nwednesday", "sunday\nthursday", "sunday\nfriday", "friday\nfriday", "friday\nsunday", "monday\nmonday", "friday\ntuesday", "thursday\nsaturday", "tuesday\nfriday", "sunday\nwednesday", "monday\nthursday", "saturday\nsunday", "friday\nmonday", "thursday\nthursday", "wednesday\nfriday", "thursday\nmonday", "wednesday\nsunday", "thursday\nfriday", "monday\nfriday", "wednesday\nsaturday", "thursday\nsunday", "saturday\nfriday", "saturday\nmonday"], "outputs": ["NO", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	156	codeforces
74244487ce06cc0da0e22a0572c585c6	Leha and Function	Leha like all kinds of strange things. Recently he liked the function F(n,<=k). Consider all possible k-element subsets of the set [1,<=2,<=...,<=n]. For subset find minimal element in it. F(n,<=k) — mathematical expectation of the minimal element among all k-element subsets. But only function does not interest him. He wants to do interesting things with it. Mom brought him two arrays A and B, each consists of m integers. For all i,<=j such that 1<=≤<=i,<=j<=≤<=m the condition Ai<=≥<=Bj holds. Help Leha rearrange the numbers in the array A so that the sum is maximally possible, where A' is already rearranged array. First line of input data contains single integer m (1<=≤<=m<=≤<=2·105) — length of arrays A and B. Next line contains m integers a1,<=a2,<=...,<=am (1<=≤<=ai<=≤<=109) — array A. Next line contains m integers b1,<=b2,<=...,<=bm (1<=≤<=bi<=≤<=109) — array B. Output m integers a'1,<=a'2,<=...,<=a'm — array A' which is permutation of the array A. Sample Input 5 7 3 5 3 4 2 1 3 2 3 7 4 6 5 8 8 2 6 2 1 2 2 1 1 2 Sample Output 4 7 3 5 3 2 6 4 5 8 8 6	{"inputs": ["5\n7 3 5 3 4\n2 1 3 2 3", "7\n4 6 5 8 8 2 6\n2 1 2 2 1 1 2"], "outputs": ["4 7 3 5 3", "2 6 4 5 8 8 6"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	54	codeforces
7431c78681efd4e5818be5fd32cb59e8	Fox and Cross	Fox Ciel has a board with n rows and n columns. So, the board consists of n<=×<=n cells. Each cell contains either a symbol '.', or a symbol '#'. A cross on the board is a connected set of exactly five cells of the board that looks like a cross. The picture below shows how it looks. Ciel wants to draw several (may be zero) crosses on the board. Each cross must cover exactly five cells with symbols '#', and any cell with symbol '#' must belong to some cross. No two crosses can share a cell. Please, tell Ciel if she can draw the crosses in the described way. The first line contains an integer n (3<=≤<=n<=≤<=100) — the size of the board. Each of the next n lines describes one row of the board. The i-th line describes the i-th row of the board and consists of n characters. Each character is either a symbol '.', or a symbol '#'. Output a single line with "YES" if Ciel can draw the crosses in the described way. Otherwise output a single line with "NO". Sample Input 5 .#... ####. .#### ...#. ..... 4 #### #### #### #### 6 .#.... ####.. .####. .#.##. ###### .#..#. 6 .#..#. ###### .####. .####. ###### .#..#. 3 ... ... ... Sample Output YES NO YES NO YES	{"inputs": ["4\n####\n####\n####\n####", "6\n.#....\n####..\n.####.\n.#.##.\n######\n.#..#.", "6\n.#..#.\n######\n.####.\n.####.\n######\n.#..#.", "5\n.....\n.#...\n####.\n.####\n...#.", "5\n#....\n###..\n.###.\n..##.\n..##.", "10\n....#...#.\n.#.###.###\n#####.#.#.\n.#######..\n.#.##.#.#.\n######.###\n.#..#.#.#.\n.#..#####.\n##########\n.#..#...#.", "8\n.#...##.\n##.##.#.\n#....##.\n#.###.##\n...##..#\n#..#.##.\n#..#.#..\n#....###", "15\n.#...##.##.....\n.###.#.#.##..#.\n##.#####......#\n#....###.#..#..\n#.##.#.###.###.\n.###....#.###.#\n##.....##..#...\n.#.########...#\n##..#..##..#.##\n#...#....##....\n.......#.......\n.#..#.#.####...\n.#..#...#..###.\n#..#.#..#......\n###.....##....#", "7\n.......\n.......\n.......\n.......\n.....#.\n....###\n.....#.", "9\n.#.#....#\n#.#.....#\n.#..#..#.\n#.#....##\n...#...#.\n#..###.#.\n....#..##\n.#.###...\n....##..#", "5\n#...#\n.....\n..#..\n.....\n#...#", "3\n.#.\n#.#\n.#.", "3\n...\n...\n..#"], "outputs": ["NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	68	codeforces
7432deec97885b39b604ea686f87155a	Hockey	Petya loves hockey very much. One day, as he was watching a hockey match, he fell asleep. Petya dreamt of being appointed to change a hockey team's name. Thus, Petya was given the original team name w and the collection of forbidden substrings s1,<=s2,<=...,<=sn. All those strings consist of uppercase and lowercase Latin letters. String w has the length of \|w\|, its characters are numbered from 1 to \|w\|. First Petya should find all the occurrences of forbidden substrings in the w string. During the search of substrings the case of letter shouldn't be taken into consideration. That is, strings "aBC" and "ABc" are considered equal. After that Petya should perform the replacement of all letters covered by the occurrences. More formally: a letter in the position i should be replaced by any other one if for position i in string w there exist pair of indices l,<=r (1<=≤<=l<=≤<=i<=≤<=r<=≤<=\|w\|) such that substring w[l ... r] is contained in the collection s1,<=s2,<=...,<=sn, when using case insensitive comparison. During the replacement the letter's case should remain the same. Petya is not allowed to replace the letters that aren't covered by any forbidden substring. Letter letter (uppercase or lowercase) is considered lucky for the hockey players. That's why Petya should perform the changes so that the letter occurred in the resulting string as many times as possible. Help Petya to find such resulting string. If there are several such strings, find the one that comes first lexicographically. Note that the process of replacements is not repeated, it occurs only once. That is, if after Petya's replacements the string started to contain new occurrences of bad substrings, Petya pays no attention to them. The first line contains the only integer n (1<=≤<=n<=≤<=100) — the number of forbidden substrings in the collection. Next n lines contain these substrings. The next line contains string w. All those n<=+<=1 lines are non-empty strings consisting of uppercase and lowercase Latin letters whose length does not exceed 100. The last line contains a lowercase letter letter. Output the only line — Petya's resulting string with the maximum number of letters letter. If there are several answers then output the one that comes first lexicographically. The lexicographical comparison is performed by the standard < operator in modern programming languages. The line a is lexicographically smaller than the line b, if a is a prefix of b, or there exists such an i (1<=≤<=i<=≤<=\|a\|), that ai<=<<=bi, and for any j (1<=≤<=j<=<<=i) aj<==<=bj. \|a\| stands for the length of string a. Sample Input 3 bers ucky elu PetrLoveLuckyNumbers t 4 hello party abefglghjdhfgj IVan petrsmatchwin a 2 aCa cba abAcaba c Sample Output PetrLovtTttttNumtttt petrsmatchwin abCacba	{"inputs": ["3\nbers\nucky\nelu\nPetrLoveLuckyNumbers\nt", "4\nhello\nparty\nabefglghjdhfgj\nIVan\npetrsmatchwin\na", "2\naCa\ncba\nabAcaba\nc", "3\nlol\nhello\neho\nPetrUnited\nt", "2\ntrsd\ndream\nPetrsDreamOh\ny", "1\nPetrsDreamOh\nPetrsDreamOh\nh", "3\netr\ned\nied\nPetrUnited\nd", "3\netr\ned\nied\nPetrUnited\nz", "3\nab\nBa\naB\nABBA\na", "3\nab\nBa\naB\nABBAC\nb", "7\na\nb\ng\nk\ne\nt\nt\nA\na", "4\nEfron\nKeyt\ncesho\ncool\nCodeForcesHockeyTeam\np", "4\nEfron\nKeyt\ncesho\ncool\nCodeForcesOldHockeyNewTeam\np", "2\nA\nB\nabababBabaBBaBBBBAaaaAAAAA\na", "7\nS\nT\ng\ni\nO\nr\nq\nkljpfP\nv", "47\nV\nS\ng\nr\nC\nR\nB\nb\nl\nW\nJ\ni\nU\nn\nq\nq\nj\nL\nR\nu\nQ\nC\nf\nC\nU\nu\nx\nh\nq\nE\nY\nu\nK\nt\nM\nU\nA\nA\ns\ni\nV\nT\nj\nb\nk\nW\nN\nNlVwRlWzQQWoCI\nz", "47\njw\nL\nxIp\nW\nI\naI\nEp\nylG\nNe\nEglZ\noYkyo\nwDuZK\nDVh\nuoAoF\nGWj\nt\nP\nuNQz\nbPSg\neqru\nxvll\nO\nmb\nCM\nwnmvv\nYpFsq\nFYID\nc\nr\nrhbl\nYseyB\nRGcRj\nhDtz\nW\nQlQWB\nY\nftSl\nyPlAd\nLPgVw\nEIGOF\nTQ\nQrFcr\nspu\nK\nIJ\nfXUd\nGhpV\nDxUhKXELSLIiJMIOsbrpPQPXFwH\nw", "74\nPjc\nZcOWk\nM\nyMyp\ncH\nTzmX\nA\nXgl\nKVB\nbljv\nIH\nu\nnu\nLdahF\nt\nO\nSv\nuzFT\nzfNd\nUM\nbXR\nUQbXk\nAA\ngVmH\nng\nF\nK\nHP\nIu\nwrH\nN\nPnTIQ\nkUY\nyabHN\nTA\nvrgl\nyxmsh\nTrQ\nX\nvIbrl\nMfu\nPfN\ni\nrH\nt\nHl\nUwst\nj\nB\nBiDCA\nJcE\nfd\nbXuI\nWWSU\nrd\nmj\nt\nIGrPe\nQl\nxfoSV\no\nWKdG\nTqeu\nE\nbZyg\nbVqR\nzY\nZD\nhHpdP\njHww\nlfU\ngVem\nt\nBD\nhUOfmkiMZhZxTuuiAyPuoutEQiPfZFSQVMMQxckAqtlRv\nx", "74\nULa\nn\nvq\nbybI\nfCX\nEEi\nSg\nxj\nIDz\nfsP\nM\nGGjx\nDpY\ngffu\nK\nMy\nqbtz\nk\nbLNb\nqET\nN\nBBY\nx\nKHUT\nUju\ntyXI\no\nChXY\neia\nR\nakHR\ng\nax\nKyY\nwpdl\nCZA\nsmFl\nLVDJ\nO\nxHF\nW\nTMZ\nvN\nqiT\ng\nI\nPsR\nsCJL\nN\naSCi\nJYD\nP\nA\nM\nT\nG\ngU\nk\nA\nloT\nEbP\nZ\nEoo\nQ\nGGY\nZcbG\ntvYl\nM\nczMR\nj\ne\nlLjf\nY\nzm\nqifNoaopvznANCLmPpfToShyelsYSFllyQLUDYbcQ\ng", "74\nM\nLQ\nH\ncA\nqj\nD\nnj\nzD\njM\ns\nR\noC\nFh\nlO\nj\nc\nEn\nAB\nsw\nT\nz\nEb\nb\nu\nmj\nMI\nD\nj\nH\np\nzD\nV\nR\nvg\nH\nS\nBy\nu\nQP\nB\ndD\nrI\nJF\nnA\nsv\nz\na\nl\nI\nFJ\nK\nH\nT\nF\nl\ntC\ng\ns\nNl\nUj\nu\nA\nOO\nLd\nk\nk\nkM\nLY\nbn\nv\nfT\nC\nI\nc\naeBolOleYgGmSLkFCPJPbQZUeodomjS\nv", "99\ns\nc\nN\nN\ni\ni\nW\nJ\nA\nW\nm\nB\nf\nO\nm\nk\nQ\nf\nx\np\nl\nH\nH\no\nn\nC\nK\nR\ns\nT\nJ\nv\nC\nZ\nd\nl\nr\no\nD\ng\na\nA\nE\nk\nN\nw\na\nb\no\nk\nv\nc\ni\nj\nE\nl\no\nf\nv\ns\nh\nx\nm\nE\nN\nt\nj\nk\ng\nk\nX\nW\ni\nX\nm\nw\nK\nL\nQ\nr\nj\nf\no\nw\nv\nS\no\nH\ne\nL\nL\nd\nP\nr\ng\nz\nz\nq\nd\nBBPVyRDLuNwdkeSYWimsIMiAPiOMQfuDQMcLEly\nq", "77\nGw\nZw\nqg\neO\nmx\nfE\nqD\nVv\nRs\nbd\nwA\nnh\nDm\nbR\nxV\nwe\nKH\nbl\nVy\naJ\nFr\nNP\nir\nxh\nFq\nDG\nNh\ndW\naG\nkm\nNS\nOm\nyC\nts\nZt\nEN\nFs\njA\nvf\nde\nDa\nAW\nBv\nmO\nDk\nYj\nfl\ndj\nJF\ndI\nhr\nzk\nam\nLT\nPJ\nAQ\nOW\nWN\nUG\nTL\nSZ\nBK\nLp\njW\nrY\nPB\nRj\nBw\ngl\nlK\nWj\nPl\nfx\nYO\nbX\nSN\nPt\nxPDCKNGWsNSlScKgBNEooOTnSuycVtvdToGmFoEfsUorvsSNcQIlaXRQqrfTZZoNvjutjhGpGXmNSQQWCzeHhMJAxclmiNnErpxH\nh", "100\nqn\nBE\nyN\nep\nPq\nXz\nLM\nEZ\ndb\nMn\nbn\nFe\nqA\nzc\nyq\npC\nyA\nWk\nYq\nrs\noD\nvD\nzW\nxZ\nbl\nur\nkf\ndf\nLS\nUW\nMy\nhR\nsh\nNh\nog\nCW\nor\nzo\nrO\nao\nXH\nDq\nKa\nlL\nYQ\nOh\nRZ\nAx\nta\nko\nDn\nNg\nNy\nDB\nYD\njO\nAp\nFT\noB\nNc\nwB\nHO\neW\nAc\nDr\nMt\nDf\nbF\nFP\nRa\nnF\nhF\nXC\nnG\nan\nZY\nuB\nHP\nOR\nKN\nUv\nLe\nIj\nlH\nVw\njb\nXn\nqu\nJo\nzL\nKW\nLS\naV\nLs\nBX\nMY\noK\nfh\ngP\nTB\npBWBEkqznLlZykhmPrfidzWbQMNDdBaDLykOfdvOZjKoUxCqKwJdGuhseuxaYcVyAGTSTwXYmKweRMUdbyfxssSNGLSAhckIknDj\nd", "3\na\nA\na\nA\na", "3\na\nA\na\nA\nb", "4\na\nA\ni\nA\nPetyaIsVeryCoolGuy\np", "3\njap\nthd\ndshipssinceW\nJapanisexperiencingitsgreatesthardshipssinceWorldWarIIthardshipssinceWorldWarIItesthardshixper\nc", "3\njap\nthd\ndshipssinceW\nJapanisexperiencingitsgreatesthardshipssinceWorldWarIIthardshipssinceWorldWarIItesthardshixper\na", "7\na\nh\nu\np\nfgh\nwyz\ndefghijkl\nabcdefghijklmnopqrstuvwxyz\na", "9\na\nh\nu\np\nz\nfgh\nwyz\ndefghijkl\nghijklmnopqrstu\nabcdefghijklmnopqrstuvwxyz\na", "3\nab\nBa\naB\nABBA\nl"], "outputs": ["PetrLovtTttttNumtttt", "petrsmatchwin", "abCacba", "PetrUnited", "PeyyyYyyyyOh", "HhhhhHhhhhHa", "PdddUnitda", "PzzzUnitzz", "BAAB", "BAABC", "B", "CodeForpppPpcpppPeam", "CodeForcesOldHockeyNewTeam", "bababaAbabAAbAAAABbbbBBBBB", "kljpfP", "ZzZzZzZzZZZoZZ", "DxUhWXEWSWWwWMWWsbwwWQWXFaH", "hXXxxxxXZhZaXxxxXyPxxxxXQxPxZXSQVXXQacxXqxlRv", "ggfGggggvggGGCLgGgfGgShgglsGSFllgGLUDGbcG", "vvVovVveYvVvVVvVVVVVvQVVeovovvV", "QQQQyQQQuQqqqqQYQqqqQQqQQqQQAquQAQqQQqy", "xPDCKNHHhHHlScKgBNHhoOThHuhhVtvdToGmFoEhhUorvsHHcQIlaXRQqrfTZZoNvjutjhGpGXmHHQQWCzeHhMHHxclmiNnErphA", "pBDDDkqznDdDdkhmPrfiddDdQDDDaDaDLydDfdvOZjDdUdDqDdJdGuhseuxaYcVdDGTSTwXYmDdeRMUadyfxssSDDDDAhckIddDj", "B", "B", "PetypPsVeryCoolGuy", "CccanisexperiencingitsgreatestharcccccccccacCorldWarIItharcccccccccacCorldWarIItesthardshixper", "AbaanisexperiencingitsgreatestharaaaaaaaaaaaAorldWarIItharaaaaaaaaaaaAorldWarIItesthardshixper", "bbcaaaaaaaaamnoaqrstavwxyz", "bbcaaaaaaaaaaaaaaaaaavwxya", "LLLL"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
743d2125ab70ce92fbcc50088321ef71	Theatre Square	Theatre Square in the capital city of Berland has a rectangular shape with the size n<=×<=m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a<=×<=a. What is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square. The input contains three positive integer numbers in the first line: n,<=<=m and a (1<=≤<=<=n,<=m,<=a<=≤<=109). Write the needed number of flagstones. Sample Input 6 6 4 Sample Output 4	{"inputs": ["6 6 4", "1 1 1", "2 1 1", "1 2 1", "2 2 1", "2 1 2", "1 1 3", "2 3 4", "1000000000 1000000000 1", "12 13 4", "222 332 5", "1000 1000 10", "1001 1000 10", "100 10001 1000000000", "1000000000 1000000000 1000000000", "1000000000 1000000000 999999999", "1000000000 1000000000 192", "1000000000 987654321 1", "456784567 1000000000 51", "39916800 134217728 40320"], "outputs": ["4", "1", "2", "2", "4", "1", "1", "1", "1000000000000000000", "12", "3015", "10000", "10100", "1", "1", "4", "27126743055556", "987654321000000000", "175618850864484", "3295710"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2,260	codeforces
7451485ce70557064845f1b022da2b0b	Elevator	And now the numerous qualifying tournaments for one of the most prestigious Russian contests Russian Codec Cup are over. All n participants who have made it to the finals found themselves in a huge m-floored 108-star hotel. Of course the first thought to come in a place like this is "How about checking out the elevator?". The hotel's elevator moves between floors according to one never changing scheme. Initially (at the moment of time 0) the elevator is located on the 1-st floor, then it moves to the 2-nd floor, then — to the 3-rd floor and so on until it reaches the m-th floor. After that the elevator moves to floor m<=-<=1, then to floor m<=-<=2, and so on until it reaches the first floor. This process is repeated infinitely. We know that the elevator has infinite capacity; we also know that on every floor people get on the elevator immediately. Moving between the floors takes a unit of time. For each of the n participant you are given si, which represents the floor where the i-th participant starts, fi, which represents the floor the i-th participant wants to reach, and ti, which represents the time when the i-th participant starts on the floor si. For each participant print the minimum time of his/her arrival to the floor fi. If the elevator stops on the floor si at the time ti, then the i-th participant can enter the elevator immediately. If the participant starts on the floor si and that's the floor he wanted to reach initially (si<==<=fi), then the time of arrival to the floor fi for this participant is considered equal to ti. The first line contains two space-separated integers n and m (1<=≤<=n<=≤<=105,<=2<=≤<=m<=≤<=108). Next n lines contain information about the participants in the form of three space-separated integers si fi ti (1<=≤<=si,<=fi<=≤<=m,<=0<=≤<=ti<=≤<=108), described in the problem statement. Print n lines each containing one integer — the time of the arrival for each participant to the required floor. Sample Input 7 4 2 4 3 1 2 0 2 2 0 1 2 1 4 3 5 1 2 2 4 2 0 5 5 1 5 4 1 3 1 1 3 4 3 1 5 4 2 5 Sample Output 9 1 0 7 10 7 5 12 10 10 8 7	{"inputs": ["7 4\n2 4 3\n1 2 0\n2 2 0\n1 2 1\n4 3 5\n1 2 2\n4 2 0", "5 5\n1 5 4\n1 3 1\n1 3 4\n3 1 5\n4 2 5", "5 5\n1 3 4\n4 4 2\n3 2 1\n2 4 0\n1 5 3", "8 5\n2 2 91\n5 1 97\n5 1 36\n5 4 19\n2 5 50\n4 2 1\n1 4 9\n3 2 32", "7 5\n2 2 85\n4 3 76\n4 1 17\n5 4 70\n2 5 3\n3 3 14\n3 1 51", "5 2\n1 2 0\n2 1 1\n2 2 0\n2 2 5\n2 1 4", "1 2\n1 1 3", "2 2\n2 2 3\n2 1 5", "3 4\n2 4 7\n3 3 1\n2 2 9", "2 100000000\n2 1 3\n99999999 100000000 100000000"], "outputs": ["9\n1\n0\n7\n10\n7\n5", "12\n10\n10\n8\n7", "10\n2\n7\n3\n12", "91\n104\n40\n21\n60\n7\n19\n39", "85\n78\n24\n77\n12\n14\n56", "1\n2\n0\n5\n6", "3", "3\n6", "9\n1\n9", "199999998\n299999997"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	6	codeforces
745a11c35b7aa99d52b544581262721d	Strange Game On Matrix	Ivan is playing a strange game. He has a matrix a with n rows and m columns. Each element of the matrix is equal to either 0 or 1. Rows and columns are 1-indexed. Ivan can replace any number of ones in this matrix with zeroes. After that, his score in the game will be calculated as follows: 1. Initially Ivan's score is 0; 1. In each column, Ivan will find the topmost 1 (that is, if the current column is j, then he will find minimum i such that ai,<=j<==<=1). If there are no 1's in the column, this column is skipped; 1. Ivan will look at the next min(k,<=n<=-<=i<=+<=1) elements in this column (starting from the element he found) and count the number of 1's among these elements. This number will be added to his score. Of course, Ivan wants to maximize his score in this strange game. Also he doesn't want to change many elements, so he will replace the minimum possible number of ones with zeroes. Help him to determine the maximum possible score he can get and the minimum possible number of replacements required to achieve that score. The first line contains three integer numbers n, m and k (1<=≤<=k<=≤<=n<=≤<=100, 1<=≤<=m<=≤<=100). Then n lines follow, i-th of them contains m integer numbers — the elements of i-th row of matrix a. Each number is either 0 or 1. Print two numbers: the maximum possible score Ivan can get and the minimum number of replacements required to get this score. Sample Input 4 3 2 0 1 0 1 0 1 0 1 0 1 1 1 3 2 1 1 0 0 1 0 0 Sample Output 4 1 2 0	{"inputs": ["4 3 2\n0 1 0\n1 0 1\n0 1 0\n1 1 1", "3 2 1\n1 0\n0 1\n0 0", "3 4 2\n0 1 1 1\n1 0 1 1\n1 0 0 1", "3 57 3\n1 0 0 1 1 0 1 1 0 0 0 0 1 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 0 0 0 1 1 0 0 1 0 0 0 1 1 0 0 1 0\n1 1 0 0 0 1 1 1 0 1 1 0 0 0 0 1 1 0 0 1 0 0 1 1 1 0 1 0 0 0 0 1 1 1 0 0 0 1 0 1 0 0 0 1 1 0 0 0 1 1 0 0 1 1 0 0 0\n1 0 1 0 0 1 1 0 1 0 0 0 1 0 1 0 1 0 1 1 1 1 0 1 0 0 0 1 1 1 1 0 1 1 1 0 1 0 0 0 0 0 0 1 1 1 1 0 1 1 1 0 0 1 1 0 1", "1 1 1\n1", "1 1 1\n0", "2 2 1\n0 1\n1 0", "100 1 20\n0\n0\n0\n1\n1\n0\n0\n0\n1\n1\n0\n1\n0\n1\n1\n0\n1\n1\n0\n1\n0\n1\n1\n0\n1\n0\n1\n0\n0\n0\n0\n0\n1\n0\n0\n0\n0\n1\n1\n0\n1\n0\n1\n1\n1\n0\n0\n0\n0\n1\n1\n1\n0\n0\n0\n0\n0\n1\n0\n0\n1\n1\n1\n1\n1\n0\n0\n1\n0\n1\n0\n1\n0\n1\n0\n0\n0\n1\n1\n1\n1\n1\n1\n0\n0\n1\n1\n0\n1\n0\n0\n0\n0\n1\n1\n1\n1\n1\n0\n1", "1 100 1\n0 0 1 1 1 0 1 0 0 0 0 0 1 1 0 0 0 0 1 1 0 1 1 0 0 1 1 0 0 1 1 1 1 1 0 1 1 1 1 1 1 0 0 1 1 0 1 1 1 1 1 0 1 0 1 0 1 0 1 0 1 1 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 1 1 1 1 1 0 0 1 0 1 1 1 0 1 0 0 1 0 0 1 1 1"], "outputs": ["4 1", "2 0", "7 0", "80 0", "1 0", "0 0", "2 0", "13 34", "53 0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	37	codeforces
745d4711d6cd7d0f3f5f9cb57cbb1ba9	Elephant	An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point x(x<=><=0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house. The first line of the input contains an integer x (1<=≤<=x<=≤<=1<=000<=000) — The coordinate of the friend's house. Print the minimum number of steps that elephant needs to make to get from point 0 to point x. Sample Input 5 12 Sample Output 1 3	{"inputs": ["5", "12", "999999", "41", "1000000", "1", "2", "3", "4", "534204", "469569", "502877", "942212", "97", "53", "89", "574", "716", "729", "8901", "3645", "4426", "46573", "86380", "94190", "999990", "999991", "999992", "999993", "999994", "999995", "999996", "999997", "999998"], "outputs": ["1", "3", "200000", "9", "200000", "1", "1", "1", "1", "106841", "93914", "100576", "188443", "20", "11", "18", "115", "144", "146", "1781", "729", "886", "9315", "17276", "18838", "199998", "199999", "199999", "199999", "199999", "199999", "200000", "200000", "200000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	759	codeforces
74746b6772a19f1dff2accd003348e03	Sonya and Robots	Since Sonya is interested in robotics too, she decided to construct robots that will read and recognize numbers. Sonya has drawn $n$ numbers in a row, $a_i$ is located in the $i$-th position. She also has put a robot at each end of the row (to the left of the first number and to the right of the last number). Sonya will give a number to each robot (they can be either same or different) and run them. When a robot is running, it is moving toward to another robot, reading numbers in the row. When a robot is reading a number that is equal to the number that was given to that robot, it will turn off and stay in the same position. Sonya does not want robots to break, so she will give such numbers that robots will stop before they meet. That is, the girl wants them to stop at different positions so that the first robot is to the left of the second one. For example, if the numbers $[1, 5, 4, 1, 3]$ are written, and Sonya gives the number $1$ to the first robot and the number $4$ to the second one, the first robot will stop in the $1$-st position while the second one in the $3$-rd position. In that case, robots will not meet each other. As a result, robots will not be broken. But if Sonya gives the number $4$ to the first robot and the number $5$ to the second one, they will meet since the first robot will stop in the $3$-rd position while the second one is in the $2$-nd position. Sonya understands that it does not make sense to give a number that is not written in the row because a robot will not find this number and will meet the other robot. Sonya is now interested in finding the number of different pairs that she can give to robots so that they will not meet. In other words, she wants to know the number of pairs ($p$, $q$), where she will give $p$ to the first robot and $q$ to the second one. Pairs ($p_i$, $q_i$) and ($p_j$, $q_j$) are different if $p_i\neq p_j$ or $q_i\neq q_j$. Unfortunately, Sonya is busy fixing robots that broke after a failed launch. That is why she is asking you to find the number of pairs that she can give to robots so that they will not meet. The first line contains a single integer $n$ ($1\leq n\leq 10^5$) — the number of numbers in a row. The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1\leq a_i\leq 10^5$) — the numbers in a row. Print one number — the number of possible pairs that Sonya can give to robots so that they will not meet. Sample Input 5 1 5 4 1 3 7 1 2 1 1 1 3 2 Sample Output 9 7	{"inputs": ["5\n1 5 4 1 3", "7\n1 2 1 1 1 3 2", "10\n2 2 4 4 3 1 1 2 3 2", "15\n1 2 2 1 2 4 2 1 1 6 6 4 2 5 4", "1\n1"], "outputs": ["9", "7", "14", "20", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	126	codeforces
7483de00921fbbd67ba427bdfb4a54c8	Punctuation	You are given a text that consists of lowercase Latin letters, spaces and punctuation marks (dot, comma, exclamation mark and question mark). A word is defined as a sequence of consecutive Latin letters. Your task is to add spaces to the text by the following rules: - if there is no punctuation mark between two words, then they should be separated by exactly one space - there should be no spaces before each punctuation mark - there should be exactly one space after each punctuation mark It is guaranteed that there is at least one word between any two punctuation marks. The text begins and ends with a Latin letter. The input data contains of a single non-empty line — the text whose length is no more than 10000 characters. Print the text, edited according to the rules. In this problem you should follow the output format very strictly. For example, extra space at the end of the output line is considered as wrong answer. Note that a newline character at the end of the line doesn't matter. Sample Input galileo galilei was an italian physicist ,mathematician,astronomer galileo was born in pisa Sample Output galileo galilei was an italian physicist, mathematician, astronomer galileo was born in pisa	{"inputs": ["galileo galilei was an italian physicist ,mathematician,astronomer", "galileo was born in pisa", "jkhksdfhsdfsf", "a a a a a", "ksdfk sdlfsdf sdf sdf sdf", "gdv", "incen q", "k ? gq dad", "ntomzzut !pousysvfg ,rnl mcyytihe hplnqnb", "mck . gq dauqminf wee bazyzy humnv d pgtvx , vxntxgrkrc rg rwr, uuyweyz l", "jjcmhwnon taetfgdvc, ysrajurstj ! fryavybwpg hnxbnsron ,txplbmm atw?wkfhn ez mcdn tujsy wrdhw . k i lzwtxcyam fi . nyeu j", "chcf htb flfwkosmda a qygyompixkgz ?rg? hdw f dsvqzs kxvjt ? zj zghgarwihw zgrhr xlwmhv . lycpsmdm iotv . d jhsxoogbr ! ppgrpwcrcl inw usegrtd ?fexma ? mhszrvdoa ,audsrhina epoleuq oaz hqapedl lm", "cutjrjhf x megxzdtbrw bq!drzsvsvcdd ukydvulxgz! tmacmcwoay xyyx v ajrhsvxm sy boce kbpshtbija phuxfhw hfpb do ? z yb aztpydzwjf. fjhihoei !oyenq !heupilvm whemii mtt kbjh hvtfv pr , s , h swtdils jcppog . nyl ? zier is ? xibbv exufvjjgn. yiqhmrp opeeimxlmv krxa crc czqwnka psfsjvou nywayqoec .t , kjtpg d ?b ? zb", "ajdwlf ibvlfqadt sqdn aoj nsjtivfrsp !mquqfgzrbp w ow aydap ry s . jwlvg ? ocf segwvfauqt kicxdzjsxhi xorefcdtqc v zhvjjwhl bczcvve ayhkkl ujtdzbxg nggh fnuk xsspgvyz aze zjubgkwff?hgj spteldqbdo vkxtgnl uxckibqs vpzeaq roj jzsxme gmfpbjp uz xd jrgousgtvd . muozgtktxi ! c . vdma hzhllqwg . daq? rhvp shwrlrjmgx ggq eotbiqlcse . rfklcrpzvw ?ieitcaby srinbwso gs oelefwq xdctsgxycn yxbbusqe.eyd .zyo", "x", "xx", "x x", "x,x", "x.x", "x!x", "x?x", "a!b", "a, a", "physicist ?mathematician.astronomer", "dfgdfg ? ddfgdsfg ? dsfgdsfgsdfgdsf ! dsfg . sd dsg sdg ! sdfg", "jojo ! majo , hehehehe? jo . kok", "adskfj,kjdf?kjadf kj!kajs f", "a , b", "ahmed? ahmed ? ahmed ?ahmed", "kjdsf, kdjf?kjdf!kj kdjf", "italian physicist .mathematician?astronomer", "galileo galilei was an italian physicist , mathematician,astronomer", "z zz zz z z! z z aksz zkjsdfz kajfz z !akj , zz a z", "jojo ! maja . jaooo", "a ! b", "fff , fff", "a!a?a ! a ? a", "a!a", "a!a a ! a ? a ! a , a . a", "casa?mesa, y unos de , los sapotes?l", "ff ! ff", "i love evgenia ! x", "galileo galilei was an italian physicist ,mathematician,astronomer?asdf ?asdfff?asdf. asdf.dfd .dfdf ? df d! sdf dsfsa sdf ! asdf ? sdfsdf, dfg a ! b ?a", "a , a", "x, werwr, werwerwr we,rwer ,wer", "abcabc, abcabc", "i love evgenia x! x", "gg gg,h,h,j,i,jh , jjj , jj ,aadd , jjj jjj", "mt test ! case", "dolphi ! nigle", "asdasdasd.asdasdasdasd?asdasdasd!asdasdasd,asdasdasdasd", "x, x, ds ,ertert, ert, et et", "anton!love ?yourself", "facepalm ? yes , lol ! yeah", "a ! a", "adf!kadjf?kajdf,lkdas. kd ! akdjf", "a? x", "read problem carefully ! heh", "a?a?a?a.a", "a. v", "a!a a ! a ? a ! a , a . a aaaaaa ! a ! a. a a .a a.a aa.aa aa . aa aa .aa aa. aa", "a, a", "a!a!a", "a.a.a.a", "a, b", "galileo galilei was an italian physicist, mathematician, astronomer", "a!a!a!a", "af ! kadjf ? kjdfkj!kjadkfjz z z a a! ka,kjf", "ab cd,k", "a!n , to", "dolphi ! nigle", "u, sux"], "outputs": ["galileo galilei was an italian physicist, mathematician, astronomer", "galileo was born in pisa", "jkhksdfhsdfsf", "a a a a a", "ksdfk sdlfsdf sdf sdf sdf", "gdv", "incen q", "k? gq dad", "ntomzzut! pousysvfg, rnl mcyytihe hplnqnb", "mck. gq dauqminf wee bazyzy humnv d pgtvx, vxntxgrkrc rg rwr, uuyweyz l", "jjcmhwnon taetfgdvc, ysrajurstj! fryavybwpg hnxbnsron, txplbmm atw? wkfhn ez mcdn tujsy wrdhw. k i lzwtxcyam fi. nyeu j", "chcf htb flfwkosmda a qygyompixkgz? rg? hdw f dsvqzs kxvjt? zj zghgarwihw zgrhr xlwmhv. lycpsmdm iotv. d jhsxoogbr! ppgrpwcrcl inw usegrtd? fexma? mhszrvdoa, audsrhina epoleuq oaz hqapedl lm", "cutjrjhf x megxzdtbrw bq! drzsvsvcdd ukydvulxgz! tmacmcwoay xyyx v ajrhsvxm sy boce kbpshtbija phuxfhw hfpb do? z yb aztpydzwjf. fjhihoei! oyenq! heupilvm whemii mtt kbjh hvtfv pr, s, h swtdils jcppog. nyl? zier is? xibbv exufvjjgn. yiqhmrp opeeimxlmv krxa crc czqwnka psfsjvou nywayqoec. t, kjtpg d? b? zb", "ajdwlf ibvlfqadt sqdn aoj nsjtivfrsp! mquqfgzrbp w ow aydap ry s. jwlvg? ocf segwvfauqt kicxdzjsxhi xorefcdtqc v zhvjjwhl bczcvve ayhkkl ujtdzbxg nggh fnuk xsspgvyz aze zjubgkwff? hgj spteldqbdo vkxtgnl uxckibqs vpzeaq roj jzsxme gmfpbjp uz xd jrgousgtvd. muozgtktxi! c. vdma hzhllqwg. daq? rhvp shwrlrjmgx ggq eotbiqlcse. rfklcrpzvw? ieitcaby srinbwso gs oelefwq xdctsgxycn yxbbusqe. eyd. zyo", "x", "xx", "x x", "x, x", "x. x", "x! x", "x? x", "a! b", "a, a", "physicist? mathematician. astronomer", "dfgdfg? ddfgdsfg? dsfgdsfgsdfgdsf! dsfg. sd dsg sdg! sdfg", "jojo! majo, hehehehe? jo. kok", "adskfj, kjdf? kjadf kj! kajs f", "a, b", "ahmed? ahmed? ahmed? ahmed", "kjdsf, kdjf? kjdf! kj kdjf", "italian physicist. mathematician? astronomer", "galileo galilei was an italian physicist, mathematician, astronomer", "z zz zz z z! z z aksz zkjsdfz kajfz z! akj, zz a z", "jojo! maja. jaooo", "a! b", "fff, fff", "a! a? a! a? a", "a! a", "a! a a! a? a! a, a. a", "casa? mesa, y unos de, los sapotes? l", "ff! ff", "i love evgenia! x", "galileo galilei was an italian physicist, mathematician, astronomer? asdf? asdfff? asdf. asdf. dfd. dfdf? df d! sdf dsfsa sdf! asdf? sdfsdf, dfg a! b? a", "a, a", "x, werwr, werwerwr we, rwer, wer", "abcabc, abcabc", "i love evgenia x! x", "gg gg, h, h, j, i, jh, jjj, jj, aadd, jjj jjj", "mt test! case", "dolphi! nigle", "asdasdasd. asdasdasdasd? asdasdasd! asdasdasd, asdasdasdasd", "x, x, ds, ertert, ert, et et", "anton! love? yourself", "facepalm? yes, lol! yeah", "a! a", "adf! kadjf? kajdf, lkdas. kd! akdjf", "a? x", "read problem carefully! heh", "a? a? a? a. a", "a. v", "a! a a! a? a! a, a. a aaaaaa! a! a. a a. a a. a aa. aa aa. aa aa. aa aa. aa", "a, a", "a! a! a", "a. a. a. a", "a, b", "galileo galilei was an italian physicist, mathematician, astronomer", "a! a! a! a", "af! kadjf? kjdfkj! kjadkfjz z z a a! ka, kjf", "ab cd, k", "a! n, to", "dolphi! nigle", "u, sux"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	44	codeforces
74957bef0ae6692daca852a9741e1138	Traveling Graph	You are given undirected weighted graph. Find the length of the shortest cycle which starts from the vertex 1 and passes throught all the edges at least once. Graph may contain multiply edges between a pair of vertices and loops (edges from the vertex to itself). The first line of the input contains two integers n and m (1<=≤<=n<=≤<=15,<=0<=≤<=m<=≤<=2000), n is the amount of vertices, and m is the amount of edges. Following m lines contain edges as a triples x,<=y,<=w (1<=≤<=x,<=y<=≤<=n,<=1<=≤<=w<=≤<=10000), x,<=y are edge endpoints, and w is the edge length. Output minimal cycle length or -1 if it doesn't exists. Sample Input 3 3 1 2 1 2 3 1 3 1 1 3 2 1 2 3 2 3 4 Sample Output 3 14	{"inputs": ["4 6\n1 2 10\n2 3 1000\n3 4 10\n4 1 1000\n4 2 5000\n1 3 2", "2 9\n1 2 9\n1 2 9\n2 1 9\n1 2 8\n2 1 9\n1 2 9\n1 2 9\n1 2 11\n1 2 9", "2 10\n1 2 9\n1 2 9\n2 1 9\n1 2 8\n2 1 9\n1 2 9\n1 2 9\n1 2 11\n1 2 9\n1 2 9", "15 14\n1 2 1\n2 3 1\n2 4 1\n3 5 1\n3 6 1\n4 7 1\n4 8 1\n5 9 1\n5 10 1\n6 11 1\n6 12 1\n7 13 1\n7 14 1\n8 15 1", "4 5\n1 2 3\n2 3 4\n3 4 5\n1 4 10\n1 3 12", "4 5\n1 2 3\n2 3 4\n3 4 5\n1 4 10\n1 3 12", "5 0", "1 0", "1 1\n1 1 44", "1 2\n1 1 5\n1 1 3", "2 0", "2 1\n2 1 3", "2 1\n1 1 3", "2 1\n2 2 44", "2 2\n1 1 44\n2 2 44", "2 3\n1 1 1\n2 2 2\n2 1 3", "7 3\n4 4 1\n7 7 1\n2 2 1", "15 0", "4 2\n1 2 1\n3 4 1", "7 1\n3 4 4", "2 1\n2 2 5741", "2 2\n2 1 4903\n1 1 4658", "2 4\n1 2 7813\n2 1 6903\n1 2 6587\n2 2 7372", "2 8\n1 2 4618\n1 1 6418\n2 2 2815\n1 1 4077\n2 1 4239\n1 2 5359\n1 2 3971\n1 2 7842", "3 1\n3 2 6145", "3 2\n1 1 1169\n1 2 1250", "3 4\n1 1 5574\n3 1 5602\n3 2 5406\n2 1 5437", "3 8\n3 3 9507\n2 1 9560\n3 3 9328\n2 2 9671\n2 2 9641\n1 2 9717\n1 3 9535\n1 2 9334", "4 1\n1 3 3111", "4 2\n3 2 6816\n1 3 7161", "4 4\n1 3 1953\n3 2 2844\n1 3 2377\n3 2 2037", "4 8\n1 2 4824\n3 1 436\n2 2 3087\n2 4 2955\n2 4 2676\n4 3 2971\n3 4 3185\n3 1 3671", "5 1\n5 5 1229", "5 2\n2 2 2515\n2 4 3120", "5 4\n5 1 404\n3 1 551\n1 1 847\n5 1 706", "5 8\n1 5 1016\n4 5 918\n1 4 926\n2 3 928\n5 4 994\n2 3 1007\n1 4 946\n3 4 966", "6 1\n3 6 2494", "6 2\n5 3 5039\n2 3 4246", "6 4\n5 4 6847\n3 6 7391\n1 6 7279\n2 5 7250", "6 8\n2 4 8044\n6 4 7952\n2 5 6723\n6 4 8105\n1 5 6648\n1 6 6816\n1 3 7454\n5 3 6857", "15 1\n7 5 7838", "15 2\n5 13 9193\n14 5 9909", "15 4\n1 5 5531\n9 15 3860\n8 4 6664\n13 3 4320", "15 8\n14 6 9084\n1 12 8967\n11 12 8866\n12 2 8795\n7 10 9102\n10 12 9071\n12 10 9289\n4 11 8890", "15 16\n3 3 2551\n6 11 2587\n2 4 2563\n3 6 2569\n3 1 2563\n4 11 2487\n7 15 2580\n7 14 2534\n10 7 2530\n3 5 2587\n5 14 2596\n14 14 2556\n15 9 2547\n12 4 2586\n6 8 2514\n2 12 2590", "15 32\n15 9 8860\n12 4 9045\n12 12 8221\n9 6 8306\n11 14 9052\n13 14 8176\n14 5 8857\n6 8 8835\n3 9 8382\n10 14 8212\n13 13 9061\n2 14 8765\n4 13 9143\n13 13 8276\n13 11 8723\n7 10 8775\n8 15 8965\n15 5 8800\n4 5 9317\n5 13 9178\n1 7 9031\n4 10 9114\n10 4 8628\n9 1 8584\n5 7 8701\n6 15 8177\n3 3 9325\n4 5 9003\n7 5 9308\n8 9 8307\n12 13 8547\n7 7 8209"], "outputs": ["7042", "90", "91", "28", "41", "41", "0", "0", "44", "8", "0", "6", "3", "-1", "-1", "9", "-1", "0", "-1", "-1", "-1", "14464", "35262", "43310", "-1", "3669", "22019", "95162", "6222", "27954", "9211", "28629", "-1", "-1", "3059", "9683", "-1", "-1", "-1", "73199", "-1", "-1", "-1", "-1", "69034", "315043"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
74b1be24aae77b05b2d4dbcef091a8da	Spiders	One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjured a cunning plan: he will glue all the spiders together and attach them to the ceiling. Besides, Petya knows that the lower the spiders will hang, the more mum is going to like it and then she won't throw his favourite toys away. Help Petya carry out the plan. A spider consists of k beads tied together by k<=-<=1 threads. Each thread connects two different beads, at that any pair of beads that make up a spider is either directly connected by a thread, or is connected via some chain of threads and beads. Petya may glue spiders together directly gluing their beads. The length of each thread equals 1. The sizes of the beads can be neglected. That's why we can consider that gluing spiders happens by identifying some of the beads (see the picture). Besides, the construction resulting from the gluing process should also represent a spider, that is, it should have the given features. After Petya glues all spiders together, he measures the length of the resulting toy. The distance between a pair of beads is identified as the total length of the threads that connect these two beads. The length of the resulting construction is the largest distance between all pairs of beads. Petya wants to make the spider whose length is as much as possible. The picture two shows two spiders from the second sample. We can glue to the bead number 2 of the first spider the bead number 1 of the second spider. The threads in the spiders that form the sequence of threads of maximum lengths are highlighted on the picture. The first input file line contains one integer n (1<=≤<=n<=≤<=100) — the number of spiders. Next n lines contain the descriptions of each spider: integer ni (2<=≤<=ni<=≤<=100) — the number of beads, then ni<=-<=1 pairs of numbers denoting the numbers of the beads connected by threads. The beads that make up each spider are numbered from 1 to ni. Print a single number — the length of the required construction. Sample Input 1 3 1 2 2 3 2 3 1 2 1 3 4 1 2 2 3 2 4 2 5 1 2 2 3 3 4 3 5 7 3 4 1 2 2 4 4 6 2 7 6 5 Sample Output 2 4 7	{"inputs": ["1\n3 1 2 2 3", "2\n3 1 2 1 3\n4 1 2 2 3 2 4", "2\n5 1 2 2 3 3 4 3 5\n7 3 4 1 2 2 4 4 6 2 7 6 5", "3\n3 1 2 2 3\n5 2 5 5 3 3 4 5 1\n9 6 5 5 9 4 8 4 7 2 1 2 6 2 4 6 3", "7\n2 2 1\n4 1 4 2 3 1 2\n3 3 1 3 2\n5 1 4 3 5 1 2 1 3\n6 4 5 1 3 4 2 3 6 5 1\n7 1 3 3 6 7 4 7 1 5 2 3 5\n10 6 8 2 6 6 3 2 7 2 4 6 10 3 1 6 5 6 9", "10\n3 1 2 1 3\n3 1 2 1 3\n7 1 2 1 3 3 4 7 5 1 6 5 1\n2 1 2\n4 4 3 3 1 4 2\n3 3 1 3 2\n5 4 2 5 1 3 5 3 4\n6 1 6 2 4 6 2 4 3 5 1\n7 2 4 4 6 7 3 3 1 3 5 2 7\n10 3 5 5 6 1 9 5 2 7 8 8 1 6 10 4 3 4 7", "7\n4 2 3 4 1 2 4\n4 4 3 2 1 3 2\n3 2 1 2 3\n5 5 4 1 5 1 2 2 3\n6 1 3 4 5 2 6 3 2 1 4\n7 6 4 4 7 6 2 6 3 3 1 6 5\n10 8 10 4 8 5 9 5 6 3 4 3 1 5 3 4 7 1 2", "7\n2 1 2\n4 4 1 1 2 4 3\n3 3 2 2 1\n5 4 1 1 5 4 3 1 2\n6 4 2 3 1 3 4 3 5 3 6\n8 7 4 6 2 6 7 4 5 4 1 1 3 6 8\n10 4 1 8 9 7 8 2 4 8 6 6 5 2 7 8 3 7 10", "3\n4 3 2 3 1 1 4\n4 3 1 2 4 3 2\n4 1 4 2 1 4 3", "3\n10 7 3 10 9 7 10 4 7 8 6 8 2 4 8 8 5 5 1\n12 10 3 11 4 11 9 12 1 10 12 8 7 8 11 6 5 10 6 10 2 6 8\n13 3 7 10 4 3 8 3 1 8 5 4 12 9 2 8 6 10 9 1 10 10 11 4 13", "4\n5 3 2 3 5 4 1 4 3\n6 6 4 1 2 2 3 2 6 6 5\n7 6 1 6 4 4 5 1 7 4 3 2 6\n8 2 1 6 8 4 5 8 3 4 7 4 2 2 6", "2\n10 8 1 6 7 10 8 7 5 3 4 5 3 9 2 6 9 2 10\n10 9 7 6 1 8 10 6 4 8 3 9 2 3 5 8 9 3 6", "6\n3 1 3 1 2\n3 2 1 3 2\n5 2 5 5 1 2 3 2 4\n4 2 3 2 4 1 2\n5 2 3 2 1 3 5 2 4\n5 3 5 2 3 5 1 4 2", "1\n50 4 37 49 41 40 10 23 14 35 3 39 46 40 8 11 35 32 17 3 7 25 47 17 27 49 1 28 9 6 38 41 29 22 13 38 16 4 48 4 21 13 23 49 30 35 44 25 34 25 18 31 50 21 6 32 19 19 28 22 42 39 25 22 26 21 40 21 33 21 39 14 43 3 15 17 2 19 12 26 24 28 5 22 11 4 20 10 45 48 36 4 22 4 32 4 31 39 49", "4\n10 9 5 9 7 7 6 7 2 1 4 9 1 7 3 2 10 3 8\n10 9 10 2 5 3 6 5 7 9 3 9 1 9 2 2 8 2 4\n10 5 3 2 5 1 6 6 8 3 9 3 10 5 1 8 4 3 7\n10 7 6 3 1 8 10 2 3 2 7 5 9 10 5 1 4 2 8"], "outputs": ["2", "4", "7", "10", "23", "36", "26", "23", "9", "18", "15", "14", "16", "10", "23"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	14	codeforces
74c7eb05a7a7c46fb862f9ab7cfa58e0	Mashmokh and Tokens	Bimokh is Mashmokh's boss. For the following n days he decided to pay to his workers in a new way. At the beginning of each day he will give each worker a certain amount of tokens. Then at the end of each day each worker can give some of his tokens back to get a certain amount of money. The worker can save the rest of tokens but he can't use it in any other day to get more money. If a worker gives back w tokens then he'll get dollars. Mashmokh likes the tokens however he likes money more. That's why he wants to save as many tokens as possible so that the amount of money he gets is maximal possible each day. He has n numbers x1,<=x2,<=...,<=xn. Number xi is the number of tokens given to each worker on the i-th day. Help him calculate for each of n days the number of tokens he can save. The first line of input contains three space-separated integers n,<=a,<=b (1<=≤<=n<=≤<=105; 1<=≤<=a,<=b<=≤<=109). The second line of input contains n space-separated integers x1,<=x2,<=...,<=xn (1<=≤<=xi<=≤<=109). Output n space-separated integers. The i-th of them is the number of tokens Mashmokh can save on the i-th day. Sample Input 5 1 4 12 6 11 9 1 3 1 2 1 2 3 1 1 1 1 Sample Output 0 2 3 1 1 1 0 1 0	{"inputs": ["5 1 4\n12 6 11 9 1", "3 1 2\n1 2 3", "1 1 1\n1", "1 1 1000000000\n1000000000", "1 1 1000000000\n999999999", "10 1 100000000\n999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999 999999999"], "outputs": ["0 2 3 1 1 ", "1 0 1 ", "0 ", "0 ", "999999999 ", "99999999 99999999 99999999 99999999 99999999 99999999 99999999 99999999 99999999 99999999 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	78	codeforces
750b2e050867ca435456d6232b303fd1	Ivan and Powers of Two	Ivan has got an array of n non-negative integers a1,<=a2,<=...,<=an. Ivan knows that the array is sorted in the non-decreasing order. Ivan wrote out integers 2a1,<=2a2,<=...,<=2an on a piece of paper. Now he wonders, what minimum number of integers of form 2b (b<=≥<=0) need to be added to the piece of paper so that the sum of all integers written on the paper equalled 2v<=-<=1 for some integer v (v<=≥<=0). Help Ivan, find the required quantity of numbers. The first line contains integer n (1<=≤<=n<=≤<=105). The second input line contains n space-separated integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=2·109). It is guaranteed that a1<=≤<=a2<=≤<=...<=≤<=an. Print a single integer — the answer to the problem. Sample Input 4 0 1 1 1 1 3 Sample Output 0 3	{"inputs": ["4\n0 1 1 1", "1\n3", "1\n0", "1\n2000000000", "1\n1", "26\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 2"], "outputs": ["0", "3", "0", "2000000000", "1", "5"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	20	codeforces
752107aaa1473f689aaa56e39034671e	Timofey and cubes	Young Timofey has a birthday today! He got kit of n cubes as a birthday present from his parents. Every cube has a number ai, which is written on it. Timofey put all the cubes in a row and went to unpack other presents. In this time, Timofey's elder brother, Dima reordered the cubes using the following rule. Suppose the cubes are numbered from 1 to n in their order. Dima performs several steps, on step i he reverses the segment of cubes from i-th to (n<=-<=i<=+<=1)-th. He does this while i<=≤<=n<=-<=i<=+<=1. After performing the operations Dima went away, being very proud of himself. When Timofey returned to his cubes, he understood that their order was changed. Help Timofey as fast as you can and save the holiday — restore the initial order of the cubes using information of their current location. The first line contains single integer n (1<=≤<=n<=≤<=2·105) — the number of cubes. The second line contains n integers a1,<=a2,<=...,<=an (<=-<=109<=≤<=ai<=≤<=109), where ai is the number written on the i-th cube after Dima has changed their order. Print n integers, separated by spaces — the numbers written on the cubes in their initial order. It can be shown that the answer is unique. Sample Input 7 4 3 7 6 9 1 2 8 6 1 4 2 5 6 9 2 Sample Output 2 3 9 6 7 1 42 1 6 2 5 4 9 6	{"inputs": ["7\n4 3 7 6 9 1 2", "8\n6 1 4 2 5 6 9 2", "1\n1424", "9\n-7 9 -4 9 -6 11 15 2 -10", "2\n21968 5686", "5\n241218936 -825949895 -84926813 491336344 -872198236", "42\n-557774624 828320986 -345782722 -62979938 -681259411 -945983652 -139095040 832293378 -82572118 432027535 88438103 568183540 961782904 73543295 615958219 -5050584 322982437 -146046730 759453379 129267920 -819827396 -348156048 805080102 390723009 -771277251 -79011872 -592313207 528489973 656201270 -127795621 17284747 145139617 -565641608 83452176 -223074608 545811186 -657981923 -204657836 154779765 -476867246 180386291 202782486", "2\n1 2", "6\n1 2 3 4 5 6", "4\n0 1 2 3", "10\n1 2 3 4 5 6 7 8 9 10", "2\n4 5", "2\n1 5", "2\n2 5", "2\n3 4", "2\n10 0", "66\n8229 5299 5562 1259 2258 1126 5026 8796 3497 7111 6680 1180 1426 4821 3322 3502 400 2951 4187 417 5234 1266 7525 7648 417 9297 174 670 1790 4121 9737 938 4616 3402 2009 2461 474 3728 327 3353 9773 6818 8781 874 2209 1260 1647 6126 9287 9638 5049 1256 4459 863 1835 4822 6809 348 5053 7784 6927 2140 9173 7817 5095 4184"], "outputs": ["2 3 9 6 7 1 4", "2 1 6 2 5 4 9 6", "1424", "-10 9 15 9 -6 11 -4 2 -7", "5686 21968", "-872198236 -825949895 -84926813 491336344 241218936", "202782486 828320986 -476867246 -62979938 -204657836 -945983652 545811186 832293378 83452176 432027535 145139617 568183540 -127795621 73543295 528489973 -5050584 -79011872 -146046730 390723009 129267920 -348156048 -819827396 805080102 759453379 -771277251 322982437 -592313207 615958219 656201270 961782904 17284747 88438103 -565641608 -82572118 -223074608 -139095040 -657981923 -681259411 154779765 -345782722 180386291 -557774624", "2 1", "6 2 4 3 5 1", "3 1 2 0", "10 2 8 4 6 5 7 3 9 1", "5 4", "5 1", "5 2", "4 3", "0 10", "4184 5299 7817 1259 2140 1126 7784 8796 348 7111 4822 1180 863 4821 1256 3502 9638 2951 6126 417 1260 1266 874 7648 6818 9297 3353 670 3728 4121 2461 938 3402 4616 2009 9737 474 1790 327 174 9773 417 8781 7525 2209 5234 1647 4187 9287 400 5049 3322 4459 1426 1835 6680 6809 3497 5053 5026 6927 2258 9173 5562 5095 8229"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	222	codeforces
7541acbed93b5dd57610e64bd1571264	Lazy Security Guard	Your security guard friend recently got a new job at a new security company. The company requires him to patrol an area of the city encompassing exactly N city blocks, but they let him choose which blocks. That is, your friend must walk the perimeter of a region whose area is exactly N blocks. Your friend is quite lazy and would like your help to find the shortest possible route that meets the requirements. The city is laid out in a square grid pattern, and is large enough that for the sake of the problem it can be considered infinite. Input will consist of a single integer N (1<=≤<=N<=≤<=106), the number of city blocks that must be enclosed by the route. Print the minimum perimeter that can be achieved. Sample Input 4 11 22 Sample Output 8 14 20	{"inputs": ["4", "11", "22", "3", "1024", "101", "30", "1000000", "1", "2", "5", "6", "7", "8", "9", "10", "999000", "999001", "999999", "933206", "718351", "607443", "347887", "246206", "151375", "12639", "3751", "3607", "124", "64", "31", "23", "15", "19", "59637"], "outputs": ["8", "14", "20", "8", "128", "42", "22", "4000", "4", "6", "10", "10", "12", "12", "12", "14", "3998", "4000", "4000", "3866", "3392", "3118", "2360", "1986", "1558", "450", "246", "242", "46", "32", "24", "20", "16", "18", "978"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	224	codeforces
754c9237727a83ab77d875525e1bac65	Pie Rules	You may have heard of the pie rule before. It states that if two people wish to fairly share a slice of pie, one person should cut the slice in half, and the other person should choose who gets which slice. Alice and Bob have many slices of pie, and rather than cutting the slices in half, each individual slice will be eaten by just one person. The way Alice and Bob decide who eats each slice is as follows. First, the order in which the pies are to be handed out is decided. There is a special token called the "decider" token, initially held by Bob. Until all the pie is handed out, whoever has the decider token will give the next slice of pie to one of the participants, and the decider token to the other participant. They continue until no slices of pie are left. All of the slices are of excellent quality, so each participant obviously wants to maximize the total amount of pie they get to eat. Assuming both players make their decisions optimally, how much pie will each participant receive? Input will begin with an integer N (1<=≤<=N<=≤<=50), the number of slices of pie. Following this is a line with N integers indicating the sizes of the slices (each between 1 and 100000, inclusive), in the order in which they must be handed out. Print two integers. First, the sum of the sizes of slices eaten by Alice, then the sum of the sizes of the slices eaten by Bob, assuming both players make their decisions optimally. Sample Input 3 141 592 653 5 10 21 10 21 10 Sample Output 653 733 31 41	{"inputs": ["3\n141 592 653", "5\n10 21 10 21 10", "1\n100000", "50\n100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000 100000", "2\n1 100000", "17\n1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536", "15\n3026 3027 4599 4854 7086 29504 38709 40467 40663 58674 61008 70794 77517 85547 87320", "30\n2351 14876 66138 87327 29940 73204 19925 50198 13441 54751 1383 92120 90236 13525 3920 16669 80637 94428 54890 71321 77670 57080 82145 39778 69967 38722 46902 82127 1142 21792", "1\n59139", "2\n9859 48096", "3\n25987 64237 88891", "4\n9411 13081 2149 19907", "5\n25539 29221 6895 82089 18673", "6\n76259 10770 87448 3054 67926 81667", "7\n92387 35422 24898 32532 92988 84636 99872", "8\n8515 51563 5451 94713 9537 30709 63343 41819", "9\n91939 407 10197 24191 58791 9486 68030 25807 11", "10\n30518 96518 74071 59971 50121 4862 43967 73607 19138 90754", "11\n46646 21171 78816 89449 99375 50934 15950 90299 18702 62232 12657", "12\n30070 37311 92074 18927 91732 29711 12126 41583 52857 99118 73097 33928", "13\n13494 86155 96820 72596 40986 99976 16813 25571 87013 3301 832 26376 83769", "14\n96918 67704 10077 34778 90239 11457 80284 42263 53872 74779 93976 53416 83860 74518", "15\n13046 83844 14823 64255 15301 90234 84972 93547 88028 11665 54415 13159 83950 951 42336", "16\n29174 32688 95377 26437 64554 60498 56955 10239 22183 15847 47559 40199 92552 70488 4147 73082", "17\n79894 24637 8634 80107 81104 39275 53130 94227 56339 87326 7999 75751 92642 96921 74470 20999 69688", "18\n96022 73481 13380 42288 6166 85348 25113 78215 23198 24212 44246 35494 92733 66459 44793 68916 82818 3967", "19\n79446 55030 93934 39062 88123 88317 21289 62203 57354 28394 37390 95238 92823 92892 39308 16833 54733 51525 58759", "20\n5440 88704 61481 72140 15810 58854 43034 5150 80684 61360 50516 54301 78790 43678 46138 79893 89899 60260 2881 66499", "21\n21569 37548 74739 25809 65063 37631 71913 89138 47543 65542 10956 14045 78880 70111 73357 27810 70326 40523 899 6547 87440", "22\n72289 86393 79484 55287 14317 83704 11192 73126 81699 2429 4100 41085 87482 72352 10976 75727 42240 79569 31621 3492 51189 25936", "23\n88417 11045 92742 84765 6675 86673 40072 57114 15854 6611 40347 76636 87572 66082 38195 56348 89962 59831 29640 43541 14937 73713 52755", "24\n71841 27185 73295 46946 55928 65450 12055 73806 82714 78089 787 36380 87663 68323 75814 4265 94581 31581 51850 40486 11390 21491 27560 22678", "25\n87969 76030 78041 616 13694 11522 84038 25090 16869 14975 61226 96124 20457 62052 70329 76374 42303 11844 15276 37430 99330 77781 35069 64358 45168", "26\n71393 24874 91299 30093 62947 14491 80214 41782 51025 19158 21666 23163 20547 64293 40653 24291 46922 92106 13294 77479 63079 25559 42579 62933 24433 39507", "27\n54817 73719 96044 92275 12201 60564 84901 25770 17884 90636 14810 82907 20637 58023 10976 72208 94644 63856 11312 74424 26828 40632 58600 37316 38290 82420 48297", "28\n70945 22563 76598 21753 4558 39341 48372 77054 52039 27522 75249 18459 96536 60264 5491 20125 42367 44118 42034 38665 47472 88410 66109 78995 52147 68436 9814 71112", "29\n54369 14511 14048 83934 53812 75014 20356 17938 86195 31704 68393 78202 96626 86697 75814 746 46985 15868 40052 11417 11221 44700 40915 53378 98708 78644 4035 20164 37165", "30\n4555 13594 57403 75796 14203 12847 66292 60885 9525 40478 57327 69970 15297 37483 39540 31102 14855 412 84174 57684 65591 19837 80431 18385 3107 87740 15433 24854 73472 88205", "31\n20683 29734 37957 37978 63456 58920 70980 44873 76385 44661 17767 97009 15387 63916 77159 79019 86770 4866 14897 63141 86236 67614 87940 60064 16964 97948 9654 49714 30888 88075 63792", "32\n71403 78578 75406 67455 12710 37697 67155 28861 10540 48843 10911 56753 15477 33453 4378 26936 34492 19720 12915 27382 49984 91200 95449 34448 63525 83964 3875 98767 77905 63753 83018 58084", "33\n87531 27423 55960 53829 37771 40665 39138 12849 77399 53025 71350 83793 48271 59887 41997 74854 14919 24175 43637 24327 13733 38978 2959 319 10086 26876 65393 56332 68025 63623 93732 68354 83938", "34\n70955 19371 60706 50603 54321 86738 11122 29541 11555 57207 31790 19344 24170 29424 36512 22771 86833 4437 41655 64376 34378 19459 86276 74702 23943 69789 59614 48489 49634 63494 12958 11328 69333 1736", "35\n54379 920 41259 12784 3574 98219 40001 80825 45710 61390 24933 79088 24260 23153 6835 94880 67260 76187 39673 28616 98126 10341 26489 49085 37800 55805 86539 97542 39754 30660 32184 64703 11625 77872 63584", "36\n37803 17060 78709 42262 28636 68484 79280 97517 12570 98276 52669 6128 57054 58098 68646 75501 39174 56449 3099 1369 94579 58119 1295 90764 51657 66013 48056 55107 54066 30530 75602 74973 21212 21304 22589 4895", "37\n53932 65904 91967 4443 77890 47261 8160 81505 46725 69754 21621 65871 24440 51828 71673 23418 86896 4008 1117 65610 82519 5897 8804 65148 98218 76221 42277 79968 68379 30401 62125 61052 96207 64737 24698 99495 70720", "38\n70060 14749 72520 58113 2951 26037 80143 32789 80881 73936 82060 92911 24531 78261 9292 71335 91515 8462 31839 62555 46268 29482 92121 31019 12075 94942 36498 96317 58499 30271 81351 71322 81602 8169 26807 69903 38154 20539", "39\n20780 30889 9970 87591 19501 96302 76318 49481 47740 10823 42500 61167 57325 47798 36511 19252 39237 23316 29857 2603 10016 9964 99630 5402 82828 5150 98015 53882 72811 97437 57473 57400 91189 84305 85811 64503 40179 50614 52044", "40\n3670 5779 20621 87964 12595 34136 98063 92429 38366 43789 88330 52934 19100 22776 43342 82312 74404 64756 73980 14278 21283 85101 63339 70409 63034 14245 33606 58571 84927 14931 25355 15452 46072 4671 5838 69121 18243 87783 29748 84047", "41\n87094 21920 58071 41634 29145 45616 94239 76417 5226 47971 48770 79974 19190 25017 37857 30229 11726 12314 71998 54327 85032 8687 46656 12088 9595 24454 27827 7624 66535 14801 44581 25723 55659 48103 75242 39529 52973 17858 16985 41454 44182", "42\n70518 70764 38625 3816 78399 48585 66222 60405 72085 52153 85018 39717 51984 51451 8180 78146 59448 16768 2720 51272 48780 56464 21461 86471 23452 10470 22048 65189 56655 90480 31103 11801 73758 91536 10055 34129 20407 47933 4223 98861 84475 52291", "43\n86646 19609 43370 33293 3460 94658 95101 44393 6241 56335 78161 66757 52074 53692 2695 58767 31363 64326 738 15513 69425 4242 28971 60855 37309 53382 16269 57346 70968 90350 74522 22072 83345 67672 69060 4537 55137 78008 91461 32075 33280 70405 71607", "44\n70070 68453 23924 95475 52714 73435 34380 61085 40396 60518 38601 26501 52165 47421 73018 6684 79085 68781 31460 88265 33173 52020 44992 2534 8062 96295 77786 39103 85280 24812 93748 75446 92932 11105 71169 66433 89866 75379 11402 22186 73572 31624 70092 10734", "45\n53494 93105 37182 24953 1967 43700 39068 12369 7256 64700 31744 62052 84959 49662 34829 78793 51000 16339 29478 52506 96922 75606 52501 1109 21919 6503 72007 63964 75400 24682 45678 18420 67928 87241 73278 69545 24596 29646 65936 55401 89673 49738 35873 45189 3622", "46\n36918 9246 74631 78622 94325 22476 35243 96357 41411 68882 92184 21796 28153 43392 37856 26710 64130 20793 60200 16747 84862 23383 60010 42788 68480 92519 66229 56121 57009 24553 89096 4499 53323 30673 75386 31442 92030 59721 53173 45511 29966 67853 77462 12347 61811 81517", "47\n53046 58090 55185 8100 43578 1253 7226 13049 75567 73065 19920 48836 28243 45633 75475 74628 11853 68351 90922 89500 81315 71161 34816 49875 82337 2727 27746 37878 79833 24423 75618 82065 95614 82618 34391 1850 94056 57092 73115 70214 46067 29071 75947 46802 95807 42600 11211", "48\n69174 6934 59931 70281 68640 47326 3402 64333 42426 77247 13063 8579 61038 39362 2694 22545 83767 15909 88940 86445 45063 27451 18133 91555 28898 45640 21967 62738 61441 24293 19036 68144 5201 26050 69204 29154 85681 19871 60352 36133 86359 47186 74432 5448 53996 27876 58022 80559", "49\n19894 55779 73188 99759 17893 50295 8089 81025 76582 81429 73503 35619 61128 41603 40313 3166 31490 87660 19662 59197 8812 75229 25642 65938 42755 31656 16188 87599 51562 91460 38262 11118 90596 69482 71313 66858 87707 17242 14886 93539 35164 32596 83317 72606 12185 21664 80642 72099 7525", "50\n70081 97965 40736 24325 2476 20832 54026 23972 91400 47099 95141 27386 79799 49285 4039 818 23552 72203 55273 38168 52783 50365 89351 30945 47154 8047 27586 49184 20573 8953 38849 36466 45479 89848 82827 71475 74283 87115 92590 28903 97800 74550 74140 82514 10849 6786 67881 63456 53022 25051", "4\n10 3 2 1", "6\n5245 1414 21632 12159 31783 7412", "46\n1666 17339 9205 20040 30266 12751 11329 7951 9000 14465 11771 7600 19480 15993 19453 7470 1361 7922 27747 17347 4727 11280 403 16338 6064 11124 25723 18717 26118 271 9242 16952 26381 31795 28226 3646 27589 31472 30108 28354 25281 22429 30956 32264 14729 21685", "3\n100 90 80", "5\n10 9 8 7 6", "4\n100 40 50 10", "6\n5 4 3 2 1 1", "33\n30274 12228 26670 31244 5457 2643 27275 4380 30954 23407 8387 6669 25229 31591 27518 30261 25670 20962 31316 8992 8324 26216 10812 28467 15401 23077 10311 24975 14046 12010 11406 22841 7593", "3\n4 2 1", "3\n10 5 5", "6\n6 5 4 3 2 1", "4\n5 2 7 3"], "outputs": ["653 733", "31 41", "0 100000", "2500000 2500000", "1 100000", "65535 65536", "306375 306420", "724302 724303", "0 59139", "9859 48096", "88891 90224", "19907 24641", "80328 82089", "158428 168696", "192724 270011", "138409 167241", "102429 186430", "252317 291210", "288850 297381", "296580 315954", "325890 327812", "414474 453667", "362168 392358", "370791 371188", "492038 551105", "436157 470692", "538648 614005", "506639 558873", "506467 510922", "513496 572193", "602650 616877", "560664 601494", "586407 637558", "569885 599895", "716531 728460", "669482 697066", "678299 683312", "620095 620382", "825663 838784", "770578 774459", "741185 823963", "693927 744637", "823487 862568", "872694 876851", "989044 1011845", "977736 1012543", "954593 973021", "909877 959523", "799467 864856", "1012190 1036128", "1039942 1109548", "1141992 1210184", "1052557 1068976", "1199490 1212346", "1214201 1233568", "1096672 1115247", "1233007 1259909", "1251581 1255820", "4 12", "38442 41203", "379808 392222", "90 180", "16 24", "50 150", "7 9", "299163 327443", "2 5", "5 15", "9 12", "7 10"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	68	codeforces
7556993199c339a3be059e3c49eb86dc	I Wanna Be the Guy	There is a game called "I Wanna Be the Guy", consisting of n levels. Little X and his friend Little Y are addicted to the game. Each of them wants to pass the whole game. Little X can pass only p levels of the game. And Little Y can pass only q levels of the game. You are given the indices of levels Little X can pass and the indices of levels Little Y can pass. Will Little X and Little Y pass the whole game, if they cooperate each other? The first line contains a single integer n (1<=≤<=<=n<=≤<=100). The next line contains an integer p (0<=≤<=p<=≤<=n) at first, then follows p distinct integers a1,<=a2,<=...,<=ap (1<=≤<=ai<=≤<=n). These integers denote the indices of levels Little X can pass. The next line contains the levels Little Y can pass in the same format. It's assumed that levels are numbered from 1 to n. If they can pass all the levels, print "I become the guy.". If it's impossible, print "Oh, my keyboard!" (without the quotes). Sample Input 4 3 1 2 3 2 2 4 4 3 1 2 3 2 2 3 Sample Output I become the guy. Oh, my keyboard!	{"inputs": ["4\n3 1 2 3\n2 2 4", "4\n3 1 2 3\n2 2 3", "10\n5 8 6 1 5 4\n6 1 3 2 9 4 6", "10\n8 8 10 7 3 1 4 2 6\n8 9 5 10 3 7 2 4 8", "10\n9 6 1 8 3 9 7 5 10 4\n7 1 3 2 7 6 9 5", "100\n75 83 69 73 30 76 37 48 14 41 42 21 35 15 50 61 86 85 46 3 31 13 78 10 2 44 80 95 56 82 38 75 77 4 99 9 84 53 12 11 36 74 39 72 43 89 57 28 54 1 51 66 27 22 93 59 68 88 91 29 7 20 63 8 52 23 64 58 100 79 65 49 96 71 33 45\n83 50 89 73 34 28 99 67 77 44 19 60 68 42 8 27 94 85 14 39 17 78 24 21 29 63 92 32 86 22 71 81 31 82 65 48 80 59 98 3 70 55 37 12 15 72 47 9 11 33 16 7 91 74 13 64 38 84 6 61 93 90 45 69 1 54 52 100 57 10 35 49 53 75 76 43 62 5 4 18 36 96 79 23", "1\n1 1\n1 1", "1\n0\n1 1", "1\n1 1\n0", "1\n0\n0", "100\n0\n0", "100\n44 71 70 55 49 43 16 53 7 95 58 56 38 76 67 94 20 73 29 90 25 30 8 84 5 14 77 52 99 91 66 24 39 37 22 44 78 12 63 59 32 51 15 82 34\n56 17 10 96 80 69 13 81 31 57 4 48 68 89 50 45 3 33 36 2 72 100 64 87 21 75 54 74 92 65 23 40 97 61 18 28 98 93 35 83 9 79 46 27 41 62 88 6 47 60 86 26 42 85 19 1 11", "100\n78 63 59 39 11 58 4 2 80 69 22 95 90 26 65 16 30 100 66 99 67 79 54 12 23 28 45 56 70 74 60 82 73 91 68 43 92 75 51 21 17 97 86 44 62 47 85 78 72 64 50 81 71 5 57 13 31 76 87 9 49 96 25 42 19 35 88 53 7 83 38 27 29 41 89 93 10 84 18\n78 1 16 53 72 99 9 36 59 49 75 77 94 79 35 4 92 42 82 83 76 97 20 68 55 47 65 50 14 30 13 67 98 8 7 40 64 32 87 10 33 90 93 18 26 71 17 46 24 28 89 58 37 91 39 34 25 48 84 31 96 95 80 88 3 51 62 52 85 61 12 15 27 6 45 38 2 22 60", "2\n2 2 1\n0", "2\n1 2\n2 1 2", "80\n57 40 1 47 36 69 24 76 5 72 26 4 29 62 6 60 3 70 8 64 18 37 16 14 13 21 25 7 66 68 44 74 61 39 38 33 15 63 34 65 10 23 56 51 80 58 49 75 71 12 50 57 2 30 54 27 17 52\n61 22 67 15 28 41 26 1 80 44 3 38 18 37 79 57 11 7 65 34 9 36 40 5 48 29 64 31 51 63 27 4 50 13 24 32 58 23 19 46 8 73 39 2 21 56 77 53 59 78 43 12 55 45 30 74 33 68 42 47 17 54", "100\n78 87 96 18 73 32 38 44 29 64 40 70 47 91 60 69 24 1 5 34 92 94 99 22 83 65 14 68 15 20 74 31 39 100 42 4 97 46 25 6 8 56 79 9 71 35 54 19 59 93 58 62 10 85 57 45 33 7 86 81 30 98 26 61 84 41 23 28 88 36 66 51 80 53 37 63 43 95 75\n76 81 53 15 26 37 31 62 24 87 41 39 75 86 46 76 34 4 51 5 45 65 67 48 68 23 71 27 94 47 16 17 9 96 84 89 88 100 18 52 69 42 6 92 7 64 49 12 98 28 21 99 25 55 44 40 82 19 36 30 77 90 14 43 50 3 13 95 78 35 20 54 58 11 2 1 33", "100\n77 55 26 98 13 91 78 60 23 76 12 11 36 62 84 80 18 1 68 92 81 67 19 4 2 10 17 77 96 63 15 69 46 97 82 42 83 59 50 72 14 40 89 9 52 29 56 31 74 39 45 85 22 99 44 65 95 6 90 38 54 32 49 34 3 70 75 33 94 53 21 71 5 66 73 41 100 24\n69 76 93 5 24 57 59 6 81 4 30 12 44 15 67 45 73 3 16 8 47 95 20 64 68 85 54 17 90 86 66 58 13 37 42 51 35 32 1 28 43 80 7 14 48 19 62 55 2 91 25 49 27 26 38 79 89 99 22 60 75 53 88 82 34 21 87 71 72 61", "100\n74 96 32 63 12 69 72 99 15 22 1 41 79 77 71 31 20 28 75 73 85 37 38 59 42 100 86 89 55 87 68 4 24 57 52 8 92 27 56 98 95 58 34 9 45 14 11 36 66 76 61 19 25 23 78 49 90 26 80 43 70 13 65 10 5 74 81 21 44 60 97 3 47 93 6\n64 68 21 27 16 91 23 22 33 12 71 88 90 50 62 43 28 29 57 59 5 74 10 95 35 1 67 93 36 32 86 40 6 64 78 46 89 15 84 53 18 30 17 85 2 3 47 92 25 48 76 51 20 82 52 83 99 63 80 11 94 54 39 7 58", "100\n75 11 98 44 47 88 94 23 78 59 70 2 43 39 34 63 71 19 42 61 30 74 14 77 97 53 92 60 67 36 37 13 6 86 62 46 41 3 25 93 7 12 27 48 55 49 31 35 51 10 57 54 95 82 28 90 73 26 17 50 81 56 20 87 40 85 72 64 99 29 91 5 80 18 24 52\n72 93 59 5 88 47 9 58 48 1 43 50 100 87 61 91 45 98 99 56 25 84 53 73 78 54 63 38 37 2 77 95 89 85 4 90 10 33 12 22 74 32 34 70 71 52 96 57 15 66 31 27 75 8 21 39 62 44 67 94 81 68 14 19 36 28 11 79 16 65 46 83 76", "3\n1 2\n2 2 3", "4\n1 2\n3 1 3 4", "6\n2 1 2\n3 4 5 6"], "outputs": ["I become the guy.", "Oh, my keyboard!", "Oh, my keyboard!", "I become the guy.", "I become the guy.", "Oh, my keyboard!", "I become the guy.", "I become the guy.", "I become the guy.", "Oh, my keyboard!", "Oh, my keyboard!", "I become the guy.", "I become the guy.", "I become the guy.", "I become the guy.", "Oh, my keyboard!", "Oh, my keyboard!", "I become the guy.", "I become the guy.", "Oh, my keyboard!", "Oh, my keyboard!", "I become the guy.", "Oh, my keyboard!"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	291	codeforces
75bd96eaf1d058b3b0acafa7aaf06d1a	Maximum Absurdity	Reforms continue entering Berland. For example, during yesterday sitting the Berland Parliament approved as much as n laws (each law has been assigned a unique number from 1 to n). Today all these laws were put on the table of the President of Berland, G.W. Boosch, to be signed. This time mr. Boosch plans to sign 2k laws. He decided to choose exactly two non-intersecting segments of integers from 1 to n of length k and sign all laws, whose numbers fall into these segments. More formally, mr. Boosch is going to choose two integers a, b (1<=≤<=a<=≤<=b<=≤<=n<=-<=k<=+<=1,<=b<=-<=a<=≥<=k) and sign all laws with numbers lying in the segments [a; a<=+<=k<=-<=1] and [b; b<=+<=k<=-<=1] (borders are included). As mr. Boosch chooses the laws to sign, he of course considers the public opinion. Allberland Public Opinion Study Centre (APOSC) conducted opinion polls among the citizens, processed the results into a report and gave it to the president. The report contains the absurdity value for each law, in the public opinion. As mr. Boosch is a real patriot, he is keen on signing the laws with the maximum total absurdity. Help him. The first line contains two integers n and k (2<=≤<=n<=≤<=2·105, 0<=<<=2k<=≤<=n) — the number of laws accepted by the parliament and the length of one segment in the law list, correspondingly. The next line contains n integers x1,<=x2,<=...,<=xn — the absurdity of each law (1<=≤<=xi<=≤<=109). Print two integers a, b — the beginning of segments that mr. Boosch should choose. That means that the president signs laws with numbers from segments [a; a<=+<=k<=-<=1] and [b; b<=+<=k<=-<=1]. If there are multiple solutions, print the one with the minimum number a. If there still are multiple solutions, print the one with the minimum b. Sample Input 5 2 3 6 1 1 6 6 2 1 1 1 1 1 1 Sample Output 1 4 1 3	{"inputs": ["5 2\n3 6 1 1 6", "6 2\n1 1 1 1 1 1", "6 2\n1 4 1 2 5 6", "4 1\n1 2 2 2", "6 3\n15 20 1 15 43 6", "12 3\n1 2 1 15 2 3 6 8 3 3 8 6", "14 2\n2 1 2 3 1 2 2 3 1 2 2 3 2 3", "2 1\n1 1", "2 1\n1000000000 999999999", "3 1\n100 30 563", "3 1\n547468 78578678 6467834", "4 1\n90000 34567 90000 90001", "4 2\n999999 8888888 7777777 666666", "5 1\n2 1 2 1 2", "5 2\n98 96 98 96 96", "6 2\n4 4 7 1 1 7", "98 24\n91 20 12 75 44 22 22 67 28 100 8 41 31 47 95 87 5 54 7 49 32 46 42 37 45 22 29 15 54 98 46 94 69 47 60 1 15 76 17 82 46 22 32 34 91 37 30 26 92 77 69 11 59 78 24 66 88 15 32 49 46 14 57 20 5 69 53 99 81 70 67 22 54 31 49 52 46 51 46 2 53 59 8 66 28 53 54 5 85 75 15 55 87 16 68 6 36 98", "6 3\n1 2 2 2 1 1", "10 4\n9 3 3 9 1 9 9 4 4 9", "7 3\n1 2 5 5 5 5 5"], "outputs": ["1 4", "1 3", "1 5", "2 3", "1 4", "4 7", "3 7", "1 2", "1 2", "1 3", "2 3", "1 4", "1 3", "1 3", "1 3", "2 5", "30 67", "1 4", "1 6", "2 5"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	53	codeforces
75d7721c34fb451b39638108c261fdfe	Segments	You are given n segments on the Ox-axis. You can drive a nail in any integer point on the Ox-axis line nail so, that all segments containing this point, are considered nailed down. If the nail passes through endpoint of some segment, this segment is considered to be nailed too. What is the smallest number of nails needed to nail all the segments down? The first line of the input contains single integer number n (1<=≤<=n<=≤<=1000) — amount of segments. Following n lines contain descriptions of the segments. Each description is a pair of integer numbers — endpoints coordinates. All the coordinates don't exceed 10000 by absolute value. Segments can degenarate to points. The first line should contain one integer number — the smallest number of nails needed to nail all the segments down. The second line should contain coordinates of driven nails separated by space in any order. If the answer is not unique, output any. Sample Input 2 0 2 2 5 5 0 3 4 2 4 8 8 10 7 7 Sample Output 1 2 3 7 10 3	{"inputs": ["2\n0 2\n2 5", "5\n0 3\n4 2\n4 8\n8 10\n7 7", "3\n40 -83\n52 -80\n-21 -4", "4\n67 -88\n37 -62\n-26 91\n-99 -50", "5\n45 58\n22 6\n-32 36\n49 -37\n43 62", "10\n47 -85\n71 40\n-87 64\n76 73\n52 -51\n-20 -57\n-14 -77\n-45 -11\n-56 -48\n81 20", "35\n-47 61\n-73 -15\n9 43\n43 -49\n13 -6\n48 -65\n49 -84\n-6 76\n40 6\n-41 11\n-63 -42\n-7 -66\n47 -98\n-17 61\n79 99\n47 -98\n61 31\n85 72\n-50 -17\n-67 45\n14 -50\n-45 61\n-6 -96\n-47 -83\n56 -58\n-69 -15\n14 20\n-95 -82\n47 93\n-4 -7\n70 9\n91 -18\n-71 31\n55 -20\n81 -8", "1\n0 0", "4\n1 1\n0 0\n10000 10000\n-10000 -10000", "3\n55 55\n55 55\n55 55", "4\n55 55\n55 55\n55 55\n55 56", "1\n-2244 5023"], "outputs": ["1\n2 ", "3\n3 7 10 ", "1\n-4 ", "2\n-50 91 ", "2\n22 58 ", "4\n-48 -11 71 76 ", "6\n-82 -42 -4 20 61 85 ", "1\n0 ", "4\n-10000 0 1 10000 ", "1\n55 ", "1\n55 ", "1\n5023 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	19	codeforces
75fe450019cc75c44b9c4a2ed5ad2024	Chain Reaction	There are n beacons located at distinct positions on a number line. The i-th beacon has position ai and power level bi. When the i-th beacon is activated, it destroys all beacons to its left (direction of decreasing coordinates) within distance bi inclusive. The beacon itself is not destroyed however. Saitama will activate the beacons one at a time from right to left. If a beacon is destroyed, it cannot be activated. Saitama wants Genos to add a beacon strictly to the right of all the existing beacons, with any position and any power level, such that the least possible number of beacons are destroyed. Note that Genos's placement of the beacon means it will be the first beacon activated. Help Genos by finding the minimum number of beacons that could be destroyed. The first line of input contains a single integer n (1<=≤<=n<=≤<=100<=000) — the initial number of beacons. The i-th of next n lines contains two integers ai and bi (0<=≤<=ai<=≤<=1<=000<=000, 1<=≤<=bi<=≤<=1<=000<=000) — the position and power level of the i-th beacon respectively. No two beacons will have the same position, so ai<=≠<=aj if i<=≠<=j. Print a single integer — the minimum number of beacons that could be destroyed if exactly one beacon is added. Sample Input 4 1 9 3 1 6 1 7 4 7 1 1 2 1 3 1 4 1 5 1 6 1 7 1 Sample Output 1 3	{"inputs": ["4\n1 9\n3 1\n6 1\n7 4", "7\n1 1\n2 1\n3 1\n4 1\n5 1\n6 1\n7 1", "1\n0 1", "1\n0 1000000", "1\n1000000 1000000", "7\n1 1\n2 1\n3 1\n4 1\n5 1\n6 6\n7 7", "5\n1 1\n3 1\n5 1\n7 10\n8 10", "11\n110 90\n100 70\n90 10\n80 10\n70 1\n60 1\n50 10\n40 1\n30 1\n10 1\n20 1"], "outputs": ["1", "3", "0", "0", "0", "4", "2", "4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	87	codeforces
7623e6a775ed42e82fa807f998873abf	Checkposts	Your city has n junctions. There are m one-way roads between the junctions. As a mayor of the city, you have to ensure the security of all the junctions. To ensure the security, you have to build some police checkposts. Checkposts can only be built in a junction. A checkpost at junction i can protect junction j if either i<==<=j or the police patrol car can go to j from i and then come back to i. Building checkposts costs some money. As some areas of the city are more expensive than others, building checkpost at some junctions might cost more money than other junctions. You have to determine the minimum possible money needed to ensure the security of all the junctions. Also you have to find the number of ways to ensure the security in minimum price and in addition in minimum number of checkposts. Two ways are different if any of the junctions contains a checkpost in one of them and do not contain in the other. In the first line, you will be given an integer n, number of junctions (1<=≤<=n<=≤<=105). In the next line, n space-separated integers will be given. The ith integer is the cost of building checkpost at the ith junction (costs will be non-negative and will not exceed 109). The next line will contain an integer m (0<=≤<=m<=≤<=3·105). And each of the next m lines contains two integers ui and vi (1<=≤<=ui,<=vi<=≤<=n; u<=≠<=v). A pair ui,<=vi means, that there is a one-way road which goes from ui to vi. There will not be more than one road between two nodes in the same direction. Print two integers separated by spaces. The first one is the minimum possible money needed to ensure the security of all the junctions. And the second one is the number of ways you can ensure the security modulo 1000000007 (109<=+<=7). Sample Input 3 1 2 3 3 1 2 2 3 3 2 5 2 8 0 6 0 6 1 4 1 3 2 4 3 4 4 5 5 1 10 1 3 2 2 1 3 1 4 10 10 12 1 2 2 3 3 1 3 4 4 5 5 6 5 7 6 4 7 3 8 9 9 10 10 9 2 7 91 2 1 2 2 1 Sample Output 3 1 8 2 15 6 7 1	{"inputs": ["3\n1 2 3\n3\n1 2\n2 3\n3 2", "5\n2 8 0 6 0\n6\n1 4\n1 3\n2 4\n3 4\n4 5\n5 1", "10\n1 3 2 2 1 3 1 4 10 10\n12\n1 2\n2 3\n3 1\n3 4\n4 5\n5 6\n5 7\n6 4\n7 3\n8 9\n9 10\n10 9", "2\n7 91\n2\n1 2\n2 1", "10\n1 1 1 1 1 1 1 2 2 2\n15\n2 3\n2 4\n4 1\n4 7\n4 10\n4 5\n4 8\n2 6\n3 2\n1 2\n7 2\n10 2\n5 2\n8 2\n6 2", "100\n174 174 49 152 10 185 101 157 28 177 105 83 155 178 119 123 197 197 56 174 39 53 85 94 72 166 71 43 177 123 186 11 64 82 145 81 11 29 100 10 106 45 138 79 131 90 80 104 149 116 129 30 96 192 11 182 92 157 95 136 152 38 68 34 42 95 164 134 117 75 186 185 28 146 86 24 147 12 166 169 116 44 46 99 55 179 85 187 150 161 49 46 146 79 100 130 59 135 81 176\n0", "1\n1000000000\n0", "1\n0\n0"], "outputs": ["3 1", "8 2", "15 6", "7 1", "3 7", "10585 1", "1000000000 1", "0 1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
7633fd36fd792dd159c25f0914eed4c8	King of Thieves	In this problem you will meet the simplified model of game King of Thieves. In a new ZeptoLab game called "King of Thieves" your aim is to reach a chest with gold by controlling your character, avoiding traps and obstacles on your way. An interesting feature of the game is that you can design your own levels that will be available to other players. Let's consider the following simple design of a level. A dungeon consists of n segments located at a same vertical level, each segment is either a platform that character can stand on, or a pit with a trap that makes player lose if he falls into it. All segments have the same length, platforms on the scheme of the level are represented as '' and pits are represented as '.'. One of things that affects speedrun characteristics of the level is a possibility to perform a series of consecutive jumps of the same length. More formally, when the character is on the platform number i1, he can make a sequence of jumps through the platforms i1<=<<=i2<=<<=...<=<<=i*k, if i2<=-<=i1<==<=i3<=-<=i2<==<=...<==<=ik<=-<=ik<=-<=1. Of course, all segments i1,<=i2,<=... ik should be exactly the platforms, not pits. Let's call a level to be good if you can perform a sequence of four jumps of the same length or in the other words there must be a sequence i1,<=i2,<=...,<=i5, consisting of five platforms so that the intervals between consecutive platforms are of the same length. Given the scheme of the level, check if it is good. The first line contains integer n (1<=≤<=n<=≤<=100) — the number of segments on the level. Next line contains the scheme of the level represented as a string of n characters '' and '.'. If the level is good, print the word "yes" (without the quotes), otherwise print the word "no" (without the quotes). Sample Input 16 ....... 11 ....... Sample Output yesno	{"inputs": ["16\n.*......", "11\n.......", "53\n..***.............*......*......", "71\n...***....******.....*.*...**.........", "56\n......**.....*....*..............", "64\n*........**...........**..........**.....**.", "99\n...*..........*........**.......***.......*....****......*......", "89\n.......******.....***..***.........******....**....***.......*..", "99\n........****........*..****....**.........*...........*...", "5\n****", "10\n.....", "51\n....***...............*............***.....", "98\n....***......*........****.......*..............***...", "45\n...***..................", "67\n...........*.......*.....*.....****......", "97\n........*****......*****....***....**.......****.*..*......", "87\n.........**.......*..............***....*....**.....", "99\n.........***..*................*..........*.......****........", "90\n....*...*..****........***....**.....****............", "58\n*.....***.....*..*****......****..", "75\n......****.................**..*....**.*......**.", "72\n.......***...........*..........*.....", "69\n.**....*.........**...........*..............*", "42\n........*..........**..****", "54\n.......***...***..........**........", "55\n...............**..*......*.**....", "57\n..........***...*..............", "97\n*..*.......**.........................*..**......*..***.", "42\n.....*..................", "99\n*............*.....*....................**...............*.", "1\n.", "1\n", "99\n..............................................................................................", "99\n...............................................................................................", "100\n**************************************************************************************************", "99\n***********************************************************************************************", "5\n.*", "5\n.*", "5\n.", "5\n.", "5\n***.", "100\n...............................................................................................**", "11\n.....*", "21\n.............", "6\n.", "13\n........", "4\n**", "17\n............", "7\n*.", "20\n...............", "11\n......", "10\n***....", "16\n.......", "10\n......", "17\n............", "15\n..........*****"], "outputs": ["yes", "no", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "no", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "yes", "no", "no", "yes", "no", "yes", "yes", "no", "no", "no", "no", "no", "no", "no", "no", "no", "yes", "no", "no", "no", "no", "no", "yes", "yes", "no", "yes", "yes"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	54	codeforces
76493a7daaff07951caf248451558065	Guards In The Storehouse	Polycarp owns a shop in the capital of Berland. Recently the criminal activity in the capital increased, so Polycarp is thinking about establishing some better security in the storehouse of his shop. The storehouse can be represented as a matrix with n rows and m columns. Each element of the matrix is either . (an empty space) or x (a wall). Polycarp wants to hire some guards (possibly zero) to watch for the storehouse. Each guard will be in some cell of matrix and will protect every cell to the right of his own cell and every cell to the bottom of his own cell, until the nearest wall. More formally, if the guard is standing in the cell (x0,<=y0), then he protects cell (x1,<=y1) if all these conditions are met: - (x1,<=y1) is an empty cell; - either x0<==<=x1 and y0<=≤<=y1, or x0<=≤<=x1 and y0<==<=y1; - there are no walls between cells (x0,<=y0) and (x1,<=y1). There can be a guard between these cells, guards can look through each other. Guards can be placed only in empty cells (and can protect only empty cells). The plan of placing the guards is some set of cells where guards will be placed (of course, two plans are different if there exists at least one cell that is included in the first plan, but not included in the second plan, or vice versa). Polycarp calls a plan suitable if there is not more than one empty cell that is not protected. Polycarp wants to know the number of suitable plans. Since it can be very large, you have to output it modulo 109<=+<=7. The first line contains two numbers n and m — the length and the width of the storehouse (1<=≤<=n,<=m<=≤<=250, 1<=≤<=nm<=≤<=250). Then n lines follow, ith line contains a string consisting of m characters — ith row of the matrix representing the storehouse. Each character is either . or x. Output the number of suitable plans modulo 109<=+<=7. Sample Input 1 3 .x. 2 2 xx xx 2 2 .. .. 3 1 x . x Sample Output 3 1 10 2	{"inputs": ["1 3\n.x.", "2 2\nxx\nxx", "2 2\n..\n..", "3 1\nx\n.\nx", "100 2\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..\n..", "150 1\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.", "50 5\n..xxx\n.xx..\nx.x..\n..xx.\nxxx..\nx..x.\n.x.x.\nx..xx\n.x..x\n...x.\n..xxx\nx.x..\nx.xxx\nx.x..\n.xx.x\nxxx.x\nx..xx\nx.x..\nx.xxx\n.xxx.\nxxxxx\nx..xx\n.x.x.\n...x.\n...x.\nx.x.x\n.xx..\nxxx..\n..xxx\n.x.xx\n...x.\n.x...\nxxxxx\nx.x..\nx.x.x\n..x.x\nx...x\nx....\nxxx..\n.xx.x\n..x.x\nx.xx.\n.x.xx\nx..x.\nx....\n....x\n.x...\n.xxxx\nxxxxx\n.x..x", "100 2\nxx\nxx\n..\n.x\n..\n..\n.x\nx.\n.x\n..\n.x\nxx\nxx\nxx\nx.\nx.\nxx\n.x\n.x\nx.\nx.\n.x\nx.\nxx\n..\nxx\n.x\n..\n.x\n.x\nxx\n.x\n..\n.x\nxx\n.x\n..\nx.\nxx\n..\n..\nxx\nxx\n.x\n.x\nx.\nxx\nx.\n..\n.x\n..\n.x\n.x\n.x\nxx\n.x\nx.\nx.\n.x\nxx\nxx\n..\nxx\n..\nxx\n..\nxx\nx.\nx.\n..\n.x\nx.\n..\n.x\n..\nxx\n..\n..\n..\nxx\nx.\nx.\n.x\n.x\n..\n..\nx.\n.x\n.x\n..\n.x\nx.\n.x\nxx\nxx\nxx\n..\nxx\n.x\n..", "150 1\n.\nx\nx\nx\n.\nx\nx\n.\n.\nx\nx\nx\n.\n.\nx\nx\n.\nx\nx\nx\nx\n.\n.\n.\n.\nx\nx\nx\n.\nx\n.\n.\n.\nx\nx\nx\n.\nx\nx\nx\n.\n.\n.\n.\nx\nx\n.\nx\n.\n.\n.\n.\n.\n.\n.\nx\n.\n.\n.\n.\nx\n.\n.\n.\n.\nx\nx\nx\nx\nx\nx\n.\n.\n.\nx\n.\n.\nx\n.\nx\n.\n.\n.\n.\nx\n.\n.\nx\nx\n.\nx\nx\n.\n.\nx\nx\nx\n.\nx\n.\n.\nx\nx\n.\nx\nx\n.\n.\nx\n.\n.\n.\n.\n.\nx\n.\n.\nx\nx\nx\n.\n.\n.\nx\n.\nx\nx\nx\n.\nx\nx\n.\nx\nx\n.\nx\n.\nx\nx\n.\nx\nx\nx\nx\n.\nx\nx\nx\nx\n.", "5 50\n.......x.....xx.x.xxxxx....xx.xx....x.xx.x.xx....x\n.xxx.xx.x.x..x.xxx..xxx.xxxxx....xx..x....xx...x.x\nx.xxxxxxxx...x.xxx..x..x..xx.xxx.x.xxxx.x.x.x...x.\nx..x......xx...xxx.xx..x.x....xxx.xxxx.xx..x...xx.\n...x..xxxx..xxxx.x.xx.x.....xxxx....xxxxxx.x..xx.x", "2 100\n.....xx.xxxx...x...xx.x.x.x.x....xxx.xxxxxxxxx...xx......x.xxxx..x.x.xxx....x..x.x.x.xxxx.xx.xx..x..\n..xx.xx.x..x..xx.....x..x.xx.x.x.x.xx.xx.xxx.x.xxx.xxx.xx...xxxxx.xx..xx.x.x.xx...x.....xx......xx.x", "1 150\nxx..xxxxxxxx.xx...x.xx.xx.xxx.xx.x......x.xx.x..x...x.....x..xx..xx.x.x...x..x..x.....x.xx..xxx.x.xxxxxxxx....x.xx.xx..x...xxx..xx..x.xxx.xx.xx....x.x", "1 250\nx.xx..xxxxxxx.x.xx.xxx..xx..xx.xx..x..x...x..xx.xx.xxxx..x.x.x.x.x...x.x.xx....xxx.x....xxx..xxxxxx.x..x.x.x.xx..x.x...xxx.xxx..xxx....x.xxx....x..x.x...xxxx.x.....xx.xxx..xx....x..xx.x...x.xxxx....x.x.x.x.x..x.x.x..x.xx...xxx.x..x.xxx....x..xxxx...x", "50 5\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxx.x\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nx.xxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nxxxxx\nx.xxx\nxxxxx\nxxxxx", "100 2\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nx.\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nx.\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nxx\nx.", "150 1\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\n.\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\n.\n.\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx\nx", "5 50\nxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxx\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "2 100\nxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxx", "1 150\nxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx", "1 200\nxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxx", "1 250\nxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"], "outputs": ["3", "1", "10", "2", "187168617", "77305127", "464550945", "953133247", "162681113", "991840195", "192835741", "449099046", "20102033", "4", "4", "5", "4", "4", "4", "4", "4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
76669443e7378ca137df9628ed85e6a9	Fashion in Berland	According to rules of the Berland fashion, a jacket should be fastened by all the buttons except only one, but not necessarily it should be the last one. Also if the jacket has only one button, it should be fastened, so the jacket will not swinging open. You are given a jacket with n buttons. Determine if it is fastened in a right way. The first line contains integer n (1<=≤<=n<=≤<=1000) — the number of buttons on the jacket. The second line contains n integers ai (0<=≤<=ai<=≤<=1). The number ai<==<=0 if the i-th button is not fastened. Otherwise ai<==<=1. In the only line print the word "YES" if the jacket is fastened in a right way. Otherwise print the word "NO". Sample Input 3 1 0 1 3 1 0 0 Sample Output YES NO	{"inputs": ["3\n1 0 1", "3\n1 0 0", "3\n1 1 0", "3\n1 1 1", "3\n0 0 1", "3\n0 0 0", "3\n0 1 1", "3\n0 1 0", "2\n0 1", "2\n1 0", "2\n0 0", "2\n1 1", "1\n1", "1\n0", "10\n1 0 1 1 1 1 1 1 1 1", "5\n1 1 1 1 0", "4\n1 0 1 0", "4\n1 1 0 0", "10\n0 0 1 1 1 1 1 1 1 1", "10\n1 1 1 1 1 1 1 1 1 1", "123\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", "124\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", "94\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", "64\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", "34\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", "35\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", "5\n1 1 1 1 1", "10\n0 0 0 0 0 0 0 0 0 0", "231\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "10\n1 1 0 1 1 1 0 1 1 1"], "outputs": ["YES", "NO", "YES", "NO", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	166	codeforces
7684443c62d44e19ea93c1ba3f6df7b4	Levko and Table	Levko loves tables that consist of n rows and n columns very much. He especially loves beautiful tables. A table is beautiful to Levko if the sum of elements in each row and column of the table equals k. Unfortunately, he doesn't know any such table. Your task is to help him to find at least one of them. The single line contains two integers, n and k (1<=≤<=n<=≤<=100, 1<=≤<=k<=≤<=1000). Print any beautiful table. Levko doesn't like too big numbers, so all elements of the table mustn't exceed 1000 in their absolute value. If there are multiple suitable tables, you are allowed to print any of them. Sample Input 2 4 4 7 Sample Output 1 3 3 1 2 1 0 4 4 0 2 1 1 3 3 0 0 3 2 2	{"inputs": ["2 4", "4 7", "1 8", "9 3", "31 581", "100 1000", "100 999", "99 998", "100 997", "81 111", "1 407", "54 341", "92 460", "34 47", "11 547", "100 1", "99 1", "99 2", "2 7", "100 100", "4 3", "3 2"], "outputs": ["4 0 \n0 4 ", "7 0 0 0 \n0 7 0 0 \n0 0 7 0 \n0 0 0 7 ", "8 ", "3 0 0 0 0 0 0 0 0 \n0 3 0 0 0 0 0 0 0 \n0 0 3 0 0 0 0 0 0 \n0 0 0 3 0 0 0 0 0 \n0 0 0 0 3 0 0 0 0 \n0 0 0 0 0 3 0 0 0 \n0 0 0 0 0 0 3 0 0 \n0 0 0 0 0 0 0 3 0 \n0 0 0 0 0 0 0 0 3 ", "581 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 581 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 581 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 581 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 581 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 581 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 581 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 581 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...", "999 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 999 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 999 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "998 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 998 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 998 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "997 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 997 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 997 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "111 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 111 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 111 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 111 0 0...", "407 ", "341 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 341 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 341 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 341 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 341 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "460 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 460 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 460 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "47 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 47 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 47 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 47 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 47 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 47 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 47 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 0 0 ...", "547 0 0 0 0 0 0 0 0 0 0 \n0 547 0 0 0 0 0 0 0 0 0 \n0 0 547 0 0 0 0 0 0 0 0 \n0 0 0 547 0 0 0 0 0 0 0 \n0 0 0 0 547 0 0 0 0 0 0 \n0 0 0 0 0 547 0 0 0 0 0 \n0 0 0 0 0 0 547 0 0 0 0 \n0 0 0 0 0 0 0 547 0 0 0 \n0 0 0 0 0 0 0 0 547 0 0 \n0 0 0 0 0 0 0 0 0 547 0 \n0 0 0 0 0 0 0 0 0 0 547 ", "1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "7 0 \n0 7 ", "100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...", "3 0 0 0 \n0 3 0 0 \n0 0 3 0 \n0 0 0 3 ", "2 0 0 \n0 2 0 \n0 0 2 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	367	codeforces
768e6345e264704e23f22e7840d3742a	none	There is a right triangle with legs of length a and b. Your task is to determine whether it is possible to locate the triangle on the plane in such a way that none of its sides is parallel to the coordinate axes. All the vertices must have integer coordinates. If there exists such a location, you have to output the appropriate coordinates of vertices. The first line contains two integers a,<=b (1<=≤<=a,<=b<=≤<=1000), separated by a single space. In the first line print either "YES" or "NO" (without the quotes) depending on whether the required location exists. If it does, print in the next three lines three pairs of integers — the coordinates of the triangle vertices, one pair per line. The coordinates must be integers, not exceeding 109 in their absolute value. Sample Input 1 1 5 5 5 10 Sample Output NO YES 2 1 5 5 -2 4 YES -10 4 -2 -2 1 2	{"inputs": ["1 1", "5 5", "5 10", "2 2", "5 6", "5 11", "10 15", "935 938", "999 1000", "1000 1000", "15 20", "20 15", "629 865", "45 872", "757 582", "173 588", "533 298", "949 360", "661 175", "728 299", "575 85", "385 505", "755 865", "395 55", "600 175", "280 210", "180 135", "140 105", "440 330", "130 312", "65 156", "105 140", "408 765", "195 468", "305 949", "80 60", "15 15", "120 90", "60 80", "5 25", "5 1000", "25 35", "25 5", "30 40", "65 156", "455 470", "90 120", "5 205", "111 111", "17 17", "1000 5"], "outputs": ["NO", "YES\n2 1\n5 5\n-2 4", "YES\n-10 4\n-2 -2\n1 2", "NO", "NO", "NO", "YES\n0 0\n6 8\n-12 9", "NO", "NO", "YES\n0 0\n280 960\n-960 280", "YES\n0 0\n12 9\n-12 16", "YES\n0 0\n12 16\n-12 9", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES\n0 0\n280 672\n-276 115", "YES\n0 0\n345 460\n-68 51", "YES\n0 0\n231 308\n-404 303", "YES\n0 0\n453 604\n-692 519", "YES\n0 0\n237 316\n-44 33", "YES\n0 0\n168 576\n-168 49", "YES\n0 0\n168 224\n-168 126", "YES\n0 0\n108 144\n-108 81", "YES\n0 0\n84 112\n-84 63", "YES\n0 0\n264 352\n-264 198", "YES\n0 0\n120 50\n-120 288", "YES\n0 0\n60 25\n-60 144", "YES\n0 0\n84 63\n-84 112", "YES\n0 0\n360 192\n-360 675", "YES\n0 0\n180 75\n-180 432", "NO", "YES\n0 0\n48 64\n-48 36", "YES\n0 0\n9 12\n-12 9", "YES\n0 0\n72 96\n-72 54", "YES\n0 0\n48 36\n-48 64", "YES\n0 0\n3 4\n-20 15", "YES\n0 0\n3 4\n-800 600", "YES\n0 0\n15 20\n-28 21", "YES\n0 0\n15 20\n-4 3", "YES\n0 0\n24 18\n-24 32", "YES\n0 0\n60 25\n-60 144", "YES\n0 0\n273 364\n-376 282", "YES\n0 0\n72 54\n-72 96", "YES\n0 0\n3 4\n-164 123", "YES\n0 0\n36 105\n-105 36", "YES\n0 0\n8 15\n-15 8", "YES\n0 0\n600 800\n-4 3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	18	codeforces
76bb3f769dfb164c76a4fe5eac98c396	School	There are n students studying in the 6th grade, in group "B" of a berland secondary school. Every one of them has exactly one friend whom he calls when he has some news. Let us denote the friend of the person number i by g(i). Note that the friendships are not mutual, i.e. g(g(i)) is not necessarily equal to i. On day i the person numbered as ai learns the news with the rating of bi (bi<=≥<=1). He phones the friend immediately and tells it. While he is doing it, the news becomes old and its rating falls a little and becomes equal to bi<=-<=1. The friend does the same thing — he also calls his friend and also tells the news. The friend of the friend gets the news already rated as bi<=-<=2. It all continues until the rating of the news reaches zero as nobody wants to tell the news with zero rating. More formally, everybody acts like this: if a person x learns the news with a non-zero rating y, he calls his friend g(i) and his friend learns the news with the rating of y<=-<=1 and, if it is possible, continues the process. Let us note that during a day one and the same person may call his friend and tell him one and the same news with different ratings. Thus, the news with the rating of bi will lead to as much as bi calls. Your task is to count the values of resi — how many students learned their first news on day i. The values of bi are known initially, whereas ai is determined from the following formula: The first line contains two space-separated integers n and m (2<=≤<=n,<=m<=≤<=105) — the number of students and the number of days. The second line contains n space-separated integers g(i) (1<=≤<=g(i)<=≤<=n,<=g(i)<=≠<=i) — the number of a friend of the i-th student. The third line contains m space-separated integers vi (1<=≤<=vi<=≤<=107). The fourth line contains m space-separated integers bi (1<=≤<=bi<=≤<=107). Print m lines containing one number each. The i-th line should contain resi — for what number of students the first news they've learned over the m days in question, was the news number i. The number of the news is the number of the day on which it can be learned. The days are numbered starting from one in the order in which they are given in the input file. Don't output res0. Sample Input 3 4 2 3 1 1 2 3 4 1 2 3 4 8 6 7 6 4 2 3 5 5 7 10 4 3 8 9 1 1 1 1 2 2 2 Sample Output 1 1 1 0 1 1 1 2 1 1	{"inputs": ["3 4\n2 3 1\n1 2 3 4\n1 2 3 4", "8 6\n7 6 4 2 3 5 5 7\n10 4 3 8 9 1\n1 1 1 2 2 2", "2 2\n2 1\n3304501 9446989\n1 1", "7 3\n7 5 5 1 1 1 1\n9034254 4422892 8872331\n1 2 2", "15 10\n15 3 15 10 11 8 12 5 12 1 4 14 2 2 1\n7571484 4599112 1145547 6936854 5801110 425356 2034668 588381 3181461 3390332\n3 3 1 1 3 1 1 3 1 3", "25 4\n14 12 6 19 13 19 15 25 25 3 17 2 5 23 6 20 7 2 14 6 4 24 16 11 21\n8811002 2094993 3283083 1356127\n55 9 24 47", "5 4\n3 3 5 5 3\n5565507 7260433 6435867 7566379\n2 2 2 2", "10 3\n5 8 2 5 7 4 9 7 3 3\n2012655 2536652 4223787\n1 1 2", "17 13\n16 17 15 6 14 9 6 12 2 2 7 14 15 11 5 2 10\n6955062 519705 8301513 1608820 1677389 4161932 3375638 7503103 9463040 865894 7904301 3677834 9386753\n3 3 1 3 2 1 3 1 3 2 2 3 2", "29 8\n21 24 10 12 18 17 10 10 7 18 8 17 11 10 19 21 12 21 21 17 10 6 18 13 19 15 25 13 17\n2652976 6233829 2019117 8215448 7685251 3135510 273031 3269699\n48 17 24 29 46 37 35 34", "7 5\n5 4 7 1 7 4 4\n9652529 4807563 4640440 7951551 5100424\n2 1 1 2 1", "15 10\n13 14 11 8 11 9 12 13 5 12 2 1 6 10 10\n1887488 3965543 7457763 2544663 3384503 677356 9960202 1594306 6779776 1802114\n2 1 3 3 1 3 1 2 2 1", "25 5\n8 9 6 25 7 5 2 17 15 24 19 14 23 16 11 1 18 22 12 4 13 21 20 3 10\n9107232 33274 4726680 4798292 9082258\n27 21 7 22 36", "2 2\n2 1\n8893795 1438648\n2 1", "3 3\n2 1 2\n1350221 5736109 1940982\n1 1 2", "7 7\n2 1 6 2 2 1 4\n841742 5157415 9495311 7797906 3221678 1825961 2551965\n4 2 3 2 2 1 1", "9 9\n2 1 1 3 1 2 1 9 2\n953141 8428759 1620190 1239444 6268195 865401 8834020 4980241 1094078\n1 4 2 1 1 4 1 3 1", "10 10\n2 1 1 8 8 2 6 1 6 1\n391307 9236442 3605210 6745077 9187730 2029623 6504653 7767163 3211044 5628051\n1 1 3 2 1 2 1 2 6 3"], "outputs": ["1\n1\n1\n0", "1\n1\n1\n2\n1\n1", "1\n1", "1\n2\n1", "3\n3\n0\n0\n0\n0\n1\n1\n0\n2", "2\n6\n0\n0", "2\n1\n0\n1", "1\n1\n2", "3\n3\n1\n2\n0\n0\n0\n0\n2\n0\n1\n1\n1", "6\n4\n0\n2\n0\n1\n2\n0", "2\n0\n0\n2\n1", "2\n1\n1\n0\n0\n2\n1\n2\n2\n0", "25\n0\n0\n0\n0", "2\n0", "1\n0\n1", "3\n2\n0\n0\n1\n0\n1", "1\n4\n0\n0\n0\n1\n0\n0\n0", "1\n1\n2\n2\n0\n0\n0\n0\n2\n0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
76bcef84c53dbedb2f1b4529391130b6	Thoroughly Bureaucratic Organization	Once n people simultaneously signed in to the reception at the recently opened, but already thoroughly bureaucratic organization (abbreviated TBO). As the organization is thoroughly bureaucratic, it can accept and cater for exactly one person per day. As a consequence, each of n people made an appointment on one of the next n days, and no two persons have an appointment on the same day. However, the organization workers are very irresponsible about their job, so none of the signed in people was told the exact date of the appointment. The only way to know when people should come is to write some requests to TBO. The request form consists of m empty lines. Into each of these lines the name of a signed in person can be written (it can be left blank as well). Writing a person's name in the same form twice is forbidden, such requests are ignored. TBO responds very quickly to written requests, but the reply format is of very poor quality — that is, the response contains the correct appointment dates for all people from the request form, but the dates are in completely random order. Responds to all requests arrive simultaneously at the end of the day (each response specifies the request that it answers). Fortunately, you aren't among these n lucky guys. As an observer, you have the following task — given n and m, determine the minimum number of requests to submit to TBO to clearly determine the appointment date for each person. The first line contains a single integer t (1<=≤<=t<=≤<=1000) — the number of test cases. Each of the following t lines contains two integers n and m (1<=≤<=n,<=m<=≤<=109) — the number of people who have got an appointment at TBO and the number of empty lines in the request form, correspondingly. Print t lines, each containing an answer for the corresponding test case (in the order they are given in the input) — the minimum number of requests to submit to TBO. Sample Input 5 4 1 4 2 7 3 1 1 42 7 Sample Output 3 2 3 0 11	{"inputs": ["5\n4 1\n4 2\n7 3\n1 1\n42 7", "12\n11 4\n9 2\n10000 100\n1000000000 2345\n123456 1234567\n123456 65536\n5 55\n5 3\n2323 10\n999111000 232323\n999888777 777888999\n999888777 777", "17\n1 1000000000\n1000000000 1\n1000000000 1000000000\n1000000000 999999999\n999999999 1000000000\n1 2\n2 1\n2 3\n3 2\n2 1000000000\n1000000000 2\n1000000000 999999998\n999999998 1000000000\n1000000000 500000000\n500000000 1000000000\n1000000000 500000001\n500000001 1000000000"], "outputs": ["3\n2\n3\n0\n11", "4\n6\n198\n852515\n17\n17\n3\n3\n423\n12562\n30\n2570409", "0\n999999999\n30\n30\n30\n0\n1\n1\n2\n1\n666666666\n30\n30\n30\n29\n30\n29"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
76da8f8730411f205ecf823f2528d55c	none	Throughout Igor K.'s life he has had many situations worthy of attention. We remember the story with the virus, the story of his mathematical career and of course, his famous programming achievements. However, one does not always adopt new hobbies, one can quit something as well. This time Igor K. got disappointed in one of his hobbies: editing and voicing videos. Moreover, he got disappointed in it so much, that he decided to destroy his secret archive for good. Igor K. use Pindows XR operation system which represents files and folders by small icons. At that, m icons can fit in a horizontal row in any window. Igor K.'s computer contains n folders in the D: disk's root catalog. The folders are numbered from 1 to n in the order from the left to the right and from top to bottom (see the images). At that the folders with secret videos have numbers from a to b inclusive. Igor K. wants to delete them forever, at that making as few frame selections as possible, and then pressing Shift+Delete exactly once. What is the minimum number of times Igor K. will have to select the folder in order to select folders from a to b and only them? Let us note that if some selected folder is selected repeatedly, then it is deselected. Each selection possesses the shape of some rectangle with sides parallel to the screen's borders. The only line contains four integers n, m, a, b (1<=≤<=n,<=m<=≤<=109, 1<=≤<=a<=≤<=b<=≤<=n). They are the number of folders in Igor K.'s computer, the width of a window and the numbers of the first and the last folders that need to be deleted. Print a single number: the least possible number of times Igor K. will have to select the folders using frames to select only the folders with numbers from a to b. Sample Input 11 4 3 9 20 5 2 20 Sample Output 3 2	{"inputs": ["11 4 3 9", "20 5 2 20", "1 1 1 1", "26 5 2 18", "21 5 1 15", "21 5 1 21", "21 5 8 14", "20 4 1 20", "21 5 1 13", "21 5 4 15", "17 3 1 16", "19 5 7 19", "18 2 1 13", "21 3 6 11", "21 5 3 12", "21 3 6 10", "28 5 4 26", "21 5 6 18", "21 5 4 21", "17 5 6 17", "21 5 9 12", "21 3 6 7", "21 5 7 9", "12 4 5 8", "21 3 6 8", "21 1 5 17", "5 5 2 4", "18 4 6 17", "18 4 6 18", "16 4 1 16", "20 4 7 14", "17 3 12 16", "12 4 8 9", "11 8 2 7", "27 5 4 24", "29 5 12 27", "30 5 5 29", "91 2 15 72", "41 1 8 27", "26 5 7 21", "70 5 31 33", "84 9 6 80", "79 8 41 64", "63 11 23 48", "97 9 18 54", "75 18 20 23", "66 42 43 44", "92 54 20 53", "32 90 31 32", "18 100 6 6", "458 12 203 310", "149 49 92 129", "264 2 9 63", "908 6 407 531", "410 36 109 191", "301 38 97 171", "691 27 313 499", "939 42 86 827", "280 32 64 277", "244 25 94 199", "134 110 11 52", "886 251 61 672", "261 686 243 254", "162 309 68 98", "476 398 77 256", "258 224 84 174", "357 182 73 247", "488 655 290 457", "149 334 78 105", "488 519 203 211", "192293793 2864 5278163 190776899", "38644205 2729 9325777 31658388", "268836959 6117 166683294 249843000", "831447817 8377 549549158 577671489", "444819690 3519 48280371 117052060", "729584406 8367 456501516 557088265", "629207296 3735 112288653 309364482", "775589210 6930 266348458 604992807", "249414894 1999 34827655 127026562", "566377385 227 424126063 478693454", "960442940 572344654 77422042 406189391", "291071313 592207814 6792338 181083636", "191971162 306112722 18212391 188328807", "609162932 300548167 21640850 411089609", "645010014 34698301 217620581 416292490", "51474721 867363452 12231088 43489285", "484381636 927869638 57278216 175514226", "491259590 529594367 305425951 326414536", "733405771 830380469 19971607 389270995", "446237720 920085248 296916273 439113596", "12 6 3 10", "25 2 8 11", "17 8 3 15", "9 2 4 7", "6 7 5 6", "13 2 1 6", "15 8 10 14", "27 2 5 13", "14 8 2 12", "61 1 10 38", "15 6 7 15", "100 1 2 15", "10 1 4 5", "6 3 1 6", "4 3 3 4", "5 2 1 5", "7 3 1 1", "7 3 1 2", "7 3 1 3", "7 3 1 4", "7 3 1 5", "7 3 1 6", "7 3 1 7", "7 3 2 2", "7 3 2 3", "7 3 2 4", "7 3 2 5", "7 3 2 6", "7 3 2 7", "7 3 3 3", "7 3 3 4", "7 3 3 5", "7 3 3 6", "7 3 3 7", "7 3 4 4", "7 3 4 5", "7 3 4 6", "7 3 4 7", "7 3 5 5", "7 3 5 6", "7 3 5 7", "7 3 6 6", "7 3 6 7", "7 3 7 7", "8 3 1 1", "8 3 1 2", "8 3 1 3", "8 3 1 4", "8 3 1 5", "8 3 1 6", "8 3 1 7", "8 3 1 8", "8 3 2 2", "8 3 2 3", "8 3 2 4", "8 3 2 5", "8 3 2 6", "8 3 2 7", "8 3 2 8", "8 3 3 3", "8 3 3 4", "8 3 3 5", "8 3 3 6", "8 3 3 7", "8 3 3 8", "8 3 4 4", "8 3 4 5", "8 3 4 6", "8 3 4 7", "8 3 4 8", "8 3 5 5", "8 3 5 6", "8 3 5 7", "8 3 5 8", "8 3 6 6", "8 3 6 7", "8 3 6 8", "8 3 7 7", "8 3 7 8", "8 3 8 8"], "outputs": ["3", "2", "1", "3", "1", "1", "2", "1", "2", "2", "2", "2", "2", "2", "2", "3", "3", "2", "2", "1", "2", "2", "1", "1", "2", "1", "1", "2", "2", "1", "2", "3", "2", "1", "3", "3", "2", "1", "1", "2", "1", "3", "1", "2", "2", "1", "1", "1", "1", "1", "2", "2", "2", "3", "2", "3", "3", "3", "3", "3", "1", "3", "1", "1", "1", "1", "2", "1", "1", "1", "3", "3", "3", "3", "3", "3", "3", "3", "3", "3", "1", "1", "1", "2", "3", "1", "1", "1", "1", "1", "2", "2", "2", "2", "1", "1", "1", "2", "2", "1", "1", "1", "1", "1", "2", "1", "1", "1", "1", "2", "2", "1", "1", "1", "1", "2", "2", "2", "2", "1", "2", "2", "2", "2", "1", "1", "1", "1", "1", "1", "2", "1", "2", "1", "1", "1", "1", "2", "2", "1", "2", "1", "1", "1", "2", "2", "2", "2", "2", "1", "2", "2", "2", "3", "2", "1", "1", "1", "2", "1", "1", "1", "2", "2", "1", "2", "2", "1", "1", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	6	codeforces
76e6bb403b4b2b2676a6771e9d9e4d1e	Friends or Not	Polycarpus has a hobby — he develops an unusual social network. His work is almost completed, and there is only one more module to implement — the module which determines friends. Oh yes, in this social network one won't have to add friends manually! Pairs of friends are deduced in the following way. Let's assume that user A sent user B a message at time t1, and user B sent user A a message at time t2. If 0<=<<=t2<=-<=t1<=≤<=d, then user B's message was an answer to user A's one. Users A and B are considered to be friends if A answered at least one B's message or B answered at least one A's message. You are given the log of messages in chronological order and a number d. Find all pairs of users who will be considered to be friends. The first line of the input contains two integers n and d (1<=≤<=n,<=d<=≤<=1000). The next n lines contain the messages log. The i-th line contains one line of the log formatted as "Ai Bi ti" (without the quotes), which means that user Ai sent a message to user Bi at time ti (1<=≤<=i<=≤<=n). Ai and Bi are non-empty strings at most 20 characters long, consisting of lowercase letters ('a' ... 'z'), and ti is an integer (0<=≤<=ti<=≤<=10000). It is guaranteed that the lines are given in non-decreasing order of ti's and that no user sent a message to himself. The elements in the lines are separated by single spaces. In the first line print integer k — the number of pairs of friends. In the next k lines print pairs of friends as "Ai Bi" (without the quotes). You can print users in pairs and the pairs themselves in any order. Each pair must be printed exactly once. Sample Input 4 1 vasya petya 1 petya vasya 2 anya ivan 2 ivan anya 4 1 1000 a b 0 Sample Output 1 petya vasya 0	{"inputs": ["4 1\nvasya petya 1\npetya vasya 2\nanya ivan 2\nivan anya 4", "1 1000\na b 0", "2 1\na b 0\nb a 0", "3 1\na b 1\nb c 2\nc d 3", "10 2\nlutdc xfavzancwrokyzzkpco 0\nxfavzancwrokyzzkpco lutdc 1\nlutdc vydvatbnibttqgn 2\nxfavzancwrokyzzkpco vydvatbnibttqgn 2\nvydvatbnibttqgn lutdc 3\nlutdc xfavzancwrokyzzkpco 4\nlutdc vydvatbnibttqgn 5\nlutdc vydvatbnibttqgn 6\nlutdc xfavzancwrokyzzkpco 6\nvydvatbnibttqgn xfavzancwrokyzzkpco 6", "10 2\nrvmykneiddpqyf jdhmt 0\nwcsjvh jdhmt 0\njdhmt rvmykneiddpqyf 1\nrvmykneiddpqyf jdhmt 1\nwcsjvh rvmykneiddpqyf 2\nrvmykneiddpqyf jdhmt 2\njdhmt rvmykneiddpqyf 3\njdhmt wcsjvh 5\njdhmt wcsjvh 5\nrvmykneiddpqyf jdhmt 6", "10 2\nliazxawm spxwktiqjgs 0\nnolq liazxawm 1\nliazxawm nolq 2\nliazxawm spxwktiqjgs 2\nnolq liazxawm 3\nspxwktiqjgs liazxawm 3\nspxwktiqjgs liazxawm 3\nspxwktiqjgs liazxawm 3\nspxwktiqjgs nolq 3\nnolq spxwktiqjgs 4", "10 2\nfxn ipntr 0\nipntr fxn 1\nfxn ipntr 1\npfvpfteadph ipntr 2\nfxn pfvpfteadph 4\nipntr fxn 4\npfvpfteadph fxn 5\nfxn pfvpfteadph 5\npfvpfteadph ipntr 6\nipntr pfvpfteadph 6", "10 2\nyltec xnzdtcgzxqqltvpfr 0\nfxxhcmbzzg xnzdtcgzxqqltvpfr 0\nfxxhcmbzzg xnzdtcgzxqqltvpfr 0\nfxxhcmbzzg yltec 1\nfxxhcmbzzg xnzdtcgzxqqltvpfr 2\nfxxhcmbzzg yltec 2\nyltec fxxhcmbzzg 3\nyltec xnzdtcgzxqqltvpfr 3\nyltec xnzdtcgzxqqltvpfr 5\nfxxhcmbzzg yltec 6", "10 2\nrclgdpxdefqu abrfhwigaihoqq 0\nabrfhwigaihoqq rclgdpxdefqu 1\nrclgdpxdefqu bvkfwutdtvxgvx 1\nrclgdpxdefqu abrfhwigaihoqq 1\nabrfhwigaihoqq bvkfwutdtvxgvx 2\nbvkfwutdtvxgvx abrfhwigaihoqq 2\nbvkfwutdtvxgvx abrfhwigaihoqq 3\nabrfhwigaihoqq rclgdpxdefqu 5\nabrfhwigaihoqq rclgdpxdefqu 6\nrclgdpxdefqu bvkfwutdtvxgvx 6", "3 1\na b 1\na b 2\nb a 2"], "outputs": ["1\npetya vasya", "0", "0", "0", "2\nlutdc vydvatbnibttqgn\nlutdc xfavzancwrokyzzkpco", "1\njdhmt rvmykneiddpqyf", "3\nliazxawm nolq\nliazxawm spxwktiqjgs\nnolq spxwktiqjgs", "2\nfxn ipntr\nfxn pfvpfteadph", "1\nfxxhcmbzzg yltec", "2\nabrfhwigaihoqq bvkfwutdtvxgvx\nabrfhwigaihoqq rclgdpxdefqu", "1\na b"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
771139a2d1667bd0deb3cbea3e7902e4	IQ Test	In the city of Ultima Thule job applicants are often offered an IQ test. The test is as follows: the person gets a piece of squared paper with a 4<=×<=4 square painted on it. Some of the square's cells are painted black and others are painted white. Your task is to repaint at most one cell the other color so that the picture has a 2<=×<=2 square, completely consisting of cells of the same color. If the initial picture already has such a square, the person should just say so and the test will be completed. Your task is to write a program that determines whether it is possible to pass the test. You cannot pass the test if either repainting any cell or no action doesn't result in a 2<=×<=2 square, consisting of cells of the same color. Four lines contain four characters each: the j-th character of the i-th line equals "." if the cell in the i-th row and the j-th column of the square is painted white, and "#", if the cell is black. Print "YES" (without the quotes), if the test can be passed and "NO" (without the quotes) otherwise. Sample Input #### .#.. #### .... #### .... #### .... Sample Output YES NO	{"inputs": ["###.\n...#\n###.\n...#", ".##.\n#..#\n.##.\n#..#", ".#.#\n#.#.\n.#.#\n#.#.", "##..\n..##\n##..\n..##", "#.#.\n#.#.\n.#.#\n.#.#", ".#.#\n#.#.\n#.#.\n#.#.", ".#.#\n#.#.\n#.#.\n.#.#", "#.#.\n#.#.\n#.#.\n#.#.", ".#.#\n.#.#\n.#.#\n.#.#", "#..#\n.##.\n####\n####", "#.#.\n.###\n#.#.\n.###", "#..#\n.##.\n.##.\n#..#", ".##.\n.#..\n##.#\n#..#", ".##.\n##..\n#..#\n..##", "##..\n##..\n..##\n..##", ".#..\n###.\n.#.#\n..#.", "###.\n###.\n...#\n...#", "#.##\n##.#\n#.##\n##.#", ".#.#\n#.#.\n.#.#\n#.##", "##..\n..##\n##..\n...#", ".#..\n..##\n##..\n..##", "##..\n...#\n##..\n...#", ".#..\n..#.\n.#..\n..#.", "....\n....\n....\n.#.#", "....\n....\n....\n...#"], "outputs": ["NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	221	codeforces
7733ab8e2222578e78c4856a48ff3078	System of Equations	Furik loves math lessons very much, so he doesn't attend them, unlike Rubik. But now Furik wants to get a good mark for math. For that Ms. Ivanova, his math teacher, gave him a new task. Furik solved the task immediately. Can you? You are given a system of equations: You should count, how many there are pairs of integers (a,<=b) (0<=≤<=a,<=b) which satisfy the system. A single line contains two integers n,<=m (1<=≤<=n,<=m<=≤<=1000) — the parameters of the system. The numbers on the line are separated by a space. On a single line print the answer to the problem. Sample Input 9 3 14 28 4 20 Sample Output 1 1 0	{"inputs": ["9 3", "14 28", "4 20", "18 198", "22 326", "26 104", "14 10", "8 20", "2 8", "20 11", "57 447", "1 1", "66 296", "75 683", "227 975", "247 499", "266 116", "286 916", "307 341", "451 121", "471 921", "502 346", "535 59", "555 699", "747 351", "790 64", "810 704", "855 225", "902 34", "922 514", "971 131", "991 931", "840 780", "102 595", "139 433", "968 288", "563 354", "994 975", "456 221", "205 210", "1 11", "1000 1000", "3 3", "11 99", "2 2", "11 1", "6 6", "100 452", "420 380", "31 31", "2 6", "112 134", "13 13", "1 571"], "outputs": ["1", "1", "0", "1", "1", "1", "0", "0", "0", "0", "1", "2", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "1", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "0", "1", "0", "1", "0", "0", "0", "0", "0", "0", "0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	522	codeforces
77493b95633982ea7b597a0e3aff9aa0	Ksusha the Squirrel	Ksusha the Squirrel is standing at the beginning of a straight road, divided into n sectors. The sectors are numbered 1 to n, from left to right. Initially, Ksusha stands in sector 1. Ksusha wants to walk to the end of the road, that is, get to sector n. Unfortunately, there are some rocks on the road. We know that Ksusha hates rocks, so she doesn't want to stand in sectors that have rocks. Ksusha the squirrel keeps fit. She can jump from sector i to any of the sectors i<=+<=1,<=i<=+<=2,<=...,<=i<=+<=k. Help Ksusha! Given the road description, say if she can reach the end of the road (note, she cannot stand on a rock)? The first line contains two integers n and k (2<=≤<=n<=≤<=3·105,<=1<=≤<=k<=≤<=3·105). The next line contains n characters — the description of the road: the i-th character equals ".", if the i-th sector contains no rocks. Otherwise, it equals "#". It is guaranteed that the first and the last characters equal ".". Print "YES" (without the quotes) if Ksusha can reach the end of the road, otherwise print "NO" (without the quotes). Sample Input 2 1 .. 5 2 .#.#. 7 3 .#.###. Sample Output YES YES NO	{"inputs": ["2 1\n..", "5 2\n.#.#.", "7 3\n.#.###.", "2 200\n..", "2 1\n..", "2 2\n..", "2 100000\n..", "3 1\n.#.", "3 2\n.#.", "3 10000\n.#."], "outputs": ["YES", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "YES", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	174	codeforces
77559f3bff47a375c58414034dd838e5	Bear and Three Balls	Limak is a little polar bear. He has n balls, the i-th ball has size ti. Limak wants to give one ball to each of his three friends. Giving gifts isn't easy — there are two rules Limak must obey to make friends happy: - No two friends can get balls of the same size. - No two friends can get balls of sizes that differ by more than 2. For example, Limak can choose balls with sizes 4, 5 and 3, or balls with sizes 90, 91 and 92. But he can't choose balls with sizes 5, 5 and 6 (two friends would get balls of the same size), and he can't choose balls with sizes 30, 31 and 33 (because sizes 30 and 33 differ by more than 2). Your task is to check whether Limak can choose three balls that satisfy conditions above. The first line of the input contains one integer n (3<=≤<=n<=≤<=50) — the number of balls Limak has. The second line contains n integers t1,<=t2,<=...,<=tn (1<=≤<=ti<=≤<=1000) where ti denotes the size of the i-th ball. Print "YES" (without quotes) if Limak can choose three balls of distinct sizes, such that any two of them differ by no more than 2. Otherwise, print "NO" (without quotes). Sample Input 4 18 55 16 17 6 40 41 43 44 44 44 8 5 972 3 4 1 4 970 971 Sample Output YES NO YES	{"inputs": ["4\n18 55 16 17", "6\n40 41 43 44 44 44", "8\n5 972 3 4 1 4 970 971", "3\n959 747 656", "4\n1 2 2 3", "50\n998 30 384 289 505 340 872 223 663 31 929 625 864 699 735 589 676 399 745 635 963 381 75 97 324 612 597 797 103 382 25 894 219 458 337 572 201 355 294 275 278 311 586 573 965 704 936 237 715 543", "50\n941 877 987 982 966 979 984 810 811 909 872 980 957 897 845 995 924 905 984 914 824 840 868 910 815 808 872 858 883 952 823 835 860 874 959 972 931 867 866 987 982 837 800 921 887 910 982 980 828 869", "3\n408 410 409", "3\n903 902 904", "3\n399 400 398", "3\n450 448 449", "3\n390 389 388", "3\n438 439 440", "11\n488 688 490 94 564 615 641 170 489 517 669", "24\n102 672 983 82 720 501 81 721 982 312 207 897 159 964 611 956 118 984 37 271 596 403 772 954", "36\n175 551 70 479 875 480 979 32 465 402 640 116 76 687 874 678 359 785 753 401 978 629 162 963 886 641 39 845 132 930 2 372 478 947 407 318", "6\n10 79 306 334 304 305", "34\n787 62 26 683 486 364 684 891 846 801 969 837 359 800 836 359 471 637 732 91 841 836 7 799 959 405 416 841 737 803 615 483 323 365", "30\n860 238 14 543 669 100 428 789 576 484 754 274 849 850 586 377 711 386 510 408 520 693 23 477 266 851 728 711 964 73", "11\n325 325 324 324 324 325 325 324 324 324 324", "7\n517 517 518 517 518 518 518", "20\n710 710 711 711 711 711 710 710 710 710 711 710 710 710 710 710 710 711 711 710", "48\n29 30 29 29 29 30 29 30 30 30 30 29 30 30 30 29 29 30 30 29 30 29 29 30 29 30 29 30 30 29 30 29 29 30 30 29 29 30 30 29 29 30 30 30 29 29 30 29", "7\n880 880 514 536 881 881 879", "15\n377 432 262 376 261 375 377 262 263 263 261 376 262 262 375", "32\n305 426 404 961 426 425 614 304 404 425 615 403 303 304 615 303 305 405 427 614 403 303 425 615 404 304 427 403 206 616 405 404", "41\n115 686 988 744 762 519 745 519 518 83 85 115 520 44 687 686 685 596 988 687 989 988 114 745 84 519 519 746 988 84 745 744 115 114 85 115 520 746 745 116 987", "47\n1 2 483 28 7 109 270 651 464 162 353 521 224 989 721 499 56 69 197 716 313 446 580 645 828 197 100 138 789 499 147 677 384 711 783 937 300 543 540 93 669 604 739 122 632 822 116", "31\n1 2 1 373 355 692 750 920 578 666 615 232 141 129 663 929 414 704 422 559 568 731 354 811 532 618 39 879 292 602 995", "50\n5 38 41 4 15 40 27 39 20 3 44 47 30 6 36 29 35 12 19 26 10 2 21 50 11 46 48 49 17 16 33 13 32 28 31 18 23 34 7 14 24 45 9 37 1 8 42 25 43 22", "50\n967 999 972 990 969 978 963 987 954 955 973 970 959 981 995 983 986 994 979 957 965 982 992 977 953 975 956 961 993 997 998 958 980 962 960 951 996 991 1000 966 971 988 976 968 989 984 974 964 985 952", "50\n850 536 761 506 842 898 857 723 583 637 536 943 895 929 890 612 832 633 696 731 553 880 710 812 665 877 915 636 711 540 748 600 554 521 813 796 568 513 543 809 798 820 928 504 999 646 907 639 550 911", "3\n3 1 2", "3\n500 999 1000", "10\n101 102 104 105 107 109 110 112 113 115", "50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "50\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", "3\n1000 999 998", "49\n343 322 248 477 53 156 245 493 209 141 370 66 229 184 434 137 276 472 216 456 147 180 140 114 493 323 393 262 380 314 222 124 98 441 129 346 48 401 347 460 122 125 114 106 189 260 374 165 456", "20\n1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 3 3 3 3 3", "3\n999 999 1000", "9\n2 4 5 13 25 100 200 300 400", "9\n1 1 1 2 2 2 3 3 3", "3\n1 1 2", "3\n998 999 1000", "12\n1 1 1 1 1 1 1 1 1 2 2 4", "4\n4 3 4 5", "6\n1 1 1 2 2 2", "3\n2 3 2", "5\n10 5 6 3 2", "3\n1 2 1", "3\n1 2 3", "4\n998 999 1000 1000", "5\n2 3 9 9 4", "4\n1 2 4 4", "3\n1 1 1", "3\n2 2 3", "7\n1 2 2 2 4 5 6", "5\n1 3 10 3 10", "3\n1 2 2", "4\n1000 1000 999 998", "3\n5 3 7", "6\n1 1 2 2 3 3", "9\n6 6 6 5 5 5 4 4 4", "7\n5 6 6 6 7 7 7", "5\n2 3 3 3 4", "5\n2 1 2 1 3", "3\n1 2 7", "3\n1000 1000 1000", "5\n1 100 2 100 3", "5\n5 4 6 5 5", "12\n1 1 1 1 2 2 2 2 3 3 3 3", "5\n9 9 1 2 3", "6\n1 2 3 1 2 3", "7\n1 1 1 1 2 3 3", "3\n13 13 13", "3\n42 42 42", "8\n1 1 1 1 2 2 2 2", "6\n1 1 1 1 2 3", "6\n1 1 2 2 6 6", "6\n1 2 5 5 5 5", "9\n1 2 3 1 2 3 1 2 3", "4\n1 2 1 100", "5\n1 1 2 2 3"], "outputs": ["YES", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "YES", "NO", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	184	codeforces
775bf86700385871a4c415dd98d0e276	Jon Snow and his Favourite Number	Jon Snow now has to fight with White Walkers. He has n rangers, each of which has his own strength. Also Jon Snow has his favourite number x. Each ranger can fight with a white walker only if the strength of the white walker equals his strength. He however thinks that his rangers are weak and need to improve. Jon now thinks that if he takes the bitwise XOR of strengths of some of rangers with his favourite number x, he might get soldiers of high strength. So, he decided to do the following operation k times: 1. Arrange all the rangers in a straight line in the order of increasing strengths.1. Take the bitwise XOR (is written as ) of the strength of each alternate ranger with x and update it's strength.1. The strength of first ranger is updated to , i.e. 7.1. The strength of second ranger remains the same, i.e. 7.1. The strength of third ranger is updated to , i.e. 11.1. The strength of fourth ranger remains the same, i.e. 11.1. The strength of fifth ranger is updated to , i.e. 13. Now, Jon wants to know the maximum and minimum strength of the rangers after performing the above operations k times. He wants your help for this task. Can you help him? First line consists of three integers n, k, x (1<=≤<=n<=≤<=105, 0<=≤<=k<=≤<=105, 0<=≤<=x<=≤<=103) — number of rangers Jon has, the number of times Jon will carry out the operation and Jon's favourite number respectively. Second line consists of n integers representing the strengths of the rangers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=103). Output two integers, the maximum and the minimum strength of the rangers after performing the operation k times. Sample Input 5 1 2 9 7 11 15 5 2 100000 569 605 986 Sample Output 13 7986 605	{"inputs": ["5 1 2\n9 7 11 15 5", "2 100000 569\n605 986", "10 10 98\n1 58 62 71 55 4 20 17 25 29", "100 100 96\n11 79 47 73 77 66 50 32 26 38 8 58 45 86 35 49 63 13 35 61 52 44 16 80 32 18 8 4 49 90 78 83 72 3 86 71 96 93 97 60 43 74 58 61 21 96 43 92 31 23 64 60 14 77 27 45 71 27 49 41 40 22 72 50 14 73 72 91 39 54 62 42 70 15 9 90 98 36 80 26 64 25 37 27 40 95 32 36 58 73 12 69 81 86 97 7 16 50 52 29", "100 100 301\n364 290 417 465 126 48 172 473 255 204 188 417 292 80 129 145 26 439 239 442 496 305 431 84 127 473 81 376 50 489 191 25 273 13 72 230 150 89 166 325 314 461 189 472 498 271 299 259 112 289 284 105 407 221 219 218 344 133 221 477 123 409 396 199 496 396 8 68 47 340 187 153 238 121 448 30 198 347 311 306 35 441 56 310 150 222 208 424 218 109 495 238 283 491 132 255 352 62 409 215", "10 50000 211\n613 668 383 487 696 540 157 86 440 22", "1 1 1\n1", "1 100000 489\n879", "1 100000 711\n882", "3 100000 993\n641 701 924", "5 3 64\n1 2 3 4 5", "1 1 100\n923", "2 101 2\n1 5", "4 3 2\n0 4 1 4", "10 3 77\n52 95 68 77 85 11 69 81 68 1", "5 2 2\n9 10 11 12 13", "2 1001 2\n1 5", "10 4 42\n87 40 11 62 83 30 91 10 13 72", "14 49 685\n104 88 54 134 251 977 691 713 471 591 109 69 898 696", "11 1007 9\n12 5 10 8 0 6 8 10 12 14 4", "10 22198 912\n188 111 569 531 824 735 857 433 182 39", "5 12 6\n0 2 2 2 3", "9 106 12\n1 11 12 14 18 20 23 24 26", "68 5430 49\n863 131 37 363 777 260 318 525 645 131 677 172 33 830 246 51 624 62 624 919 911 633 213 92 886 135 642 949 579 37 190 973 772 590 387 715 139 981 281 176 955 457 803 638 784 149 834 988 804 642 855 827 64 661 241 133 132 952 755 209 627 780 311 968 162 265 39 779", "28 97 49\n4 10 5 8 10 6 5 9 8 7 9 5 3 7 2 5 3 1 8 7 7 9 8 10 3 5 4 7", "6 7 12\n8 9 12 3 11 9", "10 82 69\n10 5 6 8 8 1 2 10 6 7", "50 10239 529\n439 326 569 356 395 64 329 250 210 385 416 130 944 483 537 621 451 285 262 35 303 148 620 119 898 648 428 604 247 328 485 687 655 54 43 402 471 724 652 33 109 420 164 406 903 53 379 706 338 641", "119 12 653\n877 938 872 962 590 500 422 249 141 163 609 452 594 768 316 530 838 945 658 636 997 938 941 272 102 8 713 862 572 809 301 462 282 478 12 544 157 204 367 789 136 251 754 43 349 355 560 325 463 659 666 644 992 603 799 597 364 234 903 377 896 92 971 308 617 712 480 772 170 68 318 947 741 568 63 483 418 560 535 804 180 426 793 743 357 784 792 236 37 529 825 66 488 46 69 854 838 262 715 560 238 352 246 628 589 434 486 828 716 551 953 863 405 512 655 299 932 389 359", "5 102 6\n0 2 2 2 3", "5 4 6\n0 2 2 2 3", "6 66 406\n856 165 248 460 135 235", "50 10234 607\n102 40 468 123 448 152 595 637 466 46 949 484 465 282 106 840 109 375 341 473 131 188 217 882 787 736 685 321 98 860 928 200 900 749 323 700 901 918 338 719 316 639 555 133 922 661 974 383 389 315", "5 8 6\n0 2 2 2 3", "72 99 269\n681 684 278 716 9 715 898 370 513 898 903 70 437 967 916 283 530 55 838 956 486 647 594 578 154 340 747 423 334 70 621 338 985 390 339 453 576 218 353 427 272 409 198 731 461 697 378 950 794 485 404 634 727 35 64 910 978 407 426 303 491 616 788 439 555 177 528 498 805 431 250 56", "11 1003 9\n12 5 10 8 0 6 8 10 12 14 4", "10 68 700\n446 359 509 33 123 180 178 904 583 191", "5 24 6\n0 2 2 2 3", "74 361 405\n83 185 269 357 65 252 374 887 904 373 720 662 542 920 367 982 87 656 218 661 967 264 684 108 452 790 71 633 773 781 743 377 292 566 220 254 163 865 39 870 106 592 943 765 76 861 514 841 416 62 8 766 595 471 654 470 482 567 660 141 198 987 513 684 979 867 332 869 105 506 435 948 772 548", "10 8883 410\n423 866 593 219 369 888 516 29 378 192", "10 22196 912\n188 111 569 531 824 735 857 433 182 39", "2 2001 2\n1 5", "2 3 5\n1 2", "5 10001 2\n9 7 11 15 5", "10 3 5\n1 2 3 4 5 6 7 8 9 10", "2 1 5\n1 2", "21 22527 4\n6 9 30 21 18 6 29 21 8 0 2 2 8 25 27 29 30 2 11 9 28", "10 3 581\n61 112 235 397 397 620 645 659 780 897", "3 3 4\n0 3 8", "6 6 5\n1 3 7 1 7 2", "20 99 179\n456 866 689 828 582 72 143 709 339 702 453 710 379 341 149 450 138 552 298 488", "10 10 10\n1 9 4 5 3 4 6 2 4 9", "2 21 569\n605 986", "10 99999 581\n61 112 235 397 397 620 645 659 780 897", "31 3 4\n7 18 16 14 16 7 13 10 2 3 8 11 20 4 7 1 7 13 17 12 9 8 10 3 11 3 4 8 16 10 3"], "outputs": ["13 7", "986 605", "127 17", "127 0", "509 9", "719 22", "0 0", "879 879", "882 882", "924 348", "69 3", "1023 1023", "5 3", "6 0", "121 9", "13 9", "5 3", "125 2", "977 54", "13 1", "1023 182", "4 0", "27 1", "1020 16", "59 2", "15 4", "79 6", "1012 33", "1006 8", "5 0", "4 0", "856 165", "986 32", "4 0", "985 27", "13 1", "987 180", "4 0", "987 39", "971 219", "1023 168", "5 3", "7 1", "13 7", "15 0", "4 2", "30 0", "968 61", "12 0", "7 2", "977 60", "15 3", "986 100", "968 61", "20 0"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
77648609db63b536c2fed07fc8dfd61b	Open Communication	Two participants are each given a pair of distinct numbers from 1 to 9 such that there's exactly one number that is present in both pairs. They want to figure out the number that matches by using a communication channel you have access to without revealing it to you. Both participants communicated to each other a set of pairs of numbers, that includes the pair given to them. Each pair in the communicated sets comprises two different numbers. Determine if you can with certainty deduce the common number, or if you can determine with certainty that both participants know the number but you do not. The first line contains two integers $n$ and $m$ ($1 \le n, m \le 12$) — the number of pairs the first participant communicated to the second and vice versa. The second line contains $n$ pairs of integers, each between $1$ and $9$, — pairs of numbers communicated from first participant to the second. The third line contains $m$ pairs of integers, each between $1$ and $9$, — pairs of numbers communicated from the second participant to the first. All pairs within each set are distinct (in particular, if there is a pair $(1,2)$, there will be no pair $(2,1)$ within the same set), and no pair contains the same number twice. It is guaranteed that the two sets do not contradict the statements, in other words, there is pair from the first set and a pair from the second set that share exactly one number. If you can deduce the shared number with certainty, print that number. If you can with certainty deduce that both participants know the shared number, but you do not know it, print $0$. Otherwise print $-1$. Sample Input 2 2 1 2 3 4 1 5 3 4 2 2 1 2 3 4 1 5 6 4 2 3 1 2 4 5 1 2 1 3 2 3 Sample Output 1 0 -1	{"inputs": ["2 2\n1 2 3 4\n1 5 3 4", "2 2\n1 2 3 4\n1 5 6 4", "2 3\n1 2 4 5\n1 2 1 3 2 3", "2 1\n1 2 1 3\n1 2", "4 4\n1 2 3 4 5 6 7 8\n2 3 4 5 6 7 8 1", "3 3\n1 2 5 6 7 8\n2 3 4 5 8 9", "4 3\n1 2 4 5 6 7 8 9\n1 2 8 9 3 1", "3 4\n2 1 8 9 3 1\n1 2 4 5 6 7 8 9", "3 8\n8 9 8 5 9 2\n8 4 8 3 2 6 4 2 4 3 3 7 3 6 1 6", "9 1\n3 4 3 2 3 7 3 5 9 4 1 9 6 4 5 2 7 6\n8 3", "5 6\n4 7 7 3 4 3 9 4 3 9\n7 5 7 8 1 7 7 2 6 2 1 2", "7 3\n2 6 6 7 6 4 6 1 9 6 7 4 1 9\n6 5 3 6 6 8", "9 2\n9 6 1 6 2 5 7 3 8 1 7 2 9 1 2 8 3 8\n6 4 4 5", "5 6\n1 7 5 6 6 9 3 6 1 9\n2 7 2 5 8 5 4 8 4 2 8 2", "3 9\n9 7 9 2 7 2\n9 8 1 9 3 9 6 3 8 6 4 6 1 3 5 4 5 3", "9 4\n2 8 8 9 8 1 9 2 5 9 3 5 3 2 5 2 9 1\n8 4 8 7 6 8 4 7", "1 12\n6 8\n8 4 8 2 5 8 9 8 8 3 8 7 8 1 1 3 1 9 4 3 7 3 5 7", "12 12\n7 6 3 8 8 4 4 7 1 9 9 5 7 5 4 9 8 6 2 7 7 3 3 6\n9 1 2 4 9 8 5 3 6 7 3 8 2 7 5 9 6 4 3 1 2 6 1 4", "12 12\n1 6 2 6 8 3 6 4 4 8 7 2 7 5 9 4 2 4 9 5 8 5 3 6\n2 8 6 9 2 6 7 4 6 5 6 3 5 8 7 8 7 1 1 9 9 7 7 3", "12 12\n6 7 5 4 7 8 2 9 8 5 3 5 1 6 7 3 7 9 5 7 1 8 6 8\n6 4 2 1 7 8 1 6 8 5 9 8 1 5 7 2 5 9 6 3 9 2 9 4", "1 10\n3 9\n3 2 3 4 5 3 5 7 8 6 2 5 7 8 2 4 1 7 5 1", "3 10\n6 1 4 1 4 6\n7 1 8 1 8 5 3 2 9 7 9 3 5 9 5 3 5 7 7 2", "2 7\n2 7 2 5\n7 1 9 7 8 9 4 9 8 1 3 9 3 8", "12 1\n6 2 6 4 8 6 6 9 5 6 6 1 9 1 1 3 3 9 2 4 5 2 8 1\n6 7", "2 11\n6 1 3 6\n1 7 1 2 1 5 1 4 5 3 3 2 9 8 4 2 7 5 4 9 2 9", "6 9\n8 1 8 4 2 8 2 1 4 1 4 2\n8 3 8 6 7 8 5 8 6 7 5 7 9 6 5 6 5 3", "6 4\n2 7 3 2 8 3 1 5 7 4 3 5\n2 6 9 8 8 6 6 9", "3 10\n1 5 7 1 2 1\n9 5 5 6 3 5 4 7 8 3 9 6 8 4 9 8 4 6 3 4", "1 7\n8 4\n9 8 8 2 6 8 8 1 7 8 2 1 9 5", "3 6\n3 5 7 4 7 5\n3 9 3 2 8 6 6 2 8 2 6 9", "8 5\n7 9 6 7 4 7 2 1 4 9 2 9 4 2 9 6\n8 7 1 8 8 5 3 5 3 8", "8 1\n1 6 7 6 7 3 9 2 1 2 8 6 2 3 4 1\n8 3", "12 5\n9 2 6 7 7 8 3 4 8 4 7 1 2 1 7 3 7 2 5 6 3 8 1 5\n3 7 7 5 7 4 5 8 4 6", "11 1\n2 6 1 4 7 9 7 6 8 1 4 8 4 7 7 2 1 7 9 6 6 5\n3 1", "10 2\n4 9 2 1 5 1 6 2 6 7 2 7 5 8 1 7 5 3 9 1\n9 7 1 4", "9 1\n1 8 7 6 7 2 7 9 4 1 4 3 3 8 4 6 9 6\n9 4", "4 7\n9 2 4 1 2 3 2 7\n6 1 5 4 7 5 6 3 1 5 8 1 1 4", "3 7\n8 2 7 9 8 1\n3 1 8 1 2 7 4 7 4 2 1 4 4 6", "12 2\n3 1 8 2 6 9 2 6 5 4 4 3 4 1 4 2 6 3 9 7 9 4 3 2\n7 1 4 1", "7 6\n6 2 9 2 6 5 2 4 1 2 4 5 6 7\n3 9 5 1 9 8 9 5 3 4 2 3", "4 12\n2 8 3 1 2 1 9 4\n9 5 5 3 1 6 3 7 7 1 8 5 6 5 4 6 1 9 1 4 2 5 9 8", "2 2\n1 2 2 3\n2 3 3 4", "2 2\n1 2 1 3\n1 2 1 3", "3 3\n1 2 1 3 2 3\n1 2 1 3 2 3", "2 3\n1 2 1 3\n1 2 1 3 2 3", "2 2\n1 2 2 4\n1 2 1 3", "2 1\n4 5 6 7\n4 7", "3 2\n1 2 1 3 2 3\n1 2 4 5", "4 4\n1 2 1 3 6 7 6 8\n1 4 1 5 6 1 6 9", "4 4\n1 2 2 3 1 3 4 5\n1 3 3 2 1 2 4 6", "3 2\n1 2 4 5 6 7\n4 7 1 3", "2 3\n1 2 7 8\n1 3 2 4 7 9"], "outputs": ["1", "0", "-1", "1", "-1", "0", "1", "1", "0", "3", "7", "6", "0", "0", "9", "8", "8", "-1", "-1", "-1", "3", "1", "7", "6", "0", "8", "0", "0", "8", "3", "0", "-1", "-1", "1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "0", "1", "-1", "-1", "0", "-1", "-1", "-1", "-1", "-1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	19	codeforces
777032d786f2e0f4f7249941810cd2e2	Dreamoon and WiFi	Dreamoon is standing at the position 0 on a number line. Drazil is sending a list of commands through Wi-Fi to Dreamoon's smartphone and Dreamoon follows them. Each command is one of the following two types: 1. Go 1 unit towards the positive direction, denoted as '+' 1. Go 1 unit towards the negative direction, denoted as '-' But the Wi-Fi condition is so poor that Dreamoon's smartphone reports some of the commands can't be recognized and Dreamoon knows that some of them might even be wrong though successfully recognized. Dreamoon decides to follow every recognized command and toss a fair coin to decide those unrecognized ones (that means, he moves to the 1 unit to the negative or positive direction with the same probability 0.5). You are given an original list of commands sent by Drazil and list received by Dreamoon. What is the probability that Dreamoon ends in the position originally supposed to be final by Drazil's commands? The first line contains a string s1 — the commands Drazil sends to Dreamoon, this string consists of only the characters in the set {'+', '-'}. The second line contains a string s2 — the commands Dreamoon's smartphone recognizes, this string consists of only the characters in the set {'+', '-', '?'}. '?' denotes an unrecognized command. Lengths of two strings are equal and do not exceed 10. Output a single real number corresponding to the probability. The answer will be considered correct if its relative or absolute error doesn't exceed 10<=-<=9. Sample Input ++-+- +-+-+ +-+- +-?? +++ ??- Sample Output 1.000000000000 0.500000000000 0.000000000000	{"inputs": ["++-+-\n+-+-+", "+-+-\n+-??", "+++\n??-", "++++++++++\n+++??++?++", "--+++---+-\n??????????", "+--+++--+-\n??????????", "+\n+", "-\n?", "+\n-", "-\n-", "-\n+", "+\n?", "++++++++++\n++++++++++", "++++++++++\n++++-+++++", "----------\n++++++++++", "++++++++++\n++++??++++", "----------\n+++?++++-+", "++++++++++\n++++++++?+", "--++++--+\n?-+?-??+-", "----------\n??????????", "+--++\n+--+-", "-----++---\n????????+?", "------+--+\n??????????", "---++--\n???????", "-----++\n???????", "+---+--\n???????", "---+-+\n??????", "+++-+\n---++", "++-+--+\n?-?+??+", "----+++--\n-+?+++?--", "+-----\n+?----"], "outputs": ["1.000000000000", "0.500000000000", "0.000000000000", "0.125000000000", "0.205078125000", "0.246093750000", "1.000000000000", "0.500000000000", "0.000000000000", "1.000000000000", "0.000000000000", "0.500000000000", "1.000000000000", "0.000000000000", "0.000000000000", "0.250000000000", "0.000000000000", "0.500000000000", "0.250000000000", "0.000976562500", "0.000000000000", "0.017578125000", "0.043945312500", "0.164062500000", "0.164062500000", "0.164062500000", "0.234375000000", "0.000000000000", "0.375000000000", "0.000000000000", "0.500000000000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	212	codeforces
77882bc7c3a1570e125a93874785cc09	none	Imagine that you are in a building that has exactly n floors. You can move between the floors in a lift. Let's number the floors from bottom to top with integers from 1 to n. Now you're on the floor number a. You are very bored, so you want to take the lift. Floor number b has a secret lab, the entry is forbidden. However, you already are in the mood and decide to make k consecutive trips in the lift. Let us suppose that at the moment you are on the floor number x (initially, you were on floor a). For another trip between floors you choose some floor with number y (y<=≠<=x) and the lift travels to this floor. As you cannot visit floor b with the secret lab, you decided that the distance from the current floor x to the chosen y must be strictly less than the distance from the current floor x to floor b with the secret lab. Formally, it means that the following inequation must fulfill: \|x<=-<=y\|<=<<=\|x<=-<=b\|. After the lift successfully transports you to floor y, you write down number y in your notepad. Your task is to find the number of distinct number sequences that you could have written in the notebook as the result of k trips in the lift. As the sought number of trips can be rather large, find the remainder after dividing the number by 1000000007 (109<=+<=7). The first line of the input contains four space-separated integers n, a, b, k (2<=≤<=n<=≤<=5000, 1<=≤<=k<=≤<=5000, 1<=≤<=a,<=b<=≤<=n, a<=≠<=b). Print a single integer — the remainder after dividing the sought number of sequences by 1000000007 (109<=+<=7). Sample Input 5 2 4 1 5 2 4 2 5 3 4 1 Sample Output 2 2 0	{"inputs": ["5 2 4 1", "5 2 4 2", "5 3 4 1", "2 2 1 1", "10 1 10 2", "2222 1206 1425 2222", "3 2 3 1", "5 1 2 1", "50 48 41 2", "50 25 21 50", "5000 1 100 3", "100 1 30 500", "50 5 2 50", "35 9 10 35", "10 1 3 4", "22 9 18 3", "500 500 498 4999", "300 300 299 300", "100 3 30 5000", "222 187 134 500", "300 299 300 300", "400 11 12 400", "2 1 2 5000", "2 1 2 5000", "1000 213 480 1", "1000 213 480 1", "2 1 2 1", "10 1 4 4999", "500 499 500 500", "500 500 498 5000", "300 1 300 300", "300 300 1 300", "500 498 500 499", "1000 1 500 1000", "500 498 500 500", "500 1 500 500", "2000 500 1 2000", "1000 500 1 2000", "1000 500 1 1000", "5000 2500 1 5000", "5000 1 2500 5000", "4999 2500 1 4999", "4999 1 2 4999", "5000 100 1 5000", "5000 4999 5000 5000", "3999 2 10 5000", "4998 2 4 5000", "5000 5000 1 5000", "5000 5000 4999 5000", "5000 4998 5000 5000", "443 144 6 223", "232 34 49 234", "232 195 193 322", "488 96 473 488", "500 436 412 500", "4943 944 1747 2213", "2032 1050 1339 2334", "2332 2204 558 3722", "4988 3629 4106 4488", "5000 2081 3619 5000", "5000 2 5000 5000", "5000 3000 2000 5000", "5000 1 5000 5000", "150 150 1 150", "5 3 2 2", "5 4 2 1", "5000 1031 4737 5000", "5000 1031 4782 5000", "5000 2314 1234 5000"], "outputs": ["2", "2", "0", "0", "44", "402572650", "0", "0", "44", "317551605", "483642", "627243445", "923222599", "0", "0", "1964", "0", "0", "831733342", "769809644", "0", "0", "0", "0", "478", "478", "0", "2", "0", "0", "396536590", "396536590", "113017568", "594673663", "973540182", "521515914", "288043610", "744846473", "921282926", "898026985", "968861072", "694314934", "0", "363556022", "0", "343196694", "2", "233993486", "0", "701940824", "362569369", "984852735", "12938181", "212471726", "724363905", "12879261", "439644037", "659576072", "349016655", "557114846", "233993486", "82819894", "233993486", "954984546", "0", "2", "917351304", "981271392", "546628648"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	5	codeforces
778b2187fee20fcdab6240e536a76739	The Text Splitting	You are given the string s of length n and the numbers p,<=q. Split the string s to pieces of length p and q. For example, the string "Hello" for p<==<=2, q<==<=3 can be split to the two strings "Hel" and "lo" or to the two strings "He" and "llo". Note it is allowed to split the string s to the strings only of length p or to the strings only of length q (see the second sample test). The first line contains three positive integers n,<=p,<=q (1<=≤<=p,<=q<=≤<=n<=≤<=100). The second line contains the string s consists of lowercase and uppercase latin letters and digits. If it's impossible to split the string s to the strings of length p and q print the only number "-1". Otherwise in the first line print integer k — the number of strings in partition of s. Each of the next k lines should contain the strings in partition. Each string should be of the length p or q. The string should be in order of their appearing in string s — from left to right. If there are several solutions print any of them. Sample Input 5 2 3 Hello 10 9 5 Codeforces 6 4 5 Privet 8 1 1 abacabac Sample Output 2 He llo 2 Codef orces -1 8 a b a c a b a c	{"inputs": ["5 2 3\nHello", "10 9 5\nCodeforces", "6 4 5\nPrivet", "8 1 1\nabacabac", "1 1 1\n1", "10 8 1\nuTl9w4lcdo", "20 6 4\nfmFRpk2NrzSvnQC9gB61", "30 23 6\nWXDjl9kitaDTY673R5xyTlbL9gqeQ6", "40 14 3\nSOHBIkWEv7ScrkHgMtFFxP9G7JQLYXFoH1sJDAde", "50 16 3\nXCgVJUu4aMQ7HMxZjNxe3XARNiahK303g9y7NV8oN6tWdyXrlu", "60 52 8\nhae0PYwXcW2ziQCOSci5VaElHLZCZI81ULSHgpyG3fuZaP0fHjN4hCKogONj", "70 50 5\n1BH1ECq7hjzooQOZdbiYHTAgATcP5mxI7kLI9rqA9AriWc9kE5KoLa1zmuTDFsd2ClAPPY", "80 51 8\no2mpu1FCofuiLQb472qczCNHfVzz5TfJtVMrzgN3ff7FwlAY0fQ0ROhWmIX2bggodORNA76bHMjA5yyc", "90 12 7\nclcImtsw176FFOA6OHGFxtEfEyhFh5bH4iktV0Y8onIcn0soTwiiHUFRWC6Ow36tT5bsQjgrVSTcB8fAVoe7dJIWkE", "100 25 5\n2SRB9mRpXMRND5zQjeRxc4GhUBlEQSmLgnUtB9xTKoC5QM9uptc8dKwB88XRJy02r7edEtN2C6D60EjzK1EHPJcWNj6fbF8kECeB", "100 97 74\nxL8yd8lENYnXZs28xleyci4SxqsjZqkYzkEbQXfLQ4l4gKf9QQ9xjBjeZ0f9xQySf5psDUDkJEtPLsa62n4CLc6lF6E2yEqvt4EJ", "51 25 11\nwpk5wqrB6d3qE1slUrzJwMFafnnOu8aESlvTEb7Pp42FDG2iGQn", "70 13 37\nfzL91QIJvNoZRP4A9aNRT2GTksd8jEb1713pnWFaCGKHQ1oYvlTHXIl95lqyZRKJ1UPYvT", "10 3 1\nXQ2vXLPShy", "4 2 3\naaaa", "100 1 1\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb", "99 2 4\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "11 2 3\nhavanahavan", "100 2 2\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "17 3 5\ngopstopmipodoshli", "5 4 3\nfoyku", "99 2 2\n123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789", "99 2 2\nrecursionishellrecursionishellrecursionishellrecursionishellrecursionishellrecursionishelldontuseit", "11 2 3\nqibwnnvqqgo", "4 4 3\nhhhh", "99 2 2\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "99 2 5\nhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh", "10 5 9\nCodeforces", "10 5 9\naaaaaaaaaa", "11 3 2\nmlmqpohwtsf", "3 3 2\nzyx", "100 3 3\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "4 2 3\nzyxw", "3 2 3\nejt", "5 2 4\nzyxwv", "100 1 1\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "100 5 4\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "3 2 2\nzyx", "99 2 2\nhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh", "26 8 9\nabcabcabcabcabcabcabcabcab", "6 3 5\naaaaaa", "3 2 3\nzyx", "5 5 2\naaaaa", "4 3 2\nzyxw", "5 4 3\nzyxwv", "95 3 29\nabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcab", "3 2 2\naaa", "91 62 3\nfjzhkfwzoabaauvbkuzaahkozofaophaafhfpuhobufawkzbavaazwavwppfwapkapaofbfjwaavajojgjguahphofj", "99 2 2\nabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabc", "56 13 5\nabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcab", "79 7 31\nabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabcabca", "92 79 6\nxlvplpckwnhmctoethhslkcyashqtsoeltriddglfwtgkfvkvgytygbcyohrvcxvosdioqvackxiuifmkgdngvbbudcb", "48 16 13\nibhfinipihcbsqnvtgsbkobepmwymlyfmlfgblvhlfhyojsy", "16 3 7\naaaaaaaaaaaaaaaa", "11 10 3\naaaaaaaaaaa", "11 8 8\naaaaaaaaaaa", "11 7 3\naaaaaaaaaaa", "41 3 4\nabcabcabcabcabcabcabcabcabcabcabcabcabcab", "11 3 2\naaaaaaaaaaa", "14 9 4\nabcdefghijklmn", "9 9 5\n123456789", "92 10 41\nmeotryyfneonmnrvfnhqlehlxtvpracifpadcofecvbikoitrlgeftiqofpvacgocrdiquhatlqosqvtduenaqkwrnnw", "17 16 3\ndxyhgtsxtuyljmclj", "82 13 30\nfmtwumakkejtolxqxrnydhqoufwtdwldfxcfjrndauqcarhbwmdwxsxfbqjsfspuxobywhcrvlndsdmkqd", "95 3 3\nihnfqcswushyoirjxlxxnwqtwtaowounkumxukwpacxwatimhhhoggqwkkspcplvyndfukbxickcixidgxkjtnpkoeiwlor", "7 5 3\nzyxwvut", "17 16 4\nctvfhkiakagcilrdw"], "outputs": ["2\nHe\nllo", "2\nCodef\norces", "-1", "8\na\nb\na\nc\na\nb\na\nc", "1\n1", "10\nu\nT\nl\n9\nw\n4\nl\nc\nd\no", "5\nfmFR\npk2N\nrzSv\nnQC9\ngB61", "5\nWXDjl9\nkitaDT\nY673R5\nxyTlbL\n9gqeQ6", "6\nSOHBIkWEv7Scrk\nHgMtFFxP9G7JQL\nYXF\noH1\nsJD\nAde", "8\nXCgVJUu4aMQ7HMxZ\njNxe3XARNiahK303\ng9y\n7NV\n8oN\n6tW\ndyX\nrlu", "2\nhae0PYwXcW2ziQCOSci5VaElHLZCZI81ULSHgpyG3fuZaP0fHjN4\nhCKogONj", "14\n1BH1E\nCq7hj\nzooQO\nZdbiY\nHTAgA\nTcP5m\nxI7kL\nI9rqA\n9AriW\nc9kE5\nKoLa1\nzmuTD\nFsd2C\nlAPPY", "10\no2mpu1FC\nofuiLQb4\n72qczCNH\nfVzz5TfJ\ntVMrzgN3\nff7FwlAY\n0fQ0ROhW\nmIX2bggo\ndORNA76b\nHMjA5yyc", "10\nclcImtsw176F\nFOA6OHGFxtEf\nEyhFh5bH4ikt\nV0Y8onIcn0so\nTwiiHUF\nRWC6Ow3\n6tT5bsQ\njgrVSTc\nB8fAVoe\n7dJIWkE", "20\n2SRB9\nmRpXM\nRND5z\nQjeRx\nc4GhU\nBlEQS\nmLgnU\ntB9xT\nKoC5Q\nM9upt\nc8dKw\nB88XR\nJy02r\n7edEt\nN2C6D\n60Ejz\nK1EHP\nJcWNj\n6fbF8\nkECeB", "-1", "-1", "-1", "10\nX\nQ\n2\nv\nX\nL\nP\nS\nh\ny", "2\naa\naa", "100\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb\nb", "-1", "4\nha\nvan\naha\nvan", "50\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa\naa", "5\ngop\nsto\npmi\npod\noshli", "-1", "-1", "-1", "4\nqi\nbwn\nnvq\nqgo", "1\nhhhh", "-1", "21\nhh\nhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh\nhhhhh", "2\nCodef\norces", "2\naaaaa\naaaaa", "5\nmlm\nqp\noh\nwt\nsf", "1\nzyx", "-1", "2\nzy\nxw", "1\nejt", "-1", "100\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na\na", "25\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa\naaaa", "-1", "-1", "3\nabcabcab\ncabcabcab\ncabcabcab", "2\naaa\naaa", "1\nzyx", "1\naaaaa", "2\nzy\nxw", "-1", "23\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabc\nabcabcabcabcabcabcabcabcabcab", "-1", "-1", "-1", "8\nabcabcabcabca\nbcabcabcabcab\ncabca\nbcabc\nabcab\ncabca\nbcabc\nabcab", "-1", "-1", "3\nibhfinipihcbsqnv\ntgsbkobepmwymlyf\nmlfgblvhlfhyojsy", "4\naaa\naaa\naaa\naaaaaaa", "-1", "-1", "-1", "11\nabc\nabc\nabc\nabca\nbcab\ncabc\nabca\nbcab\ncabc\nabca\nbcab", "5\naaa\naa\naa\naa\naa", "-1", "1\n123456789", "3\nmeotryyfne\nonmnrvfnhqlehlxtvpracifpadcofecvbikoitrlg\neftiqofpvacgocrdiquhatlqosqvtduenaqkwrnnw", "-1", "5\nfmtwumakkejto\nlxqxrnydhqouf\nwtdwldfxcfjrn\ndauqcarhbwmdw\nxsxfbqjsfspuxobywhcrvlndsdmkqd", "-1", "-1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	99	codeforces
779fdfa680ef6b95e64785246e21ff16	Face Detection	The developers of Looksery have to write an efficient algorithm that detects faces on a picture. Unfortunately, they are currently busy preparing a contest for you, so you will have to do it for them. In this problem an image is a rectangular table that consists of lowercase Latin letters. A face on the image is a 2<=×<=2 square, such that from the four letters of this square you can make word "face". You need to write a program that determines the number of faces on the image. The squares that correspond to the faces can overlap. The first line contains two space-separated integers, n and m (1<=≤<=n,<=m<=≤<=50) — the height and the width of the image, respectively. Next n lines define the image. Each line contains m lowercase Latin letters. In the single line print the number of faces on the image. Sample Input 4 4 xxxx xfax xcex xxxx 4 2 xx cf ae xx 2 3 fac cef 1 4 face Sample Output 1 1 2 0	{"inputs": ["4 4\nxxxx\nxfax\nxcex\nxxxx", "4 2\nxx\ncf\nae\nxx", "2 3\nfac\ncef", "1 4\nface", "5 5\nwmmwn\nlurcm\nkeetd\nfokon\ncxxgx", "5 5\nkjxbw\neacra\nxefhx\nucmcz\npgtjk", "1 1\np", "2 5\nacdmw\nefazb", "5 2\ndz\nda\nsx\nyu\nzz", "5 5\nxeljd\nwriac\nveief\nlcacf\nbqefn", "5 5\nacnbx\nefacp\nlrefa\norqce\nzvbay", "5 5\nbyjvu\nkmaca\nalefe\nwcacg\nrefez", "5 5\npuxac\nbbaef\naccfa\nefaec\nligsr", "37 4\nacjo\nefac\nacef\nefac\nwpef\nicac\naefe\ncfac\naece\ncfaf\nyqce\nmiaf\nirce\nycaf\naefc\ncfae\nrsnc\nbacz\nqefb\npdhs\nffac\nfaef\nacfd\nacmi\nefvm\nacaz\nefpn\nacao\nefer\nacap\nefec\nacaf\nefef\nacbj\nefac\nacef\nefoz", "7 3\njac\naef\ncfa\naec\ncfq\ndig\nxyq", "35 1\ny\na\nk\ng\ni\nd\nv\nn\nl\nx\nu\nx\nu\no\nd\nf\nk\nj\nr\nm\nq\ns\nc\nd\nc\nm\nv\nh\nn\ne\nl\nt\nz\ny\no", "9 46\nuuexbaacesjclggslacermcbkxlcxhdgqtacdwfryxzuxc\naclrsaefakndbnzlkefenuphgcgoedhkaxefjtnkgfeaca\nefuqunpmfxdyyffyhvracozzrxlpekhtsrfhlilfmyhefg\numyacfzffvicqtdpiulefnwcojuwtfbvlxkfsiapdnzpqo\nactefvuxqptremlqjhdbdwacjxdxitxjktecvefacamjcz\neflarseklqrkayhosverpfefzirqigzlxezabhzeferkwm\nztpypwxyohtacsnnvoigqwcachtaceyxlkhfhgwbnfmklb\nfzpqeymhljiefctvqtbgcdjefkxefarbciyosmktmoziac\nbssxizyrzyhacszttwhrzspbfkgfcejybdjcpuczhrkqef", "7 30\nmjfracgaacacctacrreyrlkacuacay\nrlacefacefeftaeftkacacaefcefev\nacefacefacraccfaeaefefecaeacaf\nefacefacefaefaecfcfacacaecfefa\nncefacefacecacfaeaecefefcaeace\nfafaceacuafaefadcfcafacaefcfea\nzsvefafukcecfarkaeaecefecailgu", "2 2\nff\nee", "2 2\nfa\ncc", "2 2\nfa\naa", "2 2\nfa\nea", "2 2\nfa\ndd", "2 2\nee\nff", "2 2\ncc\ncf", "2 2\naa\nae", "2 2\nef\nac", "2 2\nfe\nca"], "outputs": ["1", "1", "2", "0", "0", "1", "0", "1", "0", "2", "3", "5", "5", "49", "5", "0", "20", "95", "0", "0", "0", "0", "0", "0", "0", "0", "1", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	260	codeforces
77cd1f091319b7e918a798512706abd9	Subsegments	Programmer Sasha has recently begun to study data structures. His coach Stas told him to solve the problem of finding a minimum on the segment of the array in , which Sasha coped with. For Sasha not to think that he had learned all, Stas gave him a new task. For each segment of the fixed length Sasha must find the maximum element of those that occur on the given segment exactly once. Help Sasha solve this problem. The first line contains two positive integers n and k (1<=≤<=n<=≤<=105,<=1<=≤<=k<=≤<=n) — the number of array elements and the length of the segment. Then follow n lines: the i-th one contains a single number ai (<=-<=109<=≤<=ai<=≤<=109). Print n–k<=+<=1 numbers, one per line: on the i-th line print of the maximum number of those numbers from the subarray ai ai<=+<=1 … ai<=+<=k<=-<=1 that occur in this subarray exactly 1 time. If there are no such numbers in this subarray, print "Nothing". Sample Input 5 3 1 2 2 3 3 6 4 3 3 3 4 4 2 Sample Output 1 3 2 4 Nothing 3	{"inputs": ["5 3\n1\n2\n2\n3\n3", "6 4\n3\n3\n3\n4\n4\n2", "10 3\n-55\n-35\n-80\n91\n-96\n-93\n-39\n-77\n4\n29", "10 3\n-13\n26\n-97\n-38\n43\n-12\n80\n3\n8\n45", "10 3\n-84\n25\n-25\n8\n60\n-74\n-98\n48\n-55\n38", "10 3\n-62\n-81\n46\n22\n-84\n19\n-86\n44\n-84\n-73", "10 3\n-6\n2\n79\n-49\n86\n13\n-31\n-71\n57\n93", "10 3\n-38\n68\n-77\n57\n-35\n28\n-61\n-9\n3\n60", "10 3\n2\n-100\n50\n-85\n-48\n68\n-96\n-31\n85\n-29", "10 3\n-20\n-63\n-64\n45\n-84\n-13\n79\n-31\n70\n-100"], "outputs": ["1\n3\n2", "4\nNothing\n3", "-35\n91\n91\n91\n-39\n-39\n4\n29", "26\n26\n43\n43\n80\n80\n80\n45", "25\n25\n60\n60\n60\n48\n48\n48", "46\n46\n46\n22\n19\n44\n44\n44", "79\n79\n86\n86\n86\n13\n57\n93", "68\n68\n57\n57\n28\n28\n3\n60", "50\n50\n50\n68\n68\n68\n85\n85", "-20\n45\n45\n45\n79\n79\n79\n70"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
77dd332fafec225b0a001ffa4b0736af	Restoring IPv6	An IPv6-address is a 128-bit number. For convenience, this number is recorded in blocks of 16 bits in hexadecimal record, the blocks are separated by colons — 8 blocks in total, each block has four hexadecimal digits. Here is an example of the correct record of a IPv6 address: "0124:5678:90ab:cdef:0124:5678:90ab:cdef". We'll call such format of recording an IPv6-address full. Besides the full record of an IPv6 address there is a short record format. The record of an IPv6 address can be shortened by removing one or more leading zeroes at the beginning of each block. However, each block should contain at least one digit in the short format. For example, the leading zeroes can be removed like that: "a56f:00d3:0000:0124:0001:f19a:1000:0000" <=→<= "a56f:d3:0:0124:01:f19a:1000:00". There are more ways to shorten zeroes in this IPv6 address. Some IPv6 addresses contain long sequences of zeroes. Continuous sequences of 16-bit zero blocks can be shortened to "::". A sequence can consist of one or several consecutive blocks, with all 16 bits equal to 0. You can see examples of zero block shortenings below: - "a56f:00d3:0000:0124:0001:0000:0000:0000" <=→<= "a56f:00d3:0000:0124:0001::"; - "a56f:0000:0000:0124:0001:0000:1234:0ff0" <=→<= "a56f::0124:0001:0000:1234:0ff0"; - "a56f:0000:0000:0000:0001:0000:1234:0ff0" <=→<= "a56f:0000::0000:0001:0000:1234:0ff0"; - "a56f:00d3:0000:0124:0001:0000:0000:0000" <=→<= "a56f:00d3:0000:0124:0001::0000"; - "0000:0000:0000:0000:0000:0000:0000:0000" <=→<= "::". It is not allowed to shorten zero blocks in the address more than once. This means that the short record can't contain the sequence of characters "::" more than once. Otherwise, it will sometimes be impossible to determine the number of zero blocks, each represented by a double colon. The format of the record of the IPv6 address after removing the leading zeroes and shortening the zero blocks is called short. You've got several short records of IPv6 addresses. Restore their full record. The first line contains a single integer n — the number of records to restore (1<=≤<=n<=≤<=100). Each of the following n lines contains a string — the short IPv6 addresses. Each string only consists of string characters "0123456789abcdef:". It is guaranteed that each short address is obtained by the way that is described in the statement from some full IPv6 address. For each short IPv6 address from the input print its full record on a separate line. Print the full records for the short IPv6 addresses in the order, in which the short records follow in the input. Sample Input 6 a56f:d3:0:0124:01:f19a:1000:00 a56f:00d3:0000:0124:0001:: a56f::0124:0001:0000:1234:0ff0 a56f:0000::0000:0001:0000:1234:0ff0 :: 0ea::4d:f4:6:0 Sample Output a56f:00d3:0000:0124:0001:f19a:1000:0000 a56f:00d3:0000:0124:0001:0000:0000:0000 a56f:0000:0000:0124:0001:0000:1234:0ff0 a56f:0000:0000:0000:0001:0000:1234:0ff0 0000:0000:0000:0000:0000:0000:0000:0000 00ea:0000:0000:0000:004d:00f4:0006:0000	{"inputs": ["6\na56f:d3:0:0124:01:f19a:1000:00\na56f:00d3:0000:0124:0001::\na56f::0124:0001:0000:1234:0ff0\na56f:0000::0000:0001:0000:1234:0ff0\n::\n0ea::4d:f4:6:0", "20\n0:0:9e39:9:b21:c9b:c:0\n0:0:0:0:0:a27:6b:cb0a\n2:7:4d:b:0:3:2:f401\n17:2dc6::0:89e3:0:dc:0\nca:4:0:0:d6:b999:e:0\n4af:553:b29:dd7:2:5b:0:7\n0:c981:8f:a4d:0:d4:0:f61\n0:0:1:0:dc33:0:1964:0\n84:da:0:6d6:0ecc:1:f:0\n4:fb:4d37:0:8c:4:4a52:24\nc:e:a:0:0:0:e:0\n0:3761:72ed:b7:3b0:ff7:fc:102\n5ae:8ca7:10::0:9b2:0:525a\n0::ab:8d64:86:767:2\ne6b:3cb:0:81ce:0ac4:11::1\n4:0:5238:7b:591d:ff15:0:e\n0:f9a5:0::118e:dde:0\n0:d4c:feb:b:10a:0:d:e\n0:0:0:ff38:b5d:a3c2:f3:0\n2:a:6:c50:83:4f:7f0d::", "10\n1::7\n0:0::1\n::1ed\n::30:44\n::eaf:ff:000b\n56fe::\ndf0:3df::\nd03:ab:0::\n85::0485:0\n::", "6\n0:00:000:0000::\n1:01:001:0001::\nf:0f:00f:000f::\n1:10:100:1000::\nf:f0:f00:f000::\nf:ff:fff:ffff::", "3\n::\n::\n::", "4\n1:2:3:4:5:6:7:8\n0:0:0:0:0:0:0:0\nf:0f:00f:000f:ff:0ff:00ff:fff\n0fff:0ff0:0f0f:f0f:0f0:f0f0:f00f:ff0f"], "outputs": ["a56f:00d3:0000:0124:0001:f19a:1000:0000\na56f:00d3:0000:0124:0001:0000:0000:0000\na56f:0000:0000:0124:0001:0000:1234:0ff0\na56f:0000:0000:0000:0001:0000:1234:0ff0\n0000:0000:0000:0000:0000:0000:0000:0000\n00ea:0000:0000:0000:004d:00f4:0006:0000", "0000:0000:9e39:0009:0b21:0c9b:000c:0000\n0000:0000:0000:0000:0000:0a27:006b:cb0a\n0002:0007:004d:000b:0000:0003:0002:f401\n0017:2dc6:0000:0000:89e3:0000:00dc:0000\n00ca:0004:0000:0000:00d6:b999:000e:0000\n04af:0553:0b29:0dd7:0002:005b:0000:0007\n0000:c981:008f:0a4d:0000:00d4:0000:0f61\n0000:0000:0001:0000:dc33:0000:1964:0000\n0084:00da:0000:06d6:0ecc:0001:000f:0000\n0004:00fb:4d37:0000:008c:0004:4a52:0024\n000c:000e:000a:0000:0000:0000:000e:0000\n0000:3761:72ed:00b7:03b0:0ff7:00fc:0102\n05ae:8ca7:0010:0000...", "0001:0000:0000:0000:0000:0000:0000:0007\n0000:0000:0000:0000:0000:0000:0000:0001\n0000:0000:0000:0000:0000:0000:0000:01ed\n0000:0000:0000:0000:0000:0000:0030:0044\n0000:0000:0000:0000:0000:0eaf:00ff:000b\n56fe:0000:0000:0000:0000:0000:0000:0000\n0df0:03df:0000:0000:0000:0000:0000:0000\n0d03:00ab:0000:0000:0000:0000:0000:0000\n0085:0000:0000:0000:0000:0000:0485:0000\n0000:0000:0000:0000:0000:0000:0000:0000", "0000:0000:0000:0000:0000:0000:0000:0000\n0001:0001:0001:0001:0000:0000:0000:0000\n000f:000f:000f:000f:0000:0000:0000:0000\n0001:0010:0100:1000:0000:0000:0000:0000\n000f:00f0:0f00:f000:0000:0000:0000:0000\n000f:00ff:0fff:ffff:0000:0000:0000:0000", "0000:0000:0000:0000:0000:0000:0000:0000\n0000:0000:0000:0000:0000:0000:0000:0000\n0000:0000:0000:0000:0000:0000:0000:0000", "0001:0002:0003:0004:0005:0006:0007:0008\n0000:0000:0000:0000:0000:0000:0000:0000\n000f:000f:000f:000f:00ff:00ff:00ff:0fff\n0fff:0ff0:0f0f:0f0f:00f0:f0f0:f00f:ff0f"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	41	codeforces
780a1c7b659cc52202d5fb7c7b7d95ba	Collective Mindsets (hard)	Heidi got one brain, thumbs up! But the evening isn't over yet and one more challenge awaits our dauntless agent: after dinner, at precisely midnight, the N attendees love to play a very risky game... Every zombie gets a number ni (1<=≤<=ni<=≤<=N) written on his forehead. Although no zombie can see his own number, he can see the numbers written on the foreheads of all N<=-<=1 fellows. Note that not all numbers have to be unique (they can even all be the same). From this point on, no more communication between zombies is allowed. Observation is the only key to success. When the cuckoo clock strikes midnight, all attendees have to simultaneously guess the number on their own forehead. If at least one of them guesses his number correctly, all zombies survive and go home happily. On the other hand, if not a single attendee manages to guess his number correctly, all of them are doomed to die! Zombies aren't very bright creatures though, and Heidi has to act fast if she does not want to jeopardize her life. She has one single option: by performing some quick surgery on the brain she managed to get from the chest, she has the ability to remotely reprogram the decision-making strategy of all attendees for their upcoming midnight game! Can you suggest a sound strategy to Heidi which, given the rules of the game, ensures that at least one attendee will guess his own number correctly, for any possible sequence of numbers on the foreheads? Given a zombie's rank R and the N<=-<=1 numbers ni on the other attendees' foreheads, your program will have to return the number that the zombie of rank R shall guess. Those answers define your strategy, and we will check if it is flawless or not. The first line of input contains a single integer T (1<=≤<=T<=≤<=50000): the number of scenarios for which you have to make a guess. The T scenarios follow, described on two lines each: - The first line holds two integers, N (2<=≤<=N<=≤<=6), the number of attendees, and R (1<=≤<=R<=≤<=N), the rank of the zombie who has to make the guess. - The second line lists N<=-<=1 integers: the numbers on the foreheads of all other attendees, listed in increasing order of the attendees' rank. (Every zombie knows the rank of every other zombie.) For every scenario, output a single integer: the number that the zombie of rank R shall guess, based on the numbers ni on his N<=-<=1 fellows' foreheads. Sample Input 4 2 1 1 2 2 1 2 1 2 2 2 2 2 5 2 2 2 2 2 6 4 3 2 6 1 2 Sample Output 1 2 2 1 5 2	{"inputs": ["4\n2 1\n1\n2 2\n1\n2 1\n2\n2 2\n2", "4\n2 1\n1\n2 2\n1\n2 1\n2\n2 2\n2", "27\n3 1\n1 1\n3 2\n1 1\n3 3\n1 1\n3 1\n2 1\n3 2\n2 1\n3 3\n2 1\n3 1\n3 1\n3 2\n3 1\n3 3\n3 1\n3 1\n1 2\n3 2\n1 2\n3 3\n1 2\n3 1\n2 2\n3 2\n2 2\n3 3\n2 2\n3 1\n3 2\n3 2\n3 2\n3 3\n3 2\n3 1\n1 3\n3 2\n1 3\n3 3\n1 3\n3 1\n2 3\n3 2\n2 3\n3 3\n2 3\n3 1\n3 3\n3 2\n3 3\n3 3\n3 3"], "outputs": ["1\n2\n2\n1", "1\n2\n2\n1", "3\n1\n2\n2\n3\n1\n1\n2\n3\n2\n3\n1\n1\n2\n3\n3\n1\n2\n1\n2\n3\n3\n1\n2\n2\n3\n1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
780ea41ae2abba43273b718c11ef01fa	Kyoya and Colored Balls	Kyoya Ootori has a bag with n colored balls that are colored with k different colors. The colors are labeled from 1 to k. Balls of the same color are indistinguishable. He draws balls from the bag one by one until the bag is empty. He noticed that he drew the last ball of color i before drawing the last ball of color i<=+<=1 for all i from 1 to k<=-<=1. Now he wonders how many different ways this can happen. The first line of input will have one integer k (1<=≤<=k<=≤<=1000) the number of colors. Then, k lines will follow. The i-th line will contain ci, the number of balls of the i-th color (1<=≤<=ci<=≤<=1000). The total number of balls doesn't exceed 1000. A single integer, the number of ways that Kyoya can draw the balls from the bag as described in the statement, modulo 1<=000<=000<=007. Sample Input 3 2 2 1 4 1 2 3 4 Sample Output 3 1680	{"inputs": ["3\n2\n2\n1", "4\n1\n2\n3\n4", "10\n100\n100\n100\n100\n100\n100\n100\n100\n100\n100", "5\n10\n10\n10\n10\n10", "11\n291\n381\n126\n39\n19\n20\n3\n1\n20\n45\n2", "1\n1", "13\n67\n75\n76\n80\n69\n86\n75\n86\n81\n84\n73\n72\n76", "25\n35\n43\n38\n33\n47\n44\n40\n36\n41\n42\n33\n30\n49\n42\n62\n39\n40\n35\n43\n31\n42\n46\n42\n34\n33", "47\n20\n21\n16\n18\n24\n20\n25\n13\n20\n22\n26\n24\n17\n18\n21\n22\n21\n23\n17\n15\n24\n19\n18\n21\n20\n19\n26\n25\n20\n17\n17\n17\n26\n32\n20\n21\n25\n28\n24\n21\n21\n17\n28\n20\n20\n31\n19", "3\n343\n317\n337", "1\n5"], "outputs": ["3", "1680", "12520708", "425711769", "902382672", "1", "232242896", "362689152", "295545118", "691446102", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	113	codeforces
7817fa3aebed2caadd9283cb701d61ca	Black-and-White Cube	You are given a cube of size k<=×<=k<=×<=k, which consists of unit cubes. Two unit cubes are considered neighbouring, if they have common face. Your task is to paint each of k3 unit cubes one of two colours (black or white), so that the following conditions must be satisfied: - each white cube has exactly 2 neighbouring cubes of white color; - each black cube has exactly 2 neighbouring cubes of black color. The first line contains integer k (1<=≤<=k<=≤<=100), which is size of the cube. Print -1 if there is no solution. Otherwise, print the required painting of the cube consequently by layers. Print a k<=×<=k matrix in the first k lines, showing how the first layer of the cube should be painted. In the following k lines print a k<=×<=k matrix — the way the second layer should be painted. And so on to the last k-th layer. Note that orientation of the cube in the space does not matter. Mark a white unit cube with symbol "w" and a black one with "b". Use the format of output data, given in the test samples. You may print extra empty lines, they will be ignored. Sample Input 1 2 Sample Output -1 bb ww bb ww	{"inputs": ["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", "40"], "outputs": ["-1", "bb\nww\n\nbb\nww", "-1", "bbbb\nbwwb\nbwwb\nbbbb\n\nwwww\nwbbw\nwbbw\nwwww\n\nbbbb\nbwwb\nbwwb\nbbbb\n\nwwww\nwbbw\nwbbw\nwwww", "-1", "bbbbbb\nbwwwwb\nbwbbwb\nbwbbwb\nbwwwwb\nbbbbbb\n\nwwwwww\nwbbbbw\nwbwwbw\nwbwwbw\nwbbbbw\nwwwwww\n\nbbbbbb\nbwwwwb\nbwbbwb\nbwbbwb\nbwwwwb\nbbbbbb\n\nwwwwww\nwbbbbw\nwbwwbw\nwbwwbw\nwbbbbw\nwwwwww\n\nbbbbbb\nbwwwwb\nbwbbwb\nbwbbwb\nbwwwwb\nbbbbbb\n\nwwwwww\nwbbbbw\nwbwwbw\nwbwwbw\nwbbbbw\nwwwwww", "-1", "bbbbbbbb\nbwwwwwwb\nbwbbbbwb\nbwbwwbwb\nbwbwwbwb\nbwbbbbwb\nbwwwwwwb\nbbbbbbbb\n\nwwwwwwww\nwbbbbbbw\nwbwwwwbw\nwbwbbwbw\nwbwbbwbw\nwbwwwwbw\nwbbbbbbw\nwwwwwwww\n\nbbbbbbbb\nbwwwwwwb\nbwbbbbwb\nbwbwwbwb\nbwbwwbwb\nbwbbbbwb\nbwwwwwwb\nbbbbbbbb\n\nwwwwwwww\nwbbbbbbw\nwbwwwwbw\nwbwbbwbw\nwbwbbwbw\nwbwwwwbw\nwbbbbbbw\nwwwwwwww\n\nbbbbbbbb\nbwwwwwwb\nbwbbbbwb\nbwbwwbwb\nbwbwwbwb\nbwbbbbwb\nbwwwwwwb\nbbbbbbbb\n\nwwwwwwww\nwbbbbbbw\nwbwwwwbw\nwbwbbwbw\nwbwbbwbw\nwbwwwwbw\nwbbbbbbw\nwwwwwwww\n\nbbbbbbbb\nbwwwwwwb\n...", "-1", "bbbbbbbbbb\nbwwwwwwwwb\nbwbbbbbbwb\nbwbwwwwbwb\nbwbwbbwbwb\nbwbwbbwbwb\nbwbwwwwbwb\nbwbbbbbbwb\nbwwwwwwwwb\nbbbbbbbbbb\n\nwwwwwwwwww\nwbbbbbbbbw\nwbwwwwwwbw\nwbwbbbbwbw\nwbwbwwbwbw\nwbwbwwbwbw\nwbwbbbbwbw\nwbwwwwwwbw\nwbbbbbbbbw\nwwwwwwwwww\n\nbbbbbbbbbb\nbwwwwwwwwb\nbwbbbbbbwb\nbwbwwwwbwb\nbwbwbbwbwb\nbwbwbbwbwb\nbwbwwwwbwb\nbwbbbbbbwb\nbwwwwwwwwb\nbbbbbbbbbb\n\nwwwwwwwwww\nwbbbbbbbbw\nwbwwwwwwbw\nwbwbbbbwbw\nwbwbwwbwbw\nwbwbwwbwbw\nwbwbbbbwbw\nwbwwwwwwbw\nwbbbbbbbbw\nwwwwwwwwww\n\nbbbbbbbbbb\nbwwwwwwwwb\n...", "-1", "bbbbbbbbbbbb\nbwwwwwwwwwwb\nbwbbbbbbbbwb\nbwbwwwwwwbwb\nbwbwbbbbwbwb\nbwbwbwwbwbwb\nbwbwbwwbwbwb\nbwbwbbbbwbwb\nbwbwwwwwwbwb\nbwbbbbbbbbwb\nbwwwwwwwwwwb\nbbbbbbbbbbbb\n\nwwwwwwwwwwww\nwbbbbbbbbbbw\nwbwwwwwwwwbw\nwbwbbbbbbwbw\nwbwbwwwwbwbw\nwbwbwbbwbwbw\nwbwbwbbwbwbw\nwbwbwwwwbwbw\nwbwbbbbbbwbw\nwbwwwwwwwwbw\nwbbbbbbbbbbw\nwwwwwwwwwwww\n\nbbbbbbbbbbbb\nbwwwwwwwwwwb\nbwbbbbbbbbwb\nbwbwwwwwwbwb\nbwbwbbbbwbwb\nbwbwbwwbwbwb\nbwbwbwwbwbwb\nbwbwbbbbwbwb\nbwbwwwwwwbwb\nbwbbbbbbbbwb\nbwwwwwwwwwwb\nbbbbbbbbbbbb\n\nw...", "-1", "bbbbbbbbbbbbbb\nbwwwwwwwwwwwwb\nbwbbbbbbbbbbwb\nbwbwwwwwwwwbwb\nbwbwbbbbbbwbwb\nbwbwbwwwwbwbwb\nbwbwbwbbwbwbwb\nbwbwbwbbwbwbwb\nbwbwbwwwwbwbwb\nbwbwbbbbbbwbwb\nbwbwwwwwwwwbwb\nbwbbbbbbbbbbwb\nbwwwwwwwwwwwwb\nbbbbbbbbbbbbbb\n\nwwwwwwwwwwwwww\nwbbbbbbbbbbbbw\nwbwwwwwwwwwwbw\nwbwbbbbbbbbwbw\nwbwbwwwwwwbwbw\nwbwbwbbbbwbwbw\nwbwbwbwwbwbwbw\nwbwbwbwwbwbwbw\nwbwbwbbbbwbwbw\nwbwbwwwwwwbwbw\nwbwbbbbbbbbwbw\nwbwwwwwwwwwwbw\nwbbbbbbbbbbbbw\nwwwwwwwwwwwwww\n\nbbbbbbbbbbbbbb\nbwwwwwwwwwwwwb\nbwbbbbbbbbbbwb\nbwbwwwwwwww...", "-1", "bbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbwb\nbwbwwwwwwwwwwbwb\nbwbwbbbbbbbbwbwb\nbwbwbwwwwwwbwbwb\nbwbwbwbbbbwbwbwb\nbwbwbwbwwbwbwbwb\nbwbwbwbwwbwbwbwb\nbwbwbwbbbbwbwbwb\nbwbwbwwwwwwbwbwb\nbwbwbbbbbbbbwbwb\nbwbwwwwwwwwwwbwb\nbwbbbbbbbbbbbbwb\nbwwwwwwwwwwwwwwb\nbbbbbbbbbbbbbbbb\n\nwwwwwwwwwwwwwwww\nwbbbbbbbbbbbbbbw\nwbwwwwwwwwwwwwbw\nwbwbbbbbbbbbbwbw\nwbwbwwwwwwwwbwbw\nwbwbwbbbbbbwbwbw\nwbwbwbwwwwbwbwbw\nwbwbwbwbbwbwbwbw\nwbwbwbwbbwbwbwbw\nwbwbwbwwwwbwbwbw\nwbwbwbbbbbbwbwbw\nwbwbwwwwwwwwbwbw\nwbwbb...", "-1", "bbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbwbwb\nbwbwbwwwwwwwwbwbwb\nbwbwbwbbbbbbwbwbwb\nbwbwbwbwwwwbwbwbwb\nbwbwbwbwbbwbwbwbwb\nbwbwbwbwbbwbwbwbwb\nbwbwbwbwwwwbwbwbwb\nbwbwbwbbbbbbwbwbwb\nbwbwbwwwwwwwwbwbwb\nbwbwbbbbbbbbbbwbwb\nbwbwwwwwwwwwwwwbwb\nbwbbbbbbbbbbbbbbwb\nbwwwwwwwwwwwwwwwwb\nbbbbbbbbbbbbbbbbbb\n\nwwwwwwwwwwwwwwwwww\nwbbbbbbbbbbbbbbbbw\nwbwwwwwwwwwwwwwwbw\nwbwbbbbbbbbbbbbwbw\nwbwbwwwwwwwwwwbwbw\nwbwbwbbbbbbbbwbwbw\nwbwbwbwwwwwwbwbwbw\nwbwbwbwbb...", "-1", "bbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbwbwbwb\nbwbwbwbwwwwwwbwbwbwb\nbwbwbwbwbbbbwbwbwbwb\nbwbwbwbwbwwbwbwbwbwb\nbwbwbwbwbwwbwbwbwbwb\nbwbwbwbwbbbbwbwbwbwb\nbwbwbwbwwwwwwbwbwbwb\nbwbwbwbbbbbbbbwbwbwb\nbwbwbwwwwwwwwwwbwbwb\nbwbwbbbbbbbbbbbbwbwb\nbwbwwwwwwwwwwwwwwbwb\nbwbbbbbbbbbbbbbbbbwb\nbwwwwwwwwwwwwwwwwwwb\nbbbbbbbbbbbbbbbbbbbb\n\nwwwwwwwwwwwwwwwwwwww\nwbbbbbbbbbbbbbbbbbbw\nwbwwwwwwwwwwwwwwwwbw\nwbw...", "-1", "bbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbwbwbwbwb\nbwbwbwbwbwwwwbwbwbwbwb\nbwbwbwbwbwbbwbwbwbwbwb\nbwbwbwbwbwbbwbwbwbwbwb\nbwbwbwbwbwwwwbwbwbwbwb\nbwbwbwbwbbbbbbwbwbwbwb\nbwbwbwbwwwwwwwwbwbwbwb\nbwbwbwbbbbbbbbbbwbwbwb\nbwbwbwwwwwwwwwwwwbwbwb\nbwbwbbbbbbbbbbbbbbwbwb\nbwbwwwwwwwwwwwwwwwwbwb\nbwbbbbbbbbbbbbbbbbbbwb\nbwwwwwwwwwwwwwwwwwwwwb\nbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbwbwbwbwbwb\nbwbwbwbwbwbwwbwbwbwbwbwb\nbwbwbwbwbwbwwbwbwbwbwbwb\nbwbwbwbwbwbbbbwbwbwbwbwb\nbwbwbwbwbwwwwwwbwbwbwbwb\nbwbwbwbwbbbbbbbbwbwbwbwb\nbwbwbwbwwwwwwwwwwbwbwbwb\nbwbwbwbbbbbbbbbbbbwbwbwb\nbwbwbwwwwwwwwwwwwwwbwbwb\nbwbwbbbbbbbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwbwbwbwbwbwb\nbwbwbwbwbwbwbbwbwbwbwbwbwb\nbwbwbwbwbwbwbbwbwbwbwbwbwb\nbwbwbwbwbwbwwwwbwbwbwbwbwb\nbwbwbwbwbwbbbbbbwbwbwbwbwb\nbwbwbwbwbwwwwwwwwbwbwbwbwb\nbwbwbwbwbbbbbbbbbbwbwbwbwb\nbwbwbwb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwbwbwbwbwbwb\nbwbwbwbwbwbwbbbbwbwbwbwbwbwb\nbwbwbwbwbwbwbwwbwbwbwbwbwbwb\nbwbwbwbwbwbwbwwbwbwbwbwbwbwb\nbwbwbwbwbwbwbbbbwbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwbwbwbwbwbwb\nb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwwwbwbwbwbwbwb\nbwbwbwbwbwbwbbbbbbwbwbwbwbwbwb\nbwbwbwbwbwbwbwwwwbwbwbwbwbwbwb\nbwbwbwbwbwbwbwbbwbwbwbwbwbwbwb\nbwbwbwbwbwbwbwbbwbwbwbwbwbwbwb\n...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwwwwwbwbwbwbwbwb\nbwbwbwbwbwbwbbbbbbbbwbwbwbwbwbwb\nbwbwbwbwbwbwbwwwwwwbwbwbwbwbwbwb\nbwbwbwbwbwbwbwbbbbwbwbwbwbwbwbwb\nb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwwwwwwwbwbwbwbwbwb\nbwbwbwbwbwbwbbbbbbbbbbwbwbwbwbwbwb\nbwbwbwbwbwbwbwwwwwwwwbwbwbwbwbwbwb\nbwbwbwb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwwwwwwwwwbwbwbwbwbwb\nbwbwbwbwbwbwbbbbbbbbbbbbwbwbwbwbwbwb\nbwbwbwbwbwbwbwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwwwwwwwwwwwbwbwbwbwbwb\nbwbwbwbwbwbwbbbbbbbbbbbbbbwbwbw...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwwwwwwwwwwwwwbwbwbwbwbwb\nbwbwbwb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwbwb\nbwbwb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbbbbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbw...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\n...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbw...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwb...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbw...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwww...", "-1", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nb...", "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb\nbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwb\nbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwb\nbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwb\nbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwb\nbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwb\nbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbbbbbwbwbwb\nbwbwbwbwwwwwwwwwwwwwwwwwwwwwwwwwwbwbwbwb\nbwbwbwbwbbbbbbbbbbbbbbbbbbbbbbbbwbwbwbwb\nbwbwbwbwbwwwwwwwwwwwwwwwwwwwwwwbwbwbwbwb\nbwbwbwbwbwbbbbbbbbbbbbbbbbbbbbwbwbwbwbwb\nbwbwbwbwbwbwwwwwwwwwwwwwwwwwwbwbwbwbwbwb\nbwbwbwb..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	8	codeforces
781ae30408322baa7c0802c2f4550202	String Transformation	You are given a string s consisting of \|s\| small english letters. In one move you can replace any character of this string to the next character in alphabetical order (a will be replaced with b, s will be replaced with t, etc.). You cannot replace letter z with any other letter. Your target is to make some number of moves (not necessary minimal) to get string abcdefghijklmnopqrstuvwxyz (english alphabet) as a subsequence. Subsequence of the string is the string that is obtained by deleting characters at some positions. You need to print the string that will be obtained from the given string and will be contain english alphabet as a subsequence or say that it is impossible. The only one line of the input consisting of the string s consisting of \|s\| (1<=≤<=\|s\|<=≤<=105) small english letters. If you can get a string that can be obtained from the given string and will contain english alphabet as a subsequence, print it. Otherwise print «-1» (without quotes). Sample Input aacceeggiikkmmooqqssuuwwyy thereisnoanswer Sample Output abcdefghijklmnopqrstuvwxyz -1	{"inputs": ["aacceeggiikkmmooqqssuuwwyy", "thereisnoanswer", "jqcfvsaveaixhioaaeephbmsmfcgdyawscpyioybkgxlcrhaxs", "rtdacjpsjjmjdhcoprjhaenlwuvpfqzurnrswngmpnkdnunaendlpbfuylqgxtndhmhqgbsknsy", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxxx", "abcdefghijklmnopqrstuvwxya", "aaaaaaaaaaaaaaaaaaaaaaaaaa", "cdaaaaaaaaabcdjklmnopqrstuvwxyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz", "zazaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyz", "abbbefghijklmnopqrstuvwxyz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmaopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyx", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaz", "zaaaazaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaafghijklmnopqrstuvwxyz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaz", "abcdefghijklmnopqrstuvwaxy", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnapqrstuvwxyz", "abcdefghijklmnopqrstuvnxyz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzzzz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aacceeggiikkmmooqqssuuwwya", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aacdefghijklmnopqrstuvwxyyy", "abcaefghijklmnopqrstuvwxyz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "zaaacaaaaaaaaaaaaaaaaaaaayy", "abcdedccdcdccdcdcdcdcdcddccdcdcdc", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdecdcdcddcdcdcdcdcdcdcd", "abaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "a", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaadefghijklmnopqrstuvwxyz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abbbbbbbbbbbbbbbbbbbbbbbbz", "aacceeggiikkmmaacceeggiikkmmooaacceeggiikkmmaacceeggiikkmmooqqssuuwwzy", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "phqghumeaylnlfdxfircvscxggbwkfnqduxwfnfozvsrtkjprepggxrpnrvystmwcysyycqpevikeffmznimkkasvwsrenzkycxf", "aaaaaaaaaaaaaaaaaaaaaaaaap", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "zabcdefghijklmnopqrstuvwxyz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaa", "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "rveviaomdienfygifatviahordebxazoxflfgzslhyzowhxbhqzpsgellkoimnwkvhpbijorhpggwfjexivpqbcbmqjyghkbq", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "xtlsgypsfadpooefxzbcoejuvpvaboygpoeylfpbnpljvrvipyamyehwqnqrqpmxujjloovaowuxwhmsncbxcoksfzkvatxdknly", "jqcfvsaveaixhioaaeephbmsmfcgdyawscpyioybkgxlcrhaxsa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "wlrbbmqbhcdarzowkkyhiddqscdxrjmowfrxsjybldbefsarcbynecdyggxxpklorellnmpapqfwkhopkmcoqh", "abadefghijklmnopqrstuvwxyz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "zazsazcbbbbbbbbbbbbbbbbbbbbbbb", "zazsazcbbbbbbbbbbbbbbbbbbbbbyb", "bbcdefghijklmnopqrstuvwxyzzz", "zaaaaaaaaaaaaaaaaaaaaaaaaaa", "zzzzzaaaaaaaaaaaaaaaaaaaaaaaaaaa", "kkimnfjbbgggicykcciwtoazomcvisigagkjwhyrmojmoebnqoadpmockfjxibdtvrbedrsdoundbcpkfdqdidqdmxdltink", "cawgathqceccscakbazmhwbefvygjbcfyihcbgga", "acrsbyszsbfslzbqzzamcmrypictkcheddehvxdipaxaannjodzyfxgtfnwababzjraapqbqbfzhbiewlzz", "ggcebbheeblbioxdvtlrtkxeuilonazpebcbqpzz", "zzzzabcdefghijklmnopqrstuvwxy", "zabcdefghijklmnopqrstuvwxy", "babcdefghijklmnopqrstuvwxyz", "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz", "aaaaaaaaaaaaaaaaaaaaaaaaaz", "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"], "outputs": ["abcdefghijklmnopqrstuvwxyz", "-1", "-1", "-1", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz", "cdabcdefghijklmnopqrstuvwxyzxyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz", "zazbcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaz", "zabcdzefghijklmnopqrstuvwxyzaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaz", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaa", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzzzz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzy", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "zabcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzcdcdcdc", "abcdefghijklmnopqrstuvwxyzaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "-1", "abcdefghijklmnopqrstuvwxyzaaaaaaaaa", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaa", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzmmooaacceeggiikkmmaacceeggiikkmmooqqssuuwwzy", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "-1", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaa", "zabcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyza", "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzabcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "rveviaomdienfygifbtvichordefxgzoxhlijzslkyzowlxmnqzpsopqrstuvwxyzhpbijorhpggwfjexivpqbcbmqjyghkbq", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaa", "xtlsgypsfadpooefxzbcoejuvpvdeoygpofylgphnpljvrvipyjmyklwqnqrqpmxunopqrvstwuxwvwxyzbxcoksfzkvatxdknly", "jqcfvsavebixhiocdefphgmsmhijkylwsmpynoypqrxstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaa", "wlrbbmqbhcdarzowkkyhiddqscdxrjmowfrxsjybldcefsdrefynghiyjkxxplmornopqrstuvwxyzopkmcoqh", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa", "zazsbzcdefghijklmnopqrstuvwxyz", "zazsbzcdefghijklmnopqrstuvwxyz", "-1", "zabcdefghijklmnopqrstuvwxyz", "zzzzzabcdefghijklmnopqrstuvwxyza", "kkimnfjbbgggicykcciwtoazomcvisigbgkjwhyrmojmoecnqodepmofkgjxihitvrjklrsmounopqrstuvwxyzdmxdltink", "-1", "acrsbyszscfslzdqzzemfmrypigtkhijklmnvxopqrxstuvwxyzyfxgtfnwababzjraapqbqbfzhbiewlzz", "-1", "-1", "-1", "babcdefghijklmnopqrstuvwxyz", "-1", "abcdefghijklmnopqrstuvwxyz", "abcdefghijklmnopqrstuvwxyzaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	68	codeforces
7857ee10aa0bd43979386048eba04748	Tourist's Notes	A tourist hiked along the mountain range. The hike lasted for n days, during each day the tourist noted height above the sea level. On the i-th day height was equal to some integer hi. The tourist pick smooth enough route for his hike, meaning that the between any two consecutive days height changes by at most 1, i.e. for all i's from 1 to n<=-<=1 the inequality \|hi<=-<=hi<=+<=1\|<=≤<=1 holds. At the end of the route the tourist rafted down a mountain river and some notes in the journal were washed away. Moreover, the numbers in the notes could have been distorted. Now the tourist wonders what could be the maximum height during his hike. Help him restore the maximum possible value of the maximum height throughout the hike or determine that the notes were so much distorted that they do not represent any possible height values that meet limits \|hi<=-<=hi<=+<=1\|<=≤<=1. The first line contains two space-separated numbers, n and m (1<=≤<=n<=≤<=108, 1<=≤<=m<=≤<=105) — the number of days of the hike and the number of notes left in the journal. Next m lines contain two space-separated integers di and hdi (1<=≤<=di<=≤<=n, 0<=≤<=hdi<=≤<=108) — the number of the day when the i-th note was made and height on the di-th day. It is guaranteed that the notes are given in the chronological order, i.e. for all i from 1 to m<=-<=1 the following condition holds: di<=<<=di<=+<=1. If the notes aren't contradictory, print a single integer — the maximum possible height value throughout the whole route. If the notes do not correspond to any set of heights, print a single word 'IMPOSSIBLE' (without the quotes). Sample Input 8 2 2 0 7 0 8 3 2 0 7 0 8 3 Sample Output 2 IMPOSSIBLE	{"inputs": ["8 2\n2 0\n7 0", "8 3\n2 0\n7 0\n8 3", "10 10\n1 0\n2 0\n3 0\n4 0\n5 1\n6 2\n7 3\n8 2\n9 3\n10 4", "50 10\n1 42\n7 36\n16 40\n21 40\n26 39\n30 41\n32 41\n36 40\n44 37\n50 41", "50 10\n5 17\n7 15\n10 4\n15 11\n18 13\n21 15\n31 5\n34 13\n40 15\n49 16", "100 50\n1 53\n3 51\n4 50\n6 48\n9 45\n12 48\n14 46\n16 48\n17 47\n19 49\n20 48\n22 46\n23 45\n24 44\n26 46\n27 47\n29 49\n32 52\n33 53\n35 55\n37 53\n40 50\n41 51\n43 53\n47 57\n50 60\n51 59\n52 60\n57 65\n59 63\n60 62\n61 61\n62 60\n64 62\n68 66\n70 64\n71 63\n73 65\n77 69\n79 67\n81 65\n83 63\n86 66\n88 68\n89 69\n91 67\n94 64\n95 63\n98 60\n100 58", "10 1\n4 16160172", "10000 2\n3270 897970\n8270 899508", "100000000 1\n9783835 100000000", "100000000 1\n1 100000000", "100000000 1\n100000000 100000000", "100000000 2\n1 100000000\n100000000 100000000", "100000000 2\n50000000 100000000\n50000001 100000000", "99999999 20\n3 100000000\n14 100000000\n22 100000000\n24 100000000\n31 100000000\n41 100000000\n46 100000000\n84 100000000\n94 100000000\n98 100000000\n99999912 100000000\n99999915 100000000\n99999916 100000000\n99999923 100000000\n99999935 100000000\n99999937 100000000\n99999954 100000000\n99999955 100000000\n99999979 100000000\n99999982 100000000", "8 3\n2 0\n7 3\n8 0", "10 1\n5 5", "100 2\n1 100\n2 1", "1 1\n1 100", "1 1\n1 10", "1 1\n1 2", "9 2\n1 8\n9 11", "9 2\n1 1\n9 3", "10000000 1\n10000000 0", "3 2\n1 0\n3 0", "100000000 2\n1 2\n2 1", "1 1\n1 5"], "outputs": ["2", "IMPOSSIBLE", "4", "42", "IMPOSSIBLE", "69", "16160178", "901239", "190216165", "199999999", "199999999", "149999999", "149999999", "149999907", "IMPOSSIBLE", "10", "IMPOSSIBLE", "100", "10", "2", "13", "6", "9999999", "1", "99999999", "5"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	21	codeforces
786f75d6b052237b13d2da32090caf0a	Berland and the Shortest Paths	There are $n$ cities in Berland. Some pairs of cities are connected by roads. All roads are bidirectional. Each road connects two different cities. There is at most one road between a pair of cities. The cities are numbered from $1$ to $n$. It is known that, from the capital (the city with the number $1$), you can reach any other city by moving along the roads. The President of Berland plans to improve the country's road network. The budget is enough to repair exactly $n-1$ roads. The President plans to choose a set of $n-1$ roads such that: - it is possible to travel from the capital to any other city along the $n-1$ chosen roads, - if $d_i$ is the number of roads needed to travel from the capital to city $i$, moving only along the $n-1$ chosen roads, then $d_1 + d_2 + \dots + d_n$ is minimized (i.e. as minimal as possible). In other words, the set of $n-1$ roads should preserve the connectivity of the country, and the sum of distances from city $1$ to all cities should be minimized (where you can only use the $n-1$ chosen roads). The president instructed the ministry to prepare $k$ possible options to choose $n-1$ roads so that both conditions above are met. Write a program that will find $k$ possible ways to choose roads for repair. If there are fewer than $k$ ways, then the program should output all possible valid ways to choose roads. The first line of the input contains integers $n$, $m$ and $k$ ($2 \le n \le 2\cdot10^5, n-1 \le m \le 2\cdot10^5, 1 \le k \le 2\cdot10^5$), where $n$ is the number of cities in the country, $m$ is the number of roads and $k$ is the number of options to choose a set of roads for repair. It is guaranteed that $m \cdot k \le 10^6$. The following $m$ lines describe the roads, one road per line. Each line contains two integers $a_i$, $b_i$ ($1 \le a_i, b_i \le n$, $a_i \ne b_i$) — the numbers of the cities that the $i$-th road connects. There is at most one road between a pair of cities. The given set of roads is such that you can reach any city from the capital. Print $t$ ($1 \le t \le k$) — the number of ways to choose a set of roads for repair. Recall that you need to find $k$ different options; if there are fewer than $k$ of them, then you need to find all possible different valid options. In the following $t$ lines, print the options, one per line. Print an option as a string of $m$ characters where the $j$-th character is equal to '1' if the $j$-th road is included in the option, and is equal to '0' if the road is not included. The roads should be numbered according to their order in the input. The options can be printed in any order. All the $t$ lines should be different. Since it is guaranteed that $m \cdot k \le 10^6$, the total length of all the $t$ lines will not exceed $10^6$. If there are several answers, output any of them. Sample Input 4 4 3 1 2 2 3 1 4 4 3 4 6 3 1 2 2 3 1 4 4 3 2 4 1 3 5 6 2 1 2 1 3 2 4 2 5 3 4 3 5 Sample Output 2 1110 1011 1 101001 2 111100 110110	{"inputs": ["4 4 3\n1 2\n2 3\n1 4\n4 3", "4 6 3\n1 2\n2 3\n1 4\n4 3\n2 4\n1 3", "5 6 2\n1 2\n1 3\n2 4\n2 5\n3 4\n3 5", "2 1 200000\n2 1", "3 2 100000\n1 2\n2 3", "3 2 100000\n1 2\n1 3", "3 3 1000\n1 2\n2 3\n3 1", "5 6 166666\n1 2\n1 3\n2 4\n2 5\n3 4\n3 5", "5 6 10\n4 5\n3 2\n3 5\n1 3\n5 1\n1 2", "6 9 10\n3 5\n3 2\n1 3\n2 1\n6 3\n1 6\n4 2\n1 5\n6 5", "10 14 100\n2 8\n4 7\n1 4\n9 1\n6 9\n8 6\n10 2\n8 4\n1 7\n6 5\n10 9\n3 10\n6 2\n1 3", "15 20 100\n6 7\n15 11\n2 15\n9 5\n9 1\n8 2\n2 10\n2 12\n3 11\n5 12\n14 9\n4 11\n11 2\n13 5\n12 7\n6 1\n13 3\n8 6\n10 8\n3 7", "16 20 100\n9 12\n7 1\n9 6\n1 5\n5 14\n9 11\n6 1\n3 1\n1 16\n5 6\n11 3\n9 5\n10 7\n13 1\n4 3\n5 16\n9 8\n15 13\n9 2\n14 3", "16 20 100\n8 4\n2 16\n8 7\n6 11\n8 9\n10 4\n1 4\n3 9\n5 8\n3 14\n5 6\n11 4\n10 15\n1 16\n9 5\n13 10\n5 14\n3 1\n12 16\n6 1", "16 20 100\n7 8\n6 5\n15 1\n7 2\n2 12\n1 7\n7 9\n13 15\n11 14\n3 10\n8 3\n2 14\n3 4\n1 5\n4 15\n10 12\n11 4\n4 8\n7 16\n14 13", "16 20 100\n6 3\n15 16\n14 2\n15 5\n6 12\n13 16\n9 12\n16 3\n5 11\n16 14\n10 8\n4 3\n2 7\n8 14\n2 3\n1 3\n13 15\n14 3\n3 5\n8 2", "16 20 100\n4 6\n7 15\n10 5\n8 6\n9 11\n12 15\n14 1\n13 7\n12 2\n4 12\n14 16\n3 16\n9 15\n4 5\n8 15\n6 3\n2 11\n9 12\n5 15\n3 11", "18 23 100\n5 13\n10 2\n6 3\n8 2\n1 16\n18 10\n12 1\n2 1\n18 2\n6 2\n4 1\n16 7\n15 18\n17 11\n9 17\n17 3\n16 15\n12 14\n14 17\n5 9\n9 2\n17 13\n7 10", "18 23 100\n12 14\n2 11\n1 13\n2 7\n18 17\n16 13\n9 13\n15 1\n9 12\n3 4\n10 11\n18 4\n2 18\n13 8\n5 6\n9 2\n9 4\n13 5\n5 15\n15 4\n18 1\n10 9\n16 5", "18 23 100\n14 1\n4 3\n2 9\n16 10\n10 12\n10 1\n6 15\n1 8\n3 12\n11 14\n9 8\n15 1\n15 9\n7 10\n1 5\n18 16\n3 1\n8 14\n4 9\n11 13\n13 6\n10 17\n13 15", "18 23 100\n5 13\n6 7\n8 2\n13 7\n18 12\n11 18\n9 5\n5 4\n17 15\n11 4\n6 13\n13 15\n18 16\n14 15\n4 8\n7 2\n12 14\n12 1\n2 10\n13 4\n8 5\n3 18\n1 10", "18 23 100\n4 16\n12 17\n2 12\n16 13\n5 8\n2 18\n5 15\n11 5\n15 11\n13 9\n10 4\n15 10\n13 7\n14 15\n4 9\n5 1\n6 13\n3 17\n18 11\n15 3\n9 5\n1 9\n3 5", "50 70 10000\n1 12\n43 48\n39 50\n2 9\n3 10\n2 26\n38 8\n38 39\n12 17\n6 19\n31 21\n17 23\n39 25\n25 9\n42 1\n32 18\n1 18\n32 19\n19 41\n26 32\n4 28\n12 15\n49 5\n16 11\n4 30\n34 16\n26 23\n44 30\n37 4\n25 36\n15 6\n29 27\n48 11\n29 21\n30 20\n32 20\n21 30\n17 7\n33 2\n22 19\n25 34\n49 38\n38 24\n20 46\n14 30\n33 47\n38 45\n18 40\n44 43\n36 40\n7 33\n11 27\n49 35\n25 30\n37 34\n46 28\n42 18\n37 50\n21 47\n40 21\n29 50\n27 49\n16 6\n49 44\n20 6\n37 26\n9 13\n27 19\n1 29\n19 10", "11 18 55555\n1 2\n1 3\n2 4\n2 5\n3 4\n3 5\n4 6\n4 7\n5 6\n5 7\n6 8\n6 9\n7 8\n7 9\n8 10\n8 11\n9 10\n9 11", "17 30 33333\n1 2\n1 3\n2 4\n2 5\n3 4\n3 5\n4 6\n4 7\n5 6\n5 7\n6 8\n6 9\n7 8\n7 9\n8 10\n8 11\n9 10\n9 11\n10 12\n10 13\n11 12\n11 13\n12 14\n12 15\n13 14\n13 15\n14 16\n14 17\n15 16\n15 17", "21 38 26315\n1 2\n1 3\n2 4\n2 5\n3 4\n3 5\n4 6\n4 7\n5 6\n5 7\n6 8\n6 9\n7 8\n7 9\n8 10\n8 11\n9 10\n9 11\n10 12\n10 13\n11 12\n11 13\n12 14\n12 15\n13 14\n13 15\n14 16\n14 17\n15 16\n15 17\n16 18\n16 19\n17 18\n17 19\n18 20\n18 21\n19 20\n19 21"], "outputs": ["2\n1110\n1011", "1\n101001", "2\n111100\n110110", "1\n1", "1\n11", "1\n11", "1\n101", "4\n111100\n110110\n111001\n110011", "1\n100111", "1\n001101110", "6\n10111001111001\n00111011111001\n00111001111011\n10111001110101\n00111011110101\n00111001110111", "4\n10111100111101010111\n10111100011111010111\n10111100101101110111\n10111100001111110111", "4\n11111011101011101110\n11011011101111101110\n11110011101011101111\n11010011101111101111", "2\n11110111011011010111\n11100111011111010111", "8\n11111111011101101010\n11111111010111101010\n11111111001101111010\n11111111000111111010\n11111111011001101011\n11111111010011101011\n11111111001001111011\n11111111000011111011", "4\n11001111101111110110\n11001111101110110111\n10011111101111110110\n10011111101110110111", "6\n11111011101111011001\n11111011011111011001\n11111011001111011101\n11111011101101111001\n11111011011101111001\n11111011001101111101", "4\n11111011111101101101100\n01111011111101101101110\n11111011111101001111100\n01111011111101001111110", "4\n11111111110111100100110\n11111111110011100101110\n11111111110111100010110\n11111111110011100011110", "4\n11111111011101111000011\n11111111010111111000011\n11110111111101111000011\n11110111110111111000011", "4\n01111110110011011110111\n01111110100011111110111\n01101110110111011110111\n01101110100111111110111", "4\n11001111011011111110011\n11001111010111111110011\n01011111011011111110011\n01011111010111111110011", "1536\n1111111110111011111111111001001111011101001111110101101001101100001011\n1111111110111011111111110001101111011101001111110101101001101100001011\n1110111110111111111111111001001111011101001111110101101001101100001011\n1110111110111111111111110001101111011101001111110101101001101100001011\n1111111110111011111111101001001111011101001111110101101001101110001011\n1111111110111011111111100001101111011101001111110101101001101110001011\n1110111110111111111111101001001111011101001111110101101001101110001011\n1...", "256\n111100110011001100\n110110110011001100\n111001110011001100\n110011110011001100\n111100011011001100\n110110011011001100\n111001011011001100\n110011011011001100\n111100100111001100\n110110100111001100\n111001100111001100\n110011100111001100\n111100001111001100\n110110001111001100\n111001001111001100\n110011001111001100\n111100110001101100\n110110110001101100\n111001110001101100\n110011110001101100\n111100011001101100\n110110011001101100\n111001011001101100\n110011011001101100\n111100100101101100\n110110...", "16384\n111100110011001100110011001100\n110110110011001100110011001100\n111001110011001100110011001100\n110011110011001100110011001100\n111100011011001100110011001100\n110110011011001100110011001100\n111001011011001100110011001100\n110011011011001100110011001100\n111100100111001100110011001100\n110110100111001100110011001100\n111001100111001100110011001100\n110011100111001100110011001100\n111100001111001100110011001100\n110110001111001100110011001100\n111001001111001100110011001100\n110011001111001100110011...", "26315\n11110011001100110011001100110011001100\n11011011001100110011001100110011001100\n11100111001100110011001100110011001100\n11001111001100110011001100110011001100\n11110001101100110011001100110011001100\n11011001101100110011001100110011001100\n11100101101100110011001100110011001100\n11001101101100110011001100110011001100\n11110010011100110011001100110011001100\n11011010011100110011001100110011001100\n11100110011100110011001100110011001100\n11001110011100110011001100110011001100\n111100001111001100110011..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
7876e81248cf45d60db62213c103a381	C*++ Calculations	C++ language is quite similar to C++. The similarity manifests itself in the fact that the programs written in C++ sometimes behave unpredictably and lead to absolutely unexpected effects. For example, let's imagine an arithmetic expression in C++ that looks like this (expression* is the main term): - expression ::= summand \| expression<=+<=summand \| expression<=-<=summand - summand ::= increment \| coefficient*increment - increment ::= a++ \| ++a - coefficient ::= 0\|1\|2\|...\|1000 For example, "5a++-3++a+a++" is a valid expression in C++. Thus, we have a sum consisting of several summands divided by signs "+" or "-". Every summand is an expression "a++" or "++a" multiplied by some integer coefficient. If the coefficient is omitted, it is suggested being equal to 1. The calculation of such sum in C++ goes the following way. First all the summands are calculated one after another, then they are summed by the usual arithmetic rules. If the summand contains "a++", then during the calculation first the value of the "a" variable is multiplied by the coefficient, then value of "a" is increased by 1. If the summand contains "++a", then the actions on it are performed in the reverse order: first "a" is increased by 1, then — multiplied by the coefficient. The summands may be calculated in any order, that's why sometimes the result of the calculation is completely unpredictable! Your task is to find its largest possible value. The first input line contains an integer a (<=-<=1000<=≤<=a<=≤<=1000) — the initial value of the variable "a". The next line contains an expression in C++ language of the described type. The number of the summands in the expression does not exceed 1000. It is guaranteed that the line describing the expression contains no spaces and tabulation. Output a single number — the maximal possible value of the expression. Sample Input 1 5a++-3*++a+a++ 3 a+++++a Sample Output 11 8	{"inputs": ["1\n5a++-3++a+a++", "3\na+++++a", "-668\n820a+++402++a-482++a", "902\n600++a+411a+++20a++-340++a-306++a+485a++-776a+++417a+++70a++-703a++", "-215\n840++a+183++a-975++a+301a+++874a++", "-211\n849a++-419a+++720++a-543a+++193a++-506++a", "-206\n859a++-655a+++466++a-786++a+512a+++628a+++747a++", "-441\n214++a+30++a-390++a-112++a-409++a+287a++-660++a-740++a-695a++-830++a+554a++", "875\n132a+++960++a+510a++-37++a-923++a-892a+++427a+++384a++-253a++-82a+++506a+++815a+++499++a", "399\n469++a-935++a-838++a-468++a+79++a-89++a-863++a+531a++-523a++-583++a-411++a+301++a+201a++-108a+++581a+++938++a-16a++-632a+++146a++-230++a+151++a-618a+++593a+++320++a+750++a+185a++-68++a+839a++-853a+++761a++-442a++-385a++-487a++-573a++-820a++-123a+++792++a+95++a+228++a-945a+++126++a-888++a-745++a-217a++-883++a-632++a+82a++-371++a-14++a+528a++", "-677\n490++a", "-744\n672a++-975a++-394a+++968a+++222a+++988++a+504++a-782a++-321++a+980++a-483a++-554++a-347++a-180++a-390a+++403a++-617a+++378a+++544++a-978a+++952a++-618a++-516++a-990++a+540++a-398++a-187++a+401++a+829a++-187++a-185a++-529a++", "-496\n589a+++507++a+59++a-507a+++951++a+99++a-651++a-985a++-61a+++588a++-412a++-756a+++978a+++58++a-230++a-391++a-574a++", "217\n828a+++340++a-450a++-575++a-821++a+89a++-543++a-61++a+629++a-956++a-685++a-424a++", "189\n360++a+889a++-940a++-272a+++437++a-495++a+194++a-339++a-503++a+335++a-459a++-285a++-738++a-554a++-68++a", "-589\n561a++-754++a-577a+++393++a-636++a-481++a+645a++-931++a+198a++-788a++-925a++-580a++-506++a-722a++-33++a+743a++-506++a+243a++-416a++-438a+++23++a-745++a-865a++", "-693\n372++a-195a++-542a+++15a++-560a+++268a+++266a+++476a++-267a+++608a+++766++a-861a++-649a++-973++a-840++a+586++a-346++a-940a++-177a++-925a++-608++a+816++a+150a+++494++a", "7\na+++a++-a++-a+++5a++-2a++", "1000\na++", "1000\n++a", "332\n++a", "4\n0a++", "584\n7*++a"], "outputs": ["11", "8", "-492358", "-97296", "-256096", "-55460", "-351932", "1211971", "1829041", "-2184221", "-331240", "1091591", "408226", "-565304", "-447974", "4173855", "2186029", "50", "1000", "1001", "333", "0", "4095"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	6	codeforces
787aba56bc9a1aaf3dc9a8864f8cf62f	Timofey and remoduling	Little Timofey likes integers a lot. Unfortunately, he is very young and can't work with very big integers, so he does all the operations modulo his favorite prime m. Also, Timofey likes to look for arithmetical progressions everywhere. One of his birthday presents was a sequence of distinct integers a1,<=a2,<=...,<=an. Timofey wants to know whether he can rearrange the elements of the sequence so that is will be an arithmetical progression modulo m, or not. Arithmetical progression modulo m of length n with first element x and difference d is sequence of integers x,<=x<=+<=d,<=x<=+<=2d,<=...,<=x<=+<=(n<=-<=1)·d, each taken modulo m. The first line contains two integers m and n (2<=≤<=m<=≤<=109<=+<=7, 1<=≤<=n<=≤<=105, m is prime) — Timofey's favorite prime module and the length of the sequence. The second line contains n distinct integers a1,<=a2,<=...,<=an (0<=≤<=ai<=<<=m) — the elements of the sequence. Print -1 if it is not possible to rearrange the elements of the sequence so that is will be an arithmetical progression modulo m. Otherwise, print two integers — the first element of the obtained progression x (0<=≤<=x<=<<=m) and its difference d (0<=≤<=d<=<<=m). If there are multiple answers, print any of them. Sample Input 17 5 0 2 4 13 15 17 5 0 2 4 13 14 5 3 1 2 3 Sample Output 13 2 -1 3 4	{"inputs": ["17 5\n0 2 4 13 15", "17 5\n0 2 4 13 14", "5 3\n1 2 3", "17 8\n7 9 11 13 15 1 3 5", "13 2\n0 11", "3 1\n0", "2 1\n1", "241 120\n235 136 237 28 90 60 27 122 239 59 72 46 180 233 182 21 206 153 97 112 94 219 52 109 31 17 8 152 3 118 191 222 214 119 217 39 33 40 1 164 38 173 42 82 130 229 226 73 44 155 85 41 2 132 95 163 192 62 14 210 137 197 135 142 53 154 148 162 140 35 24 106 56 170 93 201 211 147 124 20 177 76 186 228 102 74 129 156 87 51 67 167 178 146 225 111 125 144 45 151 161 22 174 30 188 98 213 199 207 107 209 200 57 65 123 157 6 204 96 66", "241 120\n114 147 193 143 206 74 60 15 75 197 192 93 115 166 116 88 14 46 156 229 7 5 233 188 111 179 102 73 187 196 57 211 137 134 201 92 29 224 160 2 110 119 184 202 20 174 124 225 97 105 1 216 155 161 19 125 101 205 78 38 178 123 87 16 142 47 28 215 219 23 70 238 120 210 69 10 55 128 25 6 42 169 79 65 56 175 170 107 214 61 43 228 24 237 96 133 34 83 152 220 234 66 52 51 84 183 146 173 33 164 151 11 207 157 165 129 64 138 37 106", "17 17\n15 1 6 3 7 8 10 13 12 16 11 9 14 2 0 4 5", "7 3\n3 4 1", "7 3\n4 0 3", "17 2\n5 13", "17 2\n8 3", "17 5\n15 6 9 8 3", "17 5\n2 5 14 8 11", "17 8\n1 10 6 8 2 16 9 15", "17 8\n6 0 8 3 14 11 9 12", "23 1\n4", "23 1\n20", "23 11\n11 7 15 20 18 5 13 0 8 3 19", "23 11\n11 4 0 3 2 14 22 12 13 15 1", "239 100\n35 96 173 36 220 188 102 227 226 237 16 97 79 211 156 49 146 222 57 209 121 201 166 123 61 29 67 89 184 72 14 47 193 127 165 76 171 30 120 68 108 228 130 151 221 139 214 18 210 169 87 100 13 52 196 148 122 86 131 208 65 194 43 178 9 118 0 24 183 45 134 55 71 212 111 106 170 80 179 233 180 238 235 75 153 105 182 70 197 143 31 207 145 83 20 113 101 190 6 64", "239 100\n95 225 152 10 96 20 192 51 150 138 105 206 33 41 29 127 53 75 118 9 21 43 119 52 174 139 86 161 207 19 203 215 228 30 66 64 32 44 217 54 131 0 74 117 22 129 109 171 172 141 181 237 107 151 193 140 142 85 55 182 160 42 185 106 11 97 65 163 195 63 128 226 194 184 173 216 84 130 162 98 76 73 120 196 116 40 62 236 218 8 183 238 149 204 205 108 214 227 31 87", "239 100\n178 74 144 43 201 189 40 175 51 31 202 114 12 17 86 78 53 196 235 158 95 224 143 198 170 117 79 81 23 197 73 165 133 166 21 50 148 34 121 223 184 45 54 228 9 238 187 19 218 169 104 62 106 46 209 182 221 61 59 48 160 27 212 123 5 107 82 102 208 151 7 180 35 191 11 70 168 18 145 89 193 87 91 215 42 139 0 29 140 69 194 41 153 231 154 111 157 122 119 127", "239 100\n9 107 11 203 36 34 35 91 20 3 42 19 225 169 99 41 43 28 113 83 193 219 153 129 155 90 123 17 209 97 235 51 73 27 234 138 49 98 81 106 58 186 139 187 226 25 224 18 65 210 131 121 67 82 137 89 60 145 232 227 179 44 33 1 194 59 195 177 2 74 233 170 50 202 10 201 162 52 105 57 26 161 218 146 171 163 66 115 217 154 122 178 130 75 211 4 12 185 147 114", "7 4\n5 2 1 4", "7 4\n5 2 1 6", "17 16\n11 14 7 15 13 6 3 0 4 10 12 1 16 5 8 9", "17 16\n10 0 7 5 13 3 16 14 1 6 8 15 2 9 12 11"], "outputs": ["13 2", "-1", "3 4", "1 2", "0 11", "0 1", "1 1", "-1", "173 191", "1 1", "-1", "4 3", "5 8", "3 5", "-1", "2 3", "-1", "8 3", "4 1", "20 1", "-1", "22 12", "-1", "66 76", "-1", "224 8", "2 3", "6 3", "3 1", "5 1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
788a3dee5440e886594b2630be6fc988	none	Filya just learned new geometry object — rectangle. He is given a field consisting of n<=×<=n unit cells. Rows are numbered from bottom to top with integer from 1 to n. Columns are numbered from left to right with integers from 1 to n. Cell, located at the intersection of the row r and column c is denoted as (r,<=c). Filya has painted two rectangles, such that their sides are parallel to coordinate axes and each cell lies fully inside or fully outside each of them. Moreover, no cell lies in both rectangles. Later, hedgehog Filya became interested in the location of his rectangles but was unable to find the sheet of paper they were painted on. They were taken by Sonya and now she wants to play a little game with Filya. He tells her a query rectangle and she replies with the number of initial rectangles that lie fully inside the given query rectangle. The query rectangle should match the same conditions as initial rectangles. Rectangle lies fully inside the query if each o its cells lies inside the query. Filya knows Sonya really well, so is sure that if he asks more than 200 questions she will stop to reply. The first line of the input contains an integer n (2<=≤<=n<=≤<=216) — size of the field. For each query an integer between 0 and 2 is returned — the number of initial rectangles that lie fully inside the query rectangle. To make a query you have to print "? x1 y1 x2 y2" (without quotes) (1<=≤<=x1<=≤<=x2<=≤<=n, 1<=≤<=y1<=≤<=y2<=≤<=n), where (x1,<=y1) stands for the position of the bottom left cell of the query and (x2,<=y2) stands for the up right cell of the query. You are allowed to ask no more than 200 queries. After each query you should perform "flush" operation and read the answer. In case you suppose you've already determined the location of two rectangles (or run out of queries) you should print "! x11 y11 x12 y12 x21 y21 x22 y22" (without quotes), where first four integers describe the bottom left and up right cells of the first rectangle, and following four describe the corresponding cells of the second rectangle. You can print the rectangles in an arbitrary order. After you have printed the answer, print the end of the line and perform "flush". Your program should terminate immediately after it print the answer. Sample Input 5 2 1 0 1 1 1 0 1 Sample Output ? 1 1 5 5 ? 1 1 3 3 ? 1 1 3 1 ? 2 2 2 2 ? 3 3 5 5 ? 3 3 3 5 ? 3 3 3 4 ? 3 4 3 5 ! 2 2 2 2 3 4 3 5	{"inputs": ["5\n2 2 2 2\n3 4 3 5", "10\n1 2 4 2\n1 6 4 9", "10\n2 2 4 4\n7 10 9 10", "10\n1 1 10 1\n5 5 5 10", "10\n3 4 10 4\n1 1 10 1", "100\n8 7 90 37\n4 64 4 100", "10\n1 3 1 3\n5 6 5 6", "8\n5 5 5 5\n7 7 7 7", "65536\n56677 37631 57096 58131\n37503 6356 53664 37172", "32768\n17828 4528 27798 14063\n19889 15555 23469 23334", "65536\n1 1 1 1\n65536 65536 65536 65536", "65536\n10000 10000 65536 20000\n1 1 9999 9999", "65536\n1 1 1 1\n2 1 2 1", "65536\n1 1 1 1\n65536 65533 65536 65534", "65536\n1 1 35536 35536\n35537 35537 65536 65536", "65536\n65536 65535 65536 65535\n65535 65536 65535 65536", "65536\n2 2 65536 65536\n1 1 1 1", "65536\n65536 65536 65536 65536\n1 1 1 1", "65536\n1 65536 1 65536\n65536 1 65536 1", "100\n45 67 89 90\n3 4 6 75", "65536\n65536 65536 65536 65536\n65535 65535 65535 65535", "65536\n1 2 1 2\n2 1 2 1", "65536\n406 5764 16570 33442\n6167 61342 10305 65256", "65536\n39235 60239 60844 61310\n734 4630 35003 28918", "65536\n25633 6000 45095 36812\n7134 43330 26516 61810", "65536\n57837 9982 62234 60010\n14205 9254 19852 49347", "65535\n27509 43826 63611 52595\n8620 8098 59547 19624", "65535\n8954 26504 22410 59426\n31023 21131 45504 44500", "10000\n4937 5137 9011 6326\n2224 5663 2565 9554", "65536\n1 1 32768 32768\n32769 32769 65536 65536", "65536\n1 1 32768 32768\n32768 32769 65536 65536", "65536\n1 32769 32768 65536\n32769 1 65536 32768", "65536\n20903 30909 20903 30909\n20904 30910 20904 30910", "65536\n21755 18195 21758 18198\n21753 18198 21754 18199", "65536\n21814 15058 21817 15061\n21817 15056 21818 15057", "65536\n1 1 1 65536\n2 1 2 65536", "65536\n65536 1 65536 65536\n65535 1 65535 65536", "65536\n1 65536 65536 65536\n1 65535 65536 65535", "65536\n1 2 65536 2\n1 1 65536 1", "65536\n1 32768 65536 32768\n1 32769 65536 32769", "65536\n32768 1 32768 65536\n32769 1 32769 65536", "65536\n41 1 41 65536\n42 1 42 65536", "65536\n1 245 65536 245\n1 246 65536 246", "65536\n617 24698 617 24698\n618 24698 618 24698", "65536\n774 16333 774 16333\n774 16334 774 16334", "65536\n32768 32768 32768 32768\n32768 32769 32768 32769", "65536\n32768 32768 32768 32768\n32769 32768 32769 32768", "65536\n32771 32771 32771 32771\n32772 32771 32772 32771", "65536\n32771 32771 32771 32771\n32771 32772 32771 32772", "65536\n1 1 1 1\n2 2 65536 65536", "65536\n65536 1 65536 1\n1 2 65535 65536", "65536\n1 1 1 1\n2 1 65536 65536", "65536\n1 1 1 1\n1 2 65536 65536", "65536\n65536 65536 65536 65536\n1 1 65535 65536", "65536\n65536 65536 65536 65536\n1 1 65536 65535", "10\n4 2 9 6\n8 7 10 9"], "outputs": ["17\n2 2 2 2 3 4 3 5", "21\n1 2 4 2 1 6 4 9", "23\n2 2 4 4 7 10 9 10", "23\n5 5 5 10 1 1 10 1", "21\n1 1 10 1 3 4 10 4", "48\n4 64 4 100 8 7 90 37", "22\n1 3 1 3 5 6 5 6", "24\n5 5 5 5 7 7 7 7", "126\n37503 6356 53664 37172 56677 37631 57096 58131", "118\n19889 15555 23469 23334 17828 4528 27798 14063", "96\n1 1 1 1 65536 65536 65536 65536", "121\n1 1 9999 9999 10000 10000 65536 20000", "65\n1 1 1 1 2 1 2 1", "96\n1 1 1 1 65536 65533 65536 65534", "126\n1 1 35536 35536 35537 35537 65536 65536", "128\n65535 65536 65535 65536 65536 65535 65536 65535", "96\n1 1 1 1 2 2 65536 65536", "96\n1 1 1 1 65536 65536 65536 65536", "96\n1 65536 1 65536 65536 1 65536 1", "49\n3 4 6 75 45 67 89 90", "128\n65535 65535 65535 65535 65536 65536 65536 65536", "66\n1 2 1 2 2 1 2 1", "123\n6167 61342 10305 65256 406 5764 16570 33442", "126\n734 4630 35003 28918 39235 60239 60844 61310", "125\n7134 43330 26516 61810 25633 6000 45095 36812", "126\n14205 9254 19852 49347 57837 9982 62234 60010", "125\n8620 8098 59547 19624 27509 43826 63611 52595", "125\n8954 26504 22410 59426 31023 21131 45504 44500", "104\n2224 5663 2565 9554 4937 5137 9011 6326", "126\n1 1 32768 32768 32769 32769 65536 65536", "126\n1 1 32768 32768 32768 32769 65536 65536", "126\n1 32769 32768 65536 32769 1 65536 32768", "124\n20903 30909 20903 30909 20904 30910 20904 30910", "123\n21753 18198 21754 18199 21755 18195 21758 18198", "122\n21814 15058 21817 15061 21817 15056 21818 15057", "97\n1 1 1 65536 2 1 2 65536", "128\n65535 1 65535 65536 65536 1 65536 65536", "128\n1 65535 65536 65535 1 65536 65536 65536", "97\n1 1 65536 1 1 2 65536 2", "127\n1 32768 65536 32768 1 32769 65536 32769", "127\n32768 1 32768 65536 32769 1 32769 65536", "108\n41 1 41 65536 42 1 42 65536", "112\n1 245 65536 245 1 246 65536 246", "114\n617 24698 617 24698 618 24698 618 24698", "112\n774 16333 774 16333 774 16334 774 16334", "125\n32768 32768 32768 32768 32768 32769 32768 32769", "125\n32768 32768 32768 32768 32769 32768 32769 32768", "128\n32771 32771 32771 32771 32772 32771 32772 32771", "128\n32771 32771 32771 32771 32771 32772 32771 32772", "96\n1 1 1 1 2 2 65536 65536", "111\n1 2 65535 65536 65536 1 65536 1", "96\n1 1 1 1 2 1 65536 65536", "96\n1 1 1 1 1 2 65536 65536", "127\n1 1 65535 65536 65536 65536 65536 65536", "127\n1 1 65536 65535 65536 65536 65536 65536", "25\n4 2 9 6 8 7 10 9"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
78954224f7bdc7ecf9906476c7b560db	Dispute	Valera has n counters numbered from 1 to n. Some of them are connected by wires, and each of the counters has a special button. Initially, all the counters contain number 0. When you press a button on a certain counter, the value it has increases by one. Also, the values recorded in all the counters, directly connected to it by a wire, increase by one. Valera and Ignat started having a dispute, the dispute is as follows. Ignat thought of a sequence of n integers a1,<=a2,<=...,<=an. Valera should choose some set of distinct counters and press buttons on each of them exactly once (on other counters the buttons won't be pressed). If after that there is a counter with the number i, which has value ai, then Valera loses the dispute, otherwise he wins the dispute. Help Valera to determine on which counters he needs to press a button to win the dispute. The first line contains two space-separated integers n and m (1<=≤<=n,<=m<=≤<=105), that denote the number of counters Valera has and the number of pairs of counters connected by wires. Each of the following m lines contains two space-separated integers ui and vi (1<=≤<=ui,<=vi<=≤<=n,<=ui<=≠<=vi), that mean that counters with numbers ui and vi are connected by a wire. It is guaranteed that each pair of connected counters occurs exactly once in the input. The last line contains n space-separated integers a1,<=a2,<=...,<=an (0<=≤<=ai<=≤<=105), where ai is the value that Ignat choose for the i-th counter. If Valera can't win the dispute print in the first line -1. Otherwise, print in the first line integer k (0<=≤<=k<=≤<=n). In the second line print k distinct space-separated integers — the numbers of the counters, where Valera should push buttons to win the dispute, in arbitrary order. If there exists multiple answers, you are allowed to print any of them. Sample Input 5 5 2 3 4 1 1 5 5 3 2 1 1 1 2 0 2 4 2 1 2 3 4 0 0 0 0 Sample Output 2 1 2 3 1 3 4	{"inputs": ["5 5\n2 3\n4 1\n1 5\n5 3\n2 1\n1 1 2 0 2", "4 2\n1 2\n3 4\n0 0 0 0", "3 3\n2 3\n1 3\n1 2\n1 1 3", "4 6\n3 4\n2 3\n2 4\n1 2\n1 3\n4 1\n4 0 2 3", "7 10\n5 4\n1 4\n7 4\n1 2\n6 2\n7 3\n7 2\n5 7\n6 1\n5 1\n3 3 0 3 4 1 4", "9 15\n7 4\n4 6\n3 2\n7 2\n8 1\n9 8\n9 6\n2 8\n7 8\n6 7\n3 6\n7 5\n3 5\n3 7\n1 7\n3 0 5 2 0 3 1 3 0", "10 4\n8 7\n1 5\n7 4\n8 9\n0 1 0 1 0 0 3 1 2 1", "15 31\n8 11\n7 14\n12 8\n2 1\n6 4\n3 11\n3 1\n8 9\n3 8\n15 5\n4 11\n9 10\n8 6\n1 10\n1 14\n1 8\n11 12\n14 15\n7 9\n7 3\n13 14\n3 2\n3 4\n4 5\n14 5\n6 14\n15 7\n11 13\n15 1\n10 7\n5 11\n5 3 7 4 1 0 0 3 3 1 6 3 2 0 3", "20 11\n12 5\n16 8\n2 9\n4 15\n10 19\n1 13\n2 18\n18 8\n12 18\n16 14\n3 13\n1 2 2 0 0 0 0 0 2 1 0 0 3 1 1 3 1 4 1 0", "2 1\n1 2\n0 1"], "outputs": ["2\n1 2", "3\n1 3 4", "0", "1\n2 ", "1\n3 ", "3\n2 5 9 ", "3\n1 3 6 ", "3\n6 7 10 ", "8\n4 5 6 7 8 11 15 20 ", "2\n1 2 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
7897a1fc1ebef585fd78b52d787c82b8	Igor In the Museum	Igor is in the museum and he wants to see as many pictures as possible. Museum can be represented as a rectangular field of n<=×<=m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked with ''. Every two adjacent cells of different types (one empty and one impassable) are divided by a wall containing one picture. At the beginning Igor is in some empty cell. At every moment he can move to any empty cell that share a side with the current one. For several starting positions you should calculate the maximum number of pictures that Igor can see. Igor is able to see the picture only if he is in the cell adjacent to the wall with this picture. Igor have a lot of time, so he will examine every picture he can see. First line of the input contains three integers n, m* and k (3<=≤<=n,<=m<=≤<=1000,<=1<=≤<=k<=≤<=min(n·m,<=100<=000)) — the museum dimensions and the number of starting positions to process. Each of the next n lines contains m symbols '.', '' — the description of the museum. It is guaranteed that all border cells are impassable, so Igor can't go out from the museum. Each of the last k* lines contains two integers x and y (1<=≤<=x<=≤<=n,<=1<=≤<=y<=≤<=m) — the row and the column of one of Igor's starting positions respectively. Rows are numbered from top to bottom, columns — from left to right. It is guaranteed that all starting positions are empty cells. Print k integers — the maximum number of pictures, that Igor can see if he starts in corresponding position. Sample Input 5 6 3 ****** ...* ****** .... **** 2 2 2 5 4 3 4 4 1 ** .. .* **** 3 2 Sample Output 6 4 10 8	{"inputs": ["5 6 3\n*****\n...\n*****\n....\n***\n2 2\n2 5\n4 3", "4 4 1\n*\n..\n.\n\n3 2", "3 3 1\n\n.\n\n2 2", "5 5 10\n**\n...\n..*\n.*\n*\n2 4\n4 2\n2 2\n2 3\n2 2\n2 2\n2 4\n3 2\n2 2\n2 2", "10 3 10\n\n.\n.\n\n\n.\n.\n.\n.\n\n2 2\n2 2\n2 2\n2 2\n8 2\n2 2\n2 2\n7 2\n8 2\n6 2", "3 10 10\n******\n....\n********\n2 6\n2 6\n2 9\n2 9\n2 4\n2 9\n2 6\n2 6\n2 4\n2 6", "10 10 50\n*******\n......*\n....\n*....\n..*..\n....\n***..\n.*..\n..**.\n********\n5 9\n5 9\n7 7\n6 4\n6 7\n8 7\n6 7\n9 2\n3 9\n9 2\n4 7\n4 6\n2 7\n9 2\n7 7\n5 8\n8 7\n8 6\n7 7\n5 9\n8 7\n3 8\n3 8\n5 9\n9 8\n9 3\n8 7\n5 9\n9 2\n9 8\n9 3\n3 8\n9 2\n8 6\n2 4\n6 9\n6 3\n9 8\n3 9\n9 8\n4 5\n8 6\n3 8\n5 9\n8 7\n5 8\n6 9\n8 2\n3 9\n3 9", "5 5 21\n**\n.*\n*\n*\n***\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2"], "outputs": ["6\n4\n10", "8", "4", "12\n12\n12\n12\n12\n12\n12\n12\n12\n12", "6\n6\n6\n6\n10\n6\n6\n10\n10\n10", "4\n4\n6\n6\n4\n6\n4\n4\n4\n4", "8\n8\n10\n28\n10\n10\n10\n8\n6\n8\n28\n28\n28\n8\n10\n8\n10\n10\n10\n8\n10\n6\n6\n8\n4\n8\n10\n8\n8\n4\n8\n6\n8\n10\n28\n8\n28\n4\n6\n4\n28\n10\n6\n8\n10\n8\n8\n8\n6\n6", "4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4\n4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	10	codeforces
78ad365464eb2d196e496497bb74dac6	3-palindrome	In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick. He is too selfish, so for a given n he wants to obtain a string of n characters, each of which is either 'a', 'b' or 'c', with no palindromes of length 3 appearing in the string as a substring. For example, the strings "abc" and "abca" suit him, while the string "aba" doesn't. He also want the number of letters 'c' in his string to be as little as possible. The first line contains single integer n (1<=≤<=n<=≤<=2·105) — the length of the string. Print the string that satisfies all the constraints. If there are multiple answers, print any of them. Sample Input 2 3 Sample Output aa bba	{"inputs": ["2", "3", "38", "47", "59", "67", "77", "89", "98", "109", "117", "1", "200000", "100000", "143670", "104217", "17879", "131809", "140873", "77859", "153022", "179227", "182801", "5188", "86539", "12802", "120289", "132866", "133377", "31775", "160397", "161415", "163623", "22942", "134767", "52257", "64905", "183758", "60131", "146883", "6", "4"], "outputs": ["aa", "aab", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaa", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabba", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabba", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaa", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabba", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabba", "a", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaabbaab...", "aabbaa", "aabb"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	236	codeforces
78cd454c6bfd25122af23d08c5adc899	Undoubtedly Lucky Numbers	Polycarpus loves lucky numbers. Everybody knows that lucky numbers are positive integers, whose decimal representation (without leading zeroes) contain only the lucky digits x and y. For example, if x<==<=4, and y<==<=7, then numbers 47, 744, 4 are lucky. Let's call a positive integer a undoubtedly lucky, if there are such digits x and y (0<=≤<=x,<=y<=≤<=9), that the decimal representation of number a (without leading zeroes) contains only digits x and y. Polycarpus has integer n. He wants to know how many positive integers that do not exceed n, are undoubtedly lucky. Help him, count this number. The first line contains a single integer n (1<=≤<=n<=≤<=109) — Polycarpus's number. Print a single integer that says, how many positive integers that do not exceed n are undoubtedly lucky. Sample Input 10 123 Sample Output 10 113	{"inputs": ["10", "123", "1", "2", "1000", "1000000000", "999999999", "999999998", "999999997", "909090901", "142498040", "603356456", "64214872", "820040584", "442198", "784262", "642678", "468390", "326806", "940", "356", "68", "132", "72", "89", "1", "3", "4", "5", "6", "7", "8", "9", "101", "102"], "outputs": ["10", "113", "1", "2", "352", "40744", "40743", "40742", "40741", "38532", "21671", "31623", "15759", "36407", "3071", "4079", "3615", "3223", "2759", "331", "175", "68", "114", "72", "89", "1", "3", "4", "5", "6", "7", "8", "9", "101", "101"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	45	codeforces
78ce6dee4e09ffe09fe48a5bcd2ea123	Yaroslav and Sequence	Yaroslav has an array, consisting of (2·n<=-<=1) integers. In a single operation Yaroslav can change the sign of exactly n elements in the array. In other words, in one operation Yaroslav can select exactly n array elements, and multiply each of them by -1. Yaroslav is now wondering: what maximum sum of array elements can be obtained if it is allowed to perform any number of described operations? Help Yaroslav. The first line contains an integer n (2<=≤<=n<=≤<=100). The second line contains (2·n<=-<=1) integers — the array elements. The array elements do not exceed 1000 in their absolute value. In a single line print the answer to the problem — the maximum sum that Yaroslav can get. Sample Input 2 50 50 50 2 -1 -100 -1 Sample Output 150 100	{"inputs": ["2\n50 50 50", "2\n-1 -100 -1", "3\n-959 -542 -669 -513 160", "4\n717 473 344 -51 -548 703 -869", "5\n270 -181 957 -509 -6 937 -175 434 -625", "6\n-403 901 -847 -708 -624 413 -293 709 886 445 716", "7\n-236 533 869 903 655 -714 27 890 -311 800 307 -682 665", "8\n-338 134 708 -761 -135 535 631 -354 -259 -973 -147 -281 737 516 -222", "9\n-690 34 -821 842 -712 -909 36 -62 255 -363 433 794 883 -274 -642 343 -1", "10\n86 -619 547 620 -383 -928 945 -253 835 -36 373 925 -705 -64 -577 -386 318 535 528", "19\n-919 -82 -467 -169 100 -363 644 -307 926 971 -695 658 -625 19 -269 -89 63 -733 827 -236 566 95 -496 975 284 157 -373 -656 -245 644 567 -971 -954 337 150 -67 714", "22\n697 556 -538 879 -623 73 -293 -401 -491 -7 -144 853 -319 395 785 248 -585 0 -420 -830 -720 75 411 -397 746 828 -83 -833 -847 709 181 967 314 -633 -322 415 -450 433 -459 438 508 -870 -949", "19\n752 -869 -583 -729 984 -321 -477 -462 429 857 -57 -807 184 296 -594 -728 -903 -524 -726 -551 722 -895 696 301 -339 784 -743 -689 -657 170 -957 -88 -197 832 -65 -689 743", "22\n549 635 969 -519 -858 185 -788 126 -840 533 -560 168 -539 -962 649 -721 -574 245 -986 -859 496 -257 -361 180 -691 -528 -992 -833 -989 -222 901 950 388 -803 624 -536 -588 310 812 320 862 -640 -851", "34\n-944 484 -717 515 -827 765 -746 763 -333 184 979 101 -524 199 624 -200 -903 -488 -376 543 924 18 958 55 -826 -12 419 497 580 -286 25 -512 -858 214 271 58 897 178 -644 -598 -41 -737 156 -765 -182 702 748 -113 -335 282 -456 -860 688 -306 614 -995 -876 -437 684 -353 -711 363 -545 -324 -418 840 472", "19\n-550 109 141 -201 -922 45 926 6 -245 -846 -695 572 -788 -963 -253 161 107 879 78 551 486 563 -533 -376 615 627 913 411 -494 -101 -45 -877 -416 736 255 -810 -491", "56\n-157 136 457 598 -138 -586 -338 752 -566 -718 -333 -965 309 -125 -938 -188 -390 17 -75 -902 -320 163 820 -970 -525 -329 81 488 -412 978 138 344 305 -358 -273 -967 253 -665 -245 187 602 252 -825 -511 828 764 -402 278 995 541 542 549 612 -536 527 -884 225 800 160 -409 -926 -795 -321 -791 981 812 599 381 752 -331 -585 -987 -918 -930 -223 491 -42 -716 836 -412 -497 211 -348 704 -638 6 -840 476 -769 -842 530 616 -97 588 -299 803 228 -250 193 -27 539 -697 417 88 242 578 642 -30 856 -98 70", "46\n-302 538 -331 769 255 -485 979 -725 937 -136 -469 234 496 -696 857 597 -691 122 -540 139 75 -444 749 887 95 -584 526 595 -44 -992 563 -972 533 335 -913 -58 -369 -602 -550 47 -321 588 337 -392 -956 211 758 940 -122 -861 -310 946 -163 420 608 -252 54 -466 -227 -974 -790 178 35 849 617 219 741 914 358 -759 -246 -58 -52 307 -290 399 15 -655 -14 -462 492 -425 511 956 331 -929 905 -866 181 938 60", "27\n-401 -840 -583 -612 -298 -384 798 366 -922 -443 -972 -271 127 -201 992 -748 -351 925 -177 -528 355 5 131 -779 833 -382 -990 -379 -816 681 650 660 624 -112 -652 406 446 -999 259 -778 452 -705 -374 -710 -751 -852 119 -689 -789 96 -984 186 70", "19\n-150 -962 -857 346 257 898 675 629 -104 -105 560 -525 -64 282 647 -341 -781 400 -80 830 360 877 -751 -1 -392 960 989 935 777 -509 -614 -331 301 -305 587 -284 936", "38\n-593 446 -769 -498 957 958 -510 515 257 -75 -145 -942 -307 965 -749 110 -793 -457 812 -679 38 -803 274 -932 954 -923 -300 -528 -238 -624 801 939 -462 -894 679 102 886 62 -212 966 -877 942 -325 -900 -997 -65 783 723 353 -972 172 -234 197 69 885 964 71 328 -144 -860 -712 -848 -185 672 622 -364 -403 308 -309 -316 -935 -889 -757 -346 528", "5\n0 0 0 0 0 -1 -1 -1 -1", "4\n0 0 0 0 0 -1 -1", "5\n0 0 0 0 0 -1 -1 1 1", "4\n0 0 0 0 0 -1 1", "2\n-1 -1 1", "3\n-1 1 1 1 1", "5\n-1 -1 -1 2 2 2 2 2 2", "3\n-100 100 100 100 100", "5\n-1 -2 -3 -4 -5 -6 -7 8 9", "5\n-1 -1 -1 -1 -1 -1 -1 -1 -1", "3\n-1 -1 -1 -1 -1", "4\n-1 -1 -1 0 1 1 1", "7\n-5 -10 12 40 20 -33 23 12 -23 21 -32 14 24", "3\n-2 3 4 5 6", "5\n-10 -100 -100 -10 -20 -5 -1 2 3"], "outputs": ["150", "100", "2843", "3603", "4094", "6359", "7592", "6463", "8094", "9591", "17413", "21725", "21400", "26399", "34048", "17787", "54799", "44689", "28653", "19402", "42209", "4", "2", "4", "2", "3", "5", "15", "500", "45", "9", "5", "6", "269", "20", "251"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	12	codeforces
78d130ce1afd05b3b09a51d2895466ea	Power Consumption Calculation	Tom is interested in power consumption of his favourite laptop. His laptop has three modes. In normal mode laptop consumes P1 watt per minute. T1 minutes after Tom moved the mouse or touched the keyboard for the last time, a screensaver starts and power consumption changes to P2 watt per minute. Finally, after T2 minutes from the start of the screensaver, laptop switches to the "sleep" mode and consumes P3 watt per minute. If Tom moves the mouse or touches the keyboard when the laptop is in the second or in the third mode, it switches to the first (normal) mode. Tom's work with the laptop can be divided into n time periods [l1,<=r1],<=[l2,<=r2],<=...,<=[ln,<=rn]. During each interval Tom continuously moves the mouse and presses buttons on the keyboard. Between the periods Tom stays away from the laptop. Find out the total amount of power consumed by the laptop during the period [l1,<=rn]. The first line contains 6 integer numbers n, P1, P2, P3, T1, T2 (1<=≤<=n<=≤<=100,<=0<=≤<=P1,<=P2,<=P3<=≤<=100,<=1<=≤<=T1,<=T2<=≤<=60). The following n lines contain description of Tom's work. Each i-th of these lines contains two space-separated integers li and ri (0<=≤<=li<=<<=ri<=≤<=1440, ri<=<<=li<=+<=1 for i<=<<=n), which stand for the start and the end of the i-th period of work. Output the answer to the problem. Sample Input 1 3 2 1 5 10 0 10 2 8 4 2 5 10 20 30 50 100 Sample Output 30570	{"inputs": ["1 3 2 1 5 10\n0 10", "2 8 4 2 5 10\n20 30\n50 100", "3 15 9 95 39 19\n873 989\n1003 1137\n1172 1436", "4 73 2 53 58 16\n51 52\n209 242\n281 407\n904 945", "5 41 20 33 43 4\n46 465\n598 875\n967 980\n1135 1151\n1194 1245", "6 88 28 100 53 36\n440 445\n525 614\n644 844\n1238 1261\n1305 1307\n1425 1434", "7 46 61 55 28 59\n24 26\n31 61\n66 133\n161 612\n741 746\n771 849\n1345 1357", "8 83 18 30 28 5\n196 249\n313 544\n585 630\n718 843\n1040 1194\n1207 1246\n1268 1370\n1414 1422", "9 31 65 27 53 54\n164 176\n194 210\n485 538\n617 690\n875 886\n888 902\n955 957\n1020 1200\n1205 1282", "30 3 1 58 44 7\n11 13\n14 32\n37 50\n70 74\n101 106\n113 129\n184 195\n197 205\n213 228\n370 394\n443 446\n457 460\n461 492\n499 585\n602 627\n709 776\n812 818\n859 864\n910 913\n918 964\n1000 1010\n1051 1056\n1063 1075\n1106 1145\n1152 1189\n1211 1212\n1251 1259\n1272 1375\n1412 1417\n1430 1431", "30 42 3 76 28 26\n38 44\n55 66\n80 81\n84 283\n298 314\n331 345\n491 531\n569 579\n597 606\n612 617\n623 701\n723 740\n747 752\n766 791\n801 827\n842 846\n853 891\n915 934\n945 949\n955 964\n991 1026\n1051 1059\n1067 1179\n1181 1191\n1214 1226\n1228 1233\n1294 1306\n1321 1340\n1371 1374\n1375 1424", "30 46 5 93 20 46\n12 34\n40 41\n54 58\n100 121\n162 182\n220 349\n358 383\n390 398\n401 403\n408 409\n431 444\n466 470\n471 535\n556 568\n641 671\n699 709\n767 777\n786 859\n862 885\n912 978\n985 997\n1013 1017\n1032 1038\n1047 1048\n1062 1080\n1094 1097\n1102 1113\n1122 1181\n1239 1280\n1320 1369", "30 50 74 77 4 57\n17 23\n24 61\n67 68\n79 87\n93 101\n104 123\n150 192\n375 377\n398 414\n461 566\n600 633\n642 646\n657 701\n771 808\n812 819\n823 826\n827 833\n862 875\n880 891\n919 920\n928 959\n970 1038\n1057 1072\n1074 1130\n1165 1169\n1171 1230\n1265 1276\n1279 1302\n1313 1353\n1354 1438", "30 54 76 95 48 16\n9 11\n23 97\n112 116\n126 185\n214 223\n224 271\n278 282\n283 348\n359 368\n373 376\n452 463\n488 512\n532 552\n646 665\n681 685\n699 718\n735 736\n750 777\n791 810\n828 838\n841 858\n874 1079\n1136 1171\n1197 1203\n1210 1219\n1230 1248\n1280 1292\n1324 1374\n1397 1435\n1438 1439", "30 58 78 12 41 28\n20 26\n27 31\n35 36\n38 99\n103 104\n106 112\n133 143\n181 246\n248 251\n265 323\n350 357\n378 426\n430 443\n466 476\n510 515\n517 540\n542 554\n562 603\n664 810\n819 823\n826 845\n869 895\n921 973\n1002 1023\n1102 1136\n1143 1148\n1155 1288\n1316 1388\n1394 1403\n1434 1437", "30 62 80 97 25 47\n19 20\n43 75\n185 188\n199 242\n252 258\n277 310\n316 322\n336 357\n398 399\n404 436\n443 520\n549 617\n637 649\n679 694\n705 715\n725 730\n731 756\n768 793\n806 833\n834 967\n1003 1079\n1088 1097\n1100 1104\n1108 1121\n1127 1164\n1240 1263\n1274 1307\n1367 1407\n1419 1425\n1433 1437", "30 100 48 14 9 7\n26 55\n75 107\n145 146\n158 167\n197 199\n201 213\n222 238\n257 265\n271 338\n357 439\n454 462\n463 562\n633 660\n670 691\n696 829\n844 864\n880 888\n891 894\n895 900\n950 973\n1004 1007\n1018 1021\n1045 1049\n1062 1073\n1138 1184\n1240 1272\n1278 1315\n1403 1410\n1412 1418\n1426 1434", "30 3 50 32 1 18\n46 60\n66 94\n99 141\n162 239\n309 334\n400 550\n594 630\n659 663\n664 701\n735 736\n741 755\n756 801\n823 854\n865 915\n937 964\n984 986\n990 1007\n1008 1031\n1052 1064\n1073 1080\n1190 1191\n1192 1254\n1265 1266\n1272 1273\n1274 1277\n1284 1302\n1308 1312\n1358 1383\n1388 1389\n1390 1401", "30 7 52 49 46 37\n2 73\n129 130\n131 140\n143 150\n187 190\n217 238\n248 271\n375 426\n465 470\n475 503\n506 541\n569 571\n578 585\n680 683\n690 738\n742 761\n868 877\n890 892\n904 915\n935 961\n1076 1100\n1103 1114\n1232 1244\n1246 1247\n1257 1261\n1271 1276\n1280 1298\n1346 1360\n1373 1382\n1407 1419"], "outputs": ["30", "570", "8445", "52870", "46995", "85540", "67147", "85876", "38570", "11134", "59043", "53608", "84067", "79844", "82686", "92356", "107490", "25258", "23992"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	171	codeforces
78f4855baf50ff5eef1bbd27a0eaf775	Buns	Lavrenty, a baker, is going to make several buns with stuffings and sell them. Lavrenty has n grams of dough as well as m different stuffing types. The stuffing types are numerated from 1 to m. Lavrenty knows that he has ai grams left of the i-th stuffing. It takes exactly bi grams of stuffing i and ci grams of dough to cook a bun with the i-th stuffing. Such bun can be sold for di tugriks. Also he can make buns without stuffings. Each of such buns requires c0 grams of dough and it can be sold for d0 tugriks. So Lavrenty can cook any number of buns with different stuffings or without it unless he runs out of dough and the stuffings. Lavrenty throws away all excess material left after baking. Find the maximum number of tugriks Lavrenty can earn. The first line contains 4 integers n, m, c0 and d0 (1<=≤<=n<=≤<=1000, 1<=≤<=m<=≤<=10, 1<=≤<=c0,<=d0<=≤<=100). Each of the following m lines contains 4 integers. The i-th line contains numbers ai, bi, ci and di (1<=≤<=ai,<=bi,<=ci,<=di<=≤<=100). Print the only number — the maximum number of tugriks Lavrenty can earn. Sample Input 10 2 2 1 7 3 2 100 12 3 1 10 100 1 25 50 15 5 20 10 Sample Output 241200	{"inputs": ["10 2 2 1\n7 3 2 100\n12 3 1 10", "100 1 25 50\n15 5 20 10", "10 1 5 2\n100 1 2 3", "10 1 5 11\n3 1 3 8", "10 2 11 5\n100 1 3 10\n100 1 2 4", "5 8 6 5\n1 2 5 4\n1 2 6 7\n1 2 3 5\n1 2 1 6\n1 2 8 3\n1 2 2 4\n1 2 5 6\n1 2 7 7", "300 4 100 2\n10 1 24 5\n10 1 25 6\n10 1 26 7\n10 1 27 8", "1 1 1 1\n1 1 1 1", "2 1 2 1\n1 2 1 1", "10 2 13 100\n20 1 3 10\n20 1 2 6", "100 5 8 80\n25 8 2 70\n27 6 7 30\n26 1 6 5\n7 1 1 86\n18 8 4 54", "150 8 3 46\n39 4 10 25\n31 17 8 70\n37 2 13 1\n29 17 17 59\n54 20 5 39\n53 14 10 23\n50 12 16 41\n8 2 6 61", "231 10 9 30\n98 11 5 17\n59 13 1 47\n83 1 7 2\n42 21 1 6\n50 16 2 9\n44 10 5 31\n12 20 8 9\n61 23 7 2\n85 18 2 19\n82 25 10 20", "345 10 5 45\n1 23 14 55\n51 26 15 11\n65 4 16 36\n81 14 13 25\n8 9 13 60\n43 4 7 59\n85 11 14 35\n82 13 5 49\n85 28 15 3\n51 21 18 53", "401 10 2 82\n17 9 14 48\n79 4 3 38\n1 2 6 31\n45 2 9 60\n45 2 4 50\n6 1 3 36\n3 1 19 37\n78 3 8 33\n59 8 19 19\n65 10 2 61", "777 10 23 20\n50 90 86 69\n33 90 59 73\n79 26 35 31\n57 48 97 4\n5 10 48 87\n35 99 33 34\n7 32 54 35\n56 25 10 38\n5 3 89 76\n13 33 91 66", "990 10 7 20\n38 82 14 69\n5 66 51 5\n11 26 91 11\n29 12 73 96\n93 82 48 59\n19 15 5 50\n15 36 6 63\n16 57 94 90\n45 3 57 72\n61 41 47 18", "1000 10 51 56\n2 62 82 65\n37 90 87 97\n11 94 47 95\n49 24 97 24\n33 38 40 31\n27 15 17 66\n91 80 34 71\n60 93 42 94\n9 35 73 68\n93 65 83 58", "1000 10 1 53\n63 1 1 58\n58 1 2 28\n100 1 1 25\n61 1 1 90\n96 2 2 50\n19 2 1 90\n7 2 1 30\n90 1 2 5\n34 2 1 12\n3 2 1 96", "1000 10 1 65\n77 1 1 36\n74 1 1 41\n96 1 1 38\n48 1 1 35\n1 1 1 54\n42 1 1 67\n26 1 1 23\n43 1 1 89\n82 1 1 7\n45 1 1 63", "1000 10 1 87\n100 1 1 38\n100 1 1 45\n100 1 1 73\n100 1 1 89\n100 1 1 38\n100 1 1 13\n100 1 1 93\n100 1 1 89\n100 1 1 71\n100 1 1 29", "1000 10 1 7\n100 1 1 89\n100 1 1 38\n100 1 1 13\n100 1 1 93\n100 1 1 89\n100 1 1 38\n100 1 1 45\n100 1 1 73\n100 1 1 71\n100 1 1 29", "1000 10 1 100\n100 1 1 100\n100 1 1 100\n100 1 1 100\n100 1 1 100\n100 1 1 100\n100 1 1 100\n100 1 1 100\n100 1 1 100\n100 1 1 100\n100 1 1 100", "99 10 100 100\n100 1 100 100\n100 1 100 100\n100 1 100 100\n100 1 100 100\n100 1 100 100\n100 1 100 100\n100 1 100 100\n100 1 100 100\n100 1 100 100\n100 1 100 100", "1000 10 100 75\n100 97 100 95\n100 64 100 78\n100 82 100 35\n100 51 100 64\n100 67 100 25\n100 79 100 33\n100 65 100 85\n100 99 100 78\n100 53 100 74\n100 87 100 73", "999 10 5 100\n100 1 10 100\n100 1 10 100\n100 1 10 100\n100 1 10 100\n100 1 10 100\n100 1 10 100\n100 1 10 100\n100 1 10 100\n100 1 10 100\n100 1 10 100", "1000 10 50 100\n7 1 80 100\n5 1 37 100\n9 1 25 100\n7 1 17 100\n6 1 10 100\n5 1 15 100\n6 1 13 100\n2 1 14 100\n4 1 17 100\n3 1 32 100", "1000 10 1 1\n1 2 1 97\n1 2 1 95\n1 2 1 99\n1 2 1 98\n1 2 1 93\n1 2 1 91\n1 2 1 90\n1 2 1 94\n1 2 1 92\n1 2 1 99", "1 10 1 97\n1 1 1 98\n1 1 1 99\n1 1 1 76\n1 1 1 89\n1 1 1 64\n1 1 1 83\n1 1 1 72\n1 1 1 66\n1 1 1 54\n1 1 1 73", "3 10 10 98\n10 5 5 97\n6 7 1 56\n23 10 5 78\n40 36 4 35\n30 50 1 30\n60 56 8 35\n70 90 2 17\n10 11 3 68\n1 2 17 70\n13 4 8 19", "1000 1 23 76\n74 22 14 5", "1000 2 95 56\n58 54 66 61\n61 14 67 65", "1000 3 67 88\n90 86 66 17\n97 38 63 17\n55 78 39 51", "1000 4 91 20\n74 18 18 73\n33 10 59 21\n7 42 87 79\n9 100 77 100", "1000 5 63 52\n6 98 18 77\n17 34 3 73\n59 6 35 7\n61 16 85 64\n73 62 40 11", "1000 6 87 32\n90 30 70 33\n53 6 99 77\n59 22 83 35\n65 32 93 28\n85 50 60 7\n15 15 5 82", "1000 7 59 64\n22 62 70 89\n37 78 43 29\n11 86 83 63\n17 48 1 92\n97 38 80 55\n15 3 89 42\n87 80 62 35", "1000 8 31 96\n6 94 70 93\n73 2 39 33\n63 50 31 91\n21 64 9 56\n61 26 100 51\n67 39 21 50\n79 4 2 71\n100 9 18 86", "1000 9 55 28\n38 74 22 49\n9 74 83 85\n63 66 79 19\n25 32 17 20\n73 62 20 47\n19 27 53 58\n71 80 94 7\n56 69 62 98\n49 7 65 76", "1000 10 67 55\n10 21 31 19\n95 29 53 1\n55 53 19 18\n26 88 19 94\n31 1 45 50\n70 38 33 93\n2 12 7 95\n54 37 81 31\n65 32 63 16\n93 66 98 38", "1000 10 37 38\n65 27 78 14\n16 70 78 66\n93 86 91 43\n95 6 72 86\n72 59 94 36\n66 58 96 40\n41 72 64 4\n26 47 69 13\n85 2 52 15\n34 62 16 79", "1000 10 58 21\n73 85 73 10\n38 60 55 31\n32 66 62 16\n63 76 73 78\n61 17 92 70\n61 79 11 87\n27 31 21 62\n47 9 4 94\n4 71 42 61\n76 5 35 72", "12 2 100 1\n100 1 9 10\n100 1 4 4", "1 1 1 10\n100 100 1 100", "10 3 5 1\n100 1 3 7\n100 1 2 5\n1 1 1 10", "10 3 5 1\n100 1 3 7\n100 1 2 5\n1 1 1 10", "1000 10 1 1\n100 1 1 1\n100 1 1 1\n100 1 1 1\n100 1 1 1\n100 1 1 1\n100 1 1 1\n100 1 1 1\n100 1 1 1\n100 1 1 1\n100 1 1 1", "10 2 100 1\n4 4 5 7\n6 2 3 4", "8 2 10 10\n5 5 5 15\n50 5 4 8", "8 2 10 10\n5 5 5 15\n50 5 4 8", "4 1 2 4\n10 1 3 7", "4 1 2 4\n10 1 3 7", "10 2 5 1\n100 1 2 5\n100 1 3 8", "1000 10 10 10\n100 1 1 1\n100 1 1 2\n100 1 2 1\n100 1 2 2\n100 1 1 1\n100 1 2 3\n100 1 3 2\n100 1 3 3\n100 1 1 3\n100 1 3 1", "10 3 5 1\n100 1 3 7\n100 1 2 5\n1 1 1 10"], "outputs": ["241", "200", "15", "24", "30", "0", "87", "1", "1", "32", "1670", "2300", "1065", "3129", "16400", "734", "2850", "1145", "55948", "66116", "88000", "57800", "100000", "0", "786", "19900", "4800", "1000", "99", "0", "3268", "713", "1232", "515", "804", "771", "1024", "4609", "831", "1161", "1156", "1823", "12", "100", "32", "32", "1000", "12", "16", "16", "8", "8", "26", "1400", "32"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	33	codeforces
78f83e8784694ae9326e4d91df76bbed	Team Work	You have a team of N people. For a particular task, you can pick any non-empty subset of people. The cost of having x people for the task is xk. Output the sum of costs over all non-empty subsets of people. Only line of input contains two integers N (1<=≤<=N<=≤<=109) representing total number of people and k (1<=≤<=k<=≤<=5000). Output the sum of costs for all non empty subsets modulo 109<=+<=7. Sample Input 1 1 3 2 Sample Output 1 24	{"inputs": ["1 1", "3 2", "5 3", "12 4", "20 5", "522 4575", "1426 4445", "81 3772", "629 3447", "2202 3497", "2775 4325", "3982 4784", "2156 3417", "902 1932", "728 3537", "739 3857", "1918 4211", "3506 4679", "1000000000 5000", "2500 5000", "158260522 4575", "602436426 4445", "861648772 81", "433933447 629", "262703497 2202", "971407775 4325", "731963982 4784", "450968417 2156", "982631932 902", "880895728 3537", "4483 4938", "4278 3849", "3281 4798", "12195 4781", "5092 4809", "2511 4990", "9896 4771", "493 4847", "137 4733", "6399 4957", "999999376 642", "999997777 645", "999998604 448", "999974772 208", "999980457 228", "999999335 1040", "999976125 157", "999974335 786", "999985549 266", "999999648 34"], "outputs": ["1", "24", "800", "8067072", "87486873", "558982611", "503519668", "420178413", "989788663", "682330518", "434053861", "987043323", "216656956", "78732216", "957098547", "836213774", "972992457", "130374558", "642932262", "416584034", "875142289", "582490088", "939143440", "396606775", "813734619", "905271522", "7722713", "634922960", "262226561", "266659411", "371059472", "183616686", "467929252", "628055652", "587575377", "622898200", "388524304", "414977957", "279404197", "639782892", "842765934", "31545099", "642283867", "268825720", "848255312", "585378634", "300682474", "754709460", "607440620", "378413808"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	6	codeforces
78fff4dcbecda8aae8ffe88f4ae1b36f	Tram	The tram in Berland goes along a straight line from the point 0 to the point s and back, passing 1 meter per t1 seconds in both directions. It means that the tram is always in the state of uniform rectilinear motion, instantly turning around at points x<==<=0 and x<==<=s. Igor is at the point x1. He should reach the point x2. Igor passes 1 meter per t2 seconds. Your task is to determine the minimum time Igor needs to get from the point x1 to the point x2, if it is known where the tram is and in what direction it goes at the moment Igor comes to the point x1. Igor can enter the tram unlimited number of times at any moment when his and the tram's positions coincide. It is not obligatory that points in which Igor enter and exit the tram are integers. Assume that any boarding and unboarding happens instantly. Igor can move arbitrary along the line (but not faster than 1 meter per t2 seconds). He can also stand at some point for some time. The first line contains three integers s, x1 and x2 (2<=≤<=s<=≤<=1000, 0<=≤<=x1,<=x2<=≤<=s, x1<=≠<=x2) — the maximum coordinate of the point to which the tram goes, the point Igor is at, and the point he should come to. The second line contains two integers t1 and t2 (1<=≤<=t1,<=t2<=≤<=1000) — the time in seconds in which the tram passes 1 meter and the time in seconds in which Igor passes 1 meter. The third line contains two integers p and d (1<=≤<=p<=≤<=s<=-<=1, d is either 1 or ) — the position of the tram in the moment Igor came to the point x1 and the direction of the tram at this moment. If , the tram goes in the direction from the point s to the point 0. If d<==<=1, the tram goes in the direction from the point 0 to the point s. Print the minimum time in seconds which Igor needs to get from the point x1 to the point x2. Sample Input 4 2 4 3 4 1 1 5 4 0 1 2 3 1 Sample Output 8 7	{"inputs": ["4 2 4\n3 4\n1 1", "5 4 0\n1 2\n3 1", "5 4 0\n5 14\n1 -1", "10 7 2\n7 9\n9 -1", "20 5 19\n163 174\n4 1", "1000 610 733\n226 690\n357 1", "40 31 14\n628 1000\n36 1", "100 20 83\n186 434\n64 -1", "200 179 81\n126 457\n37 -1", "400 30 81\n193 1000\n338 1", "500 397 440\n202 1000\n75 1", "600 443 587\n260 1000\n548 -1", "799 254 294\n539 1000\n284 -1", "801 489 351\n86 702\n125 1", "999 951 297\n62 106\n574 1", "1000 711 437\n42 126\n745 1", "1000 812 761\n230 1000\n696 -1", "1000 913 474\n34 162\n566 -1", "1000 394 798\n155 673\n954 -1", "1000 876 884\n299 1000\n825 1", "2 0 2\n1 1\n1 1", "5 4 2\n1 2\n3 1", "4 2 4\n3 4\n2 1", "200 10 100\n1 100\n20 1", "6 4 2\n1 2\n3 1", "3 1 3\n1 2\n1 1", "10 3 6\n1 2\n3 1", "1000 50 51\n1 3\n50 1", "100 1 2\n1 100\n1 1", "5 1 4\n1 100\n1 1", "10 0 5\n1 100\n7 1", "5 4 1\n1 100\n4 -1", "10 6 9\n3 100\n5 1", "50 10 30\n1 50\n10 1", "4 1 4\n1 100\n2 1", "10 5 9\n1 10\n5 1", "20 15 10\n5 2\n3 1", "2 2 0\n7 3\n1 1", "10 1 9\n1 10\n1 1", "1000 2 902\n1 1000\n2 1", "100 9 6\n3 100\n5 1", "10 1 6\n1 10\n3 -1", "1000 902 2\n1 1000\n902 -1", "100 50 25\n1 1000\n10 1", "5 3 0\n1 2\n4 -1", "4 1 2\n1 10\n3 1", "10 4 8\n1 5\n4 -1"], "outputs": ["8", "7", "55", "45", "2436", "84870", "17000", "27342", "44786", "51000", "43000", "144000", "40000", "96836", "69324", "34356", "51000", "71118", "271560", "8000", "2", "4", "6", "480", "4", "2", "3", "1", "1", "3", "18", "3", "12", "20", "10", "4", "10", "6", "8", "900", "300", "9", "900", "165", "4", "7", "12"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	5	codeforces
792832800768d03ba046bbaf6bc7252b	Beru-taxi	Vasiliy lives at point (a,<=b) of the coordinate plane. He is hurrying up to work so he wants to get out of his house as soon as possible. New app suggested n available Beru-taxi nearby. The i-th taxi is located at point (xi,<=yi) and moves with a speed vi. Consider that each of n drivers will move directly to Vasiliy and with a maximum possible speed. Compute the minimum time when Vasiliy will get in any of Beru-taxi cars. The first line of the input contains two integers a and b (<=-<=100<=≤<=a,<=b<=≤<=100) — coordinates of Vasiliy's home. The second line contains a single integer n (1<=≤<=n<=≤<=1000) — the number of available Beru-taxi cars nearby. The i-th of the following n lines contains three integers xi, yi and vi (<=-<=100<=≤<=xi,<=yi<=≤<=100, 1<=≤<=vi<=≤<=100) — the coordinates of the i-th car and its speed. It's allowed that several cars are located at the same point. Also, cars may be located at exactly the same point where Vasiliy lives. Print a single real value — the minimum time Vasiliy needs to get in any of the Beru-taxi cars. You answer will be considered correct if its absolute or relative error does not exceed 10<=-<=6. Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if . Sample Input 0 0 2 2 0 1 0 2 2 1 3 3 3 3 2 -2 3 6 -2 7 10 Sample Output 1.000000000000000000000.50000000000000000000	{"inputs": ["0 0\n2\n2 0 1\n0 2 2", "1 3\n3\n3 3 2\n-2 3 6\n-2 7 10", "2 2\n10\n8 10 1\n14 18 5\n2 2 1\n4 2 2\n5 2 1\n0 2 1\n2 10 4\n10 2 4\n14 18 20\n14 18 10", "-100 100\n3\n100 100 1\n-100 0 5\n-100 -100 20", "5 5\n4\n20 5 1\n20 5 3\n20 5 5\n20 5 15", "0 0\n6\n12 0 1\n0 12 12\n12 0 6\n12 0 3\n0 12 4\n12 0 2", "0 0\n1\n3 4 5", "1 0\n3\n1 1 1\n2 0 1\n3 0 2", "95 69\n2\n100 -47 34\n43 80 72", "-21 -48\n5\n69 4 95\n86 -44 90\n-51 -23 85\n64 -8 21\n-47 41 82", "2 2\n2\n1 3 99\n3 3 100", "0 0\n2\n0 1 100\n0 0 1", "-24 -35\n19\n7 25 34\n-7 12 17\n-40 2 54\n-60 54 38\n68 -49 8\n-43 -25 25\n-84 -44 21\n4 71 43\n96 -60 66\n-77 62 92\n23 -6 79\n44 67 10\n-21 -26 55\n-82 24 10\n92 55 23\n-82 -40 33\n78 -91 3\n-48 -17 26\n-74 87 18", "-56 45\n23\n-79 -82 42\n43 -54 73\n-91 65 54\n-79 -25 36\n40 -22 95\n57 67 31\n-12 -32 37\n-25 95 95\n39 6 24\n96 73 1\n45 -20 35\n-59 50 36\n-49 -18 72\n-74 0 12\n-22 -1 50\n-79 68 13\n-7 -63 27\n-35 3 29\n-95 -54 12\n71 92 76\n25 -90 19\n-95 -66 23\n99 -96 76", "-88 -12\n29\n60 -57 48\n52 100 14\n-86 -78 95\n59 -67 2\n-62 59 14\n-71 74 68\n5 -63 21\n-72 14 78\n84 30 35\n-41 -78 15\n-38 34 82\n38 40 57\n99 24 97\n-87 -43 7\n74 -84 14\n-92 4 61\n39 27 22\n86 -88 79\n-39 -83 37\n-93 56 25\n-35 -38 34\n-4 9 90\n-82 -69 54\n-85 31 28\n18 54 71\n89 -3 34\n-78 -81 20\n91 34 43\n34 -30 18", "-85 71\n31\n-64 -97 57\n7 41 20\n29 41 85\n27 -81 9\n-63 100 59\n-54 72 66\n-13 -33 36\n89 66 64\n77 -46 54\n86 -58 75\n71 -32 56\n78 -91 74\n-37 69 39\n67 -3 76\n-39 -62 56\n49 16 50\n6 -25 23\n-8 96 34\n14 -81 58\n34 -61 53\n0 77 37\n-27 -27 61\n-37 63 54\n86 12 10\n94 -41 53\n-81 24 49\n-32 81 62\n42 -4 77\n24 70 69\n-51 -19 20\n18 -17 61", "-16 -86\n37\n-25 28 67\n-9 -81 61\n9 99 25\n65 77 71\n-91 -19 73\n19 54 8\n-96 36 19\n-58 -15 48\n48 -21 77\n24 -8 1\n88 22 7\n50 100 95\n-65 -90 64\n29 -46 75\n-69 -20 16\n36 28 98\n76 65 13\n-12 81 76\n-6 90 87\n47 5 6\n-35 -72 56\n39 -54 41\n82 -10 28\n-72 47 32\n-48 -60 5\n13 0 66\n-61 -49 61\n21 -90 16\n-65 -85 84\n76 31 45\n-75 84 12\n8 -66 27\n10 -17 16\n45 -26 78\n-78 -24 37\n18 26 22\n99 24 66", "-27 -63\n39\n-88 87 70\n86 -89 2\n-57 19 40\n77 -62 67\n9 -34 11\n1 48 16\n-7 17 16\n53 -17 2\n96 96 15\n-31 -16 37\n1 73 89\n-94 -13 3\n17 74 44\n8 -10 4\n30 79 94\n-2 -52 78\n-76 70 40\n-5 -84 25\n-4 -54 69\n-41 -6 27\n38 -13 31\n35 55 59\n-28 24 25\n-74 -67 12\n-79 1 55\n-23 -67 36\n-53 34 67\n22 99 67\n-2 65 32\n10 13 82\n37 -24 27\n-96 -69 11\n14 82 96\n-52 70 26\n1 93 77\n-20 80 44\n-80 8 29\n77 -100 95\n83 -15 89", "-24 -5\n41\n-11 46 71\n42 -47 16\n-17 -39 26\n45 -1 74\n-92 -93 57\n18 -55 14\n-24 23 32\n13 -91 88\n90 45 27\n21 -98 1\n9 7 59\n-54 83 29\n83 -82 85\n62 31 72\n19 0 47\n64 60 79\n68 -83 41\n25 25 80\n-52 -51 86\n-14 -24 54\n-29 1 30\n-88 44 37\n-83 55 29\n72 -61 94\n-3 81 33\n-93 -16 51\n-8 -5 9\n49 61 5\n88 40 82\n7 -63 1\n-6 -99 82\n20 81 99\n57 90 46\n27 30 77\n-78 -13 79\n-32 -85 4\n82 55 93\n11 -3 45\n39 -66 43\n-37 44 63\n75 -94 2", "66 -82\n43\n27 -21 70\n-64 46 58\n-7 -20 41\n-42 60 57\n-93 -7 95\n26 -61 26\n-10 -72 25\n-78 -18 55\n-62 -64 69\n-33 95 50\n24 59 45\n4 72 37\n66 57 61\n16 -60 5\n17 -78 36\n-75 56 59\n-60 98 77\n-94 37 28\n76 6 63\n99 -35 75\n69 -40 1\n9 -48 56\n-94 -11 19\n69 1 63\n43 42 80\n-28 -83 21\n100 -23 6\n50 49 49\n-26 -12 22\n-34 45 46\n-96 -82 100\n-60 78 88\n35 88 26\n31 25 25\n-98 -97 12\n-70 -31 30\n-71 65 56\n32 26 58\n-80 82 30\n64 34 74\n5 15 2\n-72 -9 46\n68 43 84", "0 0\n2\n100 100 1\n100 99 1", "1 2\n1\n4 6 3", "100 100\n1\n-100 -100 1", "4 7\n1\n11 34 17", "91 91\n3\n3 3 2\n-2 3 6\n-2 7 10", "100 100\n3\n3 3 2\n-2 3 6\n-2 7 10", "0 0\n1\n1 5 5", "3 6\n2\n18 92 45\n32 94 86", "-100 -100\n1\n100 100 1", "0 0\n1\n0 31 13", "0 0\n1\n1 2 2", "0 0\n1\n10 0 6", "100 100\n1\n-100 -100 100", "-100 -100\n1\n100 100 2"], "outputs": ["1.00000000000000000000", "0.50000000000000000000", "0.00000000000000000000", "10.00000000000000000000", "1.00000000000000000000", "1.00000000000000000000", "1.00000000000000000000", "1.00000000000000000000", "0.73820457032879509778", "0.45942645152392084672", "0.01414213562373095049", "0.00000000000000000000", "0.17248787237282069083", "0.16197088596792501308", "0.27036758200771544589", "0.46994128543244917054", "0.14102172568922338971", "0.15713484026367722764", "0.26034165586355514647", "0.76570954748593223420", "140.71602609511114245766", "1.66666666666666666663", "282.84271247461900974929", "1.64074419776251211988", "12.53195914452325367139", "13.80326048439280884911", "1.01980390271855696595", "1.07738691952544205876", "282.84271247461900974929", "2.38461538461538461548", "1.11803398874989484821", "1.66666666666666666663", "2.82842712474619009753", "141.42135623730950487464"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	19	codeforces
793101446ecf77b43dcb093365a0c277	Arthur and Table	Arthur has bought a beautiful big table into his new flat. When he came home, Arthur noticed that the new table is unstable. In total the table Arthur bought has n legs, the length of the i-th leg is li. Arthur decided to make the table stable and remove some legs. For each of them Arthur determined number di — the amount of energy that he spends to remove the i-th leg. A table with k legs is assumed to be stable if there are more than half legs of the maximum length. For example, to make a table with 5 legs stable, you need to make sure it has at least three (out of these five) legs of the maximum length. Also, a table with one leg is always stable and a table with two legs is stable if and only if they have the same lengths. Your task is to help Arthur and count the minimum number of energy units Arthur should spend on making the table stable. The first line of the input contains integer n (1<=≤<=n<=≤<=105) — the initial number of legs in the table Arthur bought. The second line of the input contains a sequence of n integers li (1<=≤<=li<=≤<=105), where li is equal to the length of the i-th leg of the table. The third line of the input contains a sequence of n integers di (1<=≤<=di<=≤<=200), where di is the number of energy units that Arthur spends on removing the i-th leg off the table. Print a single integer — the minimum number of energy units that Arthur needs to spend in order to make the table stable. Sample Input 2 1 5 3 2 3 2 4 4 1 1 1 6 2 2 1 1 3 3 4 3 5 5 2 1 Sample Output 2 0 8	{"inputs": ["2\n1 5\n3 2", "3\n2 4 4\n1 1 1", "6\n2 2 1 1 3 3\n4 3 5 5 2 1", "10\n20 1 15 17 11 2 15 3 16 3\n129 114 183 94 169 16 18 104 49 146", "10\n15 16 19 5 14 19 6 17 7 19\n140 183 186 195 67 25 70 56 54 132", "20\n24 15 7 18 6 18 11 22 18 20 28 8 23 17 22 22 23 23 30 23\n24 137 173 189 43 164 2 11 142 153 16 200 53 58 150 199 169 172 38 78", "30\n20 27 26 17 29 9 25 13 6 21 15 1 14 22 26 2 15 18 20 23 27 9 15 29 11 2 19 23 14 12\n133 199 22 151 9 134 196 119 197 189 117 84 156 6 61 195 98 197 145 75 142 85 187 24 159 3 60 138 156 161", "5\n1 1 2 2 3\n2 2 2 2 3", "5\n1 1 2 2 3\n2 2 2 2 7", "10\n1 1 3 4 5 6 7 8 9 10\n10 10 4 2 3 4 2 2 2 2", "1\n5\n4", "2\n3 3\n4 5", "2\n4 5\n3 3", "3\n3 3 3\n1 2 3", "3\n1 2 3\n3 3 3"], "outputs": ["2", "0", "8", "652", "387", "1111", "2804", "5", "8", "21", "0", "0", "3", "0", "6"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	15	codeforces
79517c03da7240d02d74e5c8b15b5af8	Maximum Xor Secondary	Bike loves looking for the second maximum element in the sequence. The second maximum element in the sequence of distinct numbers x1,<=x2,<=...,<=xk (k<=><=1) is such maximum element xj, that the following inequality holds: . The lucky number of the sequence of distinct positive integers x1,<=x2,<=...,<=xk (k<=><=1) is the number that is equal to the bitwise excluding OR of the maximum element of the sequence and the second maximum element of the sequence. You've got a sequence of distinct positive integers s1,<=s2,<=...,<=sn (n<=><=1). Let's denote sequence sl,<=sl<=+<=1,<=...,<=sr as s[l..r] (1<=≤<=l<=<<=r<=≤<=n). Your task is to find the maximum number among all lucky numbers of sequences s[l..r]. Note that as all numbers in sequence s are distinct, all the given definitions make sence. The first line contains integer n (1<=<<=n<=≤<=105). The second line contains n distinct integers s1,<=s2,<=...,<=sn (1<=≤<=si<=≤<=109). Print a single integer — the maximum lucky number among all lucky numbers of sequences s[l..r]. Sample Input 5 5 2 1 4 3 5 9 8 3 5 7 Sample Output 7 15	{"inputs": ["5\n5 2 1 4 3", "5\n9 8 3 5 7", "10\n76969694 71698884 32888447 31877010 65564584 87864180 7850891 1505323 17879621 15722446", "10\n4547989 39261040 94929326 38131456 26174500 7152864 71295827 77784626 89898294 68006331", "10\n30301275 19973434 63004643 54007648 93722492 91677384 58694045 41546981 15552151 5811338", "10\n47606126 65484553 142643 35352821 26622058 5603080 7296801 53938188 34750256 97196502", "10\n82942694 74816699 72957520 1634864 60842992 60103606 61079517 41624114 13932450 24035648", "10\n73622246 45316865 2066146 61168230 1258786 69603039 64470479 72811017 72683016 97992629", "10\n29272229 8752316 10025994 52398694 57994948 49609605 28150935 66061676 44865054 87041483", "10\n3106954 3413954 3854371 85952704 17834583 20954227 58810981 7460648 97908613 97965110", "3\n11 10 8", "2\n5 6", "2\n16 17", "3\n8 9 10"], "outputs": ["7", "15", "128869996", "134189790", "112066588", "131671782", "133874061", "133280528", "127710165", "111078053", "2", "3", "1", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	20	codeforces
7955c1f6f1073143e4e2612f93654a80	Little Pony and Harmony Chest	Princess Twilight went to Celestia and Luna's old castle to research the chest from the Elements of Harmony. A sequence of positive integers bi is harmony if and only if for every two elements of the sequence their greatest common divisor equals 1. According to an ancient book, the key of the chest is a harmony sequence bi which minimizes the following expression: You are given sequence ai, help Princess Twilight to find the key. The first line contains an integer n (1<=≤<=n<=≤<=100) — the number of elements of the sequences a and b. The next line contains n integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=30). Output the key — sequence bi that minimizes the sum described above. If there are multiple optimal sequences, you can output any of them. Sample Input 5 1 1 1 1 1 5 1 6 4 2 8 Sample Output 1 1 1 1 1 1 5 3 1 8	{"inputs": ["5\n1 1 1 1 1", "5\n1 6 4 2 8", "10\n16 3 16 10 12 5 14 14 15 27", "10\n8 7 11 5 17 24 28 18 7 8", "10\n22 17 28 14 14 26 20 28 21 27", "10\n28 13 14 9 26 21 25 16 4 22", "100\n11 27 18 3 26 1 23 2 28 21 28 18 7 26 13 4 12 11 1 29 9 23 6 27 15 6 26 25 11 21 26 29 29 8 18 29 3 24 2 28 7 7 11 23 26 29 30 18 30 23 17 24 25 12 16 26 2 4 30 2 19 2 27 16 17 21 30 17 10 8 16 7 1 3 27 22 23 28 16 9 15 28 10 15 26 8 20 6 21 12 24 16 13 7 12 8 23 16 29 24", "10\n26 25 10 6 28 11 23 22 8 23", "30\n24 11 1 17 15 11 12 8 6 25 22 23 9 3 30 3 10 28 15 8 4 28 3 28 26 14 24 1 6 19", "30\n11 20 1 17 6 20 22 16 20 22 21 8 3 28 30 2 27 14 10 14 29 21 13 3 13 27 11 18 2 15", "30\n17 16 18 4 3 22 28 4 4 17 9 30 2 11 29 12 8 17 9 12 13 11 13 18 28 17 10 12 14 20", "30\n9 26 5 7 29 17 19 22 1 28 5 6 9 8 13 9 3 4 16 16 11 24 22 20 12 9 16 22 2 11", "30\n15 1 29 2 20 5 3 2 15 17 1 28 9 20 26 5 28 7 7 7 26 15 23 14 19 23 15 19 23 8", "30\n15 3 16 26 17 7 8 6 29 12 27 4 16 25 10 2 9 24 6 19 10 12 23 15 3 7 13 13 27 6", "30\n21 13 3 13 22 2 30 16 26 23 22 3 7 7 23 20 13 13 13 10 24 25 10 9 2 13 20 24 23 3", "100\n17 7 25 13 9 17 18 17 29 7 9 25 26 3 18 25 21 14 21 21 27 30 30 24 29 30 2 14 17 17 8 19 6 20 11 9 19 21 20 25 21 11 29 26 22 8 1 30 27 20 10 16 20 10 17 2 14 21 18 15 19 6 26 8 15 19 20 8 1 23 10 11 30 14 9 9 17 9 11 22 13 5 19 26 9 10 3 9 6 24 26 27 6 14 9 24 20 13 14 23", "100\n9 4 19 29 6 27 23 5 13 19 27 23 25 7 24 22 24 9 4 25 11 21 17 17 14 14 1 16 29 14 7 20 25 2 22 19 16 1 7 6 3 21 28 7 2 18 10 18 20 7 13 4 12 23 29 23 1 22 18 7 19 14 18 19 24 9 5 26 18 14 23 2 10 10 29 19 3 29 29 10 18 13 8 26 22 30 29 2 19 29 13 25 2 13 13 17 18 25 1 7", "100\n15 6 12 24 10 29 15 23 27 22 9 15 24 4 15 19 5 4 11 24 17 4 18 11 20 6 29 13 11 11 6 21 7 30 24 29 5 18 8 1 1 22 10 4 20 28 28 30 27 10 24 8 5 11 5 22 3 22 9 13 11 1 25 14 10 22 3 22 28 11 19 29 19 6 19 20 3 10 18 20 1 7 11 18 14 6 3 1 26 5 30 22 5 25 18 26 8 23 26 29", "100\n15 2 7 11 7 24 21 19 2 3 5 20 2 25 21 7 8 29 10 14 23 17 18 5 5 4 28 7 29 24 27 14 4 12 13 23 10 28 10 29 28 1 1 1 17 22 16 4 4 28 13 4 5 1 3 5 4 23 25 13 10 2 25 1 20 5 2 24 15 2 9 20 15 16 22 13 4 22 29 8 7 15 23 18 13 12 7 24 25 2 17 20 1 8 22 3 28 4 21 29", "100\n26 9 21 8 11 14 9 17 4 18 24 30 19 10 6 13 3 5 1 16 21 5 22 18 26 24 13 8 1 27 18 4 30 7 10 2 3 26 24 4 20 28 20 17 29 13 25 11 4 18 26 20 16 24 13 16 21 30 7 13 24 16 1 20 1 1 24 6 20 7 27 22 8 19 13 17 9 3 4 19 22 12 21 13 8 30 22 22 4 24 30 13 13 21 26 10 29 24 7 12", "100\n30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30 30", "1\n1", "1\n30", "30\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", "15\n2 2 2 1 1 1 1 1 1 1 1 1 1 1 1", "1\n6", "3\n2 2 15"], "outputs": ["1 1 1 1 1 ", "1 5 3 1 8 ", "19 1 17 7 11 1 16 13 15 29 ", "9 7 11 5 17 23 29 19 1 8 ", "23 17 31 13 11 25 19 29 16 27 ", "29 13 14 11 27 19 25 17 1 23 ", "11 27 17 1 25 1 23 1 19 13 1 1 1 1 1 1 1 1 1 53 1 1 1 1 1 1 1 1 1 1 1 49 47 1 1 43 1 1 1 1 1 1 1 1 1 29 41 1 37 1 1 1 1 1 1 1 1 1 32 1 1 1 1 1 1 1 31 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ", "27 25 13 7 29 11 23 19 8 17 ", "43 11 1 17 13 7 1 1 1 25 19 23 1 1 41 1 1 37 1 1 1 31 1 29 27 1 16 1 1 1 ", "11 19 1 17 1 16 25 13 7 23 1 1 1 41 37 1 31 1 1 1 29 1 1 1 1 27 1 1 1 1 ", "17 16 19 1 1 25 37 1 1 13 7 31 1 11 29 1 1 1 1 1 1 1 1 1 27 1 1 1 1 23 ", "7 41 1 1 37 17 19 31 1 29 1 1 1 1 13 1 1 1 16 11 1 27 25 1 1 1 1 23 1 1 ", "13 1 43 1 19 1 1 1 11 17 1 41 7 16 37 1 31 1 1 1 29 1 27 1 1 25 1 1 23 1 ", "13 1 16 41 17 7 1 1 37 11 31 1 1 29 1 1 1 25 1 19 1 1 23 1 1 1 1 1 27 1 ", "19 13 1 11 17 1 43 16 41 37 7 1 1 1 31 1 1 1 1 1 29 27 1 1 1 1 1 25 23 1 ", "17 7 25 13 1 11 1 1 53 1 1 23 19 1 1 1 1 1 1 1 27 47 43 1 41 37 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 29 1 1 1 1 32 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 31 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ", "1 1 19 53 1 27 23 1 13 17 25 11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 49 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 47 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 43 1 1 41 37 1 1 1 1 1 1 32 31 1 1 29 1 1 1 1 1 1 1 1 1 1 ", "13 1 11 23 7 53 1 19 27 17 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 47 1 1 1 1 1 1 43 1 41 1 1 1 1 1 1 1 1 1 25 1 37 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 32 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 31 1 1 1 1 1 1 1 1 29 ", "13 1 7 11 1 23 19 17 1 1 1 1 1 25 1 1 1 53 1 1 1 1 1 1 1 1 47 1 43 1 27 1 1 1 1 1 1 41 1 37 32 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 31 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 29 ", "25 7 19 1 11 13 1 17 1 1 23 53 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 27 1 1 47 1 1 1 1 1 1 1 1 43 1 1 41 1 1 1 1 1 1 1 1 1 1 1 1 37 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 32 1 1 1 1 31 1 1 1 1 1 29 1 1 1 ", "53 49 47 43 41 37 32 31 29 27 25 23 19 17 13 11 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ", "1 ", "30 ", "1 1 1 1 1 1 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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ", "6 ", "2 1 15 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
7957d1deb681dae7bde5b711125af628	Defragmentation	In this problem you have to implement an algorithm to defragment your hard disk. The hard disk consists of a sequence of clusters, numbered by integers from 1 to n. The disk has m recorded files, the i-th file occupies clusters with numbers ai,<=1, ai,<=2, ..., ai,<=ni. These clusters are not necessarily located consecutively on the disk, but the order in which they are given corresponds to their sequence in the file (cluster ai,<=1 contains the first fragment of the i-th file, cluster ai,<=2 has the second fragment, etc.). Also the disc must have one or several clusters which are free from files. You are permitted to perform operations of copying the contents of cluster number i to cluster number j (i and j must be different). Moreover, if the cluster number j used to keep some information, it is lost forever. Clusters are not cleaned, but after the defragmentation is complete, some of them are simply declared unusable (although they may possibly still contain some fragments of files). Your task is to use a sequence of copy operations to ensure that each file occupies a contiguous area of memory. Each file should occupy a consecutive cluster section, the files must follow one after another from the beginning of the hard disk. After defragmentation all free (unused) clusters should be at the end of the hard disk. After defragmenting files can be placed in an arbitrary order. Clusters of each file should go consecutively from first to last. See explanatory examples in the notes. Print the sequence of operations leading to the disk defragmentation. Note that you do not have to minimize the number of operations, but it should not exceed 2n. The first line contains two integers n and m (1<=≤<=n,<=m<=≤<=200) — the number of clusters and the number of files, correspondingly. Next m lines contain descriptions of the files. The first number in the line is ni (ni<=≥<=1), the number of clusters occupied by the i-th file. Then follow ni numbers ai,<=1, ai,<=2, ..., ai,<=ni (1<=≤<=ai,<=j<=≤<=n). It is guaranteed that each cluster number occurs not more than once and , that is, there exists at least one unused cluster. Numbers on each line are separated by spaces. In the first line print a single integer k (0<=≤<=k<=≤<=2n) — the number of operations needed to defragment the disk. Next k lines should contain the operations' descriptions as "i j" (copy the contents of the cluster number i to the cluster number j). Sample Input 7 2 2 1 2 3 3 4 5 7 2 2 1 3 3 2 4 5 Sample Output 0 3 2 6 3 2 6 3	{"inputs": ["7 2\n2 1 2\n3 3 4 5", "7 2\n2 1 3\n3 2 4 5", "2 1\n1 2", "3 1\n2 3 1", "3 2\n1 3\n1 2", "5 3\n1 2\n1 4\n1 5", "7 3\n1 7\n2 6 5\n3 4 3 2", "7 2\n3 1 3 5\n3 2 4 6", "10 1\n5 7 4 6 9 2", "7 2\n2 2 1\n3 3 4 5", "7 2\n2 1 2\n3 4 5 6", "20 5\n7 12 16 14 17 20 4 15\n2 7 8\n1 5\n5 3 6 18 11 2\n4 9 13 19 1", "20 10\n1 2\n2 14 11\n2 9 15\n2 16 8\n2 3 13\n3 17 12 6\n1 5\n1 7\n2 20 19\n1 1", "100 30\n8 62 50 93 34 82 24 87 65\n2 64 86\n3 91 42 88\n2 76 7\n2 35 63\n3 78 84 15\n4 90 46 73 9\n4 74 13 95 58\n3 71 59 55\n2 4 31\n1 19\n1 10\n2 45 23\n2 27 69\n4 12 66 44 22\n1 36\n2 67 2\n2 77 54\n4 96 47 25 52\n5 18 29 43 70 56\n2 14 41\n2 100 6\n3 30 94 75\n2 32 28\n1 53\n9 26 39 51 68 33 99 79 89 49\n4 5 17 81 37\n3 57 8 16\n3 21 72 98\n4 83 48 40 61", "200 10\n17 110 31 67 40 144 57 90 186 25 112 3 14 79 193 159 26 165\n4 91 1 30 62\n11 64 94 60 49 176 172 54 106 68 51 22\n4 131 114 2 15\n33 58 83 164 190 5 21 17 19 181 46 7 140 29 82 147 6 28 192 27 39 196 101 10 53 156 23 98 48 195 88 126 170 55\n2 81 4\n10 177 16 32 78 119 69 171 127 117 133\n14 184 34 145 43 9 134 168 97 63 191 102 50 72 120\n2 45 99\n3 169 163 104"], "outputs": ["0", "3\n2 6\n3 2\n6 3", "1\n2 1", "2\n1 2\n3 1", "1\n3 1", "3\n2 1\n4 2\n5 3", "7\n7 1\n2 7\n6 2\n3 6\n5 3\n6 5\n7 6", "5\n2 7\n3 2\n5 3\n4 5\n7 4", "7\n7 1\n2 3\n4 2\n3 4\n6 3\n4 5\n9 4", "3\n1 6\n2 1\n6 2", "3\n4 3\n5 4\n6 5", "36\n1 10\n12 1\n2 12\n16 2\n3 16\n14 3\n4 14\n17 4\n5 17\n20 5\n6 20\n14 6\n7 14\n15 7\n8 15\n14 8\n9 14\n15 9\n10 15\n17 10\n11 17\n16 11\n12 16\n20 12\n13 20\n18 13\n14 18\n17 14\n15 17\n16 15\n18 16\n17 18\n20 17\n18 20\n19 18\n20 19", "25\n1 4\n2 1\n14 2\n3 10\n11 3\n4 11\n9 4\n5 9\n15 5\n6 14\n16 6\n7 15\n8 7\n10 8\n9 10\n13 9\n10 13\n17 10\n11 16\n12 11\n14 12\n15 14\n20 15\n16 17\n19 16", "168\n62 1\n2 3\n50 2\n3 11\n93 3\n4 20\n34 4\n5 34\n82 5\n6 38\n24 6\n7 24\n87 7\n8 50\n65 8\n9 60\n64 9\n10 62\n86 10\n11 64\n91 11\n12 65\n42 12\n13 42\n88 13\n14 80\n76 14\n15 76\n24 15\n16 24\n35 16\n17 35\n63 17\n18 63\n78 18\n19 78\n84 19\n20 82\n76 20\n21 76\n90 21\n22 84\n46 22\n23 46\n73 23\n24 73\n60 24\n25 60\n74 25\n26 74\n42 26\n27 42\n95 27\n28 85\n58 28\n29 58\n71 29\n30 71\n59 30\n31 59\n55 31\n32 55\n82 32\n33 82\n59 33\n34 59\n78 34\n35 78\n62 35\n36 62\n45 36\n37 45\n46 37\n38 46\n42 38\n...", "177\n1 8\n110 1\n2 11\n31 2\n3 12\n67 3\n4 13\n40 4\n5 18\n144 5\n6 20\n57 6\n7 24\n90 7\n8 31\n186 8\n9 33\n25 9\n10 25\n112 10\n11 35\n12 11\n14 12\n13 14\n79 13\n14 36\n193 14\n15 37\n159 15\n16 38\n26 16\n17 26\n165 17\n18 40\n91 18\n19 41\n31 19\n20 31\n30 20\n21 30\n62 21\n22 42\n64 22\n23 44\n94 23\n24 47\n60 24\n25 52\n49 25\n26 49\n176 26\n27 56\n172 27\n28 57\n54 28\n29 54\n106 29\n30 59\n68 30\n31 60\n51 31\n32 51\n42 32\n33 42\n131 33\n34 61\n114 34\n36 62\n37 36\n58 37\n38 58\n83 38\n39 64\n16..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
798e69af66946802a90c8b03fcdb29c4	Pie or die	Volodya and Vlad play the following game. There are k pies at the cells of n<=<=×<=<=m board. Each turn Volodya moves one pie to the neighbouring (by side) cell. If the pie lies at the border of the board then Volodya can move it outside the board, get the pie and win. After Volodya's move, Vlad bans some edge at the border of the board of length 1 (between two knots of the board) so that Volodya is not able to move the pie outside the board through this edge anymore. The question is: will Volodya win this game? We suppose both players follow the optimal strategy. First line contains 3 integers, separated by space: 1<=≤<=n,<=m<=≤<=100 — dimensions of the board and 0<=≤<=k<=≤<=100 — the number of pies. Each of the next k lines contains 2 integers, separated by space: 1<=≤<=x<=≤<=n, 1<=≤<=y<=≤<=m — coordinates of the corresponding pie. There could be more than one pie at a cell. Output only one word: "YES" — if Volodya wins, "NO" — otherwise. Sample Input 2 2 1 1 2 3 4 0 100 50 2 50 25 50 25 Sample Output YESNONO	{"inputs": ["2 2 1\n1 2", "3 4 0", "100 50 2\n50 25\n50 25", "20 20 4\n10 10\n10 10\n10 10\n10 10", "15 15 1\n8 8", "8 8 2\n4 4\n5 5", "100 100 2\n50 96\n51 96", "100 100 2\n50 95\n51 95", "20 20 1\n16 10", "20 20 4\n15 9\n15 10\n15 11\n15 12", "11 11 1\n6 6", "11 11 1\n6 5", "35 13 20\n13 8\n19 8\n24 7\n20 6\n23 7\n23 6\n30 7\n29 7\n7 7\n6 8\n9 8\n29 6\n20 7\n25 6\n19 6\n23 8\n26 6\n12 6\n15 7\n6 8", "50 17 27\n17 8\n19 6\n25 8\n30 10\n22 10\n30 9\n25 8\n27 6\n19 7\n29 11\n39 8\n31 8\n39 8\n40 7\n11 8\n30 11\n32 8\n31 11\n36 12\n10 11\n32 8\n8 7\n7 12\n17 11\n27 7\n8 8\n23 12", "24 29 22\n16 6\n14 22\n7 15\n11 17\n12 22\n10 13\n12 22\n12 13\n6 16\n12 21\n11 11\n9 13\n18 22\n7 20\n13 6\n6 14\n17 10\n9 13\n7 23\n14 11\n7 22\n8 12", "32 45 3\n12 30\n27 9\n14 27", "35 15 63\n6 6\n14 9\n7 6\n25 6\n25 8\n13 9\n18 7\n20 8\n30 10\n25 10\n7 7\n18 8\n11 10\n12 6\n8 8\n6 9\n21 9\n27 10\n28 8\n28 9\n7 9\n28 9\n10 10\n29 10\n25 8\n28 7\n22 6\n13 9\n14 7\n23 9\n20 8\n28 10\n22 7\n12 8\n13 7\n27 9\n17 8\n10 8\n19 10\n6 10\n26 6\n19 8\n28 9\n15 9\n14 7\n25 10\n17 8\n21 8\n29 6\n7 6\n16 10\n7 10\n25 7\n9 9\n30 9\n23 8\n28 8\n7 10\n12 6\n20 9\n24 8\n6 6\n26 7", "41 50 37\n21 24\n20 32\n10 12\n35 7\n8 19\n30 22\n21 11\n35 12\n7 8\n16 10\n13 39\n6 43\n31 12\n16 14\n25 32\n27 21\n6 34\n22 26\n7 41\n18 13\n24 19\n9 44\n36 21\n17 16\n36 24\n6 31\n19 20\n12 19\n27 36\n6 31\n11 13\n19 9\n20 12\n25 25\n18 27\n17 36\n8 16", "96 95 31\n14 23\n70 47\n11 77\n53 66\n63 87\n3 14\n57 44\n65 69\n80 74\n49 6\n57 86\n75 8\n2 32\n75 21\n14 51\n56 46\n77 6\n17 89\n87 3\n21 18\n70 67\n47 64\n13 47\n61 33\n56 30\n28 2\n65 18\n17 90\n44 77\n54 26\n32 70", "80 51 47\n67 41\n74 7\n68 41\n6 2\n19 38\n37 28\n65 4\n6 25\n39 11\n19 34\n47 36\n62 26\n27 44\n70 45\n24 33\n41 2\n13 10\n3 17\n78 35\n53 46\n62 47\n33 17\n17 49\n2 3\n47 38\n72 35\n4 8\n32 21\n52 43\n67 12\n28 22\n53 34\n36 11\n45 45\n32 12\n5 11\n6 3\n55 21\n73 4\n55 21\n36 13\n48 18\n19 8\n70 24\n43 45\n59 50\n58 7", "25 92 38\n21 36\n20 18\n9 29\n18 77\n10 58\n10 39\n5 3\n21 51\n11 78\n16 32\n24 71\n15 17\n23 23\n25 59\n18 57\n11 2\n16 35\n1 47\n20 59\n19 54\n11 55\n4 33\n15 41\n17 18\n16 67\n4 15\n5 23\n3 24\n20 70\n5 87\n11 1\n23 66\n21 83\n2 32\n17 22\n2 26\n16 42\n24 15", "67 41 68\n35 16\n66 14\n1 15\n43 6\n26 17\n30 13\n42 11\n32 20\n66 14\n15 35\n35 6\n12 11\n25 9\n39 37\n31 14\n52 11\n4 32\n17 14\n32 1\n58 31\n30 20\n7 23\n13 3\n27 25\n60 27\n56 39\n60 39\n11 5\n33 14\n29 12\n13 34\n30 16\n25 16\n64 25\n47 6\n33 36\n14 40\n19 38\n57 34\n67 8\n10 13\n7 36\n22 24\n6 33\n23 40\n13 19\n65 6\n14 37\n37 21\n27 12\n41 36\n60 15\n27 11\n23 33\n67 40\n45 39\n1 41\n50 21\n28 38\n20 24\n41 34\n43 35\n51 5\n59 37\n27 4\n28 17\n63 20\n1 9", "14 95 49\n11 48\n9 12\n1 18\n7 54\n11 20\n9 82\n12 1\n12 84\n1 13\n2 13\n12 57\n13 15\n12 18\n9 47\n13 14\n10 14\n13 94\n7 46\n14 14\n6 46\n7 95\n9 29\n13 15\n6 76\n8 60\n6 27\n9 63\n5 39\n5 70\n10 59\n5 75\n3 19\n9 32\n13 59\n5 13\n4 5\n13 80\n10 62\n13 65\n5 25\n4 81\n7 12\n10 94\n8 55\n7 61\n11 58\n7 77\n12 14\n12 47", "15 96 22\n4 7\n7 40\n13 30\n8 53\n6 78\n5 9\n15 35\n3 13\n5 31\n2 9\n13 50\n11 17\n4 2\n10 91\n11 74\n14 49\n8 30\n10 66\n12 44\n6 19\n9 62\n15 50", "19 19 50\n11 16\n4 11\n5 12\n19 19\n7 16\n15 10\n8 17\n8 1\n11 10\n5 19\n5 14\n17 6\n12 15\n18 17\n17 14\n10 5\n15 11\n8 8\n5 8\n18 18\n7 11\n8 4\n11 9\n6 16\n1 15\n19 13\n5 12\n10 10\n4 19\n12 4\n8 14\n19 9\n7 1\n19 11\n15 8\n4 19\n19 9\n6 7\n15 7\n2 16\n12 9\n3 18\n17 10\n3 5\n11 7\n12 6\n4 15\n19 4\n17 15\n3 10", "93 40 43\n14 15\n58 9\n72 15\n40 40\n46 20\n17 26\n31 26\n91 36\n24 28\n32 27\n51 10\n2 35\n73 7\n6 33\n59 21\n59 39\n33 8\n22 21\n77 20\n30 38\n76 35\n40 6\n48 31\n67 29\n30 24\n6 16\n39 27\n24 29\n14 16\n5 25\n76 14\n61 25\n85 13\n60 9\n80 7\n49 19\n35 20\n90 31\n57 40\n67 27\n3 27\n21 16\n21 38", "70 50 62\n31 22\n41 21\n31 47\n2 46\n22 8\n6 4\n45 32\n40 29\n10 11\n62 40\n70 26\n48 25\n13 44\n53 22\n3 8\n41 19\n13 8\n21 41\n66 20\n34 34\n41 48\n9 35\n23 26\n29 30\n39 27\n58 11\n35 2\n67 3\n59 23\n41 10\n54 9\n10 18\n23 44\n5 2\n37 30\n31 24\n2 21\n2 36\n34 5\n59 44\n7 4\n23 22\n47 27\n14 50\n54 50\n6 4\n64 1\n29 5\n5 37\n60 50\n58 45\n70 4\n4 46\n68 43\n62 34\n15 12\n16 2\n70 21\n59 8\n13 27\n25 41\n13 20", "61 96 15\n27 36\n19 64\n27 53\n59 63\n48 56\n55 30\n10 23\n6 79\n32 74\n7 51\n29 65\n60 16\n43 74\n40 80\n14 31", "87 50 62\n34 31\n42 21\n2 23\n20 25\n57 39\n46 26\n59 46\n29 33\n32 35\n79 41\n54 19\n65 7\n41 6\n40 23\n8 41\n2 31\n56 5\n37 33\n63 23\n79 4\n85 27\n53 38\n58 21\n16 11\n15 46\n33 39\n38 6\n27 41\n6 15\n25 47\n58 16\n28 50\n43 38\n48 20\n5 48\n31 6\n8 18\n40 10\n32 29\n44 20\n42 46\n63 21\n18 10\n28 49\n66 26\n64 28\n73 23\n16 29\n48 12\n23 21\n84 14\n10 45\n75 37\n80 3\n75 24\n31 25\n8 42\n67 22\n80 45\n8 31\n16 28\n49 34", "23 100 53\n16 63\n16 31\n8 31\n4 86\n8 43\n8 27\n21 6\n13 49\n11 54\n5 86\n1 41\n19 14\n2 98\n15 76\n6 25\n6 57\n2 45\n6 98\n10 27\n16 74\n22 72\n22 13\n22 20\n15 63\n18 17\n14 32\n14 32\n2 28\n7 46\n23 16\n20 64\n18 17\n3 69\n22 77\n2 98\n11 20\n22 17\n21 8\n19 77\n19 13\n18 25\n9 24\n18 83\n19 27\n7 37\n16 19\n9 60\n11 70\n3 30\n4 84\n9 54\n22 33\n3 22", "36 89 27\n21 66\n3 60\n11 32\n10 81\n30 31\n27 62\n11 81\n24 41\n30 6\n13 45\n34 86\n26 46\n9 62\n8 86\n17 56\n4 86\n25 36\n23 72\n18 55\n18 87\n22 67\n18 12\n19 75\n21 60\n16 49\n33 63\n26 12", "93 93 50\n7 5\n73 91\n66 55\n12 24\n82 46\n38 49\n86 72\n51 69\n17 73\n9 85\n86 69\n65 2\n40 88\n92 26\n45 80\n74 45\n4 55\n57 93\n80 70\n49 69\n29 46\n67 38\n46 12\n16 87\n62 3\n79 62\n29 45\n58 30\n48 4\n76 73\n14 68\n31 8\n49 85\n73 78\n18 7\n87 56\n82 54\n52 73\n29 71\n87 74\n75 84\n45 28\n47 57\n44 53\n21 5\n86 5\n57 51\n45 9\n93 8\n82 43", "11 38 21\n2 21\n2 28\n7 19\n9 18\n7 25\n8 4\n3 23\n2 32\n5 34\n10 36\n8 21\n4 6\n6 6\n4 35\n8 34\n10 18\n11 4\n10 2\n10 13\n4 37\n2 29", "26 11 59\n13 6\n18 6\n12 6\n18 6\n21 6\n19 6\n12 6\n7 6\n6 6\n16 6\n7 6\n9 6\n19 6\n19 6\n15 6\n16 6\n16 6\n18 6\n17 6\n8 6\n13 6\n18 6\n11 6\n21 6\n9 6\n19 6\n20 6\n8 6\n20 6\n14 6\n11 6\n18 6\n7 6\n16 6\n19 6\n6 6\n6 6\n7 6\n13 6\n9 6\n16 6\n9 6\n15 6\n12 6\n17 6\n16 6\n9 6\n11 6\n10 6\n16 6\n14 6\n15 6\n7 6\n20 6\n7 6\n8 6\n17 6\n14 6\n14 6", "30 84 35\n20 60\n23 21\n14 24\n24 72\n13 76\n25 35\n11 64\n15 57\n9 55\n14 66\n10 24\n13 68\n11 8\n19 43\n11 14\n16 26\n11 22\n10 26\n15 66\n17 65\n21 34\n7 61\n24 64\n18 16\n22 18\n12 9\n10 40\n8 24\n16 52\n10 9\n7 17\n21 78\n18 75\n10 45\n16 29", "100 77 53\n62 72\n23 51\n42 8\n66 33\n62 16\n28 53\n72 54\n71 34\n30 26\n91 28\n27 37\n81 47\n22 40\n42 23\n92 46\n36 37\n86 70\n62 22\n20 9\n46 36\n86 67\n46 61\n33 30\n68 49\n44 57\n34 7\n89 36\n48 39\n47 62\n76 56\n22 41\n7 52\n16 8\n70 50\n52 27\n27 17\n44 30\n66 44\n62 10\n95 37\n94 39\n91 68\n12 49\n85 55\n63 28\n64 15\n75 31\n93 26\n53 51\n53 55\n66 65\n38 36\n40 15", "66 94 26\n11 75\n46 72\n55 74\n34 10\n33 84\n25 11\n13 23\n27 73\n45 22\n54 34\n53 63\n28 8\n57 46\n26 78\n52 46\n32 38\n22 55\n17 71\n56 18\n9 60\n31 54\n6 84\n59 57\n60 81\n51 49\n41 77", "68 100 18\n17 85\n10 77\n59 55\n29 46\n25 74\n55 11\n37 16\n57 61\n26 11\n11 88\n19 18\n28 38\n32 12\n36 49\n32 6\n57 45\n30 6\n59 95", "28 61 4\n12 18\n21 31\n14 52\n6 36", "11 73 1\n4 67", "11 79 0", "11 23 1\n11 9", "25 11 0", "39 11 1\n18 3", "69 11 0", "18 15 45\n6 7\n7 14\n12 3\n17 1\n15 3\n7 11\n9 3\n7 11\n15 4\n8 1\n12 2\n17 7\n14 15\n2 9\n12 4\n14 9\n18 8\n2 2\n17 1\n7 9\n2 4\n16 1\n12 7\n17 10\n4 1\n18 13\n10 13\n9 12\n14 1\n1 6\n3 10\n6 2\n15 3\n4 8\n14 6\n5 14\n8 11\n8 13\n6 7\n16 9\n2 7\n17 14\n17 11\n7 9\n15 8", "16 18 70\n14 17\n16 8\n14 1\n7 1\n5 3\n7 5\n15 15\n15 2\n8 17\n12 12\n8 7\n10 16\n16 6\n14 7\n2 7\n12 4\n1 9\n6 9\n1 10\n10 13\n7 11\n2 2\n9 5\n3 10\n14 7\n4 5\n2 7\n7 16\n5 7\n7 14\n14 6\n10 16\n8 1\n4 14\n3 15\n8 11\n3 16\n12 1\n10 12\n13 3\n14 17\n5 5\n6 8\n13 10\n11 13\n3 5\n15 7\n10 3\n6 12\n13 15\n7 5\n3 8\n7 18\n6 7\n15 1\n9 6\n6 17\n11 2\n2 17\n7 16\n6 6\n2 18\n2 10\n5 16\n7 17\n3 8\n15 2\n11 11\n5 13\n16 1", "14 20 68\n6 7\n2 15\n4 6\n10 18\n6 9\n14 14\n5 18\n9 15\n5 15\n2 9\n9 13\n10 17\n4 2\n12 12\n6 19\n7 13\n10 11\n1 1\n3 16\n7 6\n8 16\n10 17\n1 13\n12 11\n13 13\n2 20\n14 12\n11 18\n10 8\n12 4\n13 7\n13 11\n1 1\n10 6\n14 17\n1 2\n11 5\n6 12\n13 2\n4 3\n8 19\n12 8\n8 7\n5 1\n2 10\n11 10\n12 19\n2 10\n8 4\n12 13\n3 15\n8 8\n5 9\n14 15\n5 19\n7 7\n1 16\n6 12\n11 18\n5 13\n1 12\n10 14\n4 5\n2 8\n3 20\n14 7\n6 3\n4 18", "19 13 83\n5 2\n12 11\n5 6\n3 11\n17 8\n10 8\n3 10\n9 10\n16 3\n15 12\n14 2\n11 8\n18 6\n15 10\n11 12\n2 1\n15 3\n16 3\n1 7\n15 7\n2 9\n11 13\n18 9\n4 7\n13 4\n7 4\n3 1\n14 8\n4 5\n5 7\n8 3\n17 2\n18 2\n16 3\n10 12\n6 2\n3 6\n5 2\n10 3\n18 9\n14 3\n3 6\n6 5\n12 8\n7 12\n2 11\n6 6\n18 6\n14 4\n3 10\n3 2\n13 3\n12 9\n2 10\n15 6\n1 5\n9 12\n6 12\n4 6\n18 3\n7 2\n9 13\n3 10\n19 13\n6 7\n5 1\n4 10\n12 13\n8 12\n15 1\n4 3\n3 8\n4 8\n3 7\n4 13\n8 7\n7 13\n2 8\n14 6\n12 1\n16 8\n9 4\n5 8", "13 19 1\n6 10", "14 17 0", "20 19 5\n7 14\n14 12\n7 12\n15 9\n12 6", "17 15 3\n10 7\n12 6\n8 6", "14 17 4\n9 9\n8 7\n8 12\n7 9", "15 11 0", "14 16 4\n6 11\n6 8\n8 6\n6 7", "16 16 0", "19 20 2\n10 14\n8 11", "13 15 1\n7 10", "11 100 4\n6 10\n6 20\n6 30\n6 80", "100 11 2\n40 6\n70 6", "100 11 5\n20 6\n30 6\n43 7\n78 6\n89 6", "20 20 5\n10 6\n6 8\n16 11\n11 11\n7 15", "30 30 5\n7 15\n24 11\n15 15\n8 24\n9 6"], "outputs": ["YES", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "YES", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	10	codeforces
79a38cf64ad5510445ae44b028dbd4aa	Bear and Reverse Radewoosh	Limak and Radewoosh are going to compete against each other in the upcoming algorithmic contest. They are equally skilled but they won't solve problems in the same order. There will be n problems. The i-th problem has initial score pi and it takes exactly ti minutes to solve it. Problems are sorted by difficulty — it's guaranteed that pi<=<<=pi<=+<=1 and ti<=<<=ti<=+<=1. A constant c is given too, representing the speed of loosing points. Then, submitting the i-th problem at time x (x minutes after the start of the contest) gives max(0,<= pi<=-<=c·x) points. Limak is going to solve problems in order 1,<=2,<=...,<=n (sorted increasingly by pi). Radewoosh is going to solve them in order n,<=n<=-<=1,<=...,<=1 (sorted decreasingly by pi). Your task is to predict the outcome — print the name of the winner (person who gets more points at the end) or a word "Tie" in case of a tie. You may assume that the duration of the competition is greater or equal than the sum of all ti. That means both Limak and Radewoosh will accept all n problems. The first line contains two integers n and c (1<=≤<=n<=≤<=50,<=1<=≤<=c<=≤<=1000) — the number of problems and the constant representing the speed of loosing points. The second line contains n integers p1,<=p2,<=...,<=pn (1<=≤<=pi<=≤<=1000,<=pi<=<<=pi<=+<=1) — initial scores. The third line contains n integers t1,<=t2,<=...,<=tn (1<=≤<=ti<=≤<=1000,<=ti<=<<=ti<=+<=1) where ti denotes the number of minutes one needs to solve the i-th problem. Print "Limak" (without quotes) if Limak will get more points in total. Print "Radewoosh" (without quotes) if Radewoosh will get more points in total. Print "Tie" (without quotes) if Limak and Radewoosh will get the same total number of points. Sample Input 3 2 50 85 250 10 15 25 3 6 50 85 250 10 15 25 8 1 10 20 30 40 50 60 70 80 8 10 58 63 71 72 75 76 Sample Output Limak Radewoosh Tie	{"inputs": ["3 2\n50 85 250\n10 15 25", "3 6\n50 85 250\n10 15 25", "8 1\n10 20 30 40 50 60 70 80\n8 10 58 63 71 72 75 76", "4 1\n3 5 6 9\n1 2 4 8", "4 1\n1 3 6 10\n1 5 7 8", "4 1\n2 4 5 10\n2 3 9 10", "18 4\n68 97 121 132 146 277 312 395 407 431 458 461 595 634 751 855 871 994\n1 2 3 4 9 10 13 21 22 29 31 34 37 38 39 41 48 49", "50 1\n5 14 18 73 137 187 195 197 212 226 235 251 262 278 287 304 310 322 342 379 393 420 442 444 448 472 483 485 508 515 517 523 559 585 618 627 636 646 666 682 703 707 780 853 937 951 959 989 991 992\n30 84 113 173 199 220 235 261 266 277 300 306 310 312 347 356 394 396 397 409 414 424 446 462 468 487 507 517 537 566 594 643 656 660 662 668 706 708 773 774 779 805 820 827 868 896 929 942 961 995", "4 1\n4 6 9 10\n2 3 4 5", "4 1\n4 6 9 10\n3 4 5 7", "4 1\n1 6 7 10\n2 7 8 10", "4 1\n4 5 7 9\n1 4 5 8", "50 1\n6 17 44 82 94 127 134 156 187 211 212 252 256 292 294 303 352 355 379 380 398 409 424 434 480 524 584 594 631 714 745 756 777 778 789 793 799 821 841 849 859 878 879 895 925 932 944 952 958 990\n15 16 40 42 45 71 99 100 117 120 174 181 186 204 221 268 289 332 376 394 403 409 411 444 471 487 499 539 541 551 567 589 619 623 639 669 689 722 735 776 794 822 830 840 847 907 917 927 936 988", "50 10\n25 49 52 73 104 117 127 136 149 164 171 184 226 251 257 258 286 324 337 341 386 390 428 453 464 470 492 517 543 565 609 634 636 660 678 693 710 714 729 736 739 749 781 836 866 875 956 960 977 979\n2 4 7 10 11 22 24 26 27 28 31 35 37 38 42 44 45 46 52 53 55 56 57 59 60 61 64 66 67 68 69 71 75 76 77 78 79 81 83 85 86 87 89 90 92 93 94 98 99 100", "50 10\n11 15 25 71 77 83 95 108 143 150 182 183 198 203 213 223 279 280 346 348 350 355 375 376 412 413 415 432 470 545 553 562 589 595 607 633 635 637 688 719 747 767 771 799 842 883 905 924 942 944\n1 3 5 6 7 10 11 12 13 14 15 16 19 20 21 23 25 32 35 36 37 38 40 41 42 43 47 50 51 54 55 56 57 58 59 60 62 63 64 65 66 68 69 70 71 72 73 75 78 80", "32 6\n25 77 141 148 157 159 192 196 198 244 245 255 332 392 414 457 466 524 575 603 629 700 738 782 838 841 845 847 870 945 984 985\n1 2 4 5 8 9 10 12 13 14 15 16 17 18 20 21 22 23 24 26 28 31 38 39 40 41 42 43 45 47 48 49", "5 1\n256 275 469 671 842\n7 9 14 17 26", "2 1000\n1 2\n1 2", "3 1\n1 50 809\n2 8 800", "1 13\n866\n10", "15 1\n9 11 66 128 199 323 376 386 393 555 585 718 935 960 971\n3 11 14 19 20 21 24 26 32 38 40 42 44 47 50", "1 10\n546\n45", "50 20\n21 43 51 99 117 119 158 167 175 190 196 244 250 316 335 375 391 403 423 428 451 457 460 480 487 522 539 559 566 584 598 602 604 616 626 666 675 730 771 787 828 841 861 867 886 889 898 970 986 991\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", "50 21\n13 20 22 38 62 84 118 135 141 152 170 175 194 218 227 229 232 253 260 263 278 313 329 357 396 402 422 452 454 533 575 576 580 594 624 644 653 671 676 759 789 811 816 823 831 833 856 924 933 987\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", "1 36\n312\n42", "1 1000\n1\n1000", "1 1\n1000\n1", "50 35\n9 17 28 107 136 152 169 174 186 188 201 262 291 312 324 330 341 358 385 386 393 397 425 431 479 498 502 523 530 540 542 554 578 588 622 623 684 696 709 722 784 819 836 845 850 932 945 969 983 984\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", "50 20\n12 113 116 120 138 156 167 183 185 194 211 228 234 261 278 287 310 317 346 361 364 397 424 470 496 522 527 536 611 648 668 704 707 712 717 752 761 766 815 828 832 864 872 885 889 901 904 929 982 993\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"], "outputs": ["Limak", "Radewoosh", "Tie", "Limak", "Radewoosh", "Tie", "Radewoosh", "Tie", "Radewoosh", "Radewoosh", "Tie", "Limak", "Radewoosh", "Limak", "Radewoosh", "Radewoosh", "Limak", "Tie", "Limak", "Tie", "Limak", "Tie", "Limak", "Tie", "Tie", "Tie", "Tie", "Tie", "Limak"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	292	codeforces
79bee3be5bae0add3e18f78c8efd72b6	none	It's a beautiful April day and Wallace is playing football with his friends. But his friends do not know that Wallace actually stayed home with Gromit and sent them his robotic self instead. Robo-Wallace has several advantages over the other guys. For example, he can hit the ball directly to the specified point. And yet, the notion of a giveaway is foreign to him. The combination of these features makes the Robo-Wallace the perfect footballer — as soon as the ball gets to him, he can just aim and hit the goal. He followed this tactics in the first half of the match, but he hit the goal rarely. The opposing team has a very good goalkeeper who catches most of the balls that fly directly into the goal. But Robo-Wallace is a quick thinker, he realized that he can cheat the goalkeeper. After all, they are playing in a football box with solid walls. Robo-Wallace can kick the ball to the other side, then the goalkeeper will not try to catch the ball. Then, if the ball bounces off the wall and flies into the goal, the goal will at last be scored. Your task is to help Robo-Wallace to detect a spot on the wall of the football box, to which the robot should kick the ball, so that the ball bounces once and only once off this wall and goes straight to the goal. In the first half of the match Robo-Wallace got a ball in the head and was severely hit. As a result, some of the schemes have been damaged. Because of the damage, Robo-Wallace can only aim to his right wall (Robo-Wallace is standing with his face to the opposing team's goal). The football box is rectangular. Let's introduce a two-dimensional coordinate system so that point (0, 0) lies in the lower left corner of the field, if you look at the box above. Robo-Wallace is playing for the team, whose goal is to the right. It is an improvised football field, so the gate of Robo-Wallace's rivals may be not in the middle of the left wall. In the given coordinate system you are given: - y1, y2 — the y-coordinates of the side pillars of the goalposts of robo-Wallace's opponents; - yw — the y-coordinate of the wall to which Robo-Wallace is aiming; - xb, yb — the coordinates of the ball's position when it is hit; - r — the radius of the ball. A goal is scored when the center of the ball crosses the OY axis in the given coordinate system between (0, y1) and (0, y2). The ball moves along a straight line. The ball's hit on the wall is perfectly elastic (the ball does not shrink from the hit), the angle of incidence equals the angle of reflection. If the ball bounces off the wall not to the goal, that is, if it hits the other wall or the goal post, then the opposing team catches the ball and Robo-Wallace starts looking for miscalculation and gets dysfunctional. Such an outcome, if possible, should be avoided. We assume that the ball touches an object, if the distance from the center of the ball to the object is no greater than the ball radius r. The first and the single line contains integers y1, y2, yw, xb, yb, r (1<=≤<=y1,<=y2,<=yw,<=xb,<=yb<=≤<=106; y1<=<<=y2<=<<=yw; yb<=+<=r<=<<=yw; 2·r<=<<=y2<=-<=y1). It is guaranteed that the ball is positioned correctly in the field, doesn't cross any wall, doesn't touch the wall that Robo-Wallace is aiming at. The goal posts can't be located in the field corners. If Robo-Wallace can't score a goal in the described manner, print "-1" (without the quotes). Otherwise, print a single number xw — the abscissa of his point of aiming. If there are multiple points of aiming, print the abscissa of any of them. When checking the correctness of the answer, all comparisons are made with the permissible absolute error, equal to 10<=-<=8. It is recommended to print as many characters after the decimal point as possible. Sample Input 4 10 13 10 3 1 1 4 6 2 2 1 3 10 15 17 9 2 Sample Output 4.3750000000 -1 11.3333333333	{"inputs": ["4 10 13 10 3 1", "1 4 6 2 2 1", "3 10 15 17 9 2", "4 9 30 3 3 1", "4 9 13 2 3 1", "4 9 13 1 1 1", "1 9 10 6 6 3", "4 9 24 10 3 1", "4 9 20 10 3 1", "1 8 10 8 3 3", "2 9 10 4 6 3", "2 9 10 6 3 3", "1 9 10 7 3 3", "1 9 10 9 5 3", "2 9 10 6 5 3", "1 9 10 5 5 3", "2 9 10 9 3 3", "1 9 10 9 5 3", "1 8 10 3 3 3", "1 9 10 5 5 3", "2 9 10 5 3 3", "2 9 10 8 5 3", "2 9 10 9 5 3", "1 9 10 4 5 3", "1 8 10 5 5 3", "2 9 10 9 5 3", "15 30 100 8 8 5", "15 30 100 58 81 5", "15 30 100 601 76 5", "15 30 100 7193 39 5", "15 30 100 40766 18 5", "15 30 100 243890 31 5", "4 9 30 10 3 1", "56 90 100 9 56 9", "29 62 100 88 37 9", "712 950 1000 98 727 92", "7788 8844 10000 70 4902 63", "49 67 100 986 29 7", "190 212 1000 103 795 3", "5234 7681 10000 985 8825 847", "94603 96309 100000 728 25633 556", "30 73 100 5089 24 9", "330 357 1000 625 129 8", "5010 6384 10000 9022 3213 187", "7 17 100 56205 62 2", "626 705 1000 10072 858 35", "1727 5232 10000 67443 5399 62", "10995 85967 100000 47813 44507 2442", "845391 929573 1000000 87612 108825 1400", "78 90 100 535782 61 4", "2846 8620 10000 466361 3155 1292", "138623 763216 1000000 366229 316563 160243", "111724 287004 931554 512877 139642 23002", "70276 182564 238201 222757 154128 55592", "65775 300705 686095 383961 189161 72083", "303226 381701 395142 301908 2696 244", "451924 493579 637450 231345 530245 20087", "67933 96355 131374 588846 12918 4897", "149195 164613 287623 72041 223411 5390", "448887 492030 560100 388288 354938 20867", "435582 479389 540004 905521 413521 1624", "64887 100252 122962 146510 74262 15718", "246310 320553 585881 278070 443362 23788", "154137 199509 247827 186170 112705 19967", "652284 765064 966501 110259 224662 46292", "1437 1945 9737 17190 7829 114", "61880 74283 78517 551852 20330 1475", "196112 214848 221935 465535 132387 3661", "20296 469893 481654 239118 236770 20582", "476636 647171 684372 48498 122589 5636", "140 149 150 13 78 3", "140 149 150 16 36 3", "140 149 150 13 134 3", "140 149 150 11 76 3", "1400 1490 1500 78 292 40", "1400 1490 1500 89 829 40", "1400 1490 1500 75 585 40", "1400 1490 1500 67 240 40", "1400 1490 1500 64 276 40", "1400 1490 1500 43 926 40", "1400 1490 1500 83 1362 40", "140 149 150 18 80 3", "4 9 25 10 3 1"], "outputs": ["4.3750000000", "-1", "11.3333333333", "-1", "-1", "-1", "4.5000000000", "4.7368421053", "4.6666666667", "3.4285714286", "2.6666666667", "-1", "3.0000000000", "5.4000000000", "3.0000000000", "3.0000000000", "3.0000000000", "5.4000000000", "-1", "3.0000000000", "-1", "4.0000000000", "4.5000000000", "2.4000000000", "-1", "4.5000000000", "-1", "48.8764044944", "479.5212765957", "4118.1297709924", "20114.8026315789", "131595.3237410072", "-1", "-1", "43.5887850467", "-1", "-1", "361.2079207921", "-1", "-1", "-1", "2223.7647058824", "-1", "3713.0485021398", "40017.9600000000", "7449.8491484185", "43315.9683953342", "29321.4167104074", "12769.2918746832", "153080.5714285714", "210537.3673812111", "-1", "257255.6532044368", "-1", "-1", "57074.3018919422", "-1", "188927.5585923950", "-1", "-1", "405317.7264116302", "65461.4966203183", "197686.6564327557", "-1", "-1", "14064.2286640989", "107291.2729442180", "82508.1717726175", "155898.4832985775", "12660.0741578319", "-1", "-1", "3.0588235294", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	3	codeforces
79e0d3456ed7b662db679a702bb43977	Letters Removing	Petya has a string of length n consisting of small and large English letters and digits. He performs m operations. Each operation is described with two integers l and r and a character c: Petya removes from the string all characters c on positions between l and r, inclusive. It's obvious that the length of the string remains the same or decreases after each operation. Find how the string will look like after Petya performs all m operations. The first string contains two integers n and m (1<=≤<=n,<=m<=≤<=2·105) — the length of the string and the number of operations. The second line contains the string of length n, consisting of small and large English letters and digits. Positions in the string are enumerated from 1. Each of the next m lines contains two integers l and r (1<=≤<=l<=≤<=r), followed by a character c, which is a small or large English letter or a digit. This line describes one operation. It is guaranteed that r doesn't exceed the length of the string s before current operation. Print the string Petya will obtain after performing all m operations. If the strings becomes empty after all operations, print an empty line. Sample Input 4 2 abac 1 3 a 2 2 c 3 2 A0z 1 3 0 1 1 z 10 4 agtFrgF4aF 2 5 g 4 9 F 1 5 4 1 7 a 9 5 aAAaBBccD 1 4 a 5 6 c 2 3 B 4 4 D 2 3 A Sample Output b Az tFrg4 AB	{"inputs": ["4 2\nabac\n1 3 a\n2 2 c", "3 2\nA0z\n1 3 0\n1 1 z", "10 4\nagtFrgF4aF\n2 5 g\n4 9 F\n1 5 4\n1 7 a", "9 5\naAAaBBccD\n1 4 a\n5 6 c\n2 3 B\n4 4 D\n2 3 A", "10 10\nhRZQK137KY\n1 10 V\n8 10 g\n2 6 E\n2 2 y\n6 8 J\n1 5 w\n4 6 q\n6 8 K\n2 10 c\n4 6 t", "20 4\n8QYQY1tp6CA02NGnR04s\n1 9 N\n1 10 y\n5 11 t\n6 7 C", "30 5\nkR87ctl81OsbekSKwUATCwSPKssjio\n16 25 0\n16 19 W\n6 12 K\n4 23 k\n28 29 z", "40 24\nYYUcKDEUVLUCU8EKiUVxnD8TZSSidW8TUDS8Sccb\n3 38 K\n24 33 e\n6 36 d\n5 10 d\n13 14 E\n12 23 S\n4 30 U\n4 11 C\n12 15 Y\n5 27 x\n25 28 W\n25 26 E\n15 26 C\n17 22 d\n6 25 n\n19 22 K\n2 26 T\n1 22 W\n7 19 d\n12 18 K\n4 12 L\n9 18 8\n4 8 i\n6 8 L", "50 6\nRQQQQQQRRRRQQQQQRRQQRQRRRRRQRQQQRQQQRRRQQQQQRRQRRR\n18 26 R\n13 33 R\n23 32 R\n7 21 Q\n18 21 R\n14 20 R", "1 1\na\n1 1 A"], "outputs": ["b", "Az", "tFrg4", "AB", "hRZQK137KY", "8QYQY1p6CA02NGnR04s", "kR87ctl81OsbeSKwUATCwSPKssjio", "YYUcDEV8iVDZSiDS8Sccb", "RQQQQQRRRRQQQQQQQQQQQRRR", "a"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
79f867bd960bd74ebd3a5c734bf1389c	Pasha and Hamsters	Pasha has two hamsters: Arthur and Alexander. Pasha put n apples in front of them. Pasha knows which apples Arthur likes. Similarly, Pasha knows which apples Alexander likes. Pasha doesn't want any conflict between the hamsters (as they may like the same apple), so he decided to distribute the apples between the hamsters on his own. He is going to give some apples to Arthur and some apples to Alexander. It doesn't matter how many apples each hamster gets but it is important that each hamster gets only the apples he likes. It is possible that somebody doesn't get any apples. Help Pasha distribute all the apples between the hamsters. Note that Pasha wants to distribute all the apples, not just some of them. The first line contains integers n, a, b (1<=≤<=n<=≤<=100; 1<=≤<=a,<=b<=≤<=n) — the number of apples Pasha has, the number of apples Arthur likes and the number of apples Alexander likes, correspondingly. The next line contains a distinct integers — the numbers of the apples Arthur likes. The next line contains b distinct integers — the numbers of the apples Alexander likes. Assume that the apples are numbered from 1 to n. The input is such that the answer exists. Print n characters, each of them equals either 1 or 2. If the i-h character equals 1, then the i-th apple should be given to Arthur, otherwise it should be given to Alexander. If there are multiple correct answers, you are allowed to print any of them. Sample Input 4 2 3 1 2 2 3 4 5 5 2 3 4 1 2 5 2 3 Sample Output 1 1 2 2 1 1 1 1 1	{"inputs": ["4 2 3\n1 2\n2 3 4", "5 5 2\n3 4 1 2 5\n2 3", "100 69 31\n1 3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 24 26 27 29 31 37 38 39 40 44 46 48 49 50 51 53 55 56 57 58 59 60 61 63 64 65 66 67 68 69 70 71 72 74 76 77 78 79 80 81 82 83 89 92 94 95 97 98 99 100\n2 13 22 23 25 28 30 32 33 34 35 36 41 42 43 45 47 52 54 62 73 75 84 85 86 87 88 90 91 93 96", "100 56 44\n1 2 5 8 14 15 17 18 20 21 23 24 25 27 30 33 34 35 36 38 41 42 44 45 46 47 48 49 50 53 56 58 59 60 62 63 64 65 68 69 71 75 76 80 81 84 87 88 90 91 92 94 95 96 98 100\n3 4 6 7 9 10 11 12 13 16 19 22 26 28 29 31 32 37 39 40 43 51 52 54 55 57 61 66 67 70 72 73 74 77 78 79 82 83 85 86 89 93 97 99", "100 82 18\n1 2 3 4 5 6 7 8 9 10 11 13 14 15 16 17 18 19 20 22 23 25 27 29 30 31 32 33 34 35 36 37 38 42 43 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 71 72 73 74 75 77 78 79 80 82 83 86 88 90 91 92 93 94 96 97 98 99 100\n12 21 24 26 28 39 40 41 52 56 70 76 81 84 85 87 89 95", "99 72 27\n1 2 3 4 5 6 7 8 10 11 12 13 14 15 16 17 20 23 25 26 28 29 30 32 33 34 35 36 39 41 42 43 44 45 46 47 50 51 52 54 55 56 58 59 60 61 62 67 70 71 72 74 75 76 77 80 81 82 84 85 86 88 90 91 92 93 94 95 96 97 98 99\n9 18 19 21 22 24 27 31 37 38 40 48 49 53 57 63 64 65 66 68 69 73 78 79 83 87 89", "99 38 61\n1 3 10 15 16 22 23 28 31 34 35 36 37 38 39 43 44 49 50 53 56 60 63 68 69 70 72 74 75 77 80 81 83 85 96 97 98 99\n2 4 5 6 7 8 9 11 12 13 14 17 18 19 20 21 24 25 26 27 29 30 32 33 40 41 42 45 46 47 48 51 52 54 55 57 58 59 61 62 64 65 66 67 71 73 76 78 79 82 84 86 87 88 89 90 91 92 93 94 95", "99 84 15\n1 2 3 5 6 7 8 9 10 11 12 13 14 15 16 17 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 44 47 48 50 51 52 53 55 56 58 59 60 61 62 63 64 65 68 69 70 71 72 73 74 75 77 79 80 81 82 83 84 85 86 87 89 90 91 92 93 94 97 98 99\n4 18 33 45 46 49 54 57 66 67 76 78 88 95 96", "4 3 1\n1 3 4\n2", "4 3 1\n1 2 4\n3", "4 2 2\n2 3\n1 4", "4 3 1\n2 3 4\n1", "1 1 1\n1\n1", "2 1 1\n2\n1", "2 1 1\n1\n2", "3 3 1\n1 2 3\n1", "3 3 1\n1 2 3\n3", "3 2 1\n1 3\n2", "100 1 100\n84\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", "100 100 1\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\n17", "98 51 47\n1 2 3 4 6 7 8 10 13 15 16 18 19 21 22 23 25 26 27 29 31 32 36 37 39 40 41 43 44 48 49 50 51 52 54 56 58 59 65 66 68 79 80 84 86 88 89 90 94 95 97\n5 9 11 12 14 17 20 24 28 30 33 34 35 38 42 45 46 47 53 55 57 60 61 62 63 64 67 69 70 71 72 73 74 75 76 77 78 81 82 83 85 87 91 92 93 96 98", "98 28 70\n1 13 15 16 19 27 28 40 42 43 46 53 54 57 61 63 67 68 69 71 75 76 78 80 88 93 97 98\n2 3 4 5 6 7 8 9 10 11 12 14 17 18 20 21 22 23 24 25 26 29 30 31 32 33 34 35 36 37 38 39 41 44 45 47 48 49 50 51 52 55 56 58 59 60 62 64 65 66 70 72 73 74 77 79 81 82 83 84 85 86 87 89 90 91 92 94 95 96", "97 21 76\n7 10 16 17 26 30 34 39 40 42 44 46 53 54 56 64 67 72 78 79 94\n1 2 3 4 5 6 8 9 11 12 13 14 15 18 19 20 21 22 23 24 25 27 28 29 31 32 33 35 36 37 38 41 43 45 47 48 49 50 51 52 55 57 58 59 60 61 62 63 65 66 68 69 70 71 73 74 75 76 77 80 81 82 83 84 85 86 87 88 89 90 91 92 93 95 96 97", "97 21 76\n1 10 12 13 17 18 22 25 31 48 50 54 61 64 67 74 78 81 86 88 94\n2 3 4 5 6 7 8 9 11 14 15 16 19 20 21 23 24 26 27 28 29 30 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 49 51 52 53 55 56 57 58 59 60 62 63 65 66 68 69 70 71 72 73 75 76 77 79 80 82 83 84 85 87 89 90 91 92 93 95 96 97", "96 10 86\n2 5 31 37 68 69 80 82 90 91\n1 3 4 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 32 33 34 35 36 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 70 71 72 73 74 75 76 77 78 79 81 83 84 85 86 87 88 89 92 93 94 95 96", "95 4 91\n58 65 70 93\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 59 60 61 62 63 64 66 67 68 69 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 94 95", "98 88 10\n1 2 4 5 6 8 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 38 39 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 62 63 64 65 66 67 68 69 71 72 73 74 75 76 77 79 80 81 83 84 85 86 87 88 89 90 92 93 94 95 96 97 98\n3 7 32 37 42 61 70 78 82 91", "98 96 2\n1 2 3 4 5 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\n6 7", "97 97 1\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\n94", "97 97 1\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\n20", "96 96 1\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\n48", "95 95 1\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\n55"], "outputs": ["1 1 2 2", "1 1 1 1 1", "1 2 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 2 2 1 2 1 1 2 1 2 1 2 2 2 2 2 1 1 1 1 2 2 2 1 2 1 2 1 1 1 1 2 1 2 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 2 1 2 1 1 1 1 1 1 1 1 2 2 2 2 2 1 2 2 1 2 1 1 2 1 1 1 1", "1 1 2 2 1 2 2 1 2 2 2 2 2 1 1 2 1 1 2 1 1 2 1 1 1 2 1 2 2 1 2 2 1 1 1 1 2 1 2 2 1 1 2 1 1 1 1 1 1 1 2 2 1 2 2 1 2 1 1 1 2 1 1 1 1 2 2 1 1 2 1 2 2 2 1 1 2 2 2 1 1 2 2 1 2 2 1 1 2 1 1 1 2 1 1 1 2 1 2 1", "1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 2 1 1 2 1 2 1 2 1 1 1 1 1 1 1 1 1 1 2 2 2 1 1 1 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 2 1 1 1 1 2 1 1 2 2 1 2 1 2 1 1 1 1 1 2 1 1 1 1 1", "1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 2 2 1 2 2 1 2 1 1 2 1 1 1 2 1 1 1 1 1 2 2 1 2 1 1 1 1 1 1 1 2 2 1 1 1 2 1 1 1 2 1 1 1 1 1 2 2 2 2 1 2 2 1 1 1 2 1 1 1 1 2 2 1 1 1 2 1 1 1 2 1 2 1 1 1 1 1 1 1 1 1 1", "1 2 1 2 2 2 2 2 2 1 2 2 2 2 1 1 2 2 2 2 2 1 1 2 2 2 2 1 2 2 1 2 2 1 1 1 1 1 1 2 2 2 1 1 2 2 2 2 1 1 2 2 1 2 2 1 2 2 2 1 2 2 1 2 2 2 2 1 1 1 2 1 2 1 1 2 1 2 2 1 1 2 1 2 1 2 2 2 2 2 2 2 2 2 2 1 1 1 1", "1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 2 2 1 1 2 1 1 1 1 2 1 1 2 1 1 1 1 1 1 1 1 2 2 1 1 1 1 1 1 1 1 2 1 2 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 2 2 1 1 1", "1 2 1 1", "1 1 2 1", "2 1 1 2", "2 1 1 1", "1", "2 1", "1 2", "1 1 1", "1 1 1", "1 2 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 1 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 2 1 1 1 2 1 2 2 1 2 1 1 2 1 1 2 1 1 1 2 1 1 1 2 1 2 1 1 2 2 2 1 1 2 1 1 1 2 1 1 2 2 2 1 1 1 1 1 2 1 2 1 2 1 1 2 2 2 2 2 1 1 2 1 2 2 2 2 2 2 2 2 2 2 1 1 2 2 2 1 2 1 2 1 1 1 2 2 2 1 1 2 1 2", "1 2 2 2 2 2 2 2 2 2 2 2 1 2 1 1 2 2 1 2 2 2 2 2 2 2 1 1 2 2 2 2 2 2 2 2 2 2 2 1 2 1 1 2 2 1 2 2 2 2 2 2 1 1 2 2 1 2 2 2 1 2 1 2 2 2 1 1 1 2 1 2 2 2 1 1 2 1 2 1 2 2 2 2 2 2 2 1 2 2 2 2 1 2 2 2 1 1", "2 2 2 2 2 2 1 2 2 1 2 2 2 2 2 1 1 2 2 2 2 2 2 2 2 1 2 2 2 1 2 2 2 1 2 2 2 2 1 1 2 1 2 1 2 1 2 2 2 2 2 2 1 1 2 1 2 2 2 2 2 2 2 1 2 2 1 2 2 2 2 1 2 2 2 2 2 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2", "1 2 2 2 2 2 2 2 2 1 2 1 1 2 2 2 1 1 2 2 2 1 2 2 1 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 1 2 2 2 1 2 2 2 2 2 2 1 2 2 1 2 2 1 2 2 2 2 2 2 1 2 2 2 1 2 2 1 2 2 2 2 1 2 1 2 2 2 2 2 1 2 2 2", "2 1 2 2 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 1 2 2 2 2 2 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 1 1 2 2 2 2 2 2 2 2 2 2 1 2 1 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 1 2 2 2 2 2 2 1 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2", "1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 2 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 2 1 1 1 2 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1", "1 1 1 1 1 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 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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	283	codeforces
7a03ba5e18ef1df44dc03ac8d8878cde	Fight the Monster	A monster is attacking the Cyberland! Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF). During the battle, every second the monster's HP decrease by max(0,<=ATKY<=-<=DEFM), while Yang's HP decreases by max(0,<=ATKM<=-<=DEFY), where index Y denotes Master Yang and index M denotes monster. Both decreases happen simultaneously Once monster's HP<=≤<=0 and the same time Master Yang's HP<=><=0, Master Yang wins. Master Yang can buy attributes from the magic shop of Cyberland: h bitcoins per HP, a bitcoins per ATK, and d bitcoins per DEF. Now Master Yang wants to know the minimum number of bitcoins he can spend in order to win. The first line contains three integers HPY,<=ATKY,<=DEFY, separated by a space, denoting the initial HP, ATK and DEF of Master Yang. The second line contains three integers HPM,<=ATKM,<=DEFM, separated by a space, denoting the HP, ATK and DEF of the monster. The third line contains three integers h,<=a,<=d, separated by a space, denoting the price of 1 HP, 1 ATK and 1 DEF. All numbers in input are integer and lie between 1 and 100 inclusively. The only output line should contain an integer, denoting the minimum bitcoins Master Yang should spend in order to win. Sample Input 1 2 1 1 100 1 1 100 100 100 100 100 1 1 1 1 1 1 Sample Output 99 0	{"inputs": ["1 2 1\n1 100 1\n1 100 100", "100 100 100\n1 1 1\n1 1 1", "50 80 92\n41 51 56\n75 93 12", "76 63 14\n89 87 35\n20 15 56", "12 59 66\n43 15 16\n12 18 66", "51 89 97\n18 25 63\n22 91 74", "72 16 49\n5 21 84\n48 51 88", "74 89 5\n32 76 99\n62 95 36", "39 49 78\n14 70 41\n3 33 23", "11 82 51\n90 84 72\n98 98 43", "65 6 5\n70 78 51\n88 55 78", "14 61 87\n11 78 14\n5 84 92", "1 28 47\n31 60 38\n14 51 77", "99 32 20\n89 72 74\n1 100 39", "1 10 29\n1 1 43\n1 1 100", "1 1 100\n1 1 1\n100 1 100", "79 1 1\n1 1 10\n1 1 100", "10 10 100\n1 100 100\n10 100 90", "10 10 100\n1 10 1\n1 1 100", "1 100 1\n1 1 1\n1 1 1", "11 1 1\n100 1 1\n100 1 1", "1 100 100\n1 1 1\n87 100 43", "10 100 1\n1 100 100\n100 1 9", "10 100 55\n100 100 1\n1 1 1", "11 1 1\n10 1 10\n100 50 1", "10 100 1\n100 1 1\n1 100 1", "1 10 10\n1 10 100\n1 1 61", "1 1 1\n1 1 1\n1 1 1", "1 1 1\n1 1 1\n100 100 100", "1 1 1\n100 100 100\n100 100 100", "100 100 100\n1 1 1\n1 1 1", "100 100 100\n100 100 100\n100 100 100", "1 1 1\n1 1 100\n100 100 1", "50 100 51\n100 100 100\n1 100 100", "1 1 1\n100 100 100\n1 2 3", "100 1 1\n100 100 100\n100 1 100", "1 100 1\n100 100 100\n1 100 100", "100 100 1\n100 100 100\n1 100 100", "1 1 1\n100 100 100\n1 100 100", "20 1 1\n100 100 100\n1 100 100", "25 38 49\n84 96 42\n3 51 92", "2 1 1\n100 2 100\n100 1 100", "1 97 1\n100 99 98\n1 51 52", "1 1 1\n100 100 100\n1 1 100", "1 100 1\n100 100 99\n1 100 100", "100 1 1\n100 100 100\n1 100 100"], "outputs": ["99", "0", "0", "915", "0", "0", "3519", "3529", "0", "1376", "7027", "0", "1562", "5478", "34", "1", "10", "9100", "0", "0", "1", "0", "811", "37", "500", "0", "91", "1", "100", "19900", "0", "100", "10000", "1384", "496", "199", "1990", "1891", "11890", "11871", "1692", "199", "1498", "298", "1890", "11791"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	15	codeforces
7a050be457f1abb1e33be44a0a8dfabc	Raising Bacteria	You are a lover of bacteria. You want to raise some bacteria in a box. Initially, the box is empty. Each morning, you can put any number of bacteria into the box. And each night, every bacterium in the box will split into two bacteria. You hope to see exactly x bacteria in the box at some moment. What is the minimum number of bacteria you need to put into the box across those days? The only line containing one integer x (1<=≤<=x<=≤<=109). The only line containing one integer: the answer. Sample Input 5 8 Sample Output 2 1	{"inputs": ["5", "8", "536870911", "1", "343000816", "559980448", "697681824", "41313494", "673935585", "117422204", "954746654", "536838144", "1000000000", "2", "3", "4", "6", "7", "9", "10", "999999999", "999999998", "999999997", "999999996", "999999995", "999999994", "999999993", "999999992", "999999991", "999999990", "536870910", "536870912", "536870913", "536870914", "22", "14"], "outputs": ["2", "1", "29", "1", "14", "12", "14", "14", "13", "19", "15", "14", "13", "1", "2", "1", "2", "3", "2", "2", "21", "20", "20", "19", "20", "19", "19", "18", "20", "19", "28", "1", "2", "2", "3", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	604	codeforces
7a4dd76945e19b3e410c657bd294b6e1	Bear and Poker	Limak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There are n players (including Limak himself) and right now all of them have bids on the table. i-th of them has bid with size ai dollars. Each player can double his bid any number of times and triple his bid any number of times. The casino has a great jackpot for making all bids equal. Is it possible that Limak and his friends will win a jackpot? First line of input contains an integer n (2<=≤<=n<=≤<=105), the number of players. The second line contains n integer numbers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109) — the bids of players. Print "Yes" (without the quotes) if players can make their bids become equal, or "No" otherwise. Sample Input 4 75 150 75 50 3 100 150 250 Sample Output Yes No	{"inputs": ["4\n75 150 75 50", "3\n100 150 250", "7\n34 34 68 34 34 68 34", "10\n72 96 12 18 81 20 6 2 54 1", "20\n958692492 954966768 77387000 724664764 101294996 614007760 202904092 555293973 707655552 108023967 73123445 612562357 552908390 914853758 915004122 466129205 122853497 814592742 373389439 818473058", "2\n1 1", "2\n72 72", "2\n49 42", "3\n1000000000 1000000000 1000000000", "6\n162000 96000 648000 1000 864000 432000", "8\n600000 100000 100000 100000 900000 600000 900000 600000", "12\n2048 1024 6144 1024 3072 3072 6144 1024 4096 2048 6144 3072", "20\n246 246 246 246 246 246 246 246 246 246 246 246 246 246 246 246 246 246 246 246", "50\n840868705 387420489 387420489 795385082 634350497 206851546 536870912 536870912 414927754 387420489 387420489 536870912 387420489 149011306 373106005 536870912 700746206 387420489 777952883 847215247 176645254 576664386 387420489 230876513 536870912 536870912 536870912 387420489 387420489 536870912 460495524 528643722 387420489 536870912 470369206 899619085 387420489 631148352 387420489 387420489 536870912 414666674 521349938 776784669 387420489 102428009 536870912 387420489 536870912 718311009", "2\n5 6", "3\n536870912 387420489 257407169", "4\n2 2 5 2", "2\n33554432 59049", "3\n536870912 387420489 387420489", "2\n1 5", "18\n2 3 5 7 11 13 17 19 23 29 31 37 43 47 53 59 67 71", "2\n1 30", "3\n335544320 71744535 71744535", "5\n1000000000 999999999 999999998 999999997 999999996", "2\n25 5", "4\n75 150 75 5", "3\n536870912 387420489 362797056", "3\n536870912 387420489 89", "4\n547 2606459 222763549 143466789", "3\n129140163 33554432 1", "10\n244140625 244140625 244140625 244140625 244140625 244140625 244140625 244140625 536870912 387420489", "3\n5 5 1", "5\n3 7 29 36760123 823996703"], "outputs": ["Yes", "No", "Yes", "No", "No", "Yes", "Yes", "No", "Yes", "Yes", "Yes", "Yes", "Yes", "No", "No", "No", "No", "Yes", "Yes", "No", "No", "No", "Yes", "No", "No", "No", "Yes", "No", "No", "Yes", "No", "No", "No"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	304	codeforces
7a52b45a3918d9332ab9a559a1953314	Petr#	Long ago, when Petya was a schoolboy, he was very much interested in the Petr# language grammar. During one lesson Petya got interested in the following question: how many different continuous substrings starting with the sbegin and ending with the send (it is possible sbegin<==<=send), the given string t has. Substrings are different if and only if their contents aren't equal, their positions of occurence don't matter. Petya wasn't quite good at math, that's why he couldn't count this number. Help him! The input file consists of three lines. The first line contains string t. The second and the third lines contain the sbegin and send identificators, correspondingly. All three lines are non-empty strings consisting of lowercase Latin letters. The length of each string doesn't exceed 2000 characters. Output the only number — the amount of different substrings of t that start with sbegin and end with send. Sample Input round ro ou codeforces code forca abababab a b aba ab ba Sample Output 1 0 4 1	{"inputs": ["round\nro\nou", "codeforces\ncode\nforca", "abababab\na\nb", "aba\nab\nba", "abcdefghijklmnopqrstuvwxyz\nabc\nxyz", "aaaaaaaaaaaaaaa\na\na", "aaaaaaaaa\naa\naaa", "rmf\nrm\nf", "kennyhorror\nkenny\nhorror", "itsjustatest\njust\nits", "ololo\ntrololo\nololo", "ololololololololololololololo\no\nl", "includecstdiointmainputshelloworldreturn\ncs\nrn", "imabadsanta\nimabadsantaverybad\nimabadsantaverybad", "codecppforfood\nc\nd", "jelutarnumeratian\njelu\nerathian", "yrbqsdlzrjprklpcaahhhfpkaohwwavwcsookezigzufcfvkmawptgdcdzkprxazchdaquvizhtmsfdpyrsjqtvjepssrqqhzsjpjfvihgojqfgbeudgmgjrgeqykytuswbahfw\njqfgbeudgmgjr\nojqfgbeudgmg", "iifgcaijaakafhkbdgcciiiaihdfgdaejhjdkakljkdekcjilcjfdfhlkgfieaaiabafhleajihlegdkddifghbdbeiigiecbcblakliihcfdgkagfeadlgljijkecajbgekcekkkbflellchieehjkfcchjchigcjjaeclillialjdldiafjajdegcblcljkhfeeefeagbiilabhfjbcbkcailcaalceeekefehiadikjlkalgcghlkjegfeagfeafhibhecdlggehhecliidkghgbfbhfjldegfbifafdidecejlj\njbgekcekkkbflellchieehjkfcchjchigcjjaeclillialjdldiafjajdegcblcljkhfeeefe\nabhfjbcbkcailcaalceeekefehiadikjlkalgcghlkjegfeagfeafhibhecdlggehhecliidkghgbfbhfjldegfb", "bgphoaomnjcjhgkgbflfclbjmkbfonpbmkdomjmkahaoclcbijdjlllnpfkbilgiiidbabgojbbfmliemhicaanadbaahagmfdldbbklelkihlcbkhchlikhefeeafbhkabfdlhnnjnlimbhneafcfeapcbeifgcnaijdnkjpikedmdbhahhgcijddfmamdiaapaeimdhfblpkedamifbbdndmmljmdcffcpmanndeeclnpnkdoieiahchdnkdmfnbocnimclgckdcbp\npcbeifgcnaijdnkjpikedmdbhahhgcijddfmamdiaapaeimdhfblpkedamifbbdndmmljmd\nbklelkihlcbkhchlikhefeeafbhkabfdlhnnjnlimbhneafcfeapcbeifgcnaijdnkjpikedmdbhahhgcijddfmamdiaapaeimdhfblpkedamifbbdndmmljmdcffcpmanndeeclnpnkdoieiahchdnk", "fcgbeabagggfdbacgcaagfbdddefdbcfccfacfffebdgececdabfceadecbgdgdbdadcgfbbaaabcccdefabdfefadfdccbbefbfgcfdadeggggbdadfeadafbaccefdfcbbbadgegbbbcebfbdcfaabddeafbedagbgfdagcccafbddcfafdfaafgefcdceaabggfbaebeaccdfbeeegfdddgfdaagcbdddggcaceadgbddcbdcfddbcddfaebdgcebcbgcacgdeabffbedfabacbadcfgbdfffgadacabegecgdccbcbbaecdabeee\ngd\naa", "bcacddaaccadcddcabdcddbabdbcccacdbcbababadbcaabbaddbbaaddadcbbcbccdcaddabbdbdcbacaccccadc\nc\ndb", "uzxomgizlatyauzgyluecowouypbzladmwvtskagnltgjswsgsjmnjuxsokapatfevwavgxyhtokoaduvkszkybtqntsbaromqptomphrvvsyqchtydgslzsopervrhozsbiuygipfbmuhiaitrqqwdisxilnbuvfrqcnymaqxgiwnjfcvkqcpbiuoiricmuiyr\nsjmn\nmqpt", "dbccdbcdbcccccdaddccadabddabdaaadadcdaacacddcccacbaaaabaa\ndcc\ncdbcc", "abcdefg\nabcde\ncdefg", "aaaaaaaaaaaaaaaaaaaaa\nb\nc", "bcaaa\nbca\nc", "ruruuyruruuy\nru\nuy", "dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\nd\nd", "zzzabazzz\naba\nab", "abcdcbaabccdba\nab\nba", "xadyxbay\nx\ny", "aba\nba\nab", "aabbc\na\nb"], "outputs": ["1", "0", "4", "1", "1", "15", "7", "1", "1", "0", "0", "14", "1", "0", "3", "0", "0", "1", "0", "12", "68", "1", "0", "1", "0", "0", "4", "240", "0", "3", "3", "0", "4"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
7a56eef43ec386b74abffa147e261099	Ice Sculptures	The Berland University is preparing to celebrate the 256-th anniversary of its founding! A specially appointed Vice Rector for the celebration prepares to decorate the campus. In the center of the campus n ice sculptures were erected. The sculptures are arranged in a circle at equal distances from each other, so they form a regular n-gon. They are numbered in clockwise order with numbers from 1 to n. The site of the University has already conducted a voting that estimated each sculpture's characteristic of ti — the degree of the sculpture's attractiveness. The values of ti can be positive, negative or zero. When the university rector came to evaluate the work, he said that this might be not the perfect arrangement. He suggested to melt some of the sculptures so that: - the remaining sculptures form a regular polygon (the number of vertices should be between 3 and n), - the sum of the ti values of the remaining sculptures is maximized. Help the Vice Rector to analyze the criticism — find the maximum value of ti sum which can be obtained in this way. It is allowed not to melt any sculptures at all. The sculptures can not be moved. The first input line contains an integer n (3<=≤<=n<=≤<=20000) — the initial number of sculptures. The second line contains a sequence of integers t1,<=t2,<=...,<=tn, ti — the degree of the i-th sculpture's attractiveness (<=-<=1000<=≤<=ti<=≤<=1000). The numbers on the line are separated by spaces. Print the required maximum sum of the sculptures' attractiveness. Sample Input 8 1 2 -3 4 -5 5 2 3 6 1 -2 3 -4 5 -6 6 1 2 3 4 5 6 Sample Output 14 9 21	{"inputs": ["8\n1 2 -3 4 -5 5 2 3", "6\n1 -2 3 -4 5 -6", "6\n1 2 3 4 5 6", "4\n1 -10 1 -10", "6\n1 0 1 0 1 0", "12\n1 1 1 1 1 1 1 -1000 1 1 1 1", "3\n-1 -1 -1", "97\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "5\n0 -1 1 1 0", "6\n-8 -8 6 5 -5 1", "7\n0 55 -5 50 53 34 84", "9\n-2 -1 2 0 1 1 -1 -2 -2", "10\n5 -5 -4 3 -1 -1 2 1 5 -2", "13\n6 7 8 2 5 1 -9 -6 9 10 8 9 -8"], "outputs": ["14", "9", "21", "-18", "3", "6", "-3", "0", "1", "-2", "271", "1", "7", "42"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
7a78bd250f3e01a2588006385a66a6ee	The Evil Temple and the Moving Rocks	Important: All possible tests are in the pretest, so you shouldn't hack on this problem. So, if you passed pretests, you will also pass the system test. You are an adventurer currently journeying inside an evil temple. After defeating a couple of weak monsters, you arrived at a square room consisting of tiles forming an n<=×<=n grid, surrounded entirely by walls. At the end of the room lies a door locked with evil magical forces. The following inscriptions are written on the door: Being a very senior adventurer, you immediately realize what this means. In the room next door lies an infinite number of magical rocks. There are four types of rocks: - '^': this rock moves upwards; - '<': this rock moves leftwards; - '>': this rock moves rightwards; - 'v': this rock moves downwards. To open the door, you first need to place the rocks on some of the tiles (one tile can be occupied by at most one rock). Then, you select a single rock that you have placed and activate it. The activated rock will then move in its direction until it hits another rock or hits the walls of the room (the rock will not move if something already blocks it in its chosen direction). The rock then deactivates. If it hits the walls, or if there have been already 107 events of rock becoming activated, the movements end. Otherwise, the rock that was hit becomes activated and this procedure is repeated. If a rock moves at least one cell before hitting either the wall or another rock, the hit produces a sound. The door will open once the number of produced sounds is at least x. It is okay for the rocks to continue moving after producing x sounds. The following picture illustrates the four possible scenarios of moving rocks. - Moves at least one cell, then hits another rock. A sound is produced, the hit rock becomes activated. - Moves at least one cell, then hits the wall (i.e., the side of the room). A sound is produced, the movements end. - Does not move because a rock is already standing in the path. The blocking rock becomes activated, but no sounds are produced. - Does not move because the wall is in the way. No sounds are produced and the movements end. Assume there's an infinite number of rocks of each type in the neighboring room. You know what to do: place the rocks and open the door! The first line will consists of two integers n and x, denoting the size of the room and the number of sounds required to open the door. There will be exactly three test cases for this problem: - n<==<=5,<=x<==<=5; - n<==<=3,<=x<==<=2; - n<==<=100,<=x<==<=105. All of these testcases are in pretest. Output n lines. Each line consists of n characters — the j-th character of the i-th line represents the content of the tile at the i-th row and the j-th column, and should be one of these: - '^', '<', '>', or 'v': a rock as described in the problem statement. - '.': an empty tile. Then, output two integers r and c (1<=≤<=r,<=c<=≤<=n) on the next line — this means that the rock you activate first is located at the r-th row from above and c-th column from the left. There must be a rock in this cell. If there are multiple solutions, you may output any of them. Sample Input 5 5 3 2 Sample Output >...v v.<.. ..^.. >.... ..^.< 1 1 >vv ^<. ^.< 1 3	{"inputs": ["5 5", "3 2", "100 100000"], "outputs": [">...v\nv.<..\n..^..\n>....\n..^.<\n1 1", ">vv\n^<.\n^.<\n1 3", ">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>v.\n^v<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<.\n^>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>v.\n^v<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<.<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<.\n^>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>.>v.\n^..."]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
7a89f15c9c25f50f7100dea915d05aa5	none	International Abbreviation Olympiad takes place annually starting from 1989. Each year the competition receives an abbreviation of form IAO'y, where y stands for some number of consequent last digits of the current year. Organizers always pick an abbreviation with non-empty string y that has never been used before. Among all such valid abbreviations they choose the shortest one and announce it to be the abbreviation of this year's competition. For example, the first three Olympiads (years 1989, 1990 and 1991, respectively) received the abbreviations IAO'9, IAO'0 and IAO'1, while the competition in 2015 received an abbreviation IAO'15, as IAO'5 has been already used in 1995. You are given a list of abbreviations. For each of them determine the year it stands for. The first line of the input contains a single integer n (1<=≤<=n<=≤<=1000) — the number of abbreviations to process. Then n lines follow, each containing a single abbreviation. It's guaranteed that each abbreviation contains at most nine digits. For each abbreviation given in the input, find the year of the corresponding Olympiad. Sample Input 5 IAO'15 IAO'2015 IAO'1 IAO'9 IAO'0 4 IAO'9 IAO'99 IAO'999 IAO'9999 Sample Output 2015 12015 1991 1989 1990 1989 1999 2999 9999	{"inputs": ["5\nIAO'15\nIAO'2015\nIAO'1\nIAO'9\nIAO'0", "4\nIAO'9\nIAO'99\nIAO'999\nIAO'9999", "1\nIAO'111110", "2\nIAO'0\nIAO'00", "1\nIAO'111111", "1\nIAO'111111111", "1\nIAO'001", "1\nIAO'2000", "1\nIAO'11109999", "1\nIAO'11111", "1\nIAO'100000", "1\nIAO'18999990", "1\nIAO'113098", "1\nIAO'111122", "1\nIAO'1110222", "1\nIAO'11133333", "1\nIAO'000000000", "4\nIAO'3098\nIAO'99\nIAO'999\nIAO'9999", "1\nIAO'11100000", "2\nIAO'15\nIAO'15", "1\nIAO'999999999", "1\nIAO'1112121", "1\nIAO'111113098", "1\nIAO'10005000", "1\nIAO'111378", "1\nIAO'112222", "1\nIAO'021113099", "1\nIAO'123456789", "1\nIAO'000000001", "1\nIAO'089", "9\nIAO'0\nIAO'00\nIAO'000\nIAO'0000\nIAO'00000\nIAO'000000\nIAO'0000000\nIAO'00000000\nIAO'000000000", "2\nIAO'999999999\nIAO'999999999", "1\nIAO'2015", "1\nIAO'113097", "1\nIAO'11378"], "outputs": ["2015\n12015\n1991\n1989\n1990", "1989\n1999\n2999\n9999", "1111110", "1990\n2000", "1111111", "1111111111", "3001", "12000", "111109999", "111111", "1100000", "18999990", "1113098", "1111122", "11110222", "11133333", "1000000000", "13098\n1999\n2999\n9999", "111100000", "2015\n2015", "999999999", "11112121", "1111113098", "110005000", "1111378", "1112222", "1021113099", "123456789", "1000000001", "3089", "1990\n2000\n3000\n10000\n100000\n1000000\n10000000\n100000000\n1000000000", "999999999\n999999999", "12015", "1113097", "111378"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	8	codeforces
7a9a8a7e5402fd8076337a84117a28db	Triangle	Johnny has a younger sister Anne, who is very clever and smart. As she came home from the kindergarten, she told his brother about the task that her kindergartener asked her to solve. The task was just to construct a triangle out of four sticks of different colours. Naturally, one of the sticks is extra. It is not allowed to break the sticks or use their partial length. Anne has perfectly solved this task, now she is asking Johnny to do the same. The boy answered that he would cope with it without any difficulty. However, after a while he found out that different tricky things can occur. It can happen that it is impossible to construct a triangle of a positive area, but it is possible to construct a degenerate triangle. It can be so, that it is impossible to construct a degenerate triangle even. As Johnny is very lazy, he does not want to consider such a big amount of cases, he asks you to help him. The first line of the input contains four space-separated positive integer numbers not exceeding 100 — lengthes of the sticks. Output TRIANGLE if it is possible to construct a non-degenerate triangle. Output SEGMENT if the first case cannot take place and it is possible to construct a degenerate triangle. Output IMPOSSIBLE if it is impossible to construct any triangle. Remember that you are to use three sticks. It is not allowed to break the sticks or use their partial length. Sample Input 4 2 1 3 7 2 2 4 3 5 9 1 Sample Output TRIANGLE SEGMENT IMPOSSIBLE	{"inputs": ["4 2 1 3", "7 2 2 4", "3 5 9 1", "3 1 5 1", "10 10 10 10", "11 5 6 11", "1 1 1 1", "10 20 30 40", "45 25 5 15", "20 5 8 13", "10 30 7 20", "3 2 3 2", "70 10 100 30", "4 8 16 2", "3 3 3 10", "1 5 5 5", "13 25 12 1", "10 100 7 3", "50 1 50 100", "50 1 100 49", "49 51 100 1", "5 11 2 25", "91 50 9 40", "27 53 7 97", "51 90 24 8", "3 5 1 1", "13 49 69 15", "16 99 9 35", "27 6 18 53", "57 88 17 8", "95 20 21 43", "6 19 32 61", "100 21 30 65", "85 16 61 9", "5 6 19 82", "1 5 1 3", "65 10 36 17", "81 64 9 7", "11 30 79 43", "1 1 5 3", "21 94 61 31", "49 24 9 74", "11 19 5 77", "52 10 19 71", "2 3 7 10", "1 2 6 3", "2 6 1 8", "1 2 4 1", "4 10 6 2", "2 10 7 3", "5 2 3 9", "6 1 4 10", "10 6 4 1", "3 2 9 1", "22 80 29 7", "2 6 3 9", "3 1 2 1", "3 4 7 1", "8 4 3 1", "2 8 3 5", "4 1 2 1", "8 1 3 2", "6 2 1 8", "3 3 3 6", "3 6 3 3", "4 10 4 4", "1 1 2 1", "3 3 3 6", "5 4 5 5", "8 7 8 8", "3 3 3 1", "1 1 6 6", "1 9 1 9", "7 2 2 7", "7 2 3 2", "4 4 10 10", "7 7 10 7", "4 4 4 5", "1 10 9 2", "1 8 2 7", "4 3 2 8", "5 9 5 3", "4 10 3 5"], "outputs": ["TRIANGLE", "SEGMENT", "IMPOSSIBLE", "IMPOSSIBLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "IMPOSSIBLE", "TRIANGLE", "SEGMENT", "TRIANGLE", "SEGMENT", "IMPOSSIBLE", "TRIANGLE", "TRIANGLE", "SEGMENT", "SEGMENT", "TRIANGLE", "SEGMENT", "SEGMENT", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "IMPOSSIBLE", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "SEGMENT", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE", "TRIANGLE"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	372	codeforces
7aa4872341e638bdc2ec23b356052e20	Lara Croft and the New Game	You might have heard about the next game in Lara Croft series coming out this year. You also might have watched its trailer. Though you definitely missed the main idea about its plot, so let me lift the veil of secrecy. Lara is going to explore yet another dangerous dungeon. Game designers decided to use good old 2D environment. The dungeon can be represented as a rectangle matrix of n rows and m columns. Cell (x,<=y) is the cell in the x-th row in the y-th column. Lara can move between the neighbouring by side cells in all four directions. Moreover, she has even chosen the path for herself to avoid all the traps. She enters the dungeon in cell (1,<=1), that is top left corner of the matrix. Then she goes down all the way to cell (n,<=1) — the bottom left corner. Then she starts moving in the snake fashion — all the way to the right, one cell up, then to the left to the cell in 2-nd column, one cell up. She moves until she runs out of non-visited cells. n and m given are such that she always end up in cell (1,<=2). Lara has already moved to a neighbouring cell k times. Can you determine her current position? The only line contains three integers n, m and k (2<=≤<=n,<=m<=≤<=109, n is always even, 0<=≤<=k<=<<=n·m). Note that k doesn't fit into 32-bit integer type! Print the cell (the row and the column where the cell is situated) where Lara ends up after she moves k times. Sample Input 4 3 0 4 3 11 4 3 7 Sample Output 1 1 1 2 3 2	{"inputs": ["4 3 0", "4 3 11", "4 3 7", "1000000000 2 1999999999", "1000000000 1000000000 999999999999999999", "1000000000 1000000000 999999999", "1000000000 1000000000 2000000500", "2 2 2", "28 3 1", "2 3 3", "4 6 8", "6 6 18", "4 3 8", "4 3 4", "4 4 10", "4 5 4", "4 3 9", "4 3 6", "4 5 5", "6 4 8", "4 4 12", "10 6 15", "6666 969696 6667", "4 5 13", "84 68 4248", "6 6 9", "4 5 17", "2 3 4", "4 3 5", "2 3 2", "4 5 12", "6 6 16", "4 4 6", "10 3 18", "2 4 5", "6 9 43", "4 7 8", "500 100 800", "2 5 5", "4 6 15", "9213788 21936127 8761236", "2 5 6", "43534 432423 53443", "999999998 999999998 999999995000000005", "999999924 999999983 999999906999879972", "6 5 18", "4 4 5", "6 6 6", "99999998 8888888 77777777777", "6 5 6", "6 5 17", "6 4 12", "999995712 999993076 999988788028978212", "999994900 999993699 999988599028973300", "978642410 789244500 12348616164", "999993774 999998283 999992057010529542", "4 7 10", "6 4 9", "1000000000 789 788999999000", "978642410 789244500 1234861616400", "999999596 999999631 999999226999090676", "4 7 16", "2 2 3", "21726 5447 14771", "4 2 6", "621282132 311996010 98597740967720109", "803521870 958373820 689637244594465863", "887584278 701990442 578292377747447929", "656369902 872526042 566305269065863364", "839664176 535164910 441498526835463771", "636553724 546535019 115079316355948443", "2182 23967 52288026", "548492800 434105920 179638683192075937", "4 4 4", "6 8 15", "6 3 7", "949547590 305226065 138144146668766087", "1000000000 1000000000 3000000000", "999999998 1000000000 1000000998999999", "999381438 840037557 128928432510450944", "742860584 671970249 260211607929646490", "1000000000 1000000000 1999999998", "993142186 628701115 555947810764442157", "595261150 794915864 332353903994901365"], "outputs": ["1 1", "1 2", "3 2", "1 2", "1 2", "1000000000 1", "999999999 999999499", "2 2", "2 1", "2 3", "4 6", "4 4", "2 2", "4 2", "2 2", "4 2", "2 3", "3 3", "4 3", "6 4", "2 4", "9 6", "6666 3", "2 3", "22 12", "6 5", "1 4", "1 3", "4 3", "2 2", "2 2", "4 2", "4 4", "6 2", "1 4", "2 7", "4 6", "497 97", "2 5", "2 3", "8761237 1", "1 5", "43534 9911", "2 999999997", "1 121321", "3 5", "4 3", "6 2", "99991260 6683175", "6 2", "4 5", "4 2", "1 711901", "1 3161801", "978642396 320550770", "1 160501", "3 7", "5 4", "2 578", "978640847 495422447", "1 1058401", "2 2", "1 2", "14772 1", "2 2", "305259691 311996002", "83930798 27", "63794746 41", "7328794 36", "14687578 15", "425992073 546535018", "1 7969", "134679777 434105920", "4 2", "5 6", "6 3", "496951426 3", "999999998 4", "998999998 3", "845902072 12", "355623786 4", "1000000000 1000000000", "108862204 25", "177161677 794915848"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	67	codeforces
7ab2968b04610f2f8b3a9b37df7726eb	Vika and Squares	Vika has n jars with paints of distinct colors. All the jars are numbered from 1 to n and the i-th jar contains ai liters of paint of color i. Vika also has an infinitely long rectangular piece of paper of width 1, consisting of squares of size 1<=×<=1. Squares are numbered 1, 2, 3 and so on. Vika decided that she will start painting squares one by one from left to right, starting from the square number 1 and some arbitrary color. If the square was painted in color x, then the next square will be painted in color x<=+<=1. In case of x<==<=n, next square is painted in color 1. If there is no more paint of the color Vika wants to use now, then she stops. Square is always painted in only one color, and it takes exactly 1 liter of paint. Your task is to calculate the maximum number of squares that might be painted, if Vika chooses right color to paint the first square. The first line of the input contains a single integer n (1<=≤<=n<=≤<=200<=000) — the number of jars with colors Vika has. The second line of the input contains a sequence of integers a1,<=a2,<=...,<=an (1<=≤<=ai<=≤<=109), where ai is equal to the number of liters of paint in the i-th jar, i.e. the number of liters of color i that Vika has. The only line of the output should contain a single integer — the maximum number of squares that Vika can paint if she follows the rules described above. Sample Input 5 2 4 2 3 3 3 5 5 5 6 10 10 10 1 10 10 Sample Output 12 15 11	{"inputs": ["5\n2 4 2 3 3", "3\n5 5 5", "6\n10 10 10 1 10 10", "1\n167959139", "10\n896619242 805194919 844752453 848347723 816995848 856813612 805194919 833406689 816255448 805194919", "2\n2 3", "2\n10 10", "2\n1111 1110", "3\n100 101 100", "3\n100 100 101", "3\n101 100 100", "4\n2 3 2 2", "4\n1 1 1 1", "4\n100 100 100 101", "4\n101 100 100 101", "4\n100 101 101 100", "4\n200 201 200 201", "4\n201 200 201 200", "4\n300 302 302 300", "8\n5 4 3 2 1 1 1 1", "8\n2 2 1 2 2 1 2 2", "10\n2 1 2 1 2 2 2 2 2 1", "13\n2 2 2 1 1 1 1 1 1 1 2 2 2"], "outputs": ["12", "15", "11", "167959139", "8051949194", "5", "20", "2221", "301", "301", "301", "9", "4", "401", "402", "402", "801", "801", "1202", "12", "12", "15", "19"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	90	codeforces
7ad1ef546a97f18893db5a42709c135a	Road Improvement	In Berland there are n cities and n<=-<=1 bidirectional roads. Each road connects some pair of cities, from any city you can get to any other one using only the given roads. In each city there is exactly one repair brigade. To repair some road, you need two teams based in the cities connected by the road to work simultaneously for one day. Both brigades repair one road for the whole day and cannot take part in repairing other roads on that day. But the repair brigade can do nothing on that day. Determine the minimum number of days needed to repair all the roads. The brigades cannot change the cities where they initially are. The first line of the input contains a positive integer n (2<=≤<=n<=≤<=200<=000) — the number of cities in Berland. Each of the next n<=-<=1 lines contains two numbers ui, vi, meaning that the i-th road connects city ui and city vi (1<=≤<=ui,<=vi<=≤<=n, ui<=≠<=vi). First print number k — the minimum number of days needed to repair all the roads in Berland. In next k lines print the description of the roads that should be repaired on each of the k days. On the i-th line print first number di — the number of roads that should be repaired on the i-th day, and then di space-separated integers — the numbers of the roads that should be repaired on the i-th day. The roads are numbered according to the order in the input, starting from one. If there are multiple variants, you can print any of them. Sample Input 4 1 2 3 4 3 2 6 3 4 5 4 3 2 1 3 4 6 Sample Output 2 2 2 1 1 3 3 1 1 2 2 3 2 4 5	{"inputs": ["4\n1 2\n3 4\n3 2", "6\n3 4\n5 4\n3 2\n1 3\n4 6", "8\n1 3\n1 6\n3 4\n6 2\n5 6\n6 7\n7 8", "5\n1 2\n1 3\n1 4\n1 5", "2\n1 2", "2\n2 1", "3\n1 2\n3 2", "3\n1 3\n2 3", "4\n1 4\n1 2\n4 3", "4\n1 2\n1 3\n1 4", "6\n1 2\n1 3\n1 4\n3 5\n4 6", "6\n1 2\n1 3\n1 4\n3 5\n3 6", "8\n1 2\n2 3\n3 4\n1 5\n5 6\n6 7\n1 8", "10\n4 1\n9 5\n6 8\n4 9\n3 10\n2 8\n9 3\n10 7\n8 7", "10\n2 4\n6 10\n10 3\n7 4\n7 9\n8 2\n3 1\n4 5\n2 6", "2\n2 1", "3\n3 2\n1 2", "3\n3 1\n1 2", "3\n2 1\n3 2", "3\n1 2\n1 3", "4\n1 2\n4 2\n3 4", "4\n3 1\n1 4\n2 1", "4\n1 3\n4 3\n2 4", "4\n3 1\n1 2\n1 4", "4\n3 4\n1 4\n3 2", "4\n1 2\n1 3\n4 1", "10\n2 8\n5 10\n3 4\n1 6\n3 9\n1 7\n4 8\n10 8\n1 8", "12\n1 2\n2 3\n2 4\n2 5\n5 7\n5 6\n5 8\n5 12\n12 10\n12 11\n12 9"], "outputs": ["2\n2 1 2 \n1 3 ", "3\n1 1 \n2 2 3 \n2 4 5 ", "4\n3 2 3 7 \n2 1 4 \n1 5 \n1 6 ", "4\n1 1 \n1 2 \n1 3 \n1 4 ", "1\n1 1 ", "1\n1 1 ", "2\n1 1 \n1 2 ", "2\n1 1 \n1 2 ", "2\n1 1 \n2 2 3 ", "3\n1 1 \n1 2 \n1 3 ", "3\n3 1 4 5 \n1 2 \n1 3 ", "3\n2 1 4 \n1 2 \n2 3 5 ", "3\n3 1 3 5 \n3 2 4 6 \n1 7 ", "3\n4 1 3 7 8 \n3 2 5 6 \n2 4 9 ", "3\n4 1 2 5 7 \n3 3 4 6 \n2 8 9 ", "1\n1 1 ", "2\n1 1 \n1 2 ", "2\n1 1 \n1 2 ", "2\n1 1 \n1 2 ", "2\n1 1 \n1 2 ", "2\n2 1 3 \n1 2 ", "3\n1 1 \n1 2 \n1 3 ", "2\n2 1 3 \n1 2 ", "3\n1 1 \n1 2 \n1 3 ", "2\n1 1 \n2 2 3 ", "3\n1 1 \n1 2 \n1 3 ", "4\n4 1 2 3 4 \n3 5 6 7 \n1 8 \n1 9 ", "5\n2 4 9 \n3 1 5 10 \n3 2 6 11 \n2 3 7 \n1 8 "]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
7ad6bfee3f30ccca47af9b134d529ac7	Dasha and Stairs	On her way to programming school tiger Dasha faced her first test — a huge staircase! The steps were numbered from one to infinity. As we know, tigers are very fond of all striped things, it is possible that it has something to do with their color. So on some interval of her way she calculated two values — the number of steps with even and odd numbers. You need to check whether there is an interval of steps from the l-th to the r-th (1<=≤<=l<=≤<=r), for which values that Dasha has found are correct. In the only line you are given two integers a, b (0<=≤<=a,<=b<=≤<=100) — the number of even and odd steps, accordingly. In the only line print "YES", if the interval of steps described above exists, and "NO" otherwise. Sample Input 2 3 3 1 Sample Output YES NO	{"inputs": ["2 3", "3 1", "5 4", "9 9", "85 95", "0 1", "89 25", "74 73", "62 39", "57 57", "100 99", "0 0", "98 100", "99 100", "1 0", "100 0", "0 100", "100 98", "100 100", "0 5", "2 2"], "outputs": ["YES", "NO", "YES", "YES", "NO", "YES", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "YES"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	204	codeforces
7ada3ad5df947ef2e0f77ab0f870f31c	Paper task	Alex was programming while Valentina (his toddler daughter) got there and started asking many questions about the round brackets (or parenthesis) in the code. He explained her a bit and when she got it he gave her a task in order to finish his code on time. For the purpose of this problem we consider only strings consisting of opening and closing round brackets, that is characters '(' and ')'. The sequence of brackets is called correct if: 1. it's empty; 1. it's a correct sequence of brackets, enclosed in a pair of opening and closing brackets; 1. it's a concatenation of two correct sequences of brackets. For example, the sequences "()()" and "((()))(())" are correct, while ")(()", "(((((" and "())" are not. Alex took a piece of paper, wrote a string s consisting of brackets and asked Valentina to count the number of distinct non-empty substrings of s that are correct sequences of brackets. In other words, her task is to count the number of non-empty correct sequences of brackets that occur in a string s as a substring (don't mix up with subsequences). When Valentina finished the task, Alex noticed he doesn't know the answer. Help him don't loose face in front of Valentina and solve the problem! The first line of the input contains an integer n (1<=≤<=n<=≤<=500<=000) — the length of the string s. The second line contains a string s of length n consisting of only '(' and ')'. Print the number of distinct non-empty correct sequences that occur in s as substring. Sample Input 10 ()()()()() 7 )(())() Sample Output 5 3	{"inputs": ["10\n()()()()()", "7\n)(())()", "1\n(", "2\n))", "15\n(())(()())(()()", "30\n()(())(())(())()(())()()()(()(", "100\n(((((((((((((((((((((((((((((((((((((((((((((((((())))))))))))))))))))))))))))))))))))))))))))))))))", "1\n)", "2\n)(", "2\n((", "3\n(()", "3\n()(", "5\n()(()", "7\n(()(())", "10\n()()((())(", "10\n((((()))))", "20\n()()((()())())()()((", "20\n(((((((((())))))))))", "20\n))(())))))((((()))((", "50\n()(())()()()(()())()(())()()()()(())()()(())()()()", "50\n((((((((((((((((((((((((()))))))))))))))))))))))))", "50\n)))(()(())())())(())()())(())()((()()))(()(()(((()", "100\n)(()))))))(())()))())())(())())))))))()())))()())()((()))())((((()()((()((()((((((((()(((()())(((()(", "500\n()(()()()()()(())())((()(()))()()(())())()(())(()()())()()(())(())(())(())(())()()(())((()))()()()()()(())()()()()((())())()(())(())(())()((())(()))(())(()()()()(())())((()()(())()))(())(()()()((()))())((())(())(())())()((()(()))())()(())((())()()(()))()(()(())()((()))()())(())()((()))()()(())(((()())())()())((()()(())))()(())((())())()()()((())()(())()())((()))(())(())()()((())()()()(())())()()(()()((())()))()()()((())()()()(()))()(()()())()()()()((())())()()(())((()))()()(()()()()()()())()()((", "500\n(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((())))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))", "500\n)()))))()())))))(())))))))()))))))())))))))()))))))))))()))()))()))(())(()))()())()(()))))()))))))))()))))())))))))))))))(()()))))))))()())))))))()))))()))))))()))())))))))))()))))()))))))))()))))()))))()()))))())))))))())(()()))))))))())))))()())))))((()((((())(()(((((()((((((((((((((()(()((((((((((((((()((((()()))(((((((()((()()(((((((()(((()((((()(((()(((((((((((((((()((()(()((())(()))()(()(((()((((((((()((()(((((((()(((((((()(((((())()())()((((((()(((()(())))((((((()(()((((())(((()((((((()()"], "outputs": ["5", "3", "0", "0", "5", "34", "50", "0", "0", "0", "1", "1", "1", "3", "3", "5", "13", "10", "3", "142", "25", "13", "9", "4051", "250", "17"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
7af11cd684cd4b3c73c10f445ad8cc8b	none	Imagine you have an infinite 2D plane with Cartesian coordinate system. Some of the integral points are blocked, and others are not. Two integral points A and B on the plane are 4-connected if and only if: - the Euclidean distance between A and B is one unit and neither A nor B is blocked; - or there is some integral point C, such that A is 4-connected with C, and C is 4-connected with B. Let's assume that the plane doesn't contain blocked points. Consider all the integral points of the plane whose Euclidean distance from the origin is no more than n, we'll name these points special. Chubby Yang wants to get the following property: no special point is 4-connected to some non-special point. To get the property she can pick some integral points of the plane and make them blocked. What is the minimum number of points she needs to pick? The first line contains an integer n (0<=≤<=n<=≤<=4·107). Print a single integer — the minimum number of points that should be blocked. Sample Input 1 2 3 Sample Output 4 8 16	{"inputs": ["1", "2", "3", "4", "0", "30426905", "38450759", "743404", "3766137", "19863843", "24562258", "24483528", "25329968", "31975828", "2346673", "17082858", "22578061", "17464436", "18855321", "614109", "3107977", "39268638", "31416948", "34609610", "17590047", "12823666", "34714265", "2870141", "15012490", "31988776", "1059264", "5626785", "33146037", "17", "40000000", "5", "6", "7", "8", "9", "10", "11", "12", "13", "14", "15", "16", "25", "39999999", "39999998", "39999997", "39999996", "39099999", "46340", "46341", "395938"], "outputs": ["4", "8", "16", "20", "1", "172120564", "217510336", "4205328", "21304488", "112366864", "138945112", "138499748", "143287936", "180882596", "13274784", "96635236", "127720800", "98793768", "106661800", "3473924", "17581372", "222136960", "177721092", "195781516", "99504332", "72541608", "196373536", "16235968", "84923464", "180955840", "5992100", "31829900", "187502300", "96", "226274168", "28", "32", "36", "44", "48", "56", "60", "64", "72", "76", "84", "88", "140", "226274164", "226274156", "226274152", "226274144", "221182992", "262136", "262144", "2239760"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	11	codeforces
7b29761fa91b3fd359b750e3b402b806	Add Points	There are n points on a straight line, and the i-th point among them is located at xi. All these coordinates are distinct. Determine the number m — the smallest number of points you should add on the line to make the distances between all neighboring points equal. The first line contains a single integer n (3<=≤<=n<=≤<=100<=000) — the number of points. The second line contains a sequence of integers x1,<=x2,<=...,<=xn (<=-<=109<=≤<=xi<=≤<=109) — the coordinates of the points. All these coordinates are distinct. The points can be given in an arbitrary order. Print a single integer m — the smallest number of points you should add on the line to make the distances between all neighboring points equal. Sample Input 3 -5 10 5 6 100 200 400 300 600 500 4 10 9 0 -1 Sample Output 1 0 8	{"inputs": ["3\n-5 10 5", "6\n100 200 400 300 600 500", "4\n10 9 0 -1", "3\n1 4 7", "3\n1 4 6", "3\n1 2 6", "3\n1 3 6", "4\n1 2 3 4", "3\n-1000000000 -999999999 1000000000", "3\n-1000000000 999999999 1000000000", "3\n-1000000000 -999999998 1000000000", "3\n-1000000000 999999998 1000000000", "3\n422800963 4663162 694989823", "5\n-268968800 -435386086 -484420288 579138544 945328473", "10\n711183437 845779129 -106125616 -481773790 66231250 -183390793 -711197523 -196001897 -440633306 -873649505", "3\n300000002 -799999998 -599999998", "5\n-166282087 234698547 -853072571 644571043 444292437", "7\n996073710 -246878649 34663194 35526441 634003254 -704646201 -905166147", "3\n-1000000000 1 1000000000", "5\n-1000000000 1000000000 1 2 -30000", "3\n422800963 0 1000000000", "3\n1000000000 500000001 -500000001"], "outputs": ["1", "0", "8", "0", "3", "3", "3", "0", "1999999998", "1999999998", "999999998", "999999998", "230108885", "204249819", "156311685", "9", "3533", "15411", "1999999998", "1999999996", "999999998", "1499999999"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	92	codeforces
7b6630ecc28410fed28db9ce61242dda	Imbalanced Array	You are given an array a consisting of n elements. The imbalance value of some subsegment of this array is the difference between the maximum and minimum element from this segment. The imbalance value of the array is the sum of imbalance values of all subsegments of this array. For example, the imbalance value of array [1,<=4,<=1] is 9, because there are 6 different subsegments of this array: - [1] (from index 1 to index 1), imbalance value is 0; - [1,<=4] (from index 1 to index 2), imbalance value is 3; - [1,<=4,<=1] (from index 1 to index 3), imbalance value is 3; - [4] (from index 2 to index 2), imbalance value is 0; - [4,<=1] (from index 2 to index 3), imbalance value is 3; - [1] (from index 3 to index 3), imbalance value is 0; You have to determine the imbalance value of the array a. The first line contains one integer n (1<=≤<=n<=≤<=106) — size of the array a. The second line contains n integers a1,<=a2... an (1<=≤<=ai<=≤<=106) — elements of the array. Print one integer — the imbalance value of a. Sample Input 3 1 4 1 Sample Output 9	{"inputs": ["3\n1 4 1", "10\n1 1 1 1 1 1 1 1 1 1", "10\n1 4 4 3 5 2 4 2 4 5", "10\n9 6 8 5 5 2 8 9 2 2", "30\n4 5 2 2 5 2 3 4 3 3 2 1 3 4 4 5 3 3 1 5 2 3 5 4 5 4 4 3 5 2", "30\n2 2 9 1 10 8 3 3 1 4 6 10 2 2 1 4 1 1 1 1 1 2 4 7 6 7 5 10 8 9", "30\n6 19 12 6 25 24 12 2 24 14 10 10 24 19 11 29 10 22 7 1 9 1 2 27 7 24 20 25 20 28", "100\n9 9 72 55 14 8 55 58 35 67 3 18 73 92 41 49 15 60 18 66 9 26 97 47 43 88 71 97 19 34 48 96 79 53 8 24 69 49 12 23 77 12 21 88 66 9 29 13 61 69 54 77 41 13 4 68 37 74 7 6 29 76 55 72 89 4 78 27 29 82 18 83 12 4 32 69 89 85 66 13 92 54 38 5 26 56 17 55 29 4 17 39 29 94 3 67 85 98 21 14"], "outputs": ["9", "0", "123", "245", "1480", "3147", "10203", "426927"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	14	codeforces
7b72b4b75cf50dfdbb310061b3772773	Minesweeper	One day Alex decided to remember childhood when computers were not too powerful and lots of people played only default games. Alex enjoyed playing Minesweeper that time. He imagined that he saved world from bombs planted by terrorists, but he rarely won. Alex has grown up since then, so he easily wins the most difficult levels. This quickly bored him, and he thought: what if the computer gave him invalid fields in the childhood and Alex could not win because of it? He needs your help to check it. A Minesweeper field is a rectangle $n \times m$, where each cell is either empty, or contains a digit from $1$ to $8$, or a bomb. The field is valid if for each cell: - if there is a digit $k$ in the cell, then exactly $k$ neighboring cells have bombs. - if the cell is empty, then all neighboring cells have no bombs. Two cells are neighbors if they have a common side or a corner (i. e. a cell has at most $8$ neighboring cells). The first line contains two integers $n$ and $m$ ($1 \le n, m \le 100$) — the sizes of the field. The next $n$ lines contain the description of the field. Each line contains $m$ characters, each of them is "." (if this cell is empty), "" (if there is bomb in this cell), or a digit from $1$ to $8$, inclusive. Print "YES", if the field is valid and "NO" otherwise. You can choose the case (lower or upper) for each letter arbitrarily. Sample Input 3 3 111 11 111 2 4 .. 1211 Sample Output YESNO	{"inputs": ["3 3\n111\n11\n111", "2 4\n..\n1211", "1 10\n.....11..", "1 1\n4", "10 10\n..........\n...111111.\n..13211.\n.12*2111.\n.1542..11\n.13*1..1\n..231..11\n..111..111\n.......11\n.......111", "10 17\n1222212331....\n233334**3211.\n222134*31.\n11111.12224621.\n221..111.144311\n2233212**21\n55*413544421\n2*543222131\n134332211144\n.1122221...231", "10 10\n*******\n******\n******\n******\n******\n**3\n*******\n******\n******\n3.5**", "21 10\n626377831\n2351531\n3576..\n.3**581\n2.32745\n837665\n74.63\n323676\n345467.1\n*632656\n37254553\n24*54\n23.34***4\n5525714\n43253456\n*.345488\n731845\n234.4557\n12..21.3\n286.2254\n83411.3", "10 10\n*******\n*****6\n*****5\n******\n******\n******\n******\n******\n******\n*******", "100 1\n.\n.\n.\n.\n1\n\n2\n\n1\n.\n.\n.\n.\n.\n.\n1\n\n1\n1\n\n1\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n1\n\n2\n\n\n\n1\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n1\n\n2\n\n1\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.\n.", "1 100\n**********55************************************************4*************************", "1 100\n.....11........11................................11...1*111.......11....1.....11.....11...1", "1 10\n881111882", "5 5\n2221\n24*2\n35\n3425\n12", "5 5\n**2\n44\n3**\n3563\n22", "5 5\n2.\n531\n6\n*43\n31", "5 5\n32*\n434\n44\n*45\n4", "3 3\n\n2\n*", "1 1\n", "1 2\n1", "1 2\n2", "2 2\n32\n", "3 3\n...\n232\n", "3 2\n..\n11\n.", "2 3\n12\n32", "1 3\n..", "3 1\n.\n\n.", "3 1\n1\n\n1", "3 1\n\n1\n", "1 3\n1", "1 1\n8", "1 1\n.", "1 2\n2", "2 1\n\n2", "2 1\n\n", "2 1\n.\n1", "1 3\n..1", "3 3\n112\n11\n111", "3 3\n11.\n11\n111", "3 3\n151\n11\n111", "3 3\n1.1\n11\n111", "3 3\n611\n11\n111", "3 3\n.11\n11\n111", "3 3\n111\n21\n111", "3 3\n111\n*1\n111", "3 3\n111\n51\n111", "3 3\n111\n.1\n111", "3 3\n111\n11\n411", "3 3\n111\n11\n.11", "3 3\n111\n11\n121", "3 3\n111\n11\n1.1", "3 3\n111\n11\n115", "3 3\n111\n11\n11.", "3 3\n111\n14\n111", "3 3\n111\n1.\n111", "1 4\n222", "1 1\n", "2 2\n\n", "3 3\n*\n.\n", "3 3\n\n\n", "3 3\n*\n4\n*", "2 6\n....1.\n.....", "5 5\n***\n*\n*\n*\n**", "4 1\n.\n\n.\n.", "2 2\n2\n11", "3 3\n888\n888\n888", "1 4\n22*"], "outputs": ["YES", "NO", "YES", "NO", "YES", "YES", "NO", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "YES", "NO", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "NO", "YES", "YES", "NO", "YES", "NO", "NO", "YES", "NO", "NO", "NO", "NO"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	33	codeforces
7b79384344f556b9724fdd5e9b4aa4b6	Beautiful Year	It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits. Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits. The single line contains integer y (1000<=≤<=y<=≤<=9000) — the year number. Print a single integer — the minimum year number that is strictly larger than y and all it's digits are distinct. It is guaranteed that the answer exists. Sample Input 1987 2013 Sample Output 2013 2014	{"inputs": ["1987", "2013", "1000", "1001", "1234", "5555", "9000", "1111", "8999", "4572", "6666", "2001", "3000", "7712", "8088", "1594", "6016", "8800", "3331", "5090", "2342", "2334", "1123", "8989", "8977", "6869", "8999"], "outputs": ["2013", "2014", "1023", "1023", "1235", "5601", "9012", "1203", "9012", "4573", "6701", "2013", "3012", "7801", "8091", "1596", "6017", "8901", "3401", "5091", "2345", "2340", "1203", "9012", "9012", "6870", "9012"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	715	codeforces
7b8a429b011c4755f203e29fac2800e6	Rectangles	You are given n<=×<=m table. Each cell of the table is colored white or black. Find the number of non-empty sets of cells such that: 1. All cells in a set have the same color. 1. Every two cells in a set share row or column. The first line of input contains integers n and m (1<=≤<=n,<=m<=≤<=50) — the number of rows and the number of columns correspondingly. The next n lines of input contain descriptions of rows. There are m integers, separated by spaces, in each line. The number equals 0 if the corresponding cell is colored white and equals 1 if the corresponding cell is colored black. Output single integer — the number of non-empty sets from the problem description. Sample Input 1 1 0 2 3 1 0 1 0 1 0 Sample Output 1 8	{"inputs": ["1 1\n0", "2 3\n1 0 1\n0 1 0", "2 2\n1 1\n1 1", "1 10\n0 0 0 0 0 0 0 0 0 0", "11 1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "10 11\n1 1 0 1 1 0 0 0 1 0 0\n1 0 0 1 1 1 0 0 1 1 0\n0 0 1 0 1 1 0 1 0 1 1\n0 1 1 1 0 1 0 1 0 0 0\n1 1 1 1 1 1 1 0 1 0 0\n1 1 0 1 1 1 1 0 0 1 1\n1 0 1 0 1 0 0 1 1 1 0\n1 1 0 0 0 0 0 1 0 1 1\n1 1 0 1 1 1 0 0 1 1 0\n1 0 1 1 0 0 1 0 0 1 1", "50 1\n0\n1\n0\n1\n0\n1\n0\n1\n1\n1\n0\n0\n1\n0\n0\n1\n1\n1\n1\n0\n1\n1\n0\n1\n1\n1\n0\n1\n0\n0\n0\n1\n1\n0\n1\n1\n0\n1\n0\n1\n0\n0\n1\n0\n0\n0\n1\n1\n0\n1", "1 50\n0 1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1 0 1 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 1 0 1 0 0 1 0 0 0 1 1 0 1", "2 20\n0 1 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0", "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", "6 6\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 1 1 1 1\n1 1 1 1 1 1", "21 2\n0 1\n1 1\n0 1\n0 0\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", "3 15\n1 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 1 0 1 0 0 0 0 0 1 0\n1 0 0 1 0 0 0 0 0 0 0 0 1 0 1", "10 11\n0 1 0 0 0 0 0 0 0 0 0\n0 1 0 1 0 0 1 0 0 0 0\n0 0 0 0 0 0 1 1 1 0 0\n0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 1 0 0 0 0 1 0\n0 0 0 0 0 0 1 0 0 0 0\n0 0 0 0 0 0 0 0 0 1 0\n0 0 1 0 0 0 1 1 0 0 0\n0 0 0 0 0 0 0 0 1 0 0\n0 0 1 0 1 0 0 0 0 1 1", "14 15\n0 1 0 0 0 0 0 0 1 0 0 0 1 0 1\n0 0 0 1 1 1 1 0 1 0 0 1 1 0 0\n1 0 0 0 0 1 1 0 0 0 0 0 0 0 0\n0 1 0 0 0 1 0 1 1 0 0 1 0 0 0\n0 0 1 1 0 1 0 1 0 1 1 0 1 0 0\n0 0 0 1 1 0 0 0 0 0 1 1 0 1 0\n0 0 1 0 0 0 0 0 0 1 0 0 1 1 0\n1 1 0 0 0 1 0 0 0 0 0 0 1 1 0\n0 0 0 0 1 0 1 1 1 0 0 0 1 0 1\n1 0 1 1 0 1 0 0 1 0 0 1 1 1 0\n1 0 0 0 0 1 0 0 0 0 0 1 0 0 0\n0 0 0 1 0 1 0 0 0 0 1 0 0 0 1\n0 0 1 0 1 0 0 0 1 1 1 1 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 1 0 0 0", "1 50\n0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 1 0 0 0 1 0 0", "50 1\n0\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1\n1\n1\n0\n1\n1\n1\n1\n0\n1\n1\n1\n1\n1", "1 50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "5 50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\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\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\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\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", "32 2\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", "1 50\n0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1", "50 1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1\n1", "1 49\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", "2 50\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "3 50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\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\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 50\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "1 40\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 33\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", "2 40\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0", "1 35\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", "50 1\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0\n0"], "outputs": ["1", "8", "8", "1023", "2047", "2444", "142606334", "142606334", "589853", "285", "720", "1310745", "22587", "12047", "53166", "1099511628798", "35184372088862", "1125899906842623", "5629499534214415", "8589934622", "562949953421312", "1125899906842623", "562949953421311", "2251799813685296", "3377699720528069", "1125899906842623", "1099511627775", "8589934591", "2199023255590", "34359738367", "1125899906842623"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	159	codeforces
7b93a4c1574b65a354e5e4d577e339f6	Winnie-the-Pooh and honey	As we all know, Winnie-the-Pooh just adores honey. Ones he and the Piglet found out that the Rabbit has recently gotten hold of an impressive amount of this sweet and healthy snack. As you may guess, Winnie and the Piglet asked to come at the Rabbit's place. Thus, there are n jars of honey lined up in front of Winnie-the-Pooh, jar number i contains ai kilos of honey. Winnie-the-Pooh eats the honey like that: each time he chooses a jar containing most honey. If the jar has less that k kilos of honey or if Winnie-the-Pooh has already eaten from it three times, he gives the jar to Piglet. Otherwise he eats exactly k kilos of honey from the jar and puts it back. Winnie does so until he gives all jars to the Piglet. Count how much honey Piglet will overall get after Winnie satisfies his hunger. The first line contains two integers n and k (1<=≤<=n<=≤<=100,<=1<=≤<=k<=≤<=100). The second line contains n integers a1, a2, ..., an, separated by spaces (1<=≤<=ai<=≤<=100). Print a single number — how many kilos of honey gets Piglet. Sample Input 3 3 15 8 10 Sample Output 9	{"inputs": ["3 3\n15 8 10", "1 3\n3", "3 4\n3 8 2", "3 2\n95 25 49", "3 1\n8 3 2", "5 1\n4 7 9 5 7", "8 6\n19 15 1 14 7 2 10 14", "8 5\n5 2 17 12 16 12 17 3", "10 7\n26 11 10 8 5 20 9 27 30 9", "10 10\n20 82 19 82 18 96 40 99 87 2", "10 10\n75 52 78 83 60 31 46 28 33 17", "20 5\n33 45 36 13 46 40 15 11 29 44 43 50 14 19 46 46 46 26 42 6", "20 2\n4 2 6 9 8 4 4 7 2 3 7 7 10 6 3 5 2 9 8 5", "30 3\n20 37 89 77 74 6 52 87 19 58 3 38 40 38 42 12 1 23 29 38 12 65 15 1 92 45 23 94 61 73", "30 2\n10 5 46 30 28 18 24 35 73 2 10 24 72 86 97 95 71 12 14 57 27 94 81 59 43 77 22 58 16 96", "50 13\n53 55 51 81 59 22 11 20 30 80 38 17 8 38 69 52 11 74 16 38 80 97 39 74 78 56 75 28 4 58 80 88 78 89 95 8 13 70 36 29 49 15 74 44 19 52 42 59 92 37", "100 33\n84 70 12 53 10 38 4 66 42 1 100 98 42 10 31 26 22 94 19 43 86 5 37 64 77 98 81 40 17 66 52 43 5 7 79 92 44 78 9 95 10 86 42 56 34 91 12 17 26 16 24 99 11 37 89 100 60 74 32 66 13 29 3 24 41 99 93 87 85 74 5 3 70 46 23 12 43 10 24 32 95 2 57 86 29 100 29 62 17 24 4 40 40 73 29 11 69 89 10 31", "100 12\n90 59 100 12 82 31 66 28 7 13 43 42 48 94 60 32 20 92 37 39 22 55 14 23 77 56 21 55 10 89 93 79 5 80 40 80 6 15 56 82 68 61 32 100 23 7 13 92 32 82 17 85 49 85 13 75 4 7 42 14 84 22 50 12 11 75 4 85 32 96 56 13 34 100 66 37 58 58 24 58 81 63 59 55 89 97 90 69 29 11 71 58 58 43 72 96 81 72 14 64", "100 3\n92 51 91 67 32 97 40 24 78 72 93 90 57 77 66 13 55 24 17 90 65 35 69 97 79 31 85 2 90 80 49 44 73 77 34 45 74 75 35 14 34 56 60 54 36 55 16 49 12 54 92 68 70 71 5 79 67 89 64 80 20 84 4 39 55 84 53 59 68 11 89 89 15 73 67 86 91 78 49 24 58 83 55 34 82 97 27 29 78 15 20 48 9 87 41 34 91 76 82 44", "100 1\n85 75 55 65 39 26 47 16 9 11 3 4 70 23 56 64 36 34 16 13 18 28 32 80 8 79 76 4 21 75 93 51 85 86 100 88 91 71 97 28 66 22 47 87 91 95 3 56 81 53 88 90 21 30 74 45 58 73 36 40 70 51 28 75 20 54 69 52 14 48 52 53 91 81 32 68 16 48 60 66 91 32 55 42 93 51 3 46 23 64 39 1 30 42 20 83 99 29 35 59"], "outputs": ["9", "0", "5", "151", "5", "17", "16", "14", "43", "325", "233", "375", "21", "1021", "1208", "1012", "1467", "2377", "4839", "4801"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	36	codeforces
7b9a01e874f7194f37722f21c8c656b9	Even Odds	Being a nonconformist, Volodya is displeased with the current state of things, particularly with the order of natural numbers (natural number is positive integer number). He is determined to rearrange them. But there are too many natural numbers, so Volodya decided to start with the first n. He writes down the following sequence of numbers: firstly all odd integers from 1 to n (in ascending order), then all even integers from 1 to n (also in ascending order). Help our hero to find out which number will stand at the position number k. The only line of input contains integers n and k (1<=≤<=k<=≤<=n<=≤<=1012). Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier. Print the number that will stand at the position number k after Volodya's manipulations. Sample Input 10 3 7 7 Sample Output 56	{"inputs": ["10 3", "7 7", "7 1", "7 2", "8 5", "8 3", "8 4", "1000000000000 500000000001", "999999999997 499999999999", "999999999999 999999999999", "1000000000000 1", "999999999999 1", "1 1", "1000000000000 1000000000000", "1000000000000 500000000000", "1000000000000 499999999999", "999999999997 499999999998", "619234238 556154835", "38151981 36650624", "680402465 442571217", "109135284 9408714", "603701841 56038951", "356764822 321510177", "284911189 142190783", "91028405 61435545"], "outputs": ["5", "6", "1", "3", "2", "5", "7", "2", "999999999997", "999999999998", "1", "1", "1", "1000000000000", "999999999999", "999999999997", "999999999995", "493075432", "35149266", "204739968", "18817427", "112077901", "286255532", "284381565", "31842684"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	291	codeforces
7bd10aae4248a44fed5def6fc5d7b76f	Inna and Dima	Inna and Dima bought a table of size n<=×<=m in the shop. Each cell of the table contains a single letter: "D", "I", "M", "A". Inna loves Dima, so she wants to go through his name as many times as possible as she moves through the table. For that, Inna acts as follows: 1. initially, Inna chooses some cell of the table where letter "D" is written; 1. then Inna can move to some side-adjacent table cell that contains letter "I"; then from this cell she can go to one of the side-adjacent table cells that contains the written letter "M"; then she can go to a side-adjacent cell that contains letter "A". Then Inna assumes that she has gone through her sweetheart's name; 1. Inna's next move can be going to one of the side-adjacent table cells that contains letter "D" and then walk on through name DIMA in the similar manner. Inna never skips a letter. So, from the letter "D" she always goes to the letter "I", from the letter "I" she always goes the to letter "M", from the letter "M" she always goes to the letter "A", and from the letter "A" she always goes to the letter "D". Depending on the choice of the initial table cell, Inna can go through name DIMA either an infinite number of times or some positive finite number of times or she can't go through his name once. Help Inna find out what maximum number of times she can go through name DIMA. The first line of the input contains two integers n and m (1<=≤<=n,<=m<=≤<=103). Then follow n lines that describe Inna and Dima's table. Each line contains m characters. Each character is one of the following four characters: "D", "I", "M", "A". Note that it is not guaranteed that the table contains at least one letter "D". If Inna cannot go through name DIMA once, print on a single line "Poor Dima!" without the quotes. If there is the infinite number of names DIMA Inna can go through, print "Poor Inna!" without the quotes. Otherwise print a single integer — the maximum number of times Inna can go through name DIMA. Sample Input 1 2 DI 2 2 MA ID 5 5 DIMAD DIMAI DIMAM DDMAA AAMID Sample Output Poor Dima! Poor Inna! 4	{"inputs": ["1 2\nDI", "2 2\nMA\nID", "5 5\nDIMAD\nDIMAI\nDIMAM\nDDMAA\nAAMID", "1 1\nI", "5 5\nDIMAD\nADDDI\nMDDDM\nIDDDA\nDAMID", "5 5\nAAAAA\nAAAAA\nAAAAA\nAAAAA\nAAAAA", "1 1\nD", "1 4\nDIMA", "4 1\nD\nI\nM\nA", "2 2\nDI\nAM", "2 2\nDI\nMA", "5 5\nDIADD\nDMADD\nDDDID\nAMMMD\nMIDAD", "10 10\nDIDDIMDIDD\nDMDDAADIDD\nDADDDDDMDD\nDDDDDDDADD\nDIDDDDIDDD\nDMDDDDMDDD\nDADDDDADID\nDDIMDDDDMD\nDDAADDIAAD\nDDDDDDMADD", "14 34\nDDDDDDDDDDDDIMADDDDDDDDDDDDDDDIMAD\nDDDDDDIMADDDDDDDDDDDDDDDDDDDDDIMAD\nDDDDDDDDDDDDDIDDDDDDDDDDDIDIMIDIMA\nDDDDDDIMDDDDDDDDDDDDDIDDDDDDDDDDDD\nDDDDDDDDDDDDDDDDDMADDDDDDDDDDDDDMD\nDDDDDDIMIDDDDDDDDDDDDIMIDIMIDDDIDD\nDDDDDDDDDDDDDDDDDMIMDDDDIMDDIMADIM\nDDDDDDDDDDDADIMADIDDDDDDIDIMADADDD\nDDDDDDDDIDDDDDDDDDDDDDDDDMADIMDDAM\nDMDDDDDDDDDDDDIMADIMDDDDDMADDDMIDI\nDDDDDDDDIMDDDDDDDDDDIDIMADIDDDDMAD\nDDDIDDDDDDDDDDMIDIMADADADIMADIMAAD\nDDDADDDDDDDDDIMIMADIDDMDMAMIDMDDDM\nDIDIDDDDDDIIAAMMAIMIDADAAAMDIDDDID", "9 6\nDIMADD\nIDDDDD\nMDDDDD\nADDDDD\nDIMADD\nIDDDDD\nMDDDDD\nADDDDD\nDDDDDD", "1 1\nM", "1 1\nA", "1 4\nIMAD"], "outputs": ["Poor Dima!", "Poor Inna!", "4", "Poor Dima!", "Poor Inna!", "Poor Dima!", "Poor Dima!", "1", "1", "Poor Inna!", "Poor Dima!", "3", "4", "Poor Inna!", "2", "Poor Dima!", "Poor Dima!", "Poor Dima!"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
7bdf1792023fed0ee2299b19cea20807	New Roads	There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads. That is why there was a decision to build n<=-<=1 roads so that there will be exactly one simple path between each pair of cities. In the construction plan t integers a1,<=a2,<=...,<=at were stated, where t equals to the distance from the capital to the most distant city, concerning new roads. ai equals the number of cities which should be at the distance i from the capital. The distance between two cities is the number of roads one has to pass on the way from one city to another. Also, it was decided that among all the cities except the capital there should be exactly k cities with exactly one road going from each of them. Such cities are dead-ends and can't be economically attractive. In calculation of these cities the capital is not taken into consideration regardless of the number of roads from it. Your task is to offer a plan of road's construction which satisfies all the described conditions or to inform that it is impossible. The first line contains three positive numbers n, t and k (2<=≤<=n<=≤<=2·105, 1<=≤<=t,<=k<=<<=n) — the distance to the most distant city from the capital and the number of cities which should be dead-ends (the capital in this number is not taken into consideration). The second line contains a sequence of t integers a1,<=a2,<=...,<=at (1<=≤<=ai<=<<=n), the i-th number is the number of cities which should be at the distance i from the capital. It is guaranteed that the sum of all the values ai equals n<=-<=1. If it is impossible to built roads which satisfy all conditions, print -1. Otherwise, in the first line print one integer n — the number of cities in Berland. In the each of the next n<=-<=1 line print two integers — the ids of cities that are connected by a road. Each road should be printed exactly once. You can print the roads and the cities connected by a road in any order. If there are multiple answers, print any of them. Remember that the capital has id 1. Sample Input 7 3 3 2 3 1 14 5 6 4 4 2 2 1 3 1 1 2 Sample Output 7 1 3 2 1 2 6 2 4 7 4 3 5 14 3 1 1 4 11 6 1 2 10 13 6 10 10 12 14 12 8 4 5 1 3 7 2 6 5 9 -1	{"inputs": ["7 3 3\n2 3 1", "14 5 6\n4 4 2 2 1", "3 1 1\n2", "6 3 3\n1 2 2", "11 6 4\n1 2 2 1 3 1", "21 10 9\n2 1 3 1 1 1 3 2 3 3", "51 16 31\n1 3 3 3 4 4 3 5 4 1 3 3 3 2 3 5", "1001 179 490\n8 8 6 7 1 6 10 3 7 8 8 7 2 4 9 8 4 5 8 3 5 7 9 10 9 5 2 6 5 3 3 2 9 6 4 2 10 2 3 5 7 4 5 8 3 9 5 9 2 5 4 9 3 8 2 9 6 7 4 4 10 9 8 5 2 6 9 10 9 3 1 9 9 3 9 4 10 1 7 4 4 9 2 5 6 4 9 3 4 10 1 3 10 3 3 10 9 2 5 6 6 1 1 9 4 9 9 7 5 5 10 3 8 7 10 3 2 10 6 1 4 4 5 7 4 7 1 1 8 5 8 6 2 9 3 3 5 8 7 1 8 3 6 2 8 10 4 5 1 6 3 4 6 9 8 10 1 3 9 9 4 6 6 7 10 2 4 8 2 1 5 4 5 3 7 2 5 9 3", "200000 5 190092\n47191 35051 33744 40989 43024", "2000 3 1337\n970 632 397", "2001 34 1714\n28 91 43 47 52 42 69 95 11 70 59 68 88 92 71 19 7 70 100 66 1 38 36 88 58 52 87 85 40 75 26 42 85 99", "150001 7 147760\n8286 37995 4975 28947 23162 15808 30827", "200000 5 195020\n47330 743 46163 36629 69134", "200000 18 199982\n19878 5843 2935 16419 14574 12751 15665 18170 12578 14385 6515 9607 4121 224 14079 4972 10940 16343", "200000 4 90823\n63010 23084 77424 36481", "200000 1 199999\n199999", "6390 29 1740\n407 261 213 375 118 127 276 322 353 166 120 308 178 261 270 275 157 26 36 159 20 272 152 316 213 237 167 372 232", "2 1 1\n1", "4 2 3\n1 2", "17 5 11\n5 3 2 5 1", "16 4 10\n2 3 5 5", "2 1 1\n1", "3 2 2\n1 1", "3 2 2\n1 1", "4 2 3\n2 1", "4 1 1\n3", "4 3 1\n1 1 1", "5 4 3\n1 1 1 1", "5 4 3\n1 1 1 1", "5 4 4\n1 1 1 1", "5 4 4\n1 1 1 1", "6 4 5\n1 1 1 2"], "outputs": ["7\n1 2\n2 6\n5 3\n2 4\n1 3\n7 4", "14\n12 14\n7 3\n6 10\n5 1\n13 10\n1 3\n8 4\n9 5\n4 1\n6 2\n12 10\n6 11\n2 1", "-1", "6\n3 5\n6 3\n2 1\n4 2\n2 3", "11\n3 5\n11 8\n7 9\n10 7\n7 8\n2 3\n2 4\n6 4\n1 2\n5 7", "21\n5 4\n14 18\n7 4\n12 10\n17 15\n2 1\n10 11\n20 16\n9 10\n14 16\n4 2\n1 3\n14 11\n8 9\n13 10\n16 19\n5 8\n16 21\n6 4\n15 12", "51\n49 44\n28 32\n31 23\n36 33\n16 20\n9 12\n4 2\n42 45\n18 12\n44 51\n33 38\n11 8\n34 32\n23 20\n8 5\n39 36\n39 42\n48 44\n16 21\n12 16\n23 30\n12 19\n9 15\n20 24\n37 33\n13 9\n20 25\n23 29\n6 3\n17 12\n42 44\n50 44\n7 4\n36 40\n28 23\n35 32\n33 32\n9 6\n43 39\n36 41\n1 2\n47 44\n20 27\n22 16\n46 42\n14 9\n7 10\n5 2\n3 2\n20 26", "1001\n695 689\n737 746\n383 376\n188 185\n312 318\n901 891\n33 39\n413 404\n793 794\n865 854\n831 839\n811 814\n340 351\n944 952\n985 991\n569 579\n776 770\n845 840\n20 26\n1 2\n56 48\n778 789\n471 475\n811 815\n415 419\n767 758\n146 137\n510 498\n621 612\n383 389\n649 663\n360 369\n83 87\n756 750\n531 534\n164 169\n489 494\n258 255\n24 31\n513 516\n188 193\n794 802\n740 729\n440 449\n890 887\n738 729\n444 434\n813 811\n649 646\n240 244\n704 714\n905 891\n167 158\n192 188\n305 302\n958 962\n169 175\n705 70...", "200000\n115988 194495\n115988 186970\n136478 82244\n150960 82244\n185127 115988\n191591 115988\n187442 115988\n115988 181548\n115988 167357\n90874 47193\n115988 182235\n166965 115988\n115988 195352\n115988 177339\n188896 115988\n186993 115988\n115988 192573\n172293 115988\n115988 199003\n196650 115988\n166407 115988\n115988 186132\n115988 192130\n115988 192121\n115988 175735\n178910 115988\n121195 82244\n115988 193692\n188417 115988\n127665 82244\n199363 115988\n155907 82244\n147227 82244\n115988 186681\n1...", "2000\n1 695\n1786 972\n1327 357\n1 188\n1253 283\n972 1891\n1787 972\n1 413\n156 1126\n865 1\n1705 972\n1 814\n1 348\n992 1624\n1068 98\n1 575\n972 1957\n1 845\n149 1119\n972 1993\n1 54\n1 789\n1 475\n1 815\n1 419\n1841 972\n1 147\n507 1\n1 621\n427 1397\n1 663\n1118 148\n1 87\n756 1\n556 1526\n972 1970\n972 1837\n1872 972\n1 31\n1 517\n192 1\n391 1361\n242 1212\n1 449\n890 1\n1379 409\n983 1615\n813 1\n1 649\n1128 158\n1945 972\n978 1610\n167 1\n319 1289\n1592 622\n1986 972\n371 1341\n1 705\n1524 554\n175...", "2001\n294 336\n954 1024\n345 303\n1265 1376\n1463 1596\n1776 1892\n1025 954\n487 469\n1470 1411\n1411 1528\n2 61\n954 1090\n1194 1190\n228 280\n1872 1776\n1265 1403\n1485 1411\n1644 1550\n941 857\n869 765\n568 480\n1353 1433\n1476 1411\n609 759\n469 501\n944 857\n699 609\n1635 1688\n948 928\n609 755\n1229 1191\n1463 1579\n1955 1818\n765 912\n907 765\n1024 1158\n263 350\n550 665\n954 1083\n1969 1818\n876 765\n104 2\n1003 947\n1919 1818\n609 744\n1776 1893\n1408 1265\n663 550\n1534 1411\n154 63\n28 1\n1411 1...", "150001\n139099 103367\n136999 103367\n125242 103367\n122472 103367\n35871 2\n80205 106310\n103367 134790\n128032 103367\n145793 103367\n46283 56175\n116621 80205\n131527 103367\n103367 146171\n103367 132459\n103367 133969\n103367 129263\n112482 80205\n85396 51258\n129908 103367\n108776 80205\n103367 142201\n127810 103367\n109636 80205\n103367 140692\n1 3018\n140898 103367\n103367 147446\n46283 75221\n103367 127230\n103367 142840\n2 41625\n103367 133122\n131090 103367\n101465 51258\n103367 123412\n138388 10...", "200000\n94238 194495\n94238 186970\n136478 94238\n150960 94238\n185127 94238\n191591 94238\n187442 94238\n94238 181548\n94238 167357\n91616 47332\n94238 182235\n166965 94238\n94238 195352\n94238 177339\n188896 94238\n186993 94238\n94238 192573\n172293 94238\n94238 199003\n196650 94238\n166407 94238\n94238 186132\n94238 192130\n94238 192121\n94238 175735\n178910 94238\n124686 48075\n94238 193692\n188417 94238\n94528 48365\n199363 94238\n155907 94238\n147227 94238\n94238 186681\n189754 94238\n94238 195609\n1...", "200000\n174928 167746\n167746 176523\n172718 191873\n153667 171107\n172718 193613\n172718 197400\n172718 192738\n198484 172718\n110297 88067\n172718 186509\n139715 153381\n153667 167876\n167746 180125\n172718 185267\n153443 155797\n172718 190718\n116189 88067\n163463 153443\n172718 196975\n166400 153443\n150876 139715\n149767 139715\n172718 191355\n172718 187814\n156266 153443\n106237 131171\n178082 167746\n172718 194718\n172718 199797\n172718 193391\n172718 199525\n133200 143479\n184398 172718\n178155 167...", "-1", "200000\n1 120418\n162163 1\n156675 1\n187544 1\n1 187800\n1 192966\n184902 1\n191949 1\n1 126665\n191367 1\n1 183579\n1 181788\n1 129868\n197312 1\n1 197439\n1 179130\n1 164809\n1 114623\n188700 1\n104067 1\n1 177790\n181957 1\n1 136583\n169479 1\n1 197419\n191015 1\n8501 1\n196002 1\n1 161615\n1 199967\n1 191729\n184391 1\n1 187114\n194633 1\n173285 1\n1 189731\n1 172409\n174313 1\n126009 1\n177518 1\n189355 1\n1 168589\n184969 1\n1 179245\n1 158495\n171452 1\n130676 1\n1 198971\n180303 1\n190327 1\n15838...", "-1", "2\n2 1", "-1", "17\n3 8\n17 12\n14 10\n6 1\n10 7\n13 10\n4 1\n15 10\n1 3\n7 2\n1 2\n2 9\n10 12\n1 5\n16 10\n7 11", "16\n8 5\n7 12\n7 4\n2 4\n2 1\n9 4\n4 11\n4 10\n5 3\n13 7\n7 15\n2 6\n1 3\n16 7\n14 7", "2\n2 1", "-1", "-1", "-1", "-1", "4\n2 1\n2 3\n3 4", "-1", "-1", "-1", "-1", "-1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	1	codeforces
7bedb5e10e2916d9c08ae8e42bf62636	Mushroom Gnomes	Once upon a time in the thicket of the mushroom forest lived mushroom gnomes. They were famous among their neighbors for their magic mushrooms. Their magic nature made it possible that between every two neighboring mushrooms every minute grew another mushroom with the weight equal to the sum of weights of two neighboring ones. The mushroom gnomes loved it when everything was in order, that's why they always planted the mushrooms in one line in the order of their weights' increasing. Well... The gnomes planted the mushrooms and went to eat. After x minutes they returned and saw that new mushrooms had grown up, so that the increasing order had been violated. The gnomes replanted all the mushrooms in the correct order, that is, they sorted the mushrooms in the order of the weights' increasing. And went to eat again (those gnomes were quite big eaters). What total weights modulo p will the mushrooms have in another y minutes? The first line contains four integers n, x, y, p (1<=≤<=n<=≤<=106,<=0<=≤<=x,<=y<=≤<=1018,<=x<=+<=y<=><=0,<=2<=≤<=p<=≤<=109) which represent the number of mushrooms, the number of minutes after the first replanting, the number of minutes after the second replanting and the module. The next line contains n integers ai which represent the mushrooms' weight in the non-decreasing order (0<=≤<=ai<=≤<=109). Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d). The answer should contain a single number which is the total weights of the mushrooms modulo p in the end after x<=+<=y minutes. Sample Input 2 1 0 657276545 1 2 2 1 1 888450282 1 2 4 5 0 10000 1 2 3 4 Sample Output 6 14 1825	{"inputs": ["2 1 0 657276545\n1 2", "2 1 1 888450282\n1 2", "4 5 0 10000\n1 2 3 4", "4 0 8 78731972\n1 52 76 81", "4 0 8 414790855\n1 88 97 99", "11 10 6 560689961\n2 17 20 24 32 37 38 39 40 61 86", "8 4 9 371687114\n1 7 22 31 35 38 62 84", "4 8 6 398388678\n21 22 78 88", "49 46 48 698397508\n1098 1160 1173 1269 1438 1731 2082 2361 2602 2655 2706 2788 2957 3014 3142 3269 3338 3814 3849 3972 4618 4798 4809 5280 5642 5681 5699 6320 6427 6493 6827 7367 7413 7492 7667 7684 7850 8130 8302 8666 8709 8945 9022 9095 9391 9434 9557 9724 9781", "33 93 37 411512841\n71 76 339 357 511 822 1564 1747 1974 2499 2763 3861 3950 4140 4306 4992 5056 5660 5694 5773 6084 6512 6742 6898 7133 8616 8772 8852 8918 9046 9572 9679 9708", "62 47 14 888621154\n202 268 300 401 422 660 782 822 1164 1300 1571 1670 1713 1807 2677 2700 2747 2873 2956 3068 3798 4159 4221 4232 4485 4507 4803 5071 5161 5161 5595 5600 5623 5846 5867 5949 6140 6560 6727 6781 6873 7159 7218 7232 7241 7333 7369 7415 7486 7506 7538 7681 7781 8074 8783 8861 9208 9313 9339 9512 9831 9877", "1 1 0 2\n1", "1 1 1 2\n1000000000", "1 1 1 2\n0", "1 1 1 2\n2", "1 0 1 1000000000\n0", "1 1 1 1000000000\n1", "1 0 1 1000000000\n1000000000", "2 1 1 1000\n0 0", "2 1000000000 1000000000000 10000\n1 2"], "outputs": ["6", "14", "1825", "1108850", "1541885", "9840917", "1827639", "338926799", "691613145", "158919800", "588339858", "1", "0", "0", "0", "0", "1", "0", "0", "3"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	2	codeforces
7c10d0df3c5615067fece309da99e575	Maxim and Restaurant	Maxim has opened his own restaurant! The restaurant has got a huge table, the table's length is p meters. Maxim has got a dinner party tonight, n guests will come to him. Let's index the guests of Maxim's restaurant from 1 to n. Maxim knows the sizes of all guests that are going to come to him. The i-th guest's size (ai) represents the number of meters the guest is going to take up if he sits at the restaurant table. Long before the dinner, the guests line up in a queue in front of the restaurant in some order. Then Maxim lets the guests in, one by one. Maxim stops letting the guests in when there is no place at the restaurant table for another guest in the queue. There is no place at the restaurant table for another guest in the queue, if the sum of sizes of all guests in the restaurant plus the size of this guest from the queue is larger than p. In this case, not to offend the guest who has no place at the table, Maxim doesn't let any other guest in the restaurant, even if one of the following guests in the queue would have fit in at the table. Maxim is now wondering, what is the average number of visitors who have come to the restaurant for all possible n! orders of guests in the queue. Help Maxim, calculate this number. The first line contains integer n (1<=≤<=n<=≤<=50) — the number of guests in the restaurant. The next line contains integers a1, a2, ..., an (1<=≤<=ai<=≤<=50) — the guests' sizes in meters. The third line contains integer p (1<=≤<=p<=≤<=50) — the table's length in meters. The numbers in the lines are separated by single spaces. In a single line print a real number — the answer to the problem. The answer will be considered correct, if the absolute or relative error doesn't exceed 10<=-<=4. Sample Input 3 1 2 3 3 Sample Output 1.3333333333	{"inputs": ["3\n1 2 3\n3", "9\n2 2 2 2 2 2 2 1 2\n9", "7\n2 1 1 2 1 1 2\n2", "8\n3 1 5 6 1 5 4 4\n7", "2\n1 3\n3", "2\n1 2\n2", "5\n1 2 3 1 2\n3", "9\n1 2 2 7 4 4 1 4 7\n7", "6\n1 1 1 1 1 1\n1", "10\n35 5 7 41 17 27 32 9 45 40\n30", "27\n38 39 19 33 30 42 34 16 40 9 5 31 28 7 24 37 22 46 25 23 21 30 28 24 48 13 37\n24", "41\n37 6 18 6 25 32 3 1 1 42 25 17 31 8 42 8 38 8 38 4 34 46 10 10 9 22 39 23 47 7 31 14 19 1 42 13 6 11 10 25 38\n12", "49\n46 42 3 1 42 37 25 21 47 22 49 50 19 35 32 35 4 50 19 39 1 39 28 18 29 44 49 34 8 22 11 18 14 15 10 17 36 2 1 50 20 7 49 4 25 9 45 10 40\n34", "3\n36 44 44\n46", "24\n15 4 49 1 9 19 31 47 49 32 40 49 10 8 23 23 39 43 39 30 41 8 9 42\n38", "16\n3 5 3 1 4 2 3 2 1 4 5 3 5 2 2 4\n39", "23\n2 2 1 1 2 2 1 1 1 2 2 2 1 2 2 2 2 1 2 1 2 1 1\n2", "18\n2 1 2 2 1 2 1 1 2 2 1 2 2 1 2 1 1 2\n8", "40\n5 8 2 14 14 19 14 2 12 10 17 15 2 9 11 24 7 19 14 21 8 3 24 18 20 10 14 1 9 9 18 18 13 2 23 7 23 2 17 13\n24", "23\n16 21 14 27 15 30 13 10 4 15 25 21 6 10 17 4 5 3 9 9 8 6 19\n30", "42\n3 2 3 1 1 3 1 3 2 3 3 2 1 3 2 3 3 2 3 3 1 3 3 2 3 2 3 1 2 2 2 3 3 1 2 1 1 3 1 3 3 2\n3", "23\n2 1 2 1 1 1 2 2 2 1 1 2 2 1 1 1 2 1 2 2 1 1 1\n37", "3\n2 2 1\n22", "19\n8 11 13 11 7 11 3 11 6 7 3 14 4 10 10 8 2 1 8\n15", "28\n3 5 4 24 21 3 13 24 22 13 12 21 1 15 11 3 17 6 2 12 22 12 23 4 21 16 25 14\n25", "14\n8 13 28 2 17 31 2 11 39 12 24 3 8 10\n41", "8\n9 14 13 2 1 11 4 19\n25", "35\n5 1 2 3 1 4 1 2 2 2 3 2 3 3 2 5 2 2 3 3 3 3 2 1 2 4 5 5 1 5 3 2 1 4 3\n6", "35\n2 2 1 2 2 2 2 2 2 1 2 1 2 1 1 2 2 2 2 2 2 1 1 1 2 2 1 1 2 2 2 1 2 1 1\n35", "44\n24 19 6 4 23 10 11 16 21 15 18 17 13 9 25 3 1 11 24 26 12 12 21 17 19 2 6 24 21 18 7 2 12 2 4 25 17 26 22 10 22 11 13 27\n27", "36\n5 2 4 5 1 4 3 3 5 2 2 3 3 2 5 1 4 5 2 3 1 4 4 3 5 2 3 5 1 4 3 5 1 2 4 1\n10", "38\n2 4 2 4 1 2 5 1 5 3 5 4 2 5 4 3 1 1 1 5 4 3 4 3 5 4 2 5 4 1 1 3 2 4 5 3 5 1\n48", "40\n1 26 39 14 16 17 19 28 38 18 23 41 19 22 4 24 18 36 15 21 31 29 34 13 19 19 38 45 4 10 2 14 3 24 21 27 4 30 9 17\n45", "41\n31 21 49 18 37 34 36 27 36 39 4 30 25 49 24 10 8 17 45 6 19 27 12 26 6 2 50 47 35 16 15 43 26 14 43 47 49 23 27 7 24\n50", "30\n2 3 1 4 1 2 2 2 5 5 2 3 2 4 3 1 1 2 1 2 1 2 3 2 1 1 3 5 4 4\n5", "50\n2 1 2 1 2 1 1 1 2 2 2 1 1 1 1 1 1 2 2 1 2 1 2 2 1 2 2 1 1 2 1 1 1 2 2 2 1 2 1 2 2 2 2 2 1 1 2 2 1 2\n3", "50\n15 28 34 29 17 21 20 34 37 17 10 20 37 10 18 25 31 25 16 1 37 27 39 3 5 18 2 32 10 35 20 17 29 20 3 29 3 25 9 32 37 5 25 23 25 33 35 8 31 29\n39", "50\n1 5 2 4 3 4 1 4 1 2 5 1 4 5 4 2 1 2 5 3 4 5 5 2 1 2 2 2 2 2 3 2 5 1 2 2 3 2 5 5 1 3 4 5 2 1 3 4 2 2\n29", "50\n3 2 3 2 1 5 5 5 2 1 4 2 3 5 1 4 4 2 3 2 5 5 4 3 5 1 3 5 5 4 4 4 2 5 4 2 2 3 4 4 3 2 3 3 1 3 4 3 3 4\n19", "50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n25", "10\n42 18 35 1 20 25 29 9 50 36\n50", "7\n42 35 1 20 29 50 36\n50", "50\n1 1 1 1 1 1 1 2 2 2 2 2 2 2 3 3 3 3 3 3 3 4 4 4 4 4 4 4 5 5 5 5 5 5 5 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7\n50", "1\n1\n1", "1\n2\n1", "5\n2 3 2 3 6\n30", "3\n1 2 3\n7", "3\n1 1 1\n50", "4\n1 2 3 4\n11", "50\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n50", "50\n1 2 3 4 4 4 4 4 4 4 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\n50", "20\n1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1\n20", "2\n1 2\n3", "3\n1 2 3\n10", "5\n1 2 3 4 5\n20"], "outputs": ["1.3333333333", "4.5555555556", "1.2857142857", "1.6250000000", "1.0000000000", "1.0000000000", "1.5000000000", "1.7341269841", "1.0000000000", "0.6500000000", "0.4333903134", "0.5001534565", "0.9154259295", "1.0000000000", "0.8604837192", "12.3395604396", "1.1778656126", "4.9849398967", "1.6715713966", "1.9401705846", "1.2020905923", "23.0000000000", "3.0000000000", "1.6128310974", "1.6461894466", "2.4931734932", "2.3500000000", "1.9851721334", "21.2873098934", "1.5513891043", "2.9649127243", "15.0079078318", "1.8507376624", "1.5535424434", "1.8614767098", "1.8379591837", "1.4997987526", "9.8873093486", "5.5762635183", "25.0000000000", "1.5269841270", "1.3142857143", "12.0011471293", "1.0000000000", "0.0000000000", "5.0000000000", "3.0000000000", "3.0000000000", "4.0000000000", "50.0000000000", "2.3167627104", "20.0000000000", "2.0000000000", "3.0000000000", "5.0000000000"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	4	codeforces
7c36cde070092df3c067bac6429bb832	Magic Five	There is a long plate s containing n digits. Iahub wants to delete some digits (possibly none, but he is not allowed to delete all the digits) to form his "magic number" on the plate, a number that is divisible by 5. Note that, the resulting number may contain leading zeros. Now Iahub wants to count the number of ways he can obtain magic number, modulo 1000000007 (109<=+<=7). Two ways are different, if the set of deleted positions in s differs. Look at the input part of the statement, s is given in a special form. In the first line you're given a string a (1<=≤<=\|a\|<=≤<=105), containing digits only. In the second line you're given an integer k (1<=≤<=k<=≤<=109). The plate s is formed by concatenating k copies of a together. That is n<==<=\|a\|·k. Print a single integer — the required number of ways modulo 1000000007 (109<=+<=7). Sample Input 1256 1 13990 2 555 2 Sample Output 4 528 63	{"inputs": ["1256\n1", "13990\n2", "555\n2", "14\n178", "27755776656210607832788619414635535178188775623838313967013958143619017005079991285469853503718562504927535176713879737569375166451462839457844835806559098448980069427607\n151", "205831218776360805549796263726315728152440389522084825015113219980083245807721536032762703389\n161", "58761716080256287618526160263668449282855983776878138369871377531384\n100", "28626813825922172933379733204622160613220115755143268169598722697537715419\n184", "0\n1000000000", "079797897977\n1"], "outputs": ["4", "528", "63", "0", "319271478", "97770312", "48078375", "43220279", "140625000", "1"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	9	codeforces
7c4b50700e3e6704a97d5d9f8e133a5f	Zuma	Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible. In one second, Genos is able to choose exactly one continuous substring of colored gemstones that is a palindrome and remove it from the line. After the substring is removed, the remaining gemstones shift to form a solid line again. What is the minimum number of seconds needed to destroy the entire line? Let us remind, that the string (or substring) is called palindrome, if it reads same backwards or forward. In our case this means the color of the first gemstone is equal to the color of the last one, the color of the second gemstone is equal to the color of the next to last and so on. The first line of input contains a single integer n (1<=≤<=n<=≤<=500) — the number of gemstones. The second line contains n space-separated integers, the i-th of which is ci (1<=≤<=ci<=≤<=n) — the color of the i-th gemstone in a line. Print a single integer — the minimum number of seconds needed to destroy the entire line. Sample Input 3 1 2 1 3 1 2 3 7 1 4 4 2 3 2 1 Sample Output 1 3 2	{"inputs": ["3\n1 2 1", "3\n1 2 3", "7\n1 4 4 2 3 2 1", "1\n1", "2\n1 1", "2\n1 2", "8\n1 2 1 3 4 1 2 1", "50\n5 7 5 10 7 9 1 9 10 2 8 3 5 7 3 10 2 3 7 6 2 7 1 2 2 2 4 7 3 5 8 3 4 4 1 6 7 10 5 4 8 1 9 5 5 3 4 4 8 3", "50\n13 17 20 5 14 19 4 17 9 13 10 19 16 13 17 2 18 3 1 9 19 4 19 10 17 12 16 20 10 11 15 10 3 19 8 6 2 8 9 15 13 7 8 8 5 8 15 18 9 4", "50\n22 19 14 22 20 11 16 28 23 15 3 23 6 16 30 15 15 10 24 28 19 19 22 30 28 1 27 12 12 14 17 30 17 26 21 26 27 1 11 23 9 30 18 19 17 29 11 20 29 24", "50\n30 17 31 15 10 3 39 36 5 29 16 11 31 2 38 1 32 40 7 15 39 34 24 11 4 23 9 35 39 32 4 5 14 37 10 34 11 33 30 14 4 34 23 10 34 34 26 34 26 16", "50\n19 25 46 17 1 41 50 19 7 1 43 8 19 38 42 32 38 22 8 5 5 31 29 35 43 12 23 48 40 29 30 9 46 3 39 24 36 36 32 22 21 29 43 33 36 49 48 22 47 37", "6\n1 2 1 1 3 1"], "outputs": ["1", "3", "2", "1", "1", "2", "2", "21", "28", "25", "36", "36", "2"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	24	codeforces
7c74fd35bee1aab8fedb79f0ecc2c005	Intercity Travelling	Leha is planning his journey from Moscow to Saratov. He hates trains, so he has decided to get from one city to another by car. The path from Moscow to Saratov can be represented as a straight line (well, it's not that straight in reality, but in this problem we will consider it to be straight), and the distance between Moscow and Saratov is $n$ km. Let's say that Moscow is situated at the point with coordinate $0$ km, and Saratov — at coordinate $n$ km. Driving for a long time may be really difficult. Formally, if Leha has already covered $i$ kilometers since he stopped to have a rest, he considers the difficulty of covering $(i + 1)$-th kilometer as $a_{i + 1}$. It is guaranteed that for every $i \in [1, n - 1]$ $a_i \le a_{i + 1}$. The difficulty of the journey is denoted as the sum of difficulties of each kilometer in the journey. Fortunately, there may be some rest sites between Moscow and Saratov. Every integer point from $1$ to $n - 1$ may contain a rest site. When Leha enters a rest site, he may have a rest, and the next kilometer will have difficulty $a_1$, the kilometer after it — difficulty $a_2$, and so on. For example, if $n = 5$ and there is a rest site in coordinate $2$, the difficulty of journey will be $2a_1 + 2a_2 + a_3$: the first kilometer will have difficulty $a_1$, the second one — $a_2$, then Leha will have a rest, and the third kilometer will have difficulty $a_1$, the fourth — $a_2$, and the last one — $a_3$. Another example: if $n = 7$ and there are rest sites in coordinates $1$ and $5$, the difficulty of Leha's journey is $3a_1 + 2a_2 + a_3 + a_4$. Leha doesn't know which integer points contain rest sites. So he has to consider every possible situation. Obviously, there are $2^{n - 1}$ different distributions of rest sites (two distributions are different if there exists some point $x$ such that it contains a rest site in exactly one of these distributions). Leha considers all these distributions to be equiprobable. He wants to calculate $p$ — the expected value of difficulty of his journey. Obviously, $p \cdot 2^{n - 1}$ is an integer number. You have to calculate it modulo $998244353$. The first line contains one number $n$ ($1 \le n \le 10^6$) — the distance from Moscow to Saratov. The second line contains $n$ integer numbers $a_1$, $a_2$, ..., $a_n$ ($1 \le a_1 \le a_2 \le \dots \le a_n \le 10^6$), where $a_i$ is the difficulty of $i$-th kilometer after Leha has rested. Print one number — $p \cdot 2^{n - 1}$, taken modulo $998244353$. Sample Input 2 1 2 4 1 3 3 7 Sample Output 5 60	{"inputs": ["2\n1 2", "4\n1 3 3 7", "100\n3 3 3 4 7 8 8 8 9 9 10 12 12 13 14 14 15 15 16 17 17 20 21 21 22 22 23 25 29 31 36 37 37 38 39 40 41 41 41 42 43 44 45 46 46 47 47 49 49 49 51 52 52 53 54 55 59 59 59 60 62 63 63 64 66 69 70 71 71 72 74 76 76 77 77 78 78 79 80 81 81 82 82 84 85 86 87 87 87 89 91 92 92 92 92 97 98 99 100 100", "1\n12"], "outputs": ["5", "60", "758086002", "12"]}	UNKNOWN	[ "PYTHON3" ]	CODEFORCES	18	codeforces

Subsets and Splits

No saved queries yet

Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.